java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AbstractInterpretationC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/list-properties/alternating_list_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:33:10,851 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:33:10,853 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:33:10,866 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:33:10,866 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:33:10,867 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:33:10,868 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:33:10,870 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:33:10,872 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:33:10,873 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:33:10,873 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:33:10,873 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:33:10,874 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:33:10,875 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:33:10,875 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:33:10,878 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:33:10,880 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:33:10,882 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:33:10,883 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:33:10,884 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:33:10,886 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:33:10,887 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:33:10,887 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:33:10,888 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:33:10,889 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:33:10,890 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:33:10,890 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:33:10,891 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:33:10,891 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:33:10,891 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:33:10,892 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:33:10,892 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf [2018-01-24 16:33:10,902 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:33:10,902 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:33:10,903 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:33:10,903 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:33:10,903 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:33:10,903 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 16:33:10,904 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:33:10,904 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:33:10,904 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:33:10,905 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:33:10,905 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:33:10,905 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:33:10,905 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:33:10,905 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:33:10,906 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:33:10,906 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:33:10,906 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:33:10,906 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:33:10,906 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:33:10,907 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:33:10,907 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:33:10,907 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:33:10,907 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:33:10,907 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:33:10,908 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:33:10,908 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:33:10,908 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:33:10,908 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:33:10,908 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:33:10,909 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 16:33:10,909 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:33:10,909 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:33:10,909 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:33:10,910 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:33:10,910 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:33:10,943 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:33:10,957 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:33:10,961 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:33:10,963 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:33:10,963 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:33:10,964 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/alternating_list_true-unreach-call_true-valid-memsafety.i [2018-01-24 16:33:11,157 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:33:11,161 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:33:11,162 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:33:11,162 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:33:11,167 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:33:11,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:33:11" (1/1) ... [2018-01-24 16:33:11,170 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d17d7d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:33:11, skipping insertion in model container [2018-01-24 16:33:11,170 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:33:11" (1/1) ... [2018-01-24 16:33:11,184 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:33:11,220 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:33:11,333 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:33:11,351 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:33:11,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:33:11 WrapperNode [2018-01-24 16:33:11,358 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:33:11,359 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:33:11,359 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:33:11,359 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:33:11,372 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:33:11" (1/1) ... [2018-01-24 16:33:11,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:33:11" (1/1) ... [2018-01-24 16:33:11,380 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:33:11" (1/1) ... [2018-01-24 16:33:11,381 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:33:11" (1/1) ... [2018-01-24 16:33:11,385 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:33:11" (1/1) ... [2018-01-24 16:33:11,388 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:33:11" (1/1) ... [2018-01-24 16:33:11,389 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:33:11" (1/1) ... [2018-01-24 16:33:11,390 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:33:11,391 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:33:11,391 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:33:11,391 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:33:11,392 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:33:11" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:33:11,438 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:33:11,438 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:33:11,438 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-01-24 16:33:11,438 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:33:11,438 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 16:33:11,439 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 16:33:11,439 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:33:11,439 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:33:11,439 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:33:11,439 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:33:11,439 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:33:11,439 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-24 16:33:11,439 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:33:11,439 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 16:33:11,439 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 16:33:11,439 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-01-24 16:33:11,440 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:33:11,440 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:33:11,440 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:33:11,774 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:33:11,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:33:11 BoogieIcfgContainer [2018-01-24 16:33:11,775 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:33:11,776 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2018-01-24 16:33:11,776 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2018-01-24 16:33:11,777 INFO L276 PluginConnector]: Abstract Interpretation initialized [2018-01-24 16:33:11,778 INFO L185 PluginConnector]: Executing the observer AbstractInterpretationRcfgObserver from plugin Abstract Interpretation for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:33:11" (1/1) ... [2018-01-24 16:33:11,823 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:33:13,606 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:33:13,625 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-24 16:33:13,646 INFO L268 AbstractInterpreter]: Visited 88 different actions 390 times. Merged at 62 different actions 211 times. Widened at 4 different actions 5 times. Found 27 fixpoints after 15 different actions. Largest state had 39 variables. [2018-01-24 16:33:13,648 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2018-01-24 16:33:13,649 INFO L168 Benchmark]: Toolchain (without parser) took 2491.88 ms. Allocated memory was 301.5 MB in the beginning and 482.9 MB in the end (delta: 181.4 MB). Free memory was 261.5 MB in the beginning and 202.3 MB in the end (delta: 59.2 MB). Peak memory consumption was 240.6 MB. Max. memory is 5.3 GB. [2018-01-24 16:33:13,650 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 301.5 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:33:13,650 INFO L168 Benchmark]: CACSL2BoogieTranslator took 196.66 ms. Allocated memory is still 301.5 MB. Free memory was 260.5 MB in the beginning and 249.5 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:33:13,650 INFO L168 Benchmark]: Boogie Preprocessor took 31.81 ms. Allocated memory is still 301.5 MB. Free memory was 249.5 MB in the beginning and 248.5 MB in the end (delta: 996.5 kB). Peak memory consumption was 996.5 kB. Max. memory is 5.3 GB. [2018-01-24 16:33:13,651 INFO L168 Benchmark]: RCFGBuilder took 384.80 ms. Allocated memory is still 301.5 MB. Free memory was 247.5 MB in the beginning and 223.9 MB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 5.3 GB. [2018-01-24 16:33:13,651 INFO L168 Benchmark]: Abstract Interpretation took 1872.24 ms. Allocated memory was 301.5 MB in the beginning and 482.9 MB in the end (delta: 181.4 MB). Free memory was 223.9 MB in the beginning and 202.3 MB in the end (delta: 21.6 MB). Peak memory consumption was 203.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:33:13,652 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 301.5 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 196.66 ms. Allocated memory is still 301.5 MB. Free memory was 260.5 MB in the beginning and 249.5 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.81 ms. Allocated memory is still 301.5 MB. Free memory was 249.5 MB in the beginning and 248.5 MB in the end (delta: 996.5 kB). Peak memory consumption was 996.5 kB. Max. memory is 5.3 GB. * RCFGBuilder took 384.80 ms. Allocated memory is still 301.5 MB. Free memory was 247.5 MB in the beginning and 223.9 MB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 5.3 GB. * Abstract Interpretation took 1872.24 ms. Allocated memory was 301.5 MB in the beginning and 482.9 MB in the end (delta: 181.4 MB). Free memory was 223.9 MB in the beginning and 202.3 MB in the end (delta: 21.6 MB). Peak memory consumption was 203.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 69 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 622 LocStat_NO_SUPPORTING_DISEQUALITIES : 331 LocStat_NO_DISJUNCTIONS : -138 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 92 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 141 TransStat_NO_SUPPORTING_DISEQUALITIES : 41 TransStat_NO_DISJUNCTIONS : 107 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.293200 RENAME_VARIABLES(MILLISECONDS) : 0.264369 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.275620 PROJECTAWAY(MILLISECONDS) : 0.050310 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001817 DISJOIN(MILLISECONDS) : 0.503557 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.286387 ADD_EQUALITY(MILLISECONDS) : 0.021002 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.013297 #CONJOIN_DISJUNCTIVE : 701 #RENAME_VARIABLES : 1469 #UNFREEZE : 0 #CONJOIN : 957 #PROJECTAWAY : 759 #ADD_WEAK_EQUALITY : 31 #DISJOIN : 202 #RENAME_VARIABLES_DISJUNCTIVE : 1361 #ADD_EQUALITY : 144 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 33 - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] int flag = 1; [L628] EXPR, FCALL malloc(sizeof(struct node)) [L628] List a = (List) malloc(sizeof(struct node)); [L629] COND FALSE !(a == 0) [L630] List t; [L631] List p = a; [L632] COND FALSE !(__VERIFIER_nondet_int()) [L645] FCALL p->h = 3 - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] int flag = 1; [L628] EXPR, FCALL malloc(sizeof(struct node)) [L628] List a = (List) malloc(sizeof(struct node)); [L629] COND FALSE !(a == 0) [L630] List t; [L631] List p = a; [L632] COND TRUE __VERIFIER_nondet_int() [L633] COND TRUE \read(flag) [L634] FCALL p->h = 1 - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] int flag = 1; [L628] EXPR, FCALL malloc(sizeof(struct node)) [L628] List a = (List) malloc(sizeof(struct node)); [L629] COND FALSE !(a == 0) [L630] List t; [L631] List p = a; [L632] COND FALSE !(__VERIFIER_nondet_int()) [L645] FCALL p->h = 3 [L646] p = a [L647] flag = 1 [L648] FCALL p->h - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] int flag = 1; [L628] EXPR, FCALL malloc(sizeof(struct node)) [L628] List a = (List) malloc(sizeof(struct node)); [L629] COND FALSE !(a == 0) [L630] List t; [L631] List p = a; [L632] COND TRUE __VERIFIER_nondet_int() [L633] COND TRUE \read(flag) [L634] FCALL p->h = 1 [L635] flag = 0 [L640] EXPR, FCALL malloc(sizeof(struct node)) [L640] t = (List) malloc(sizeof(struct node)) [L641] COND FALSE !(t == 0) [L642] FCALL p->n = t - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] int flag = 1; [L628] EXPR, FCALL malloc(sizeof(struct node)) [L628] List a = (List) malloc(sizeof(struct node)); [L629] COND FALSE !(a == 0) [L630] List t; [L631] List p = a; [L632] COND TRUE __VERIFIER_nondet_int() [L633] COND TRUE \read(flag) [L634] FCALL p->h = 1 [L635] flag = 0 [L640] EXPR, FCALL malloc(sizeof(struct node)) [L640] t = (List) malloc(sizeof(struct node)) [L641] COND FALSE !(t == 0) [L642] FCALL p->n = t - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] int flag = 1; [L628] EXPR, FCALL malloc(sizeof(struct node)) [L628] List a = (List) malloc(sizeof(struct node)); [L629] COND FALSE !(a == 0) [L630] List t; [L631] List p = a; [L632] COND FALSE !(__VERIFIER_nondet_int()) [L645] FCALL p->h = 3 [L646] p = a [L647] flag = 1 [L648] EXPR, FCALL p->h [L648] COND FALSE !(p->h != 3) [L660] p = a [L661] FCALL p->h - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] int flag = 1; [L628] EXPR, FCALL malloc(sizeof(struct node)) [L628] List a = (List) malloc(sizeof(struct node)); [L629] COND FALSE !(a == 0) [L630] List t; [L631] List p = a; [L632] COND TRUE __VERIFIER_nondet_int() [L633] COND TRUE \read(flag) [L634] FCALL p->h = 1 [L635] flag = 0 [L640] EXPR, FCALL malloc(sizeof(struct node)) [L640] t = (List) malloc(sizeof(struct node)) [L641] COND FALSE !(t == 0) [L642] FCALL p->n = t [L643] FCALL p->n - UnprovableResult [Line: 626]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: abstract domain could reach this error location. Possible FailurePath: [L627] int flag = 1; [L628] EXPR, FCALL malloc(sizeof(struct node)) [L628] List a = (List) malloc(sizeof(struct node)); [L629] COND FALSE !(a == 0) [L630] List t; [L631] List p = a; [L632] COND FALSE !(__VERIFIER_nondet_int()) [L645] FCALL p->h = 3 [L646] p = a [L647] flag = 1 [L648] EXPR, FCALL p->h [L648] COND FALSE !(p->h != 3) [L660] p = a [L661] EXPR, FCALL p->h [L661] COND FALSE !(p->h != 3) [L666] FCALL free(p) [L667] return 0; - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] int flag = 1; [L628] EXPR, FCALL malloc(sizeof(struct node)) [L628] List a = (List) malloc(sizeof(struct node)); [L629] COND FALSE !(a == 0) [L630] List t; [L631] List p = a; [L632] COND TRUE __VERIFIER_nondet_int() [L633] COND TRUE \read(flag) [L634] FCALL p->h = 1 [L635] flag = 0 [L640] EXPR, FCALL malloc(sizeof(struct node)) [L640] t = (List) malloc(sizeof(struct node)) [L641] COND FALSE !(t == 0) [L642] FCALL p->n = t [L643] EXPR, FCALL p->n [L643] p = p->n [L632] COND TRUE __VERIFIER_nondet_int() [L633] COND FALSE !(\read(flag)) [L637] FCALL p->h = 2 - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] int flag = 1; [L628] EXPR, FCALL malloc(sizeof(struct node)) [L628] List a = (List) malloc(sizeof(struct node)); [L629] COND FALSE !(a == 0) [L630] List t; [L631] List p = a; [L632] COND TRUE __VERIFIER_nondet_int() [L633] COND TRUE \read(flag) [L634] FCALL p->h = 1 [L635] flag = 0 [L640] EXPR, FCALL malloc(sizeof(struct node)) [L640] t = (List) malloc(sizeof(struct node)) [L641] COND FALSE !(t == 0) [L642] FCALL p->n = t [L643] EXPR, FCALL p->n [L643] p = p->n [L632] COND FALSE !(__VERIFIER_nondet_int()) [L645] FCALL p->h = 3 [L646] p = a [L647] flag = 1 [L648] EXPR, FCALL p->h [L648] COND TRUE p->h != 3 [L649] COND TRUE \read(flag) [L650] flag = 0 [L651] FCALL p->h - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] int flag = 1; [L628] EXPR, FCALL malloc(sizeof(struct node)) [L628] List a = (List) malloc(sizeof(struct node)); [L629] COND FALSE !(a == 0) [L630] List t; [L631] List p = a; [L632] COND TRUE __VERIFIER_nondet_int() [L633] COND TRUE \read(flag) [L634] FCALL p->h = 1 [L635] flag = 0 [L640] EXPR, FCALL malloc(sizeof(struct node)) [L640] t = (List) malloc(sizeof(struct node)) [L641] COND FALSE !(t == 0) [L642] FCALL p->n = t [L643] EXPR, FCALL p->n [L643] p = p->n [L632] COND FALSE !(__VERIFIER_nondet_int()) [L645] FCALL p->h = 3 [L646] p = a [L647] flag = 1 [L648] EXPR, FCALL p->h [L648] COND TRUE p->h != 3 [L649] COND TRUE \read(flag) [L650] flag = 0 [L651] EXPR, FCALL p->h [L651] COND FALSE !(p->h != 1) [L658] FCALL p->n - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] int flag = 1; [L628] EXPR, FCALL malloc(sizeof(struct node)) [L628] List a = (List) malloc(sizeof(struct node)); [L629] COND FALSE !(a == 0) [L630] List t; [L631] List p = a; [L632] COND TRUE __VERIFIER_nondet_int() [L633] COND TRUE \read(flag) [L634] FCALL p->h = 1 [L635] flag = 0 [L640] EXPR, FCALL malloc(sizeof(struct node)) [L640] t = (List) malloc(sizeof(struct node)) [L641] COND FALSE !(t == 0) [L642] FCALL p->n = t [L643] EXPR, FCALL p->n [L643] p = p->n [L632] COND FALSE !(__VERIFIER_nondet_int()) [L645] FCALL p->h = 3 [L646] p = a [L647] flag = 1 [L648] EXPR, FCALL p->h [L648] COND TRUE p->h != 3 [L649] COND TRUE \read(flag) [L650] flag = 0 [L651] EXPR, FCALL p->h [L651] COND FALSE !(p->h != 1) [L658] EXPR, FCALL p->n [L658] p = p->n [L648] FCALL p->h - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] int flag = 1; [L628] EXPR, FCALL malloc(sizeof(struct node)) [L628] List a = (List) malloc(sizeof(struct node)); [L629] COND FALSE !(a == 0) [L630] List t; [L631] List p = a; [L632] COND TRUE __VERIFIER_nondet_int() [L633] COND TRUE \read(flag) [L634] FCALL p->h = 1 [L635] flag = 0 [L640] EXPR, FCALL malloc(sizeof(struct node)) [L640] t = (List) malloc(sizeof(struct node)) [L641] COND FALSE !(t == 0) [L642] FCALL p->n = t [L643] EXPR, FCALL p->n [L643] p = p->n [L632] COND TRUE __VERIFIER_nondet_int() [L633] COND FALSE !(\read(flag)) [L637] FCALL p->h = 2 [L638] flag = 1 [L640] EXPR, FCALL malloc(sizeof(struct node)) [L640] t = (List) malloc(sizeof(struct node)) [L641] COND FALSE !(t == 0) [L642] FCALL p->n = t [L643] EXPR, FCALL p->n [L643] p = p->n [L632] COND FALSE !(__VERIFIER_nondet_int()) [L645] FCALL p->h = 3 - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] int flag = 1; [L628] EXPR, FCALL malloc(sizeof(struct node)) [L628] List a = (List) malloc(sizeof(struct node)); [L629] COND FALSE !(a == 0) [L630] List t; [L631] List p = a; [L632] COND TRUE __VERIFIER_nondet_int() [L633] COND TRUE \read(flag) [L634] FCALL p->h = 1 [L635] flag = 0 [L640] EXPR, FCALL malloc(sizeof(struct node)) [L640] t = (List) malloc(sizeof(struct node)) [L641] COND FALSE !(t == 0) [L642] FCALL p->n = t [L643] EXPR, FCALL p->n [L643] p = p->n [L632] COND TRUE __VERIFIER_nondet_int() [L633] COND FALSE !(\read(flag)) [L637] FCALL p->h = 2 [L638] flag = 1 [L640] EXPR, FCALL malloc(sizeof(struct node)) [L640] t = (List) malloc(sizeof(struct node)) [L641] COND FALSE !(t == 0) [L642] FCALL p->n = t [L643] EXPR, FCALL p->n [L643] p = p->n [L632] COND TRUE __VERIFIER_nondet_int() [L633] COND TRUE \read(flag) [L634] FCALL p->h = 1 - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] int flag = 1; [L628] EXPR, FCALL malloc(sizeof(struct node)) [L628] List a = (List) malloc(sizeof(struct node)); [L629] COND FALSE !(a == 0) [L630] List t; [L631] List p = a; [L632] COND TRUE __VERIFIER_nondet_int() [L633] COND TRUE \read(flag) [L634] FCALL p->h = 1 [L635] flag = 0 [L640] EXPR, FCALL malloc(sizeof(struct node)) [L640] t = (List) malloc(sizeof(struct node)) [L641] COND FALSE !(t == 0) [L642] FCALL p->n = t [L643] EXPR, FCALL p->n [L643] p = p->n [L632] COND TRUE __VERIFIER_nondet_int() [L633] COND FALSE !(\read(flag)) [L637] FCALL p->h = 2 [L638] flag = 1 [L640] EXPR, FCALL malloc(sizeof(struct node)) [L640] t = (List) malloc(sizeof(struct node)) [L641] COND FALSE !(t == 0) [L642] FCALL p->n = t [L643] EXPR, FCALL p->n [L643] p = p->n [L632] COND TRUE __VERIFIER_nondet_int() [L633] COND FALSE !(\read(flag)) [L637] FCALL p->h = 2 - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] int flag = 1; [L628] EXPR, FCALL malloc(sizeof(struct node)) [L628] List a = (List) malloc(sizeof(struct node)); [L629] COND FALSE !(a == 0) [L630] List t; [L631] List p = a; [L632] COND TRUE __VERIFIER_nondet_int() [L633] COND TRUE \read(flag) [L634] FCALL p->h = 1 [L635] flag = 0 [L640] EXPR, FCALL malloc(sizeof(struct node)) [L640] t = (List) malloc(sizeof(struct node)) [L641] COND FALSE !(t == 0) [L642] FCALL p->n = t [L643] EXPR, FCALL p->n [L643] p = p->n [L632] COND FALSE !(__VERIFIER_nondet_int()) [L645] FCALL p->h = 3 [L646] p = a [L647] flag = 1 [L648] EXPR, FCALL p->h [L648] COND TRUE p->h != 3 [L649] COND TRUE \read(flag) [L650] flag = 0 [L651] EXPR, FCALL p->h [L651] COND FALSE !(p->h != 1) [L658] EXPR, FCALL p->n [L658] p = p->n [L648] EXPR, FCALL p->h [L648] COND TRUE p->h != 3 [L649] COND FALSE !(\read(flag)) [L654] flag = 1 [L655] FCALL p->h - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] int flag = 1; [L628] EXPR, FCALL malloc(sizeof(struct node)) [L628] List a = (List) malloc(sizeof(struct node)); [L629] COND FALSE !(a == 0) [L630] List t; [L631] List p = a; [L632] COND TRUE __VERIFIER_nondet_int() [L633] COND TRUE \read(flag) [L634] FCALL p->h = 1 [L635] flag = 0 [L640] EXPR, FCALL malloc(sizeof(struct node)) [L640] t = (List) malloc(sizeof(struct node)) [L641] COND FALSE !(t == 0) [L642] FCALL p->n = t [L643] EXPR, FCALL p->n [L643] p = p->n [L632] COND FALSE !(__VERIFIER_nondet_int()) [L645] FCALL p->h = 3 [L646] p = a [L647] flag = 1 [L648] EXPR, FCALL p->h [L648] COND TRUE p->h != 3 [L649] COND TRUE \read(flag) [L650] flag = 0 [L651] EXPR, FCALL p->h [L651] COND FALSE !(p->h != 1) [L658] EXPR, FCALL p->n [L658] p = p->n [L648] EXPR, FCALL p->h [L648] COND FALSE !(p->h != 3) [L660] p = a [L661] EXPR, FCALL p->h [L661] COND TRUE p->h != 3 [L662] List tmp = p; [L663] FCALL p->n - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] int flag = 1; [L628] EXPR, FCALL malloc(sizeof(struct node)) [L628] List a = (List) malloc(sizeof(struct node)); [L629] COND FALSE !(a == 0) [L630] List t; [L631] List p = a; [L632] COND TRUE __VERIFIER_nondet_int() [L633] COND TRUE \read(flag) [L634] FCALL p->h = 1 [L635] flag = 0 [L640] EXPR, FCALL malloc(sizeof(struct node)) [L640] t = (List) malloc(sizeof(struct node)) [L641] COND FALSE !(t == 0) [L642] FCALL p->n = t [L643] EXPR, FCALL p->n [L643] p = p->n [L632] COND FALSE !(__VERIFIER_nondet_int()) [L645] FCALL p->h = 3 [L646] p = a [L647] flag = 1 [L648] EXPR, FCALL p->h [L648] COND TRUE p->h != 3 [L649] COND TRUE \read(flag) [L650] flag = 0 [L651] EXPR, FCALL p->h [L651] COND FALSE !(p->h != 1) [L658] EXPR, FCALL p->n [L658] p = p->n [L648] EXPR, FCALL p->h [L648] COND FALSE !(p->h != 3) [L660] p = a [L661] EXPR, FCALL p->h [L661] COND TRUE p->h != 3 [L662] List tmp = p; [L663] EXPR, FCALL p->n [L663] p = p->n [L664] FCALL free(tmp) [L661] FCALL p->h - UnprovableResult [Line: 1]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] int flag = 1; [L628] EXPR, FCALL malloc(sizeof(struct node)) [L628] List a = (List) malloc(sizeof(struct node)); [L629] COND FALSE !(a == 0) [L630] List t; [L631] List p = a; [L632] COND TRUE __VERIFIER_nondet_int() [L633] COND TRUE \read(flag) [L634] FCALL p->h = 1 [L635] flag = 0 [L640] EXPR, FCALL malloc(sizeof(struct node)) [L640] t = (List) malloc(sizeof(struct node)) [L641] COND FALSE !(t == 0) [L642] FCALL p->n = t [L643] EXPR, FCALL p->n [L643] p = p->n [L632] COND FALSE !(__VERIFIER_nondet_int()) [L645] FCALL p->h = 3 [L646] p = a [L647] flag = 1 [L648] EXPR, FCALL p->h [L648] COND TRUE p->h != 3 [L649] COND TRUE \read(flag) [L650] flag = 0 [L651] EXPR, FCALL p->h [L651] COND FALSE !(p->h != 1) [L658] EXPR, FCALL p->n [L658] p = p->n [L648] EXPR, FCALL p->h [L648] COND FALSE !(p->h != 3) [L660] p = a [L661] EXPR, FCALL p->h [L661] COND TRUE p->h != 3 [L662] List tmp = p; [L663] EXPR, FCALL p->n [L663] p = p->n [L664] FCALL free(tmp) [L661] EXPR, FCALL p->h [L661] COND FALSE !(p->h != 3) [L666] FCALL free(p) - UnprovableResult [Line: 1]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] int flag = 1; [L628] EXPR, FCALL malloc(sizeof(struct node)) [L628] List a = (List) malloc(sizeof(struct node)); [L629] COND FALSE !(a == 0) [L630] List t; [L631] List p = a; [L632] COND TRUE __VERIFIER_nondet_int() [L633] COND TRUE \read(flag) [L634] FCALL p->h = 1 [L635] flag = 0 [L640] EXPR, FCALL malloc(sizeof(struct node)) [L640] t = (List) malloc(sizeof(struct node)) [L641] COND FALSE !(t == 0) [L642] FCALL p->n = t [L643] EXPR, FCALL p->n [L643] p = p->n [L632] COND FALSE !(__VERIFIER_nondet_int()) [L645] FCALL p->h = 3 [L646] p = a [L647] flag = 1 [L648] EXPR, FCALL p->h [L648] COND TRUE p->h != 3 [L649] COND TRUE \read(flag) [L650] flag = 0 [L651] EXPR, FCALL p->h [L651] COND FALSE !(p->h != 1) [L658] EXPR, FCALL p->n [L658] p = p->n [L648] EXPR, FCALL p->h [L648] COND FALSE !(p->h != 3) [L660] p = a [L661] EXPR, FCALL p->h [L661] COND TRUE p->h != 3 [L662] List tmp = p; [L663] EXPR, FCALL p->n [L663] p = p->n [L664] FCALL free(tmp) [L661] EXPR, FCALL p->h [L661] COND TRUE p->h != 3 [L662] List tmp = p; [L663] EXPR, FCALL p->n [L663] p = p->n [L664] FCALL free(tmp) - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/alternating_list_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-Benchmark-0-2018-01-24_16-33-13-662.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/alternating_list_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-VPDomainBenchmark-0-2018-01-24_16-33-13-662.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/alternating_list_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_16-33-13-662.csv Received shutdown request...