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/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test9_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 03:24:50,596 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 03:24:50,598 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 03:24:50,610 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 03:24:50,610 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 03:24:50,611 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 03:24:50,612 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 03:24:50,613 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 03:24:50,615 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 03:24:50,615 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 03:24:50,616 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 03:24:50,616 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 03:24:50,617 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 03:24:50,618 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 03:24:50,619 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 03:24:50,620 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 03:24:50,622 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 03:24:50,624 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 03:24:50,625 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 03:24:50,625 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 03:24:50,627 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 03:24:50,627 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 03:24:50,628 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 03:24:50,628 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 03:24:50,629 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 03:24:50,630 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 03:24:50,630 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 03:24:50,631 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 03:24:50,631 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 03:24:50,631 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 03:24:50,631 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 03:24:50,631 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-04 03:24:50,640 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 03:24:50,640 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 03:24:50,641 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 03:24:50,641 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 03:24:50,641 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 03:24:50,642 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 03:24:50,642 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 03:24:50,642 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 03:24:50,642 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 03:24:50,642 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 03:24:50,642 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 03:24:50,643 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 03:24:50,643 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 03:24:50,643 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 03:24:50,643 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 03:24:50,643 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 03:24:50,643 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 03:24:50,643 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 03:24:50,644 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 03:24:50,644 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 03:24:50,644 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 03:24:50,644 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 03:24:50,644 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 03:24:50,670 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 03:24:50,678 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 03:24:50,680 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 03:24:50,681 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 03:24:50,681 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 03:24:50,682 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test9_true-valid-memsafety_true-termination.i [2018-02-04 03:24:50,814 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 03:24:50,815 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 03:24:50,816 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 03:24:50,816 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 03:24:50,820 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 03:24:50,821 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:24:50" (1/1) ... [2018-02-04 03:24:50,823 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@692a7dd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:24:50, skipping insertion in model container [2018-02-04 03:24:50,823 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:24:50" (1/1) ... [2018-02-04 03:24:50,834 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 03:24:50,869 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 03:24:50,966 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 03:24:50,977 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 03:24:50,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:24:50 WrapperNode [2018-02-04 03:24:50,984 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 03:24:50,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 03:24:50,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 03:24:50,984 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 03:24:50,996 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:24:50" (1/1) ... [2018-02-04 03:24:50,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:24:50" (1/1) ... [2018-02-04 03:24:51,003 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:24:50" (1/1) ... [2018-02-04 03:24:51,003 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:24:50" (1/1) ... [2018-02-04 03:24:51,005 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:24:50" (1/1) ... [2018-02-04 03:24:51,007 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:24:50" (1/1) ... [2018-02-04 03:24:51,008 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:24:50" (1/1) ... [2018-02-04 03:24:51,009 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 03:24:51,009 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 03:24:51,009 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 03:24:51,010 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 03:24:51,010 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:24:50" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-04 03:24:51,045 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 03:24:51,045 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 03:24:51,045 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 03:24:51,045 INFO L136 BoogieDeclarations]: Found implementation of procedure probe_9 [2018-02-04 03:24:51,045 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_9 [2018-02-04 03:24:51,045 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 03:24:51,045 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 03:24:51,045 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 03:24:51,045 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 03:24:51,046 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 03:24:51,046 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 03:24:51,046 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 03:24:51,046 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 03:24:51,046 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 03:24:51,046 INFO L128 BoogieDeclarations]: Found specification of procedure probe_9 [2018-02-04 03:24:51,046 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_9 [2018-02-04 03:24:51,046 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 03:24:51,046 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 03:24:51,046 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 03:24:51,046 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 03:24:51,155 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 03:24:51,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:24:51 BoogieIcfgContainer [2018-02-04 03:24:51,155 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 03:24:51,156 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 03:24:51,156 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 03:24:51,158 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 03:24:51,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 03:24:50" (1/3) ... [2018-02-04 03:24:51,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d122b56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:24:51, skipping insertion in model container [2018-02-04 03:24:51,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:24:50" (2/3) ... [2018-02-04 03:24:51,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d122b56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:24:51, skipping insertion in model container [2018-02-04 03:24:51,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:24:51" (3/3) ... [2018-02-04 03:24:51,160 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test9_true-valid-memsafety_true-termination.i [2018-02-04 03:24:51,165 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 03:24:51,170 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-02-04 03:24:51,200 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 03:24:51,200 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 03:24:51,200 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 03:24:51,200 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 03:24:51,201 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 03:24:51,201 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 03:24:51,201 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 03:24:51,201 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 03:24:51,201 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 03:24:51,210 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-02-04 03:24:51,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 03:24:51,220 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:51,223 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:24:51,223 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, disconnect_9Err1RequiresViolation, disconnect_9Err0RequiresViolation]=== [2018-02-04 03:24:51,227 INFO L82 PathProgramCache]: Analyzing trace with hash 637985235, now seen corresponding path program 1 times [2018-02-04 03:24:51,279 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:51,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:51,325 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:51,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:51,432 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:24:51,433 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:24:51,433 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:51,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:51,434 INFO L182 omatonBuilderFactory]: Interpolants [37#true, 38#false, 39#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 40#(and (= 0 |probe_9_#t~ret2.offset|) (= 0 |probe_9_#t~ret2.base|)), 41#(and (= ~a9.base 0) (= ~a9.offset 0))] [2018-02-04 03:24:51,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:51,434 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:24:51,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:24:51,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:24:51,445 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 5 states. [2018-02-04 03:24:51,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:51,574 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2018-02-04 03:24:51,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:24:51,576 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-04 03:24:51,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:51,585 INFO L225 Difference]: With dead ends: 47 [2018-02-04 03:24:51,586 INFO L226 Difference]: Without dead ends: 44 [2018-02-04 03:24:51,591 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:24:51,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-04 03:24:51,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-02-04 03:24:51,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-04 03:24:51,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-02-04 03:24:51,615 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 20 [2018-02-04 03:24:51,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:51,615 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-02-04 03:24:51,615 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:24:51,615 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-02-04 03:24:51,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 03:24:51,616 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:51,616 INFO L351 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] [2018-02-04 03:24:51,616 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, disconnect_9Err1RequiresViolation, disconnect_9Err0RequiresViolation]=== [2018-02-04 03:24:51,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1778317329, now seen corresponding path program 1 times [2018-02-04 03:24:51,617 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:51,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:51,637 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:51,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:51,684 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:24:51,684 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:24:51,684 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:51,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:51,685 INFO L182 omatonBuilderFactory]: Interpolants [136#true, 137#false, 138#(= 0 |ldv_malloc_#t~malloc1.offset|), 139#(= 0 |ldv_malloc_#res.offset|), 140#(= 0 |probe_9_#t~ret2.offset|), 141#(= ~a9.offset 0)] [2018-02-04 03:24:51,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:51,686 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:24:51,686 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:24:51,686 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:24:51,686 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 6 states. [2018-02-04 03:24:51,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:51,749 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-02-04 03:24:51,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:24:51,750 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-04 03:24:51,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:51,753 INFO L225 Difference]: With dead ends: 42 [2018-02-04 03:24:51,753 INFO L226 Difference]: Without dead ends: 42 [2018-02-04 03:24:51,754 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:24:51,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-04 03:24:51,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-02-04 03:24:51,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-04 03:24:51,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-02-04 03:24:51,760 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 22 [2018-02-04 03:24:51,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:51,760 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-02-04 03:24:51,760 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:24:51,761 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-02-04 03:24:51,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 03:24:51,761 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:51,761 INFO L351 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] [2018-02-04 03:24:51,761 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, disconnect_9Err1RequiresViolation, disconnect_9Err0RequiresViolation]=== [2018-02-04 03:24:51,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1778317330, now seen corresponding path program 1 times [2018-02-04 03:24:51,763 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:51,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:51,778 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:51,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:51,824 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:24:51,825 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:24:51,825 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:51,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:51,825 INFO L182 omatonBuilderFactory]: Interpolants [234#true, 235#false, 236#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 237#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 238#(= 1 (select |#valid| |probe_9_#t~ret2.base|)), 239#(= 1 (select |#valid| ~a9.base))] [2018-02-04 03:24:51,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:51,825 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:24:51,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:24:51,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:24:51,826 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 6 states. [2018-02-04 03:24:51,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:51,882 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-02-04 03:24:51,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:24:51,883 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-04 03:24:51,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:51,884 INFO L225 Difference]: With dead ends: 48 [2018-02-04 03:24:51,884 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 03:24:51,884 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:24:51,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 03:24:51,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 33. [2018-02-04 03:24:51,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-02-04 03:24:51,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-02-04 03:24:51,893 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 22 [2018-02-04 03:24:51,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:51,894 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-02-04 03:24:51,894 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:24:51,894 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-02-04 03:24:51,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 03:24:51,895 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:51,895 INFO L351 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] [2018-02-04 03:24:51,895 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, disconnect_9Err1RequiresViolation, disconnect_9Err0RequiresViolation]=== [2018-02-04 03:24:51,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1413293605, now seen corresponding path program 1 times [2018-02-04 03:24:51,897 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:51,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:51,907 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:51,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:51,934 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:24:51,935 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 03:24:51,935 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:51,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:51,935 INFO L182 omatonBuilderFactory]: Interpolants [323#true, 324#false, 325#(= |#valid| |old(#valid)|)] [2018-02-04 03:24:51,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:51,936 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 03:24:51,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 03:24:51,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 03:24:51,936 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 3 states. [2018-02-04 03:24:51,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:51,962 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-02-04 03:24:51,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 03:24:51,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-02-04 03:24:51,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:51,963 INFO L225 Difference]: With dead ends: 42 [2018-02-04 03:24:51,963 INFO L226 Difference]: Without dead ends: 38 [2018-02-04 03:24:51,963 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 03:24:51,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-04 03:24:51,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-02-04 03:24:51,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-04 03:24:51,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-02-04 03:24:51,968 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 22 [2018-02-04 03:24:51,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:51,969 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-02-04 03:24:51,969 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 03:24:51,969 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-02-04 03:24:51,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 03:24:51,969 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:51,970 INFO L351 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] [2018-02-04 03:24:51,970 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, disconnect_9Err1RequiresViolation, disconnect_9Err0RequiresViolation]=== [2018-02-04 03:24:51,970 INFO L82 PathProgramCache]: Analyzing trace with hash -431737374, now seen corresponding path program 1 times [2018-02-04 03:24:51,971 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:51,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:51,982 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:52,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:52,012 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:24:52,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:24:52,013 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:52,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:52,013 INFO L182 omatonBuilderFactory]: Interpolants [405#true, 406#false, 407#(= 0 |probe_9_#res|), 408#(= 0 |entry_point_#t~ret3|), 409#(= entry_point_~ret~0 0)] [2018-02-04 03:24:52,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:52,014 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:24:52,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:24:52,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:24:52,014 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 5 states. [2018-02-04 03:24:52,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:52,023 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-02-04 03:24:52,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:24:52,023 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-02-04 03:24:52,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:52,024 INFO L225 Difference]: With dead ends: 44 [2018-02-04 03:24:52,024 INFO L226 Difference]: Without dead ends: 44 [2018-02-04 03:24:52,024 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:24:52,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-04 03:24:52,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2018-02-04 03:24:52,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-04 03:24:52,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-02-04 03:24:52,026 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 24 [2018-02-04 03:24:52,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:52,027 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-02-04 03:24:52,027 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:24:52,027 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-02-04 03:24:52,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 03:24:52,027 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:52,027 INFO L351 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] [2018-02-04 03:24:52,027 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, disconnect_9Err1RequiresViolation, disconnect_9Err0RequiresViolation]=== [2018-02-04 03:24:52,027 INFO L82 PathProgramCache]: Analyzing trace with hash 2055775459, now seen corresponding path program 1 times [2018-02-04 03:24:52,028 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:52,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:52,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:52,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:52,078 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:24:52,078 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 03:24:52,079 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:52,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:52,080 INFO L182 omatonBuilderFactory]: Interpolants [496#(not (= 0 ~a9.base)), 491#true, 492#false, 493#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 494#(not (= 0 |ldv_malloc_#res.base|)), 495#(not (= 0 |probe_9_#t~ret2.base|))] [2018-02-04 03:24:52,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:52,080 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:24:52,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:24:52,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:24:52,081 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 6 states. [2018-02-04 03:24:52,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:52,111 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-02-04 03:24:52,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:24:52,112 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 03:24:52,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:52,113 INFO L225 Difference]: With dead ends: 42 [2018-02-04 03:24:52,113 INFO L226 Difference]: Without dead ends: 42 [2018-02-04 03:24:52,113 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:24:52,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-04 03:24:52,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2018-02-04 03:24:52,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-02-04 03:24:52,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-02-04 03:24:52,116 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 24 [2018-02-04 03:24:52,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:52,116 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-02-04 03:24:52,116 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:24:52,116 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-02-04 03:24:52,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 03:24:52,117 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:52,117 INFO L351 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] [2018-02-04 03:24:52,117 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, disconnect_9Err1RequiresViolation, disconnect_9Err0RequiresViolation]=== [2018-02-04 03:24:52,117 INFO L82 PathProgramCache]: Analyzing trace with hash -119628224, now seen corresponding path program 1 times [2018-02-04 03:24:52,118 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:52,126 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:52,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:52,180 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:24:52,181 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 03:24:52,181 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:52,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:52,181 INFO L182 omatonBuilderFactory]: Interpolants [576#(= |#valid| |old(#valid)|), 577#(and (= |#valid| |old(#valid)|) (= 0 |ldv_malloc_#res.base|)), 578#(and (= |#valid| |old(#valid)|) (= 0 |probe_9_#t~ret2.base|)), 579#(and (= |#valid| |old(#valid)|) (= ~a9.base 0)), 580#(or (not (= ~a9.base 0)) (= |#valid| |old(#valid)|)), 574#true, 575#false] [2018-02-04 03:24:52,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:52,182 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 03:24:52,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 03:24:52,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:24:52,182 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 7 states. [2018-02-04 03:24:52,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:52,249 INFO L93 Difference]: Finished difference Result 45 states and 44 transitions. [2018-02-04 03:24:52,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:24:52,250 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-02-04 03:24:52,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:52,250 INFO L225 Difference]: With dead ends: 45 [2018-02-04 03:24:52,250 INFO L226 Difference]: Without dead ends: 29 [2018-02-04 03:24:52,251 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:24:52,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-02-04 03:24:52,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-02-04 03:24:52,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-02-04 03:24:52,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 28 transitions. [2018-02-04 03:24:52,253 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 28 transitions. Word has length 26 [2018-02-04 03:24:52,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:52,253 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 28 transitions. [2018-02-04 03:24:52,253 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 03:24:52,254 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 28 transitions. [2018-02-04 03:24:52,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 03:24:52,254 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:52,254 INFO L351 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] [2018-02-04 03:24:52,254 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, disconnect_9Err1RequiresViolation, disconnect_9Err0RequiresViolation]=== [2018-02-04 03:24:52,255 INFO L82 PathProgramCache]: Analyzing trace with hash 221087613, now seen corresponding path program 1 times [2018-02-04 03:24:52,256 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:52,268 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:52,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:52,378 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:24:52,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 03:24:52,379 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:52,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:52,379 INFO L182 omatonBuilderFactory]: Interpolants [656#false, 657#(= |#valid| |old(#valid)|), 658#(and (= (store |#valid| |ldv_malloc_#t~malloc1.base| (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) |old(#valid)|) (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 659#(and (= (store |#valid| |ldv_malloc_#res.base| (select |old(#valid)| |ldv_malloc_#res.base|)) |old(#valid)|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|))), 660#(and (= (store |#valid| |probe_9_#t~ret2.base| (select |old(#valid)| |probe_9_#t~ret2.base|)) |old(#valid)|) (not (= 0 |probe_9_#t~ret2.base|)) (= 0 (select |old(#valid)| |probe_9_#t~ret2.base|))), 661#(and (not (= 0 ~a9.base)) (= |old(#valid)| (store |#valid| ~a9.base (select |old(#valid)| ~a9.base))) (= 0 (select |old(#valid)| ~a9.base))), 662#(or (and (= |old(#valid)| (store |#valid| ~a9.base (select |old(#valid)| ~a9.base))) (= 0 (select |#valid| ~a9.base))) (= ~a9.base 0)), 655#true] [2018-02-04 03:24:52,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:52,379 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:24:52,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:24:52,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:24:52,380 INFO L87 Difference]: Start difference. First operand 29 states and 28 transitions. Second operand 8 states. [2018-02-04 03:24:52,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:52,506 INFO L93 Difference]: Finished difference Result 28 states and 27 transitions. [2018-02-04 03:24:52,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:24:52,506 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-02-04 03:24:52,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:52,507 INFO L225 Difference]: With dead ends: 28 [2018-02-04 03:24:52,507 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 03:24:52,507 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:24:52,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 03:24:52,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 03:24:52,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 03:24:52,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 03:24:52,507 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-02-04 03:24:52,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:52,508 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 03:24:52,508 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:24:52,508 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 03:24:52,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 03:24:52,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 03:24:52 BoogieIcfgContainer [2018-02-04 03:24:52,511 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 03:24:52,512 INFO L168 Benchmark]: Toolchain (without parser) took 1697.32 ms. Allocated memory was 402.1 MB in the beginning and 624.4 MB in the end (delta: 222.3 MB). Free memory was 358.8 MB in the beginning and 592.0 MB in the end (delta: -233.2 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 03:24:52,513 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 402.1 MB. Free memory is still 364.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 03:24:52,513 INFO L168 Benchmark]: CACSL2BoogieTranslator took 168.38 ms. Allocated memory is still 402.1 MB. Free memory was 358.8 MB in the beginning and 345.6 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 03:24:52,513 INFO L168 Benchmark]: Boogie Preprocessor took 24.86 ms. Allocated memory is still 402.1 MB. Free memory was 345.6 MB in the beginning and 343.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 03:24:52,513 INFO L168 Benchmark]: RCFGBuilder took 145.99 ms. Allocated memory is still 402.1 MB. Free memory was 343.0 MB in the beginning and 328.4 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. [2018-02-04 03:24:52,513 INFO L168 Benchmark]: TraceAbstraction took 1355.66 ms. Allocated memory was 402.1 MB in the beginning and 624.4 MB in the end (delta: 222.3 MB). Free memory was 328.4 MB in the beginning and 592.0 MB in the end (delta: -263.6 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 03:24:52,514 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.11 ms. Allocated memory is still 402.1 MB. Free memory is still 364.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 168.38 ms. Allocated memory is still 402.1 MB. Free memory was 358.8 MB in the beginning and 345.6 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 24.86 ms. Allocated memory is still 402.1 MB. Free memory was 345.6 MB in the beginning and 343.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 145.99 ms. Allocated memory is still 402.1 MB. Free memory was 343.0 MB in the beginning and 328.4 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1355.66 ms. Allocated memory was 402.1 MB in the beginning and 624.4 MB in the end (delta: 222.3 MB). Free memory was 328.4 MB in the beginning and 592.0 MB in the end (delta: -263.6 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1456]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 34 locations, 3 error locations. SAFE Result, 1.3s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 241 SDtfs, 87 SDslu, 604 SDs, 0 SdLazy, 283 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=1, 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.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 33 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 188 NumberOfCodeBlocks, 188 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 15483 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test9_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_03-24-52-519.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test9_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_03-24-52-519.csv Received shutdown request...