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/ArraysOfVariableLength_true-valid-memsafety.c_11.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-502d2f4 [2018-10-12 22:34:34,620 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-12 22:34:34,623 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-12 22:34:34,641 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-12 22:34:34,642 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-12 22:34:34,644 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-12 22:34:34,645 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-12 22:34:34,648 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-12 22:34:34,651 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-12 22:34:34,659 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-12 22:34:34,660 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-12 22:34:34,660 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-12 22:34:34,661 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-12 22:34:34,664 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-12 22:34:34,666 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-12 22:34:34,666 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-12 22:34:34,668 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-12 22:34:34,671 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-12 22:34:34,675 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-12 22:34:34,677 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-12 22:34:34,680 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-12 22:34:34,682 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-12 22:34:34,684 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-12 22:34:34,684 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-12 22:34:34,685 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-12 22:34:34,686 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-12 22:34:34,687 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-12 22:34:34,687 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-12 22:34:34,691 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-12 22:34:34,692 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-12 22:34:34,692 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-12 22:34:34,694 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-12 22:34:34,694 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-12 22:34:34,695 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-12 22:34:34,696 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-12 22:34:34,697 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-12 22:34:34,698 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-12 22:34:34,715 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-12 22:34:34,716 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-12 22:34:34,717 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-12 22:34:34,718 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-12 22:34:34,718 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-12 22:34:34,718 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-12 22:34:34,719 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-12 22:34:34,719 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-12 22:34:34,720 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-12 22:34:34,720 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-12 22:34:34,720 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-12 22:34:34,720 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-12 22:34:34,721 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-12 22:34:34,722 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-12 22:34:34,722 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-12 22:34:34,780 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-12 22:34:34,797 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-12 22:34:34,804 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-12 22:34:34,806 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-12 22:34:34,807 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-12 22:34:34,808 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength_true-valid-memsafety.c_11.bpl [2018-10-12 22:34:34,808 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength_true-valid-memsafety.c_11.bpl' [2018-10-12 22:34:34,885 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-12 22:34:34,886 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-12 22:34:34,887 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-12 22:34:34,887 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-12 22:34:34,887 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-12 22:34:34,917 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 10:34:34" (1/1) ... [2018-10-12 22:34:34,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 10:34:34" (1/1) ... [2018-10-12 22:34:34,935 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 10:34:34" (1/1) ... [2018-10-12 22:34:34,935 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 10:34:34" (1/1) ... [2018-10-12 22:34:34,939 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 10:34:34" (1/1) ... [2018-10-12 22:34:34,942 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 10:34:34" (1/1) ... [2018-10-12 22:34:34,943 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 10:34:34" (1/1) ... [2018-10-12 22:34:34,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-12 22:34:34,947 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-12 22:34:34,947 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-12 22:34:34,947 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-12 22:34:34,949 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArraysOfVariableLength_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 10:34:34" (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-12 22:34:35,028 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-12 22:34:35,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-12 22:34:35,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-12 22:34:35,643 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-12 22:34:35,644 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:34:35 BoogieIcfgContainer [2018-10-12 22:34:35,644 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-12 22:34:35,645 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-12 22:34:35,645 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-12 22:34:35,646 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-12 22:34:35,649 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "ArraysOfVariableLength_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:34:35" (1/1) ... [2018-10-12 22:34:35,656 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-12 22:34:35,657 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-12 22:34:35,694 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-12 22:34:35,745 INFO L219 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-12 22:34:35,762 INFO L282 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-12 22:34:35,829 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-12 22:34:41,773 INFO L315 AbstractInterpreter]: Visited 62 different actions 265 times. Merged at 43 different actions 191 times. Widened at 4 different actions 10 times. Found 8 fixpoints after 4 different actions. Largest state had 0 variables. [2018-10-12 22:34:41,776 INFO L306 apSepIcfgTransformer]: finished equality analysis [2018-10-12 22:34:41,780 INFO L318 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-12 22:34:41,790 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |#loc_#memory_int_(Array-Int-#locsort1)| |v_ULTIMATE.start_read~int_#ptr.base_6|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-12 22:34:41,793 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select (select |#loc_#memory_int_(Array-Int-(Array-Int-#locsort2))| |v_ULTIMATE.start_read~int_#ptr.base_6|) |v_ULTIMATE.start_read~int_#ptr.offset_4|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-12 22:34:41,833 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |v_#locv_ULTIMATE.start_write~int_old_#memory_int_2_1_1| |v_ULTIMATE.start_write~int_#ptr.base_6|) at (assume #memory_int == 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]];) [2018-10-12 22:34:41,834 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-12 22:34:41,835 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-12 22:34:41,836 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-12 22:34:41,836 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-12 22:34:41,836 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-12 22:34:41,836 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-12 22:34:41,837 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-12 22:34:41,837 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-12 22:34:41,837 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-12 22:34:41,837 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-12 22:34:41,837 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-12 22:34:41,838 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-12 22:34:41,838 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-12 22:34:41,838 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-12 22:34:41,839 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-12 22:34:41,840 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-12 22:34:41,860 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 12.10 10:34:41 BasicIcfg [2018-10-12 22:34:41,860 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-12 22:34:41,861 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-12 22:34:41,862 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-12 22:34:41,867 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-12 22:34:41,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 10:34:34" (1/3) ... [2018-10-12 22:34:41,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28d72c7d and model type ArraysOfVariableLength_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 10:34:41, skipping insertion in model container [2018-10-12 22:34:41,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:34:35" (2/3) ... [2018-10-12 22:34:41,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28d72c7d and model type ArraysOfVariableLength_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 10:34:41, skipping insertion in model container [2018-10-12 22:34:41,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 12.10 10:34:41" (3/3) ... [2018-10-12 22:34:41,872 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-12 22:34:41,884 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-12 22:34:41,895 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-12 22:34:41,917 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-12 22:34:41,953 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-12 22:34:41,954 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-12 22:34:41,954 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-12 22:34:41,954 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-12 22:34:41,955 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-12 22:34:41,955 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-12 22:34:41,956 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-12 22:34:41,956 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-12 22:34:41,956 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-12 22:34:41,974 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-10-12 22:34:41,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-12 22:34:41,987 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:34:41,989 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] [2018-10-12 22:34:41,990 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:34:41,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:34:41,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1564095379, now seen corresponding path program 1 times [2018-10-12 22:34:42,073 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:34:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:34:42,672 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-12 22:34:42,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-12 22:34:42,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-12 22:34:42,680 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-12 22:34:42,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-12 22:34:42,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-12 22:34:42,699 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 6 states. [2018-10-12 22:34:43,328 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-12 22:34:43,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:34:43,663 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2018-10-12 22:34:43,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-12 22:34:43,670 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-10-12 22:34:43,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:34:43,683 INFO L225 Difference]: With dead ends: 89 [2018-10-12 22:34:43,684 INFO L226 Difference]: Without dead ends: 89 [2018-10-12 22:34:43,687 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-10-12 22:34:43,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-10-12 22:34:43,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 70. [2018-10-12 22:34:43,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-12 22:34:43,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2018-10-12 22:34:43,746 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 30 [2018-10-12 22:34:43,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:34:43,747 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2018-10-12 22:34:43,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-12 22:34:43,747 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2018-10-12 22:34:43,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-12 22:34:43,751 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:34:43,752 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-12 22:34:43,752 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:34:43,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:34:43,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1348723100, now seen corresponding path program 1 times [2018-10-12 22:34:43,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:34:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:34:44,128 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-12 22:34:44,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-12 22:34:44,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-12 22:34:44,132 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-12 22:34:44,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-12 22:34:44,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-12 22:34:44,133 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 7 states. [2018-10-12 22:34:44,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:34:44,643 INFO L93 Difference]: Finished difference Result 103 states and 105 transitions. [2018-10-12 22:34:44,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-12 22:34:44,643 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2018-10-12 22:34:44,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:34:44,646 INFO L225 Difference]: With dead ends: 103 [2018-10-12 22:34:44,646 INFO L226 Difference]: Without dead ends: 103 [2018-10-12 22:34:44,647 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-10-12 22:34:44,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-10-12 22:34:44,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 72. [2018-10-12 22:34:44,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-12 22:34:44,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2018-10-12 22:34:44,655 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 56 [2018-10-12 22:34:44,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:34:44,656 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2018-10-12 22:34:44,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-12 22:34:44,656 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2018-10-12 22:34:44,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-12 22:34:44,658 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:34:44,659 INFO L375 BasicCegarLoop]: trace histogram [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-12 22:34:44,659 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:34:44,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:34:44,659 INFO L82 PathProgramCache]: Analyzing trace with hash 2089452796, now seen corresponding path program 1 times [2018-10-12 22:34:44,660 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:34:44,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:34:45,083 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:34:45,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:34:45,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-12 22:34:45,084 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-12 22:34:45,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-12 22:34:45,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-12 22:34:45,085 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 10 states. [2018-10-12 22:34:45,434 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-12 22:34:46,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:34:46,200 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2018-10-12 22:34:46,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-12 22:34:46,200 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 71 [2018-10-12 22:34:46,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:34:46,203 INFO L225 Difference]: With dead ends: 151 [2018-10-12 22:34:46,203 INFO L226 Difference]: Without dead ends: 151 [2018-10-12 22:34:46,204 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=197, Invalid=505, Unknown=0, NotChecked=0, Total=702 [2018-10-12 22:34:46,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-10-12 22:34:46,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 113. [2018-10-12 22:34:46,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-10-12 22:34:46,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 116 transitions. [2018-10-12 22:34:46,216 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 116 transitions. Word has length 71 [2018-10-12 22:34:46,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:34:46,216 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 116 transitions. [2018-10-12 22:34:46,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-12 22:34:46,217 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 116 transitions. [2018-10-12 22:34:46,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-12 22:34:46,222 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:34:46,222 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2018-10-12 22:34:46,223 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:34:46,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:34:46,223 INFO L82 PathProgramCache]: Analyzing trace with hash 2016113939, now seen corresponding path program 2 times [2018-10-12 22:34:46,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:34:46,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:34:46,445 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 39 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-12 22:34:46,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:34:46,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-12 22:34:46,446 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-12 22:34:46,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-12 22:34:46,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-12 22:34:46,447 INFO L87 Difference]: Start difference. First operand 113 states and 116 transitions. Second operand 8 states. [2018-10-12 22:34:46,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:34:46,675 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2018-10-12 22:34:46,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-12 22:34:46,676 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2018-10-12 22:34:46,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:34:46,677 INFO L225 Difference]: With dead ends: 132 [2018-10-12 22:34:46,677 INFO L226 Difference]: Without dead ends: 132 [2018-10-12 22:34:46,678 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-10-12 22:34:46,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-10-12 22:34:46,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 113. [2018-10-12 22:34:46,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-10-12 22:34:46,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 115 transitions. [2018-10-12 22:34:46,686 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 115 transitions. Word has length 97 [2018-10-12 22:34:46,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:34:46,686 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 115 transitions. [2018-10-12 22:34:46,686 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-12 22:34:46,687 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 115 transitions. [2018-10-12 22:34:46,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-12 22:34:46,688 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:34:46,689 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-12 22:34:46,689 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:34:46,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:34:46,689 INFO L82 PathProgramCache]: Analyzing trace with hash -443802189, now seen corresponding path program 3 times [2018-10-12 22:34:46,690 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:34:46,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:34:46,944 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 3 proven. 67 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-12 22:34:46,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:34:46,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-12 22:34:46,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-12 22:34:46,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-12 22:34:46,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-12 22:34:46,946 INFO L87 Difference]: Start difference. First operand 113 states and 115 transitions. Second operand 12 states. [2018-10-12 22:34:47,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:34:47,539 INFO L93 Difference]: Finished difference Result 197 states and 200 transitions. [2018-10-12 22:34:47,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-12 22:34:47,540 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 112 [2018-10-12 22:34:47,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:34:47,545 INFO L225 Difference]: With dead ends: 197 [2018-10-12 22:34:47,545 INFO L226 Difference]: Without dead ends: 197 [2018-10-12 22:34:47,546 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2018-10-12 22:34:47,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-10-12 22:34:47,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 128. [2018-10-12 22:34:47,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-10-12 22:34:47,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 131 transitions. [2018-10-12 22:34:47,556 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 131 transitions. Word has length 112 [2018-10-12 22:34:47,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:34:47,557 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 131 transitions. [2018-10-12 22:34:47,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-12 22:34:47,557 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 131 transitions. [2018-10-12 22:34:47,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-12 22:34:47,559 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:34:47,559 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2018-10-12 22:34:47,560 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:34:47,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:34:47,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1719515141, now seen corresponding path program 4 times [2018-10-12 22:34:47,561 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:34:47,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:34:47,887 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 5 proven. 99 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-12 22:34:47,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:34:47,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-12 22:34:47,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-12 22:34:47,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-12 22:34:47,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-10-12 22:34:47,889 INFO L87 Difference]: Start difference. First operand 128 states and 131 transitions. Second operand 14 states. [2018-10-12 22:34:48,410 WARN L178 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2018-10-12 22:34:49,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:34:49,450 INFO L93 Difference]: Finished difference Result 222 states and 227 transitions. [2018-10-12 22:34:49,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-12 22:34:49,453 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 127 [2018-10-12 22:34:49,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:34:49,455 INFO L225 Difference]: With dead ends: 222 [2018-10-12 22:34:49,455 INFO L226 Difference]: Without dead ends: 222 [2018-10-12 22:34:49,456 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=434, Invalid=1458, Unknown=0, NotChecked=0, Total=1892 [2018-10-12 22:34:49,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-10-12 22:34:49,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 184. [2018-10-12 22:34:49,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-10-12 22:34:49,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 189 transitions. [2018-10-12 22:34:49,479 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 189 transitions. Word has length 127 [2018-10-12 22:34:49,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:34:49,483 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 189 transitions. [2018-10-12 22:34:49,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-12 22:34:49,483 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 189 transitions. [2018-10-12 22:34:49,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-12 22:34:49,488 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:34:49,488 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-12 22:34:49,488 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:34:49,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:34:49,489 INFO L82 PathProgramCache]: Analyzing trace with hash -669313586, now seen corresponding path program 5 times [2018-10-12 22:34:49,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:34:49,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:34:50,391 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 104 proven. 47 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-12 22:34:50,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:34:50,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-12 22:34:50,392 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-12 22:34:50,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-12 22:34:50,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-12 22:34:50,393 INFO L87 Difference]: Start difference. First operand 184 states and 189 transitions. Second operand 10 states. [2018-10-12 22:34:50,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:34:50,740 INFO L93 Difference]: Finished difference Result 184 states and 187 transitions. [2018-10-12 22:34:50,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-12 22:34:50,741 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 153 [2018-10-12 22:34:50,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:34:50,742 INFO L225 Difference]: With dead ends: 184 [2018-10-12 22:34:50,743 INFO L226 Difference]: Without dead ends: 184 [2018-10-12 22:34:50,743 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-10-12 22:34:50,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-10-12 22:34:50,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-10-12 22:34:50,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-10-12 22:34:50,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 187 transitions. [2018-10-12 22:34:50,750 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 187 transitions. Word has length 153 [2018-10-12 22:34:50,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:34:50,750 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 187 transitions. [2018-10-12 22:34:50,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-12 22:34:50,751 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 187 transitions. [2018-10-12 22:34:50,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-12 22:34:50,753 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:34:50,753 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2018-10-12 22:34:50,754 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:34:50,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:34:50,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1700151364, now seen corresponding path program 6 times [2018-10-12 22:34:50,755 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:34:50,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:34:51,000 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 136 proven. 65 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-12 22:34:51,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:34:51,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-12 22:34:51,001 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-12 22:34:51,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-12 22:34:51,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-12 22:34:51,002 INFO L87 Difference]: Start difference. First operand 184 states and 187 transitions. Second operand 12 states. [2018-10-12 22:34:51,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:34:51,546 INFO L93 Difference]: Finished difference Result 184 states and 185 transitions. [2018-10-12 22:34:51,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-12 22:34:51,548 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 168 [2018-10-12 22:34:51,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:34:51,549 INFO L225 Difference]: With dead ends: 184 [2018-10-12 22:34:51,550 INFO L226 Difference]: Without dead ends: 184 [2018-10-12 22:34:51,550 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2018-10-12 22:34:51,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-10-12 22:34:51,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-10-12 22:34:51,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-10-12 22:34:51,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 185 transitions. [2018-10-12 22:34:51,557 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 185 transitions. Word has length 168 [2018-10-12 22:34:51,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:34:51,558 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 185 transitions. [2018-10-12 22:34:51,558 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-12 22:34:51,558 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 185 transitions. [2018-10-12 22:34:51,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-12 22:34:51,561 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:34:51,561 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2018-10-12 22:34:51,561 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:34:51,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:34:51,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1418707954, now seen corresponding path program 7 times [2018-10-12 22:34:51,563 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:34:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:34:51,825 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 131 proven. 17 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-10-12 22:34:51,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:34:51,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-12 22:34:51,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-12 22:34:51,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-12 22:34:51,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-10-12 22:34:51,826 INFO L87 Difference]: Start difference. First operand 184 states and 185 transitions. Second operand 11 states. [2018-10-12 22:34:52,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:34:52,169 INFO L93 Difference]: Finished difference Result 194 states and 195 transitions. [2018-10-12 22:34:52,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-12 22:34:52,170 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 183 [2018-10-12 22:34:52,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:34:52,171 INFO L225 Difference]: With dead ends: 194 [2018-10-12 22:34:52,171 INFO L226 Difference]: Without dead ends: 0 [2018-10-12 22:34:52,172 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2018-10-12 22:34:52,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-12 22:34:52,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-12 22:34:52,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-12 22:34:52,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-12 22:34:52,173 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 183 [2018-10-12 22:34:52,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:34:52,174 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-12 22:34:52,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-12 22:34:52,174 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-12 22:34:52,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-12 22:34:52,178 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 10:34:52 BasicIcfg [2018-10-12 22:34:52,178 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-12 22:34:52,179 INFO L168 Benchmark]: Toolchain (without parser) took 17293.38 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 994.1 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -300.3 MB). Peak memory consumption was 693.8 MB. Max. memory is 7.1 GB. [2018-10-12 22:34:52,180 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-12 22:34:52,181 INFO L168 Benchmark]: Boogie Preprocessor took 59.58 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-12 22:34:52,181 INFO L168 Benchmark]: RCFGBuilder took 697.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-12 22:34:52,182 INFO L168 Benchmark]: IcfgTransformer took 6215.60 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 284.2 MB). Free memory was 1.4 GB in the beginning and 922.0 MB in the end (delta: 497.8 MB). Peak memory consumption was 782.0 MB. Max. memory is 7.1 GB. [2018-10-12 22:34:52,183 INFO L168 Benchmark]: TraceAbstraction took 10316.62 ms. Allocated memory was 1.8 GB in the beginning and 2.5 GB in the end (delta: 709.9 MB). Free memory was 922.0 MB in the beginning and 1.7 GB in the end (delta: -819.2 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-10-12 22:34:52,188 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.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 59.58 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 697.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * IcfgTransformer took 6215.60 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 284.2 MB). Free memory was 1.4 GB in the beginning and 922.0 MB in the end (delta: 497.8 MB). Peak memory consumption was 782.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10316.62 ms. Allocated memory was 1.8 GB in the beginning and 2.5 GB in the end (delta: 709.9 MB). Free memory was 922.0 MB in the beginning and 1.7 GB in the end (delta: -819.2 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 59 LocStat_MAX_WEQGRAPH_SIZE : 1 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 1184 LocStat_NO_SUPPORTING_DISEQUALITIES : 192 LocStat_NO_DISJUNCTIONS : -118 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 62 TransStat_MAX_WEQGRAPH_SIZE : 3 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 54 TransStat_NO_SUPPORTING_DISEQUALITIES : 1 TransStat_NO_DISJUNCTIONS : 62 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqPostOperator statistics APPLY_NORMAL(MILLISECONDS) : 3164.62 APPLY_RETURN(MILLISECONDS) : 0.00 #APPLY_NORMAL : 267 #APPLY_RETURN : 0 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: Abstract Interpretation statistics Visited 62 different actions 265 times. Merged at 43 different actions 191 times. Widened at 4 different actions 10 times. Found 8 fixpoints after 4 different actions. Largest state had 0 variables. - StatisticsResult: HeapSeparatorStatistics #COUNT_NEW_ARRAY_VARS_[#memory_int, ULTIMATE.start_write~int_old_#memory_int] : 2 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 : 1 COUNT_BLOCKS_for_[#memory_int, ULTIMATE.start_write~int_old_#memory_int]_at_dim_1 : 1 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: 129]: 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, 61 locations, 1 error locations. SAFE Result, 10.2s OverallTime, 9 OverallIterations, 6 TraceHistogramMax, 6.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 729 SDtfs, 2332 SDslu, 3637 SDs, 0 SdLazy, 1320 SolverSat, 107 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 204 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 909 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=184occurred in iteration=6, 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, 9 MinimizatonAttempts, 214 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 997 NumberOfCodeBlocks, 997 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 988 ConstructedInterpolants, 0 QuantifiedInterpolants, 322144 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 2 PerfectInterpolantSequences, 612/931 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/ArraysOfVariableLength_true-valid-memsafety.c_11.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-Benchmark-0-2018-10-12_22-34-52-207.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_11.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-VPDomainBenchmark-0-2018-10-12_22-34-52-207.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_11.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-BenchmarkWithCounters-0-2018-10-12_22-34-52-207.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...