java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplTransformed.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/linear_search.i_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d769cf3 [2018-10-15 15:32:30,024 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 15:32:30,026 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 15:32:30,039 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 15:32:30,039 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 15:32:30,040 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 15:32:30,042 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 15:32:30,045 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 15:32:30,047 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 15:32:30,048 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 15:32:30,056 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 15:32:30,056 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 15:32:30,058 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 15:32:30,059 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 15:32:30,063 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 15:32:30,064 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 15:32:30,064 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 15:32:30,067 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 15:32:30,073 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 15:32:30,074 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 15:32:30,075 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 15:32:30,079 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 15:32:30,085 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 15:32:30,085 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 15:32:30,085 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 15:32:30,086 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 15:32:30,087 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 15:32:30,088 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 15:32:30,089 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 15:32:30,090 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 15:32:30,091 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 15:32:30,091 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 15:32:30,091 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 15:32:30,092 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 15:32:30,092 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 15:32:30,093 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 15:32:30,093 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-15 15:32:30,103 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 15:32:30,103 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 15:32:30,104 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 15:32:30,104 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 15:32:30,104 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 15:32:30,105 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 15:32:30,105 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 15:32:30,106 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 15:32:30,106 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 15:32:30,106 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 15:32:30,106 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 15:32:30,106 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 15:32:30,107 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 15:32:30,107 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 15:32:30,108 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 15:32:30,149 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 15:32:30,161 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 15:32:30,165 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 15:32:30,166 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 15:32:30,167 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 15:32:30,168 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/linear_search.i_5.bpl [2018-10-15 15:32:30,168 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/linear_search.i_5.bpl' [2018-10-15 15:32:30,228 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 15:32:30,230 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 15:32:30,231 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 15:32:30,231 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 15:32:30,231 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 15:32:30,259 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:32:30" (1/1) ... [2018-10-15 15:32:30,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:32:30" (1/1) ... [2018-10-15 15:32:30,274 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:32:30" (1/1) ... [2018-10-15 15:32:30,275 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:32:30" (1/1) ... [2018-10-15 15:32:30,279 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:32:30" (1/1) ... [2018-10-15 15:32:30,281 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:32:30" (1/1) ... [2018-10-15 15:32:30,283 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:32:30" (1/1) ... [2018-10-15 15:32:30,285 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 15:32:30,286 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 15:32:30,286 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 15:32:30,286 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 15:32:30,287 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:32:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-15 15:32:30,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 15:32:30,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 15:32:30,934 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 15:32:30,935 INFO L202 PluginConnector]: Adding new model linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:32:30 BoogieIcfgContainer [2018-10-15 15:32:30,935 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 15:32:30,936 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 15:32:30,936 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 15:32:30,937 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 15:32:30,939 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:32:30" (1/1) ... [2018-10-15 15:32:30,947 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-15 15:32:30,947 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-15 15:32:30,981 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-15 15:32:31,024 INFO L219 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-15 15:32:31,039 INFO L282 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-15 15:32:31,102 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-15 15:32:37,617 INFO L315 AbstractInterpreter]: Visited 58 different actions 91 times. Merged at 28 different actions 32 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-10-15 15:32:37,621 INFO L306 apSepIcfgTransformer]: finished equality analysis [2018-10-15 15:32:37,626 INFO L318 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-15 15:32:37,711 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select (select |#loc_#memory_int_(Array-Int-(Array-Int-#locsort2))| |v_ULTIMATE.start_read~int_#ptr.base_2|) |v_ULTIMATE.start_read~int_#ptr.offset_2|) at (assume read~int_#value == #memory_int[read~int_#ptr.base,read~int_#ptr.offset];) [2018-10-15 15:32:37,714 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-15 15:32:37,714 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-15 15:32:37,718 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-15 15:32:37,718 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-10-15 15:32:37,718 INFO L248 HeapPartitionManager]: # location blocks :2 [2018-10-15 15:32:37,718 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-15 15:32:37,719 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-15 15:32:37,719 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-15 15:32:37,719 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-15 15:32:37,719 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-15 15:32:37,719 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-10-15 15:32:37,720 INFO L248 HeapPartitionManager]: # location blocks :2 [2018-10-15 15:32:37,720 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-15 15:32:37,720 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-15 15:32:37,720 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-15 15:32:37,722 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-15 15:32:37,746 INFO L202 PluginConnector]: Adding new model linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 03:32:37 BasicIcfg [2018-10-15 15:32:37,749 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 15:32:37,750 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 15:32:37,750 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 15:32:37,754 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 15:32:37,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:32:30" (1/3) ... [2018-10-15 15:32:37,756 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ddbab3 and model type linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:32:37, skipping insertion in model container [2018-10-15 15:32:37,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:32:30" (2/3) ... [2018-10-15 15:32:37,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ddbab3 and model type linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:32:37, skipping insertion in model container [2018-10-15 15:32:37,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 03:32:37" (3/3) ... [2018-10-15 15:32:37,758 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-15 15:32:37,769 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 15:32:37,778 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 15:32:37,796 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 15:32:37,825 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 15:32:37,826 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 15:32:37,826 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 15:32:37,826 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 15:32:37,826 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 15:32:37,827 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 15:32:37,828 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 15:32:37,828 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 15:32:37,828 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 15:32:37,843 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-10-15 15:32:37,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-15 15:32:37,856 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:37,857 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:37,859 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:37,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:37,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1116179537, now seen corresponding path program 1 times [2018-10-15 15:32:37,936 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:38,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:38,853 WARN L179 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 18 [2018-10-15 15:32:39,277 WARN L179 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2018-10-15 15:32:39,525 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2018-10-15 15:32:39,870 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2018-10-15 15:32:40,216 WARN L179 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 15 [2018-10-15 15:32:40,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:40,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:32:40,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-15 15:32:40,255 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 15:32:40,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 15:32:40,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-10-15 15:32:40,271 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 9 states. [2018-10-15 15:32:40,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:40,570 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-10-15 15:32:40,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-15 15:32:40,572 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2018-10-15 15:32:40,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:40,583 INFO L225 Difference]: With dead ends: 72 [2018-10-15 15:32:40,584 INFO L226 Difference]: Without dead ends: 69 [2018-10-15 15:32:40,585 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-10-15 15:32:40,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-15 15:32:40,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2018-10-15 15:32:40,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-15 15:32:40,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-10-15 15:32:40,626 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 49 [2018-10-15 15:32:40,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:40,627 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-10-15 15:32:40,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 15:32:40,627 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-10-15 15:32:40,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-15 15:32:40,629 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:40,629 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:40,630 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:40,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:40,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1919924753, now seen corresponding path program 1 times [2018-10-15 15:32:40,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:40,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:41,133 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2018-10-15 15:32:41,636 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:41,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:41,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-15 15:32:41,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-15 15:32:41,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-15 15:32:41,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-10-15 15:32:41,639 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 10 states. [2018-10-15 15:32:42,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:42,524 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-10-15 15:32:42,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-15 15:32:42,525 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2018-10-15 15:32:42,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:42,527 INFO L225 Difference]: With dead ends: 87 [2018-10-15 15:32:42,527 INFO L226 Difference]: Without dead ends: 84 [2018-10-15 15:32:42,529 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2018-10-15 15:32:42,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-10-15 15:32:42,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2018-10-15 15:32:42,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-15 15:32:42,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-10-15 15:32:42,536 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 64 [2018-10-15 15:32:42,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:42,537 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-10-15 15:32:42,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-15 15:32:42,538 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-10-15 15:32:42,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-15 15:32:42,540 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:42,540 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:42,541 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:42,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:42,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1927634065, now seen corresponding path program 2 times [2018-10-15 15:32:42,542 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:42,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:42,907 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2018-10-15 15:32:43,208 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:43,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:43,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-15 15:32:43,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-15 15:32:43,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-15 15:32:43,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-10-15 15:32:43,210 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 12 states. [2018-10-15 15:32:43,800 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2018-10-15 15:32:44,295 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2018-10-15 15:32:44,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:44,653 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-10-15 15:32:44,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 15:32:44,655 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 79 [2018-10-15 15:32:44,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:44,657 INFO L225 Difference]: With dead ends: 102 [2018-10-15 15:32:44,658 INFO L226 Difference]: Without dead ends: 99 [2018-10-15 15:32:44,658 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=169, Invalid=533, Unknown=0, NotChecked=0, Total=702 [2018-10-15 15:32:44,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-15 15:32:44,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2018-10-15 15:32:44,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-15 15:32:44,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-10-15 15:32:44,667 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 79 [2018-10-15 15:32:44,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:44,667 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-10-15 15:32:44,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-15 15:32:44,668 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-10-15 15:32:44,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-15 15:32:44,669 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:44,669 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:44,669 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:44,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:44,670 INFO L82 PathProgramCache]: Analyzing trace with hash 531632721, now seen corresponding path program 3 times [2018-10-15 15:32:44,671 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:44,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:45,511 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:45,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:45,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-15 15:32:45,512 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-15 15:32:45,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-15 15:32:45,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-10-15 15:32:45,513 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 14 states. [2018-10-15 15:32:46,142 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2018-10-15 15:32:46,545 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2018-10-15 15:32:47,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:47,506 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-10-15 15:32:47,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-15 15:32:47,507 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 94 [2018-10-15 15:32:47,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:47,510 INFO L225 Difference]: With dead ends: 117 [2018-10-15 15:32:47,511 INFO L226 Difference]: Without dead ends: 114 [2018-10-15 15:32:47,512 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=220, Invalid=902, Unknown=0, NotChecked=0, Total=1122 [2018-10-15 15:32:47,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-15 15:32:47,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2018-10-15 15:32:47,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-15 15:32:47,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-10-15 15:32:47,522 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 94 [2018-10-15 15:32:47,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:47,522 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-10-15 15:32:47,522 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-15 15:32:47,523 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-10-15 15:32:47,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-15 15:32:47,524 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:47,524 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:47,525 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:47,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:47,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1083622191, now seen corresponding path program 4 times [2018-10-15 15:32:47,526 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:47,993 WARN L179 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-10-15 15:32:48,701 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:48,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:48,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-15 15:32:48,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-15 15:32:48,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-15 15:32:48,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-10-15 15:32:48,703 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 16 states. [2018-10-15 15:32:49,818 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2018-10-15 15:32:49,967 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2018-10-15 15:32:51,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:51,361 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-10-15 15:32:51,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-15 15:32:51,368 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 109 [2018-10-15 15:32:51,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:51,370 INFO L225 Difference]: With dead ends: 132 [2018-10-15 15:32:51,370 INFO L226 Difference]: Without dead ends: 129 [2018-10-15 15:32:51,371 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=271, Invalid=1369, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 15:32:51,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-10-15 15:32:51,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2018-10-15 15:32:51,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-15 15:32:51,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-10-15 15:32:51,388 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 109 [2018-10-15 15:32:51,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:51,389 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-10-15 15:32:51,389 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-15 15:32:51,389 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-10-15 15:32:51,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-15 15:32:51,398 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:51,398 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:51,399 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:51,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:51,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1543010961, now seen corresponding path program 5 times [2018-10-15 15:32:51,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:51,904 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-10-15 15:32:52,125 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-10-15 15:32:52,463 WARN L179 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2018-10-15 15:32:53,566 WARN L179 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 18 [2018-10-15 15:32:53,964 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:53,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:53,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-15 15:32:53,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-15 15:32:53,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-15 15:32:53,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-10-15 15:32:53,966 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 18 states. [2018-10-15 15:32:55,001 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2018-10-15 15:32:57,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:57,012 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-10-15 15:32:57,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-15 15:32:57,013 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 124 [2018-10-15 15:32:57,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:57,015 INFO L225 Difference]: With dead ends: 147 [2018-10-15 15:32:57,015 INFO L226 Difference]: Without dead ends: 144 [2018-10-15 15:32:57,017 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=322, Invalid=1934, Unknown=0, NotChecked=0, Total=2256 [2018-10-15 15:32:57,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-10-15 15:32:57,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 140. [2018-10-15 15:32:57,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-15 15:32:57,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-10-15 15:32:57,025 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 124 [2018-10-15 15:32:57,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:57,026 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-10-15 15:32:57,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-15 15:32:57,026 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-10-15 15:32:57,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-15 15:32:57,028 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:57,028 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:57,028 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:57,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:57,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1847012625, now seen corresponding path program 6 times [2018-10-15 15:32:57,029 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:57,416 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-10-15 15:32:57,629 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-10-15 15:32:57,926 WARN L179 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2018-10-15 15:32:58,723 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 279 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:58,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:58,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-15 15:32:58,724 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-15 15:32:58,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-15 15:32:58,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2018-10-15 15:32:58,725 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 20 states. [2018-10-15 15:32:59,868 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2018-10-15 15:33:01,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:01,946 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-10-15 15:33:01,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-15 15:33:01,947 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 139 [2018-10-15 15:33:01,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:01,949 INFO L225 Difference]: With dead ends: 162 [2018-10-15 15:33:01,949 INFO L226 Difference]: Without dead ends: 159 [2018-10-15 15:33:01,950 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=373, Invalid=2597, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 15:33:01,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-15 15:33:01,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 155. [2018-10-15 15:33:01,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-15 15:33:01,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-10-15 15:33:01,962 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 139 [2018-10-15 15:33:01,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:01,962 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-10-15 15:33:01,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-15 15:33:01,963 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-10-15 15:33:01,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-15 15:33:01,964 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:01,964 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:33:01,965 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:01,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:01,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1244859695, now seen corresponding path program 7 times [2018-10-15 15:33:01,966 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:01,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:02,369 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-10-15 15:33:02,598 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-10-15 15:33:03,631 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:33:03,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:33:03,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-15 15:33:03,632 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-15 15:33:03,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-15 15:33:03,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2018-10-15 15:33:03,633 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 22 states. [2018-10-15 15:33:04,839 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2018-10-15 15:33:05,792 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-10-15 15:33:07,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:07,892 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-10-15 15:33:07,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-15 15:33:07,893 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 154 [2018-10-15 15:33:07,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:07,894 INFO L225 Difference]: With dead ends: 177 [2018-10-15 15:33:07,894 INFO L226 Difference]: Without dead ends: 174 [2018-10-15 15:33:07,896 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 761 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=424, Invalid=3358, Unknown=0, NotChecked=0, Total=3782 [2018-10-15 15:33:07,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-10-15 15:33:07,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 170. [2018-10-15 15:33:07,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-10-15 15:33:07,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2018-10-15 15:33:07,902 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 154 [2018-10-15 15:33:07,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:07,903 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2018-10-15 15:33:07,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-15 15:33:07,903 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2018-10-15 15:33:07,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-15 15:33:07,907 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:07,907 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:33:07,907 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:07,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:07,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1710435665, now seen corresponding path program 8 times [2018-10-15 15:33:07,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:07,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:08,309 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-10-15 15:33:08,470 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-10-15 15:33:09,487 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 0 proven. 492 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:33:09,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:33:09,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-15 15:33:09,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-15 15:33:09,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-15 15:33:09,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=502, Unknown=0, NotChecked=0, Total=552 [2018-10-15 15:33:09,489 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 24 states. [2018-10-15 15:33:10,735 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2018-10-15 15:33:14,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:14,142 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2018-10-15 15:33:14,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-15 15:33:14,142 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 169 [2018-10-15 15:33:14,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:14,144 INFO L225 Difference]: With dead ends: 192 [2018-10-15 15:33:14,145 INFO L226 Difference]: Without dead ends: 189 [2018-10-15 15:33:14,147 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 968 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=475, Invalid=4217, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 15:33:14,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-10-15 15:33:14,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 185. [2018-10-15 15:33:14,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-15 15:33:14,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-10-15 15:33:14,152 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 169 [2018-10-15 15:33:14,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:14,152 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-10-15 15:33:14,152 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-15 15:33:14,152 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-10-15 15:33:14,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-15 15:33:14,155 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:14,155 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:33:14,155 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:14,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:14,155 INFO L82 PathProgramCache]: Analyzing trace with hash 2092006161, now seen corresponding path program 9 times [2018-10-15 15:33:14,156 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:14,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:14,600 WARN L179 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-10-15 15:33:14,824 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-10-15 15:33:15,150 WARN L179 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2018-10-15 15:33:16,656 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 0 proven. 621 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:33:16,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:33:16,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-15 15:33:16,657 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-15 15:33:16,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-15 15:33:16,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=596, Unknown=0, NotChecked=0, Total=650 [2018-10-15 15:33:16,658 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 26 states. [2018-10-15 15:33:17,904 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2018-10-15 15:33:22,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:22,657 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-10-15 15:33:22,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-15 15:33:22,658 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 184 [2018-10-15 15:33:22,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:22,659 INFO L225 Difference]: With dead ends: 207 [2018-10-15 15:33:22,659 INFO L226 Difference]: Without dead ends: 204 [2018-10-15 15:33:22,662 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=526, Invalid=5174, Unknown=0, NotChecked=0, Total=5700 [2018-10-15 15:33:22,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-10-15 15:33:22,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 200. [2018-10-15 15:33:22,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-15 15:33:22,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2018-10-15 15:33:22,666 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 184 [2018-10-15 15:33:22,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:22,666 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2018-10-15 15:33:22,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-15 15:33:22,667 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2018-10-15 15:33:22,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-15 15:33:22,669 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:22,669 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:33:22,669 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:22,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:22,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1862352273, now seen corresponding path program 10 times [2018-10-15 15:33:22,670 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:22,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:23,081 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-10-15 15:33:23,296 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-10-15 15:33:23,628 WARN L179 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2018-10-15 15:33:25,155 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 0 proven. 765 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:33:25,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:33:25,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-15 15:33:25,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-15 15:33:25,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-15 15:33:25,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=698, Unknown=0, NotChecked=0, Total=756 [2018-10-15 15:33:25,157 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 28 states. [2018-10-15 15:33:26,282 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2018-10-15 15:33:26,525 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2018-10-15 15:33:26,901 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2018-10-15 15:33:32,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:32,014 INFO L93 Difference]: Finished difference Result 222 states and 222 transitions. [2018-10-15 15:33:32,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-15 15:33:32,015 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 199 [2018-10-15 15:33:32,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:32,019 INFO L225 Difference]: With dead ends: 222 [2018-10-15 15:33:32,019 INFO L226 Difference]: Without dead ends: 219 [2018-10-15 15:33:32,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1457 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=577, Invalid=6229, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 15:33:32,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-10-15 15:33:32,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 215. [2018-10-15 15:33:32,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-10-15 15:33:32,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2018-10-15 15:33:32,026 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 199 [2018-10-15 15:33:32,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:32,027 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2018-10-15 15:33:32,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-15 15:33:32,027 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2018-10-15 15:33:32,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-10-15 15:33:32,028 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:32,028 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:33:32,029 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:32,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:32,029 INFO L82 PathProgramCache]: Analyzing trace with hash 19534673, now seen corresponding path program 11 times [2018-10-15 15:33:32,030 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:32,436 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-10-15 15:33:32,659 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-10-15 15:33:34,454 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:33:34,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:33:34,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-15 15:33:34,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-15 15:33:34,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-15 15:33:34,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=808, Unknown=0, NotChecked=0, Total=870 [2018-10-15 15:33:34,456 INFO L87 Difference]: Start difference. First operand 215 states and 215 transitions. Second operand 30 states. [2018-10-15 15:33:35,833 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2018-10-15 15:33:38,114 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-10-15 15:33:41,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:41,731 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2018-10-15 15:33:41,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 15:33:41,731 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 214 [2018-10-15 15:33:41,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:41,733 INFO L225 Difference]: With dead ends: 237 [2018-10-15 15:33:41,733 INFO L226 Difference]: Without dead ends: 234 [2018-10-15 15:33:41,736 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1739 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=628, Invalid=7382, Unknown=0, NotChecked=0, Total=8010 [2018-10-15 15:33:41,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-10-15 15:33:41,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 230. [2018-10-15 15:33:41,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-10-15 15:33:41,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 230 transitions. [2018-10-15 15:33:41,740 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 230 transitions. Word has length 214 [2018-10-15 15:33:41,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:41,740 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 230 transitions. [2018-10-15 15:33:41,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-15 15:33:41,740 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 230 transitions. [2018-10-15 15:33:41,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-10-15 15:33:41,741 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:41,741 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:33:41,741 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:41,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:41,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1917148625, now seen corresponding path program 12 times [2018-10-15 15:33:41,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:41,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:43,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1098 backedges. 0 proven. 1098 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:33:43,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:33:43,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-15 15:33:43,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-15 15:33:43,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-15 15:33:43,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=926, Unknown=0, NotChecked=0, Total=992 [2018-10-15 15:33:43,946 INFO L87 Difference]: Start difference. First operand 230 states and 230 transitions. Second operand 32 states. [2018-10-15 15:33:45,398 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2018-10-15 15:33:51,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:51,704 INFO L93 Difference]: Finished difference Result 252 states and 252 transitions. [2018-10-15 15:33:51,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-15 15:33:51,704 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 229 [2018-10-15 15:33:51,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:51,707 INFO L225 Difference]: With dead ends: 252 [2018-10-15 15:33:51,707 INFO L226 Difference]: Without dead ends: 249 [2018-10-15 15:33:51,711 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2046 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=679, Invalid=8633, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 15:33:51,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-10-15 15:33:51,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 245. [2018-10-15 15:33:51,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-10-15 15:33:51,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-10-15 15:33:51,715 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 229 [2018-10-15 15:33:51,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:51,716 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-10-15 15:33:51,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-15 15:33:51,716 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-10-15 15:33:51,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-10-15 15:33:51,717 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:51,718 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:33:51,718 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:51,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:51,718 INFO L82 PathProgramCache]: Analyzing trace with hash -725959791, now seen corresponding path program 13 times [2018-10-15 15:33:51,719 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:51,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:52,154 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-10-15 15:33:54,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1287 backedges. 0 proven. 1287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:33:54,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:33:54,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-15 15:33:54,162 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-15 15:33:54,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-15 15:33:54,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=1052, Unknown=0, NotChecked=0, Total=1122 [2018-10-15 15:33:54,163 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 34 states. [2018-10-15 15:33:55,654 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2018-10-15 15:34:02,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:02,783 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2018-10-15 15:34:02,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-15 15:34:02,783 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 244 [2018-10-15 15:34:02,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:02,786 INFO L225 Difference]: With dead ends: 267 [2018-10-15 15:34:02,786 INFO L226 Difference]: Without dead ends: 264 [2018-10-15 15:34:02,790 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2378 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=730, Invalid=9982, Unknown=0, NotChecked=0, Total=10712 [2018-10-15 15:34:02,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-10-15 15:34:02,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 260. [2018-10-15 15:34:02,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-10-15 15:34:02,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 260 transitions. [2018-10-15 15:34:02,794 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 260 transitions. Word has length 244 [2018-10-15 15:34:02,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:02,795 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 260 transitions. [2018-10-15 15:34:02,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-15 15:34:02,795 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 260 transitions. [2018-10-15 15:34:02,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-10-15 15:34:02,796 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:02,796 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:34:02,796 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:02,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:02,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1178366447, now seen corresponding path program 14 times [2018-10-15 15:34:02,797 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:02,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:05,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1491 backedges. 0 proven. 1491 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:34:05,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:34:05,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-15 15:34:05,437 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-15 15:34:05,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-15 15:34:05,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=1186, Unknown=0, NotChecked=0, Total=1260 [2018-10-15 15:34:05,438 INFO L87 Difference]: Start difference. First operand 260 states and 260 transitions. Second operand 36 states. [2018-10-15 15:34:07,013 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2018-10-15 15:34:15,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:15,184 INFO L93 Difference]: Finished difference Result 282 states and 282 transitions. [2018-10-15 15:34:15,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-15 15:34:15,185 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 259 [2018-10-15 15:34:15,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:15,187 INFO L225 Difference]: With dead ends: 282 [2018-10-15 15:34:15,188 INFO L226 Difference]: Without dead ends: 279 [2018-10-15 15:34:15,190 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2735 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=781, Invalid=11429, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 15:34:15,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-10-15 15:34:15,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 275. [2018-10-15 15:34:15,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-10-15 15:34:15,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 275 transitions. [2018-10-15 15:34:15,195 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 275 transitions. Word has length 259 [2018-10-15 15:34:15,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:15,196 INFO L481 AbstractCegarLoop]: Abstraction has 275 states and 275 transitions. [2018-10-15 15:34:15,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-15 15:34:15,196 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 275 transitions. [2018-10-15 15:34:15,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-10-15 15:34:15,197 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:15,198 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:34:15,198 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:15,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:15,198 INFO L82 PathProgramCache]: Analyzing trace with hash 166163409, now seen corresponding path program 15 times [2018-10-15 15:34:15,199 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:15,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:18,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1710 backedges. 0 proven. 1710 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:34:18,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:34:18,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-15 15:34:18,136 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-15 15:34:18,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-15 15:34:18,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1328, Unknown=0, NotChecked=0, Total=1406 [2018-10-15 15:34:18,137 INFO L87 Difference]: Start difference. First operand 275 states and 275 transitions. Second operand 38 states. [2018-10-15 15:34:19,799 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2018-10-15 15:34:28,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:28,922 INFO L93 Difference]: Finished difference Result 297 states and 297 transitions. [2018-10-15 15:34:28,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-15 15:34:28,923 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 274 [2018-10-15 15:34:28,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:28,925 INFO L225 Difference]: With dead ends: 297 [2018-10-15 15:34:28,925 INFO L226 Difference]: Without dead ends: 294 [2018-10-15 15:34:28,927 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3117 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=832, Invalid=12974, Unknown=0, NotChecked=0, Total=13806 [2018-10-15 15:34:28,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-10-15 15:34:28,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 290. [2018-10-15 15:34:28,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-10-15 15:34:28,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 290 transitions. [2018-10-15 15:34:28,932 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 290 transitions. Word has length 274 [2018-10-15 15:34:28,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:28,933 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 290 transitions. [2018-10-15 15:34:28,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-15 15:34:28,933 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 290 transitions. [2018-10-15 15:34:28,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-10-15 15:34:28,935 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:28,935 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:34:28,935 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:28,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:28,935 INFO L82 PathProgramCache]: Analyzing trace with hash -813682257, now seen corresponding path program 16 times [2018-10-15 15:34:28,936 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:29,404 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-10-15 15:34:32,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1944 backedges. 0 proven. 1944 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:34:32,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:34:32,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-15 15:34:32,051 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-15 15:34:32,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-15 15:34:32,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1478, Unknown=0, NotChecked=0, Total=1560 [2018-10-15 15:34:32,052 INFO L87 Difference]: Start difference. First operand 290 states and 290 transitions. Second operand 40 states. [2018-10-15 15:34:33,108 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2018-10-15 15:34:33,928 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2018-10-15 15:34:44,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:44,374 INFO L93 Difference]: Finished difference Result 312 states and 312 transitions. [2018-10-15 15:34:44,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-15 15:34:44,375 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 289 [2018-10-15 15:34:44,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:44,377 INFO L225 Difference]: With dead ends: 312 [2018-10-15 15:34:44,378 INFO L226 Difference]: Without dead ends: 309 [2018-10-15 15:34:44,380 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3524 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=883, Invalid=14617, Unknown=0, NotChecked=0, Total=15500 [2018-10-15 15:34:44,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-10-15 15:34:44,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 305. [2018-10-15 15:34:44,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-10-15 15:34:44,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2018-10-15 15:34:44,385 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 289 [2018-10-15 15:34:44,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:44,386 INFO L481 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2018-10-15 15:34:44,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-15 15:34:44,386 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2018-10-15 15:34:44,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-10-15 15:34:44,388 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:44,388 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:34:44,388 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:44,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:44,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1949580305, now seen corresponding path program 17 times [2018-10-15 15:34:44,389 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:44,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:44,867 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-10-15 15:34:45,071 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-10-15 15:34:47,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2193 backedges. 0 proven. 2193 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:34:47,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:34:47,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-15 15:34:47,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-15 15:34:47,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-15 15:34:47,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1636, Unknown=0, NotChecked=0, Total=1722 [2018-10-15 15:34:47,954 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 42 states. [2018-10-15 15:34:49,879 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2018-10-15 15:35:01,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:01,360 INFO L93 Difference]: Finished difference Result 327 states and 327 transitions. [2018-10-15 15:35:01,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-15 15:35:01,361 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 304 [2018-10-15 15:35:01,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:01,364 INFO L225 Difference]: With dead ends: 327 [2018-10-15 15:35:01,364 INFO L226 Difference]: Without dead ends: 324 [2018-10-15 15:35:01,366 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3956 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=934, Invalid=16358, Unknown=0, NotChecked=0, Total=17292 [2018-10-15 15:35:01,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-10-15 15:35:01,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 320. [2018-10-15 15:35:01,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-10-15 15:35:01,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 320 transitions. [2018-10-15 15:35:01,371 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 320 transitions. Word has length 304 [2018-10-15 15:35:01,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:01,372 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 320 transitions. [2018-10-15 15:35:01,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-15 15:35:01,372 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 320 transitions. [2018-10-15 15:35:01,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-10-15 15:35:01,374 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:01,374 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:01,374 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:01,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:01,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1568792943, now seen corresponding path program 18 times [2018-10-15 15:35:01,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:01,885 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-10-15 15:35:02,033 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-10-15 15:35:03,891 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 18 [2018-10-15 15:35:05,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2457 backedges. 0 proven. 2457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:05,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:05,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-15 15:35:05,249 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-15 15:35:05,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-15 15:35:05,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1802, Unknown=0, NotChecked=0, Total=1892 [2018-10-15 15:35:05,250 INFO L87 Difference]: Start difference. First operand 320 states and 320 transitions. Second operand 44 states. [2018-10-15 15:35:07,105 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2018-10-15 15:35:19,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:19,629 INFO L93 Difference]: Finished difference Result 342 states and 342 transitions. [2018-10-15 15:35:19,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-10-15 15:35:19,630 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 319 [2018-10-15 15:35:19,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:19,631 INFO L225 Difference]: With dead ends: 342 [2018-10-15 15:35:19,632 INFO L226 Difference]: Without dead ends: 339 [2018-10-15 15:35:19,633 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4413 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=985, Invalid=18197, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 15:35:19,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-10-15 15:35:19,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 335. [2018-10-15 15:35:19,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-10-15 15:35:19,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 335 transitions. [2018-10-15 15:35:19,638 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 335 transitions. Word has length 319 [2018-10-15 15:35:19,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:19,638 INFO L481 AbstractCegarLoop]: Abstraction has 335 states and 335 transitions. [2018-10-15 15:35:19,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-15 15:35:19,639 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 335 transitions. [2018-10-15 15:35:19,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-10-15 15:35:19,640 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:19,641 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:19,641 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:19,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:19,641 INFO L82 PathProgramCache]: Analyzing trace with hash -400223151, now seen corresponding path program 19 times [2018-10-15 15:35:19,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:20,156 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-10-15 15:35:20,382 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-10-15 15:35:23,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2736 backedges. 0 proven. 2736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:23,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:23,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-15 15:35:23,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-15 15:35:23,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-15 15:35:23,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1976, Unknown=0, NotChecked=0, Total=2070 [2018-10-15 15:35:23,747 INFO L87 Difference]: Start difference. First operand 335 states and 335 transitions. Second operand 46 states. [2018-10-15 15:35:25,822 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2018-10-15 15:35:39,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:39,374 INFO L93 Difference]: Finished difference Result 357 states and 357 transitions. [2018-10-15 15:35:39,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-10-15 15:35:39,374 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 334 [2018-10-15 15:35:39,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:39,376 INFO L225 Difference]: With dead ends: 357 [2018-10-15 15:35:39,376 INFO L226 Difference]: Without dead ends: 354 [2018-10-15 15:35:39,377 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4895 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=1036, Invalid=20134, Unknown=0, NotChecked=0, Total=21170 [2018-10-15 15:35:39,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-10-15 15:35:39,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 350. [2018-10-15 15:35:39,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-10-15 15:35:39,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 350 transitions. [2018-10-15 15:35:39,381 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 350 transitions. Word has length 334 [2018-10-15 15:35:39,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:39,382 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 350 transitions. [2018-10-15 15:35:39,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-15 15:35:39,382 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 350 transitions. [2018-10-15 15:35:39,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-10-15 15:35:39,384 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:39,384 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:39,384 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:39,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:39,385 INFO L82 PathProgramCache]: Analyzing trace with hash 54362415, now seen corresponding path program 20 times [2018-10-15 15:35:39,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:39,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:40,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3030 backedges. 180 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:40,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:40,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 15:35:40,632 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 15:35:40,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 15:35:40,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 15:35:40,632 INFO L87 Difference]: Start difference. First operand 350 states and 350 transitions. Second operand 43 states. [2018-10-15 15:35:45,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:45,332 INFO L93 Difference]: Finished difference Result 328 states and 327 transitions. [2018-10-15 15:35:45,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 15:35:45,332 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 349 [2018-10-15 15:35:45,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:45,333 INFO L225 Difference]: With dead ends: 328 [2018-10-15 15:35:45,333 INFO L226 Difference]: Without dead ends: 0 [2018-10-15 15:35:45,334 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=243, Invalid=6563, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 15:35:45,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-15 15:35:45,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-15 15:35:45,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-15 15:35:45,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-15 15:35:45,337 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 349 [2018-10-15 15:35:45,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:45,338 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-15 15:35:45,338 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 15:35:45,338 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-15 15:35:45,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-15 15:35:45,343 INFO L202 PluginConnector]: Adding new model linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:35:45 BasicIcfg [2018-10-15 15:35:45,343 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-15 15:35:45,344 INFO L168 Benchmark]: Toolchain (without parser) took 195115.23 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.6 GB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -542.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-10-15 15:35:45,345 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-15 15:35:45,346 INFO L168 Benchmark]: Boogie Preprocessor took 54.48 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-15 15:35:45,346 INFO L168 Benchmark]: RCFGBuilder took 649.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-15 15:35:45,348 INFO L168 Benchmark]: IcfgTransformer took 6813.37 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 440.9 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -77.7 MB). Peak memory consumption was 363.2 MB. Max. memory is 7.1 GB. [2018-10-15 15:35:45,349 INFO L168 Benchmark]: TraceAbstraction took 187593.04 ms. Allocated memory was 2.0 GB in the beginning and 3.1 GB in the end (delta: 1.2 GB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -485.8 MB). Peak memory consumption was 668.7 MB. Max. memory is 7.1 GB. [2018-10-15 15:35:45,356 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.48 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 649.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * IcfgTransformer took 6813.37 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 440.9 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -77.7 MB). Peak memory consumption was 363.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 187593.04 ms. Allocated memory was 2.0 GB in the beginning and 3.1 GB in the end (delta: 1.2 GB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -485.8 MB). Peak memory consumption was 668.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 56 LocStat_MAX_WEQGRAPH_SIZE : 7 LocStat_MAX_SIZEOF_WEQEDGELABEL : 6 LocStat_NO_SUPPORTING_EQUALITIES : 1438 LocStat_NO_SUPPORTING_DISEQUALITIES : 188 LocStat_NO_DISJUNCTIONS : -112 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 58 TransStat_MAX_WEQGRAPH_SIZE : 3 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 57 TransStat_NO_SUPPORTING_DISEQUALITIES : 3 TransStat_NO_DISJUNCTIONS : 59 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqPostOperator statistics APPLY_NORMAL(MILLISECONDS) : 4648.39 APPLY_RETURN(MILLISECONDS) : 0.00 #APPLY_NORMAL : 94 #APPLY_RETURN : 0 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: Abstract Interpretation statistics Visited 58 different actions 91 times. Merged at 28 different actions 32 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. - StatisticsResult: HeapSeparatorStatistics #COUNT_NEW_ARRAY_VARS_[#memory_int, ULTIMATE.start_write~int_old_#memory_int] : 4 COUNT_ARRAY_WRITES_for_[#memory_int, ULTIMATE.start_write~int_old_#memory_int]_at_dim_0 : null COUNT_BLOCKS_for_[#memory_int, ULTIMATE.start_write~int_old_#memory_int]_at_dim_0 : null COUNT_ARRAY_WRITES_for_[#memory_int, ULTIMATE.start_write~int_old_#memory_int]_at_dim_1 : 2 COUNT_BLOCKS_for_[#memory_int, ULTIMATE.start_write~int_old_#memory_int]_at_dim_1 : 2 COUNT_ARRAY_READS for [#memory_int, ULTIMATE.start_write~int_old_#memory_int] : null * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 102]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 58 locations, 1 error locations. SAFE Result, 187.5s OverallTime, 21 OverallIterations, 21 TraceHistogramMax, 140.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2898 SDtfs, 11190 SDslu, 69062 SDs, 0 SdLazy, 44368 SolverSat, 822 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 51.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1730 GetRequests, 42 SyntacticMatches, 60 SemanticMatches, 1628 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35605 ImplicationChecksByTransitivity, 119.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=350occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 80 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 42.3s InterpolantComputationTime, 4179 NumberOfCodeBlocks, 4179 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 4158 ConstructedInterpolants, 0 QuantifiedInterpolants, 23346012 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 1 PerfectInterpolantSequences, 180/21840 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/linear_search.i_5.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-Benchmark-0-2018-10-15_15-35-45-383.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/linear_search.i_5.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-VPDomainBenchmark-0-2018-10-15_15-35-45-383.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/linear_search.i_5.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-BenchmarkWithCounters-0-2018-10-15_15-35-45-383.csv The toolchain threw an exception: class java.lang.RuntimeException: java.lang.IllegalAccessException: Class de.uni_freiburg.informatik.ultimate.util.csv.SimpleCsvProvider can not access a member of class de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.AbsIntBenchmark with modifiers "private" RESULT: An exception occured during the execution of Ultimate: The toolchain threw an exception java.lang.RuntimeException: java.lang.IllegalAccessException: Class de.uni_freiburg.informatik.ultimate.util.csv.SimpleCsvProvider can not access a member of class de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.AbsIntBenchmark with modifiers "private" at de.uni_freiburg.informatik.ultimate.util.csv.SimpleCsvProvider.constructCsvProviderReflectively(SimpleCsvProvider.java:283) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.AbsIntBenchmark.createCsvProvider(AbsIntBenchmark.java:42) at de.uni_freiburg.informatik.ultimate.cli.CommandLineController.writeCsvLogs(CommandLineController.java:342) at de.uni_freiburg.informatik.ultimate.cli.CommandLineController.displayToolchainResults(CommandLineController.java:325) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:343) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.IllegalAccessException: Class de.uni_freiburg.informatik.ultimate.util.csv.SimpleCsvProvider can not access a member of class de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.AbsIntBenchmark with modifiers "private" at sun.reflect.Reflection.ensureMemberAccess(Reflection.java:102) at java.lang.reflect.AccessibleObject.slowCheckMemberAccess(AccessibleObject.java:296) at java.lang.reflect.AccessibleObject.checkAccess(AccessibleObject.java:288) at java.lang.reflect.Field.get(Field.java:390) at de.uni_freiburg.informatik.ultimate.util.csv.SimpleCsvProvider.constructCsvProviderReflectively(SimpleCsvProvider.java:275) ... 6 more Received shutdown request...