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/cav18-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-26d9e06-m [2018-02-02 10:24:39,220 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:24:39,221 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:24:39,234 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:24:39,234 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:24:39,235 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:24:39,235 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:24:39,237 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:24:39,238 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:24:39,239 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:24:39,240 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:24:39,240 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:24:39,241 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:24:39,242 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:24:39,242 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:24:39,244 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:24:39,246 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:24:39,247 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:24:39,248 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:24:39,249 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:24:39,251 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:24:39,251 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:24:39,251 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:24:39,252 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:24:39,253 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:24:39,254 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:24:39,254 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:24:39,254 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:24:39,254 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:24:39,255 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:24:39,255 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:24:39,255 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 10:24:39,264 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:24:39,265 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:24:39,265 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:24:39,265 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:24:39,266 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:24:39,266 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:24:39,266 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:24:39,266 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:24:39,266 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:24:39,266 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:24:39,266 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:24:39,266 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:24:39,266 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:24:39,266 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:24:39,267 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:24:39,267 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:24:39,267 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:24:39,267 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:24:39,267 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:24:39,267 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:24:39,267 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:24:39,267 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:24:39,268 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:24:39,292 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:24:39,299 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:24:39,302 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:24:39,303 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:24:39,303 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:24:39,303 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-02 10:24:39,430 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:24:39,431 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:24:39,431 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:24:39,431 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:24:39,435 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:24:39,436 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:24:39" (1/1) ... [2018-02-02 10:24:39,440 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30ce2b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:24:39, skipping insertion in model container [2018-02-02 10:24:39,440 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:24:39" (1/1) ... [2018-02-02 10:24:39,449 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:24:39,484 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:24:39,563 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:24:39,573 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:24:39,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:24:39 WrapperNode [2018-02-02 10:24:39,578 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:24:39,579 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:24:39,579 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:24:39,579 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:24:39,593 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:24:39" (1/1) ... [2018-02-02 10:24:39,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:24:39" (1/1) ... [2018-02-02 10:24:39,602 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:24:39" (1/1) ... [2018-02-02 10:24:39,603 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:24:39" (1/1) ... [2018-02-02 10:24:39,605 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:24:39" (1/1) ... [2018-02-02 10:24:39,607 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:24:39" (1/1) ... [2018-02-02 10:24:39,608 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:24:39" (1/1) ... [2018-02-02 10:24:39,609 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:24:39,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:24:39,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:24:39,610 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:24:39,611 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:24:39" (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-02 10:24:39,650 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:24:39,650 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:24:39,650 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 10:24:39,651 INFO L136 BoogieDeclarations]: Found implementation of procedure probe_9 [2018-02-02 10:24:39,651 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_9 [2018-02-02 10:24:39,651 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 10:24:39,651 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:24:39,651 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:24:39,651 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:24:39,651 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:24:39,651 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:24:39,652 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:24:39,652 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:24:39,652 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 10:24:39,652 INFO L128 BoogieDeclarations]: Found specification of procedure probe_9 [2018-02-02 10:24:39,652 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_9 [2018-02-02 10:24:39,652 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 10:24:39,652 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:24:39,652 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:24:39,652 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:24:39,774 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:24:39,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:24:39 BoogieIcfgContainer [2018-02-02 10:24:39,774 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:24:39,775 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:24:39,775 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:24:39,777 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:24:39,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:24:39" (1/3) ... [2018-02-02 10:24:39,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb595e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:24:39, skipping insertion in model container [2018-02-02 10:24:39,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:24:39" (2/3) ... [2018-02-02 10:24:39,778 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb595e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:24:39, skipping insertion in model container [2018-02-02 10:24:39,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:24:39" (3/3) ... [2018-02-02 10:24:39,779 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test9_true-valid-memsafety_true-termination.i [2018-02-02 10:24:39,784 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:24:39,789 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-02-02 10:24:39,816 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:24:39,817 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:24:39,817 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:24:39,817 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:24:39,817 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:24:39,817 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:24:39,817 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:24:39,817 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:24:39,817 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:24:39,825 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-02-02 10:24:39,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 10:24:39,831 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:24:39,831 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-02 10:24:39,831 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, disconnect_9Err1RequiresViolation, disconnect_9Err0RequiresViolation]=== [2018-02-02 10:24:39,836 INFO L82 PathProgramCache]: Analyzing trace with hash 637985235, now seen corresponding path program 1 times [2018-02-02 10:24:39,873 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:24:39,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:24:39,914 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:24:40,021 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-02 10:24:40,023 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:24:40,023 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:24:40,024 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:24:40,025 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-02 10:24:40,025 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-02 10:24:40,025 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-02 10:24:40,026 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:24:40,039 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:24:40,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:24:40,041 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 5 states. [2018-02-02 10:24:40,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:40,212 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2018-02-02 10:24:40,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:24:40,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-02 10:24:40,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:40,220 INFO L225 Difference]: With dead ends: 47 [2018-02-02 10:24:40,220 INFO L226 Difference]: Without dead ends: 44 [2018-02-02 10:24:40,222 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-02 10:24:40,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-02 10:24:40,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-02-02 10:24:40,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-02 10:24:40,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-02-02 10:24:40,244 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 20 [2018-02-02 10:24:40,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:40,245 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-02-02 10:24:40,245 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:24:40,245 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-02-02 10:24:40,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:24:40,245 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:24:40,245 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-02 10:24:40,245 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, disconnect_9Err1RequiresViolation, disconnect_9Err0RequiresViolation]=== [2018-02-02 10:24:40,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1778317329, now seen corresponding path program 1 times [2018-02-02 10:24:40,247 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:24:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:24:40,265 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:24:40,315 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-02 10:24:40,315 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:24:40,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:24:40,315 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:24:40,316 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-02 10:24:40,316 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-02 10:24:40,316 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-02 10:24:40,317 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:24:40,317 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:24:40,317 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:24:40,318 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 6 states. [2018-02-02 10:24:40,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:40,361 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-02-02 10:24:40,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:24:40,361 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-02 10:24:40,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:40,364 INFO L225 Difference]: With dead ends: 42 [2018-02-02 10:24:40,364 INFO L226 Difference]: Without dead ends: 42 [2018-02-02 10:24:40,365 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-02 10:24:40,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-02 10:24:40,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-02-02 10:24:40,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-02 10:24:40,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-02-02 10:24:40,368 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 22 [2018-02-02 10:24:40,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:40,368 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-02-02 10:24:40,369 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:24:40,369 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-02-02 10:24:40,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:24:40,369 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:24:40,369 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-02 10:24:40,369 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, disconnect_9Err1RequiresViolation, disconnect_9Err0RequiresViolation]=== [2018-02-02 10:24:40,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1778317330, now seen corresponding path program 1 times [2018-02-02 10:24:40,370 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:24:40,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:24:40,380 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:24:40,410 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-02 10:24:40,410 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:24:40,411 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:24:40,411 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:24:40,411 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-02 10:24:40,411 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-02 10:24:40,411 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-02 10:24:40,412 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:24:40,412 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:24:40,412 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:24:40,412 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 6 states. [2018-02-02 10:24:40,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:40,482 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-02-02 10:24:40,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:24:40,482 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-02 10:24:40,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:40,483 INFO L225 Difference]: With dead ends: 48 [2018-02-02 10:24:40,483 INFO L226 Difference]: Without dead ends: 48 [2018-02-02 10:24:40,483 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-02 10:24:40,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-02 10:24:40,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 33. [2018-02-02 10:24:40,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-02-02 10:24:40,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-02-02 10:24:40,490 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 22 [2018-02-02 10:24:40,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:40,490 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-02-02 10:24:40,490 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:24:40,491 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-02-02 10:24:40,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:24:40,491 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:24:40,491 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-02 10:24:40,491 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, disconnect_9Err1RequiresViolation, disconnect_9Err0RequiresViolation]=== [2018-02-02 10:24:40,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1413293605, now seen corresponding path program 1 times [2018-02-02 10:24:40,493 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:24:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:24:40,504 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:24:40,531 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-02 10:24:40,531 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:24:40,532 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:24:40,532 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:24:40,532 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-02 10:24:40,532 INFO L182 omatonBuilderFactory]: Interpolants [323#true, 324#false, 325#(= |#valid| |old(#valid)|)] [2018-02-02 10:24:40,532 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-02 10:24:40,533 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:24:40,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:24:40,533 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:24:40,533 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 3 states. [2018-02-02 10:24:40,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:40,573 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-02-02 10:24:40,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:24:40,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-02-02 10:24:40,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:40,575 INFO L225 Difference]: With dead ends: 42 [2018-02-02 10:24:40,575 INFO L226 Difference]: Without dead ends: 38 [2018-02-02 10:24:40,575 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-02 10:24:40,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-02 10:24:40,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-02-02 10:24:40,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-02 10:24:40,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-02-02 10:24:40,580 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 22 [2018-02-02 10:24:40,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:40,580 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-02-02 10:24:40,580 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:24:40,581 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-02-02 10:24:40,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 10:24:40,581 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:24:40,581 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-02 10:24:40,581 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, disconnect_9Err1RequiresViolation, disconnect_9Err0RequiresViolation]=== [2018-02-02 10:24:40,582 INFO L82 PathProgramCache]: Analyzing trace with hash -431737374, now seen corresponding path program 1 times [2018-02-02 10:24:40,583 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:24:40,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:24:40,593 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:24:40,626 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-02 10:24:40,626 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:24:40,626 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:24:40,627 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:24:40,627 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-02 10:24:40,627 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-02 10:24:40,627 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-02 10:24:40,627 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:24:40,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:24:40,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:24:40,628 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 5 states. [2018-02-02 10:24:40,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:40,638 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-02-02 10:24:40,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:24:40,639 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-02-02 10:24:40,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:40,639 INFO L225 Difference]: With dead ends: 44 [2018-02-02 10:24:40,640 INFO L226 Difference]: Without dead ends: 44 [2018-02-02 10:24:40,640 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-02 10:24:40,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-02 10:24:40,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2018-02-02 10:24:40,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-02 10:24:40,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-02-02 10:24:40,645 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 24 [2018-02-02 10:24:40,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:40,646 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-02-02 10:24:40,646 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:24:40,646 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-02-02 10:24:40,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 10:24:40,647 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:24:40,647 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-02 10:24:40,647 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, disconnect_9Err1RequiresViolation, disconnect_9Err0RequiresViolation]=== [2018-02-02 10:24:40,647 INFO L82 PathProgramCache]: Analyzing trace with hash 2055775459, now seen corresponding path program 1 times [2018-02-02 10:24:40,648 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:24:40,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:24:40,657 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:24:40,697 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-02 10:24:40,697 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:24:40,697 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:24:40,697 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:24:40,698 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-02 10:24:40,698 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-02 10:24:40,698 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-02 10:24:40,698 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:24:40,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:24:40,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:24:40,699 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 6 states. [2018-02-02 10:24:40,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:40,726 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-02-02 10:24:40,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:24:40,727 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-02 10:24:40,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:40,727 INFO L225 Difference]: With dead ends: 42 [2018-02-02 10:24:40,728 INFO L226 Difference]: Without dead ends: 42 [2018-02-02 10:24:40,728 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-02 10:24:40,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-02 10:24:40,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2018-02-02 10:24:40,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-02-02 10:24:40,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-02-02 10:24:40,731 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 24 [2018-02-02 10:24:40,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:40,731 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-02-02 10:24:40,732 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:24:40,732 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-02-02 10:24:40,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 10:24:40,732 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:24:40,732 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-02 10:24:40,732 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, disconnect_9Err1RequiresViolation, disconnect_9Err0RequiresViolation]=== [2018-02-02 10:24:40,733 INFO L82 PathProgramCache]: Analyzing trace with hash -119628224, now seen corresponding path program 1 times [2018-02-02 10:24:40,734 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:24:40,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:24:40,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:24:40,839 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-02 10:24:40,840 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:24:40,840 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:24:40,840 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:24:40,840 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-02 10:24:40,840 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-02 10:24:40,841 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-02 10:24:40,841 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:24:40,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:24:40,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:24:40,841 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 7 states. [2018-02-02 10:24:40,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:40,908 INFO L93 Difference]: Finished difference Result 45 states and 44 transitions. [2018-02-02 10:24:40,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:24:40,908 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-02-02 10:24:40,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:40,909 INFO L225 Difference]: With dead ends: 45 [2018-02-02 10:24:40,909 INFO L226 Difference]: Without dead ends: 29 [2018-02-02 10:24:40,909 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-02 10:24:40,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-02-02 10:24:40,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-02-02 10:24:40,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-02-02 10:24:40,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 28 transitions. [2018-02-02 10:24:40,911 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 28 transitions. Word has length 26 [2018-02-02 10:24:40,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:40,911 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 28 transitions. [2018-02-02 10:24:40,911 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:24:40,911 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 28 transitions. [2018-02-02 10:24:40,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 10:24:40,912 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:24:40,912 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-02 10:24:40,912 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, disconnect_9Err1RequiresViolation, disconnect_9Err0RequiresViolation]=== [2018-02-02 10:24:40,912 INFO L82 PathProgramCache]: Analyzing trace with hash 221087613, now seen corresponding path program 1 times [2018-02-02 10:24:40,914 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:24:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:24:40,929 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:24:41,093 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-02 10:24:41,093 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:24:41,094 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:24:41,094 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:24:41,094 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-02 10:24:41,094 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-02 10:24:41,095 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-02 10:24:41,095 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:24:41,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:24:41,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:24:41,095 INFO L87 Difference]: Start difference. First operand 29 states and 28 transitions. Second operand 8 states. [2018-02-02 10:24:41,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:41,243 INFO L93 Difference]: Finished difference Result 28 states and 27 transitions. [2018-02-02 10:24:41,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:24:41,244 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-02-02 10:24:41,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:41,244 INFO L225 Difference]: With dead ends: 28 [2018-02-02 10:24:41,244 INFO L226 Difference]: Without dead ends: 0 [2018-02-02 10:24:41,245 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-02 10:24:41,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-02 10:24:41,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-02 10:24:41,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-02 10:24:41,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-02 10:24:41,246 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-02-02 10:24:41,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:41,246 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-02 10:24:41,246 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:24:41,246 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-02 10:24:41,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-02 10:24:41,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:24:41 BoogieIcfgContainer [2018-02-02 10:24:41,250 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:24:41,251 INFO L168 Benchmark]: Toolchain (without parser) took 1820.74 ms. Allocated memory was 406.8 MB in the beginning and 634.9 MB in the end (delta: 228.1 MB). Free memory was 363.5 MB in the beginning and 603.8 MB in the end (delta: -240.3 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:24:41,252 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 406.8 MB. Free memory is still 370.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:24:41,252 INFO L168 Benchmark]: CACSL2BoogieTranslator took 147.11 ms. Allocated memory is still 406.8 MB. Free memory was 363.5 MB in the beginning and 350.3 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:24:41,252 INFO L168 Benchmark]: Boogie Preprocessor took 30.65 ms. Allocated memory is still 406.8 MB. Free memory was 350.3 MB in the beginning and 349.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:24:41,252 INFO L168 Benchmark]: RCFGBuilder took 164.57 ms. Allocated memory is still 406.8 MB. Free memory was 349.0 MB in the beginning and 333.1 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 5.3 GB. [2018-02-02 10:24:41,253 INFO L168 Benchmark]: TraceAbstraction took 1475.89 ms. Allocated memory was 406.8 MB in the beginning and 634.9 MB in the end (delta: 228.1 MB). Free memory was 333.1 MB in the beginning and 603.8 MB in the end (delta: -270.7 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:24:41,253 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.09 ms. Allocated memory is still 406.8 MB. Free memory is still 370.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 147.11 ms. Allocated memory is still 406.8 MB. Free memory was 363.5 MB in the beginning and 350.3 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.65 ms. Allocated memory is still 406.8 MB. Free memory was 350.3 MB in the beginning and 349.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 164.57 ms. Allocated memory is still 406.8 MB. Free memory was 349.0 MB in the beginning and 333.1 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1475.89 ms. Allocated memory was 406.8 MB in the beginning and 634.9 MB in the end (delta: 228.1 MB). Free memory was 333.1 MB in the beginning and 603.8 MB in the end (delta: -270.7 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.4s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 0.6s 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.4s 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.5s 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-02_10-24-41-260.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-02_10-24-41-260.csv Received shutdown request...