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/20181010-MemSafetyPathprograms/960521-1_1_false-valid-free.i_11.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b8f97f7-m [2018-10-10 16:20:02,658 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 16:20:02,660 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 16:20:02,673 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 16:20:02,673 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 16:20:02,676 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 16:20:02,677 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 16:20:02,679 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 16:20:02,681 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 16:20:02,682 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 16:20:02,683 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 16:20:02,684 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 16:20:02,685 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 16:20:02,685 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 16:20:02,687 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 16:20:02,687 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 16:20:02,688 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 16:20:02,690 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 16:20:02,692 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 16:20:02,694 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 16:20:02,695 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 16:20:02,696 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 16:20:02,699 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 16:20:02,699 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 16:20:02,700 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 16:20:02,701 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 16:20:02,702 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 16:20:02,705 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 16:20:02,706 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 16:20:02,709 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 16:20:02,709 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 16:20:02,710 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 16:20:02,710 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 16:20:02,710 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 16:20:02,714 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 16:20:02,715 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 16:20:02,716 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-10 16:20:02,738 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 16:20:02,739 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 16:20:02,740 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-10 16:20:02,740 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-10 16:20:02,740 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-10 16:20:02,740 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-10 16:20:02,741 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 16:20:02,741 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-10 16:20:02,741 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 16:20:02,742 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-10 16:20:02,742 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-10 16:20:02,742 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-10 16:20:02,742 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-10 16:20:02,743 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-10 16:20:02,743 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-10 16:20:02,794 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 16:20:02,807 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 16:20:02,812 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 16:20:02,814 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-10 16:20:02,815 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-10 16:20:02,816 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/960521-1_1_false-valid-free.i_11.bpl [2018-10-10 16:20:02,816 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/960521-1_1_false-valid-free.i_11.bpl' [2018-10-10 16:20:02,905 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 16:20:02,907 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-10 16:20:02,908 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 16:20:02,908 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 16:20:02,908 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 16:20:02,938 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "960521-1_1_false-valid-free.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:20:02" (1/1) ... [2018-10-10 16:20:02,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "960521-1_1_false-valid-free.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:20:02" (1/1) ... [2018-10-10 16:20:02,961 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "960521-1_1_false-valid-free.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:20:02" (1/1) ... [2018-10-10 16:20:02,961 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "960521-1_1_false-valid-free.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:20:02" (1/1) ... [2018-10-10 16:20:02,972 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "960521-1_1_false-valid-free.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:20:02" (1/1) ... [2018-10-10 16:20:02,981 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "960521-1_1_false-valid-free.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:20:02" (1/1) ... [2018-10-10 16:20:02,986 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "960521-1_1_false-valid-free.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:20:02" (1/1) ... [2018-10-10 16:20:02,992 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 16:20:02,995 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 16:20:02,995 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 16:20:02,995 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 16:20:02,997 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "960521-1_1_false-valid-free.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:20:02" (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-10 16:20:03,074 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-10 16:20:03,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 16:20:03,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 16:20:03,691 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 16:20:03,692 INFO L202 PluginConnector]: Adding new model 960521-1_1_false-valid-free.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:20:03 BoogieIcfgContainer [2018-10-10 16:20:03,692 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 16:20:03,692 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-10 16:20:03,692 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-10 16:20:03,693 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-10 16:20:03,696 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "960521-1_1_false-valid-free.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:20:03" (1/1) ... [2018-10-10 16:20:03,703 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-10 16:20:03,703 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-10 16:20:03,741 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-10 16:20:03,785 INFO L217 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-10 16:20:03,801 INFO L280 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-10 16:20:03,876 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-10 16:20:26,631 INFO L315 AbstractInterpreter]: Visited 69 different actions 160 times. Merged at 58 different actions 87 times. Widened at 1 different actions 1 times. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-10-10 16:20:26,634 INFO L304 apSepIcfgTransformer]: finished equality analysis [2018-10-10 16:20:26,638 INFO L316 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-10 16:20:26,721 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |v_#locv_ULTIMATE.start_write~int_old_#memory_int_4_1_1| |v_ULTIMATE.start_write~int_#ptr.base_13|) at (assume write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]] == #memory_int;) [2018-10-10 16:20:26,725 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-10 16:20:26,725 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-10 16:20:26,726 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-10 16:20:26,726 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 3 [2018-10-10 16:20:26,726 INFO L248 HeapPartitionManager]: # location blocks :2 [2018-10-10 16:20:26,726 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-10 16:20:26,727 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 0 [2018-10-10 16:20:26,727 INFO L248 HeapPartitionManager]: # location blocks :0 [2018-10-10 16:20:26,727 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-10 16:20:26,727 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-10 16:20:26,727 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 3 [2018-10-10 16:20:26,728 INFO L248 HeapPartitionManager]: # location blocks :2 [2018-10-10 16:20:26,728 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-10 16:20:26,728 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 0 [2018-10-10 16:20:26,728 INFO L248 HeapPartitionManager]: # location blocks :0 [2018-10-10 16:20:26,729 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-10 16:20:26,750 INFO L202 PluginConnector]: Adding new model 960521-1_1_false-valid-free.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.10 04:20:26 BasicIcfg [2018-10-10 16:20:26,750 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-10 16:20:26,751 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 16:20:26,751 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 16:20:26,755 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 16:20:26,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "960521-1_1_false-valid-free.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:20:02" (1/3) ... [2018-10-10 16:20:26,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55db62d6 and model type 960521-1_1_false-valid-free.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 04:20:26, skipping insertion in model container [2018-10-10 16:20:26,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "960521-1_1_false-valid-free.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:20:03" (2/3) ... [2018-10-10 16:20:26,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55db62d6 and model type 960521-1_1_false-valid-free.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 04:20:26, skipping insertion in model container [2018-10-10 16:20:26,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "960521-1_1_false-valid-free.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.10 04:20:26" (3/3) ... [2018-10-10 16:20:26,759 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-10 16:20:26,769 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-10 16:20:26,786 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-10 16:20:26,804 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-10 16:20:26,829 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 16:20:26,830 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 16:20:26,830 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 16:20:26,830 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-10 16:20:26,830 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 16:20:26,831 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 16:20:26,832 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 16:20:26,832 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 16:20:26,832 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 16:20:26,848 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2018-10-10 16:20:26,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-10 16:20:26,856 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:26,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, 1, 1, 1, 1, 1] [2018-10-10 16:20:26,858 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:26,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:26,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1840131552, now seen corresponding path program 1 times [2018-10-10 16:20:26,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:27,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:27,643 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 16:20:27,856 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 16:20:28,135 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 16:20:28,307 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-10 16:20:28,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 16:20:28,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-10-10 16:20:28,315 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 16:20:28,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 16:20:28,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-10-10 16:20:28,407 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 14 states. [2018-10-10 16:20:30,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:30,020 INFO L93 Difference]: Finished difference Result 133 states and 135 transitions. [2018-10-10 16:20:30,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-10 16:20:30,022 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2018-10-10 16:20:30,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:30,034 INFO L225 Difference]: With dead ends: 133 [2018-10-10 16:20:30,034 INFO L226 Difference]: Without dead ends: 133 [2018-10-10 16:20:30,037 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=213, Invalid=599, Unknown=0, NotChecked=0, Total=812 [2018-10-10 16:20:30,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-10-10 16:20:30,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 110. [2018-10-10 16:20:30,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-10 16:20:30,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2018-10-10 16:20:30,085 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 54 [2018-10-10 16:20:30,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:30,086 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2018-10-10 16:20:30,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 16:20:30,086 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2018-10-10 16:20:30,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-10 16:20:30,093 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:30,093 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:30,094 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:30,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:30,094 INFO L82 PathProgramCache]: Analyzing trace with hash -546591526, now seen corresponding path program 1 times [2018-10-10 16:20:30,096 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:30,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:30,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:20:30,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 16:20:30,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-10-10 16:20:30,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 16:20:30,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 16:20:30,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-10-10 16:20:30,795 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 16 states. [2018-10-10 16:20:31,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:31,948 INFO L93 Difference]: Finished difference Result 142 states and 144 transitions. [2018-10-10 16:20:31,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-10 16:20:31,956 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 60 [2018-10-10 16:20:31,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:31,958 INFO L225 Difference]: With dead ends: 142 [2018-10-10 16:20:31,958 INFO L226 Difference]: Without dead ends: 142 [2018-10-10 16:20:31,960 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=265, Invalid=857, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 16:20:31,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-10-10 16:20:31,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 71. [2018-10-10 16:20:31,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-10 16:20:31,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-10-10 16:20:31,969 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 60 [2018-10-10 16:20:31,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:31,970 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-10-10 16:20:31,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 16:20:31,970 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-10-10 16:20:31,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-10 16:20:31,972 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:31,972 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:31,973 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:31,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:31,973 INFO L82 PathProgramCache]: Analyzing trace with hash 183554632, now seen corresponding path program 1 times [2018-10-10 16:20:31,974 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:32,123 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:20:32,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:32,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-10 16:20:32,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 16:20:32,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 16:20:32,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-10 16:20:32,125 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 6 states. [2018-10-10 16:20:32,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:32,230 INFO L93 Difference]: Finished difference Result 126 states and 127 transitions. [2018-10-10 16:20:32,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 16:20:32,230 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-10-10 16:20:32,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:32,232 INFO L225 Difference]: With dead ends: 126 [2018-10-10 16:20:32,232 INFO L226 Difference]: Without dead ends: 76 [2018-10-10 16:20:32,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-10-10 16:20:32,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-10-10 16:20:32,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2018-10-10 16:20:32,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-10 16:20:32,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2018-10-10 16:20:32,238 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 66 [2018-10-10 16:20:32,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:32,239 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2018-10-10 16:20:32,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 16:20:32,239 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2018-10-10 16:20:32,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-10 16:20:32,241 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:32,241 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:32,241 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:32,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:32,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1497785858, now seen corresponding path program 1 times [2018-10-10 16:20:32,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:32,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:32,750 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:20:32,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:32,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-10 16:20:32,751 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-10 16:20:32,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-10 16:20:32,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-10-10 16:20:32,752 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 19 states. [2018-10-10 16:20:34,181 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2018-10-10 16:20:34,631 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2018-10-10 16:20:34,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:34,859 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2018-10-10 16:20:34,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-10 16:20:34,863 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 72 [2018-10-10 16:20:34,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:34,864 INFO L225 Difference]: With dead ends: 98 [2018-10-10 16:20:34,865 INFO L226 Difference]: Without dead ends: 98 [2018-10-10 16:20:34,866 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=425, Invalid=1381, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 16:20:34,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-10-10 16:20:34,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 85. [2018-10-10 16:20:34,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-10 16:20:34,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-10-10 16:20:34,872 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 72 [2018-10-10 16:20:34,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:34,873 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-10-10 16:20:34,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-10 16:20:34,873 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-10-10 16:20:34,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-10 16:20:34,875 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:34,875 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:34,875 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:34,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:34,876 INFO L82 PathProgramCache]: Analyzing trace with hash -800283862, now seen corresponding path program 2 times [2018-10-10 16:20:34,877 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:34,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:35,025 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:20:35,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:35,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 16:20:35,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 16:20:35,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 16:20:35,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-10-10 16:20:35,027 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 10 states. [2018-10-10 16:20:35,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:35,247 INFO L93 Difference]: Finished difference Result 156 states and 157 transitions. [2018-10-10 16:20:35,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 16:20:35,247 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 84 [2018-10-10 16:20:35,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:35,249 INFO L225 Difference]: With dead ends: 156 [2018-10-10 16:20:35,249 INFO L226 Difference]: Without dead ends: 94 [2018-10-10 16:20:35,249 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2018-10-10 16:20:35,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-10 16:20:35,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2018-10-10 16:20:35,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-10 16:20:35,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-10-10 16:20:35,255 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 84 [2018-10-10 16:20:35,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:35,256 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-10-10 16:20:35,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 16:20:35,256 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-10-10 16:20:35,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-10 16:20:35,258 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:35,258 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1] [2018-10-10 16:20:35,258 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:35,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:35,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1464761444, now seen corresponding path program 3 times [2018-10-10 16:20:35,259 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:35,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:35,815 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:20:35,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:35,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-10 16:20:35,816 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-10 16:20:35,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-10 16:20:35,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2018-10-10 16:20:35,817 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 24 states. [2018-10-10 16:20:37,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:37,934 INFO L93 Difference]: Finished difference Result 116 states and 117 transitions. [2018-10-10 16:20:37,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-10 16:20:37,935 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 90 [2018-10-10 16:20:37,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:37,937 INFO L225 Difference]: With dead ends: 116 [2018-10-10 16:20:37,937 INFO L226 Difference]: Without dead ends: 116 [2018-10-10 16:20:37,938 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=561, Invalid=2195, Unknown=0, NotChecked=0, Total=2756 [2018-10-10 16:20:37,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-10-10 16:20:37,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 103. [2018-10-10 16:20:37,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-10 16:20:37,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-10-10 16:20:37,945 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 90 [2018-10-10 16:20:37,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:37,945 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-10-10 16:20:37,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-10 16:20:37,946 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-10-10 16:20:37,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-10 16:20:37,947 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:37,948 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1] [2018-10-10 16:20:37,948 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:37,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:37,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1827916148, now seen corresponding path program 4 times [2018-10-10 16:20:37,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:37,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:38,120 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 28 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:20:38,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:38,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-10 16:20:38,121 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 16:20:38,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 16:20:38,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-10-10 16:20:38,122 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 14 states. [2018-10-10 16:20:38,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:38,466 INFO L93 Difference]: Finished difference Result 186 states and 187 transitions. [2018-10-10 16:20:38,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-10 16:20:38,467 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 102 [2018-10-10 16:20:38,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:38,468 INFO L225 Difference]: With dead ends: 186 [2018-10-10 16:20:38,469 INFO L226 Difference]: Without dead ends: 112 [2018-10-10 16:20:38,469 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=570, Unknown=0, NotChecked=0, Total=702 [2018-10-10 16:20:38,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-10-10 16:20:38,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2018-10-10 16:20:38,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-10 16:20:38,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-10-10 16:20:38,475 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 102 [2018-10-10 16:20:38,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:38,475 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-10-10 16:20:38,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 16:20:38,476 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-10-10 16:20:38,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-10 16:20:38,477 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:38,477 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:38,478 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:38,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:38,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1052510906, now seen corresponding path program 5 times [2018-10-10 16:20:38,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:38,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:39,270 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 24 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:20:39,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:39,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-10 16:20:39,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-10 16:20:39,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-10 16:20:39,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2018-10-10 16:20:39,272 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 28 states. [2018-10-10 16:20:41,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:41,761 INFO L93 Difference]: Finished difference Result 134 states and 135 transitions. [2018-10-10 16:20:41,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-10 16:20:41,763 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 108 [2018-10-10 16:20:41,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:41,764 INFO L225 Difference]: With dead ends: 134 [2018-10-10 16:20:41,764 INFO L226 Difference]: Without dead ends: 134 [2018-10-10 16:20:41,766 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=706, Invalid=3076, Unknown=0, NotChecked=0, Total=3782 [2018-10-10 16:20:41,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-10-10 16:20:41,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 121. [2018-10-10 16:20:41,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-10 16:20:41,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2018-10-10 16:20:41,771 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 108 [2018-10-10 16:20:41,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:41,772 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2018-10-10 16:20:41,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-10 16:20:41,772 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2018-10-10 16:20:41,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-10 16:20:41,774 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:41,774 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:41,774 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:41,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:41,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1338413970, now seen corresponding path program 6 times [2018-10-10 16:20:41,775 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:41,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:42,095 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 58 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:20:42,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:42,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-10 16:20:42,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-10 16:20:42,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-10 16:20:42,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-10-10 16:20:42,097 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 18 states. [2018-10-10 16:20:42,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:42,558 INFO L93 Difference]: Finished difference Result 216 states and 217 transitions. [2018-10-10 16:20:42,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-10 16:20:42,558 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 120 [2018-10-10 16:20:42,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:42,559 INFO L225 Difference]: With dead ends: 216 [2018-10-10 16:20:42,560 INFO L226 Difference]: Without dead ends: 130 [2018-10-10 16:20:42,560 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=221, Invalid=1039, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 16:20:42,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-10-10 16:20:42,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2018-10-10 16:20:42,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-10-10 16:20:42,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-10-10 16:20:42,565 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 120 [2018-10-10 16:20:42,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:42,565 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-10-10 16:20:42,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-10 16:20:42,566 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-10-10 16:20:42,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-10 16:20:42,567 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:42,567 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:42,568 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:42,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:42,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1091088552, now seen corresponding path program 7 times [2018-10-10 16:20:42,569 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:43,198 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 44 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:20:43,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:43,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-10 16:20:43,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-10 16:20:43,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-10 16:20:43,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=898, Unknown=0, NotChecked=0, Total=992 [2018-10-10 16:20:43,200 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 32 states. [2018-10-10 16:20:44,408 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-10-10 16:20:46,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:46,285 INFO L93 Difference]: Finished difference Result 152 states and 153 transitions. [2018-10-10 16:20:46,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-10 16:20:46,286 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 126 [2018-10-10 16:20:46,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:46,288 INFO L225 Difference]: With dead ends: 152 [2018-10-10 16:20:46,288 INFO L226 Difference]: Without dead ends: 152 [2018-10-10 16:20:46,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1088 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=867, Invalid=4103, Unknown=0, NotChecked=0, Total=4970 [2018-10-10 16:20:46,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-10-10 16:20:46,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 139. [2018-10-10 16:20:46,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-10-10 16:20:46,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2018-10-10 16:20:46,295 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 126 [2018-10-10 16:20:46,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:46,296 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2018-10-10 16:20:46,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-10 16:20:46,296 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2018-10-10 16:20:46,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-10 16:20:46,298 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:46,298 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:46,298 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:46,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:46,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1377426224, now seen corresponding path program 8 times [2018-10-10 16:20:46,299 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:46,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:47,054 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 100 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:20:47,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:47,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-10 16:20:47,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-10 16:20:47,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-10 16:20:47,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2018-10-10 16:20:47,055 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 22 states. [2018-10-10 16:20:47,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:47,720 INFO L93 Difference]: Finished difference Result 246 states and 247 transitions. [2018-10-10 16:20:47,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-10 16:20:47,720 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 138 [2018-10-10 16:20:47,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:47,721 INFO L225 Difference]: With dead ends: 246 [2018-10-10 16:20:47,722 INFO L226 Difference]: Without dead ends: 148 [2018-10-10 16:20:47,723 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=334, Invalid=1646, Unknown=0, NotChecked=0, Total=1980 [2018-10-10 16:20:47,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-10-10 16:20:47,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 145. [2018-10-10 16:20:47,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-10 16:20:47,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2018-10-10 16:20:47,726 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 138 [2018-10-10 16:20:47,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:47,727 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2018-10-10 16:20:47,727 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-10 16:20:47,727 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2018-10-10 16:20:47,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-10 16:20:47,728 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:47,728 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:47,729 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:47,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:47,729 INFO L82 PathProgramCache]: Analyzing trace with hash 596020874, now seen corresponding path program 9 times [2018-10-10 16:20:47,730 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:47,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:48,516 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 70 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:20:48,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:48,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-10 16:20:48,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-10 16:20:48,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-10 16:20:48,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1147, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 16:20:48,518 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 36 states. [2018-10-10 16:20:49,169 WARN L178 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-10-10 16:20:52,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:52,774 INFO L93 Difference]: Finished difference Result 170 states and 171 transitions. [2018-10-10 16:20:52,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-10 16:20:52,775 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 144 [2018-10-10 16:20:52,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:52,776 INFO L225 Difference]: With dead ends: 170 [2018-10-10 16:20:52,776 INFO L226 Difference]: Without dead ends: 170 [2018-10-10 16:20:52,779 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1455 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1044, Invalid=5276, Unknown=0, NotChecked=0, Total=6320 [2018-10-10 16:20:52,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-10 16:20:52,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 157. [2018-10-10 16:20:52,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-10 16:20:52,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2018-10-10 16:20:52,782 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 144 [2018-10-10 16:20:52,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:52,783 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2018-10-10 16:20:52,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-10 16:20:52,783 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2018-10-10 16:20:52,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-10 16:20:52,784 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:52,784 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:52,785 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:52,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:52,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1764507570, now seen corresponding path program 10 times [2018-10-10 16:20:52,786 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:52,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:53,444 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 154 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:20:53,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:53,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-10 16:20:53,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-10 16:20:53,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-10 16:20:53,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2018-10-10 16:20:53,446 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 26 states. [2018-10-10 16:20:54,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:54,483 INFO L93 Difference]: Finished difference Result 276 states and 277 transitions. [2018-10-10 16:20:54,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-10 16:20:54,483 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 156 [2018-10-10 16:20:54,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:54,485 INFO L225 Difference]: With dead ends: 276 [2018-10-10 16:20:54,485 INFO L226 Difference]: Without dead ends: 166 [2018-10-10 16:20:54,487 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=471, Invalid=2391, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 16:20:54,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-10-10 16:20:54,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 163. [2018-10-10 16:20:54,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-10-10 16:20:54,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2018-10-10 16:20:54,490 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 156 [2018-10-10 16:20:54,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:54,490 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2018-10-10 16:20:54,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-10 16:20:54,490 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2018-10-10 16:20:54,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-10 16:20:54,491 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:54,492 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:54,492 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:54,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:54,492 INFO L82 PathProgramCache]: Analyzing trace with hash 112160492, now seen corresponding path program 11 times [2018-10-10 16:20:54,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:54,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:55,817 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 102 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:20:55,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:55,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-10 16:20:55,818 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-10 16:20:55,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-10 16:20:55,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1556, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 16:20:55,819 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 42 states. [2018-10-10 16:20:56,880 WARN L178 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-10-10 16:20:58,617 WARN L178 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2018-10-10 16:21:01,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:21:01,521 INFO L93 Difference]: Finished difference Result 188 states and 189 transitions. [2018-10-10 16:21:01,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-10 16:21:01,522 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 162 [2018-10-10 16:21:01,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:21:01,524 INFO L225 Difference]: With dead ends: 188 [2018-10-10 16:21:01,524 INFO L226 Difference]: Without dead ends: 188 [2018-10-10 16:21:01,527 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2068 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1686, Invalid=7244, Unknown=0, NotChecked=0, Total=8930 [2018-10-10 16:21:01,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-10 16:21:01,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 175. [2018-10-10 16:21:01,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-10-10 16:21:01,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2018-10-10 16:21:01,532 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 162 [2018-10-10 16:21:01,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:21:01,532 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2018-10-10 16:21:01,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-10 16:21:01,532 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2018-10-10 16:21:01,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-10 16:21:01,534 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:21:01,534 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:21:01,534 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:21:01,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:21:01,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1003643628, now seen corresponding path program 12 times [2018-10-10 16:21:01,535 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:21:01,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:21:02,683 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 220 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:21:02,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:21:02,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-10 16:21:02,684 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-10 16:21:02,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-10 16:21:02,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2018-10-10 16:21:02,686 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 30 states. [2018-10-10 16:21:03,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:21:03,750 INFO L93 Difference]: Finished difference Result 306 states and 307 transitions. [2018-10-10 16:21:03,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-10 16:21:03,750 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 174 [2018-10-10 16:21:03,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:21:03,752 INFO L225 Difference]: With dead ends: 306 [2018-10-10 16:21:03,752 INFO L226 Difference]: Without dead ends: 184 [2018-10-10 16:21:03,753 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 928 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=632, Invalid=3274, Unknown=0, NotChecked=0, Total=3906 [2018-10-10 16:21:03,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-10-10 16:21:03,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2018-10-10 16:21:03,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-10 16:21:03,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2018-10-10 16:21:03,757 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 174 [2018-10-10 16:21:03,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:21:03,757 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2018-10-10 16:21:03,757 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-10 16:21:03,757 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2018-10-10 16:21:03,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-10 16:21:03,758 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:21:03,758 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:21:03,758 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:21:03,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:21:03,758 INFO L82 PathProgramCache]: Analyzing trace with hash 125645262, now seen corresponding path program 13 times [2018-10-10 16:21:03,759 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:21:03,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:21:05,075 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 140 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:21:05,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:21:05,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-10 16:21:05,076 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-10 16:21:05,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-10 16:21:05,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1883, Unknown=0, NotChecked=0, Total=2070 [2018-10-10 16:21:05,077 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 46 states. [2018-10-10 16:21:07,522 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2018-10-10 16:21:08,090 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2018-10-10 16:21:08,233 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2018-10-10 16:21:08,643 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2018-10-10 16:21:08,792 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2018-10-10 16:21:09,199 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2018-10-10 16:21:09,354 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2018-10-10 16:21:09,820 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2018-10-10 16:21:10,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:21:10,635 INFO L93 Difference]: Finished difference Result 206 states and 207 transitions. [2018-10-10 16:21:10,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-10 16:21:10,644 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 180 [2018-10-10 16:21:10,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:21:10,646 INFO L225 Difference]: With dead ends: 206 [2018-10-10 16:21:10,646 INFO L226 Difference]: Without dead ends: 206 [2018-10-10 16:21:10,649 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2473 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1880, Invalid=8626, Unknown=0, NotChecked=0, Total=10506 [2018-10-10 16:21:10,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-10-10 16:21:10,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 193. [2018-10-10 16:21:10,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-10-10 16:21:10,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2018-10-10 16:21:10,653 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 180 [2018-10-10 16:21:10,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:21:10,653 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2018-10-10 16:21:10,654 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-10 16:21:10,654 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2018-10-10 16:21:10,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-10 16:21:10,655 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:21:10,655 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:21:10,655 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:21:10,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:21:10,656 INFO L82 PathProgramCache]: Analyzing trace with hash -736879370, now seen corresponding path program 14 times [2018-10-10 16:21:10,656 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:21:10,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:21:11,726 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 298 proven. 218 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:21:11,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:21:11,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-10 16:21:11,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-10 16:21:11,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-10 16:21:11,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=957, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 16:21:11,727 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 34 states. [2018-10-10 16:21:13,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:21:13,203 INFO L93 Difference]: Finished difference Result 336 states and 337 transitions. [2018-10-10 16:21:13,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-10 16:21:13,203 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 192 [2018-10-10 16:21:13,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:21:13,204 INFO L225 Difference]: With dead ends: 336 [2018-10-10 16:21:13,205 INFO L226 Difference]: Without dead ends: 202 [2018-10-10 16:21:13,206 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1247 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=817, Invalid=4295, Unknown=0, NotChecked=0, Total=5112 [2018-10-10 16:21:13,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-10-10 16:21:13,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 199. [2018-10-10 16:21:13,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-10-10 16:21:13,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2018-10-10 16:21:13,209 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 192 [2018-10-10 16:21:13,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:21:13,210 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2018-10-10 16:21:13,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-10 16:21:13,210 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2018-10-10 16:21:13,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-10 16:21:13,211 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:21:13,211 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:21:13,211 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:21:13,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:21:13,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1878112048, now seen corresponding path program 15 times [2018-10-10 16:21:13,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:21:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:21:14,569 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 184 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:21:14,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:21:14,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-10 16:21:14,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-10 16:21:14,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-10 16:21:14,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=2212, Unknown=0, NotChecked=0, Total=2450 [2018-10-10 16:21:14,571 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 50 states. [2018-10-10 16:21:16,893 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2018-10-10 16:21:17,557 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2018-10-10 16:21:17,739 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2018-10-10 16:21:18,530 WARN L178 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2018-10-10 16:21:19,068 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2018-10-10 16:21:21,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:21:21,192 INFO L93 Difference]: Finished difference Result 224 states and 225 transitions. [2018-10-10 16:21:21,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-10 16:21:21,193 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 198 [2018-10-10 16:21:21,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:21:21,194 INFO L225 Difference]: With dead ends: 224 [2018-10-10 16:21:21,194 INFO L226 Difference]: Without dead ends: 224 [2018-10-10 16:21:21,196 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3183 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=2435, Invalid=10675, Unknown=0, NotChecked=0, Total=13110 [2018-10-10 16:21:21,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-10-10 16:21:21,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 211. [2018-10-10 16:21:21,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-10-10 16:21:21,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2018-10-10 16:21:21,200 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 198 [2018-10-10 16:21:21,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:21:21,200 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2018-10-10 16:21:21,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-10 16:21:21,200 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2018-10-10 16:21:21,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-10 16:21:21,201 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:21:21,202 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:21:21,202 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:21:21,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:21:21,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1894670504, now seen corresponding path program 16 times [2018-10-10 16:21:21,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:21:21,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:21:22,167 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 388 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:21:22,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:21:22,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-10 16:21:22,168 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-10 16:21:22,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-10 16:21:22,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1203, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 16:21:22,169 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 38 states. [2018-10-10 16:21:23,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:21:23,893 INFO L93 Difference]: Finished difference Result 366 states and 367 transitions. [2018-10-10 16:21:23,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-10 16:21:23,893 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 210 [2018-10-10 16:21:23,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:21:23,895 INFO L225 Difference]: With dead ends: 366 [2018-10-10 16:21:23,895 INFO L226 Difference]: Without dead ends: 220 [2018-10-10 16:21:23,896 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1613 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1026, Invalid=5454, Unknown=0, NotChecked=0, Total=6480 [2018-10-10 16:21:23,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-10-10 16:21:23,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2018-10-10 16:21:23,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-10 16:21:23,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 218 transitions. [2018-10-10 16:21:23,900 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 218 transitions. Word has length 210 [2018-10-10 16:21:23,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:21:23,901 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 218 transitions. [2018-10-10 16:21:23,901 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-10 16:21:23,901 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 218 transitions. [2018-10-10 16:21:23,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-10 16:21:23,902 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:21:23,903 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:21:23,903 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:21:23,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:21:23,903 INFO L82 PathProgramCache]: Analyzing trace with hash -451485934, now seen corresponding path program 17 times [2018-10-10 16:21:23,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:21:23,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:21:24,858 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 284 proven. 70 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2018-10-10 16:21:24,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:21:24,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-10 16:21:24,859 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-10 16:21:24,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-10 16:21:24,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2018-10-10 16:21:24,860 INFO L87 Difference]: Start difference. First operand 217 states and 218 transitions. Second operand 24 states. [2018-10-10 16:21:27,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:21:27,906 INFO L93 Difference]: Finished difference Result 215 states and 216 transitions. [2018-10-10 16:21:27,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-10 16:21:27,914 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 216 [2018-10-10 16:21:27,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:21:27,915 INFO L225 Difference]: With dead ends: 215 [2018-10-10 16:21:27,915 INFO L226 Difference]: Without dead ends: 0 [2018-10-10 16:21:27,916 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=849, Invalid=2457, Unknown=0, NotChecked=0, Total=3306 [2018-10-10 16:21:27,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-10 16:21:27,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-10 16:21:27,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-10 16:21:27,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-10 16:21:27,917 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 216 [2018-10-10 16:21:27,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:21:27,917 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-10 16:21:27,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-10 16:21:27,917 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-10 16:21:27,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-10 16:21:27,921 INFO L202 PluginConnector]: Adding new model 960521-1_1_false-valid-free.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 04:21:27 BasicIcfg [2018-10-10 16:21:27,921 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 16:21:27,922 INFO L168 Benchmark]: Toolchain (without parser) took 85016.61 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.5 GB). Free memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-10-10 16:21:27,924 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.59 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-10 16:21:27,924 INFO L168 Benchmark]: Boogie Preprocessor took 84.79 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-10 16:21:27,925 INFO L168 Benchmark]: RCFGBuilder took 697.20 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-10 16:21:27,925 INFO L168 Benchmark]: IcfgTransformer took 23057.88 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.4 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -137.4 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-10-10 16:21:27,927 INFO L168 Benchmark]: TraceAbstraction took 61170.50 ms. Allocated memory was 2.9 GB in the beginning and 4.1 GB in the end (delta: 1.2 GB). Free memory was 1.6 GB in the beginning and 2.7 GB in the end (delta: -1.1 GB). Peak memory consumption was 29.2 MB. Max. memory is 7.1 GB. [2018-10-10 16:21:27,935 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.59 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 84.79 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 697.20 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * IcfgTransformer took 23057.88 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.4 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -137.4 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * TraceAbstraction took 61170.50 ms. Allocated memory was 2.9 GB in the beginning and 4.1 GB in the end (delta: 1.2 GB). Free memory was 1.6 GB in the beginning and 2.7 GB in the end (delta: -1.1 GB). Peak memory consumption was 29.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 66 LocStat_MAX_WEQGRAPH_SIZE : 7 LocStat_MAX_SIZEOF_WEQEDGELABEL : 5 LocStat_NO_SUPPORTING_EQUALITIES : 1381 LocStat_NO_SUPPORTING_DISEQUALITIES : 280 LocStat_NO_DISJUNCTIONS : -132 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 69 TransStat_MAX_WEQGRAPH_SIZE : 3 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 71 TransStat_NO_SUPPORTING_DISEQUALITIES : 3 TransStat_NO_DISJUNCTIONS : 70 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqPostOperator statistics APPLY_NORMAL(MILLISECONDS) : 11599.67 APPLY_RETURN(MILLISECONDS) : 0.00 #APPLY_NORMAL : 163 #APPLY_RETURN : 0 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: Abstract Interpretation statistics Visited 69 different actions 160 times. Merged at 58 different actions 87 times. Widened at 1 different actions 1 times. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. - StatisticsResult: HeapSeparatorStatistics #COUNT_NEW_ARRAY_VARS_[#memory_int, ULTIMATE.start_write~int_old_#memory_int] : 0 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 : 3 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: 134]: 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, 68 locations, 1 error locations. SAFE Result, 61.1s OverallTime, 20 OverallIterations, 10 TraceHistogramMax, 45.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1486 SDtfs, 13159 SDslu, 16746 SDs, 0 SdLazy, 11957 SolverSat, 1503 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1160 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 1108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17826 ImplicationChecksByTransitivity, 43.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred in iteration=19, 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, 20 MinimizatonAttempts, 225 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 14.6s InterpolantComputationTime, 2652 NumberOfCodeBlocks, 2652 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2632 ConstructedInterpolants, 0 QuantifiedInterpolants, 2762605 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 2479/4718 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/960521-1_1_false-valid-free.i_11.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-Benchmark-0-2018-10-10_16-21-27-953.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/960521-1_1_false-valid-free.i_11.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-VPDomainBenchmark-0-2018-10-10_16-21-27-953.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/960521-1_1_false-valid-free.i_11.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-BenchmarkWithCounters-0-2018-10-10_16-21-27-953.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...