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/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_3_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 06:12:09,412 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 06:12:09,414 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 06:12:09,432 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 06:12:09,432 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 06:12:09,433 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 06:12:09,434 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 06:12:09,436 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 06:12:09,438 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 06:12:09,439 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 06:12:09,440 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 06:12:09,440 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 06:12:09,441 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 06:12:09,443 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 06:12:09,444 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 06:12:09,446 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 06:12:09,448 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 06:12:09,450 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 06:12:09,451 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 06:12:09,452 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 06:12:09,454 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 06:12:09,455 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 06:12:09,455 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 06:12:09,456 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 06:12:09,457 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 06:12:09,458 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 06:12:09,458 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 06:12:09,459 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 06:12:09,459 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 06:12:09,459 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 06:12:09,460 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 06:12:09,460 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf [2018-01-21 06:12:09,470 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 06:12:09,471 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 06:12:09,471 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 06:12:09,472 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 06:12:09,472 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 06:12:09,472 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-21 06:12:09,472 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 06:12:09,472 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 06:12:09,473 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 06:12:09,473 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 06:12:09,473 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 06:12:09,473 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 06:12:09,474 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 06:12:09,474 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 06:12:09,474 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 06:12:09,474 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 06:12:09,474 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 06:12:09,474 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 06:12:09,475 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 06:12:09,475 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 06:12:09,475 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 06:12:09,475 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 06:12:09,475 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 06:12:09,476 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 06:12:09,476 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 06:12:09,476 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 06:12:09,476 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 06:12:09,477 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 06:12:09,477 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 06:12:09,477 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 06:12:09,477 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 06:12:09,477 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 06:12:09,477 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 06:12:09,478 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 06:12:09,478 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 06:12:09,478 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 06:12:09,478 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 06:12:09,479 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 06:12:09,479 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 06:12:09,514 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 06:12:09,527 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 06:12:09,531 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 06:12:09,532 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 06:12:09,533 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 06:12:09,534 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_3_false-valid-memtrack.i [2018-01-21 06:12:09,740 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 06:12:09,745 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 06:12:09,745 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 06:12:09,746 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 06:12:09,750 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 06:12:09,751 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 06:12:09" (1/1) ... [2018-01-21 06:12:09,754 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a2844af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 06:12:09, skipping insertion in model container [2018-01-21 06:12:09,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 06:12:09" (1/1) ... [2018-01-21 06:12:09,767 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 06:12:09,814 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 06:12:09,928 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 06:12:09,948 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 06:12:09,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 06:12:09 WrapperNode [2018-01-21 06:12:09,957 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 06:12:09,958 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 06:12:09,958 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 06:12:09,958 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 06:12:09,973 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 06:12:09" (1/1) ... [2018-01-21 06:12:09,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 06:12:09" (1/1) ... [2018-01-21 06:12:09,982 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 06:12:09" (1/1) ... [2018-01-21 06:12:09,982 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 06:12:09" (1/1) ... [2018-01-21 06:12:09,987 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 06:12:09" (1/1) ... [2018-01-21 06:12:09,992 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 06:12:09" (1/1) ... [2018-01-21 06:12:09,993 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 06:12:09" (1/1) ... [2018-01-21 06:12:09,995 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 06:12:09,996 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 06:12:09,996 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 06:12:09,996 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 06:12:09,997 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 06:12:09" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 06:12:10,049 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 06:12:10,049 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 06:12:10,050 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-21 06:12:10,050 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-01-21 06:12:10,050 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-21 06:12:10,050 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 06:12:10,050 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 06:12:10,050 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 06:12:10,050 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 06:12:10,051 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 06:12:10,051 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 06:12:10,051 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 06:12:10,051 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 06:12:10,051 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 06:12:10,051 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-21 06:12:10,051 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-01-21 06:12:10,052 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-21 06:12:10,052 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 06:12:10,052 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 06:12:10,052 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 06:12:10,242 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 06:12:10,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 06:12:10 BoogieIcfgContainer [2018-01-21 06:12:10,242 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 06:12:10,243 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 06:12:10,243 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 06:12:10,245 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 06:12:10,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 06:12:09" (1/3) ... [2018-01-21 06:12:10,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@496a2b3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 06:12:10, skipping insertion in model container [2018-01-21 06:12:10,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 06:12:09" (2/3) ... [2018-01-21 06:12:10,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@496a2b3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 06:12:10, skipping insertion in model container [2018-01-21 06:12:10,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 06:12:10" (3/3) ... [2018-01-21 06:12:10,247 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test17_3_false-valid-memtrack.i [2018-01-21 06:12:10,254 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 06:12:10,259 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-21 06:12:10,307 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 06:12:10,307 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 06:12:10,307 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 06:12:10,307 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 06:12:10,307 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 06:12:10,307 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 06:12:10,307 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 06:12:10,308 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_mallocErr0EnsuresViolation======== [2018-01-21 06:12:10,308 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 06:12:10,322 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-01-21 06:12:10,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-21 06:12:10,326 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:12:10,327 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 06:12:10,327 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-21 06:12:10,331 INFO L82 PathProgramCache]: Analyzing trace with hash 2086039493, now seen corresponding path program 1 times [2018-01-21 06:12:10,332 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:12:10,389 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:12:10,389 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:12:10,390 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:12:10,390 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:12:10,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 06:12:10,438 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 06:12:10,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 06:12:10,486 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 06:12:10,487 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 06:12:10,487 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 06:12:10,489 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 06:12:10,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 06:12:10,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 06:12:10,501 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 3 states. [2018-01-21 06:12:10,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 06:12:10,759 INFO L93 Difference]: Finished difference Result 102 states and 123 transitions. [2018-01-21 06:12:10,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 06:12:10,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-01-21 06:12:10,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 06:12:10,768 INFO L225 Difference]: With dead ends: 102 [2018-01-21 06:12:10,768 INFO L226 Difference]: Without dead ends: 31 [2018-01-21 06:12:10,773 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-21 06:12:10,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-01-21 06:12:10,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-01-21 06:12:10,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-21 06:12:10,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-01-21 06:12:10,810 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 11 [2018-01-21 06:12:10,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 06:12:10,811 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-01-21 06:12:10,811 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 06:12:10,811 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-01-21 06:12:10,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-21 06:12:10,813 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:12:10,813 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 06:12:10,813 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-21 06:12:10,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1065867417, now seen corresponding path program 1 times [2018-01-21 06:12:10,814 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:12:10,815 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:12:10,816 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:12:10,816 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:12:10,816 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:12:10,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 06:12:10,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 06:12:10,883 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 06:12:10,891 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 06:12:10,892 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 06:12:10,902 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 06:12:10,902 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 06:12:10,903 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 06:12:10,903 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 06:12:10,903 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 06:12:10,903 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 06:12:10,903 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 06:12:10,903 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 06:12:10,903 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 06:12:10,905 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-01-21 06:12:10,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 06:12:10,906 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:12:10,906 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 06:12:10,906 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 06:12:10,906 INFO L82 PathProgramCache]: Analyzing trace with hash 124355, now seen corresponding path program 1 times [2018-01-21 06:12:10,906 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:12:10,908 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:12:10,908 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:12:10,909 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:12:10,909 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:12:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 06:12:10,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 06:12:10,919 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 06:12:10,920 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 06:12:10,922 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 06:12:10,922 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 06:12:10,922 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 06:12:10,922 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 06:12:10,923 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 06:12:10,923 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 06:12:10,923 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 06:12:10,923 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == alloc_17Err0EnsuresViolation======== [2018-01-21 06:12:10,923 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 06:12:10,925 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-01-21 06:12:10,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-21 06:12:10,927 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:12:10,927 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 06:12:10,927 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err0EnsuresViolation]=== [2018-01-21 06:12:10,927 INFO L82 PathProgramCache]: Analyzing trace with hash -936073627, now seen corresponding path program 1 times [2018-01-21 06:12:10,927 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:12:10,929 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:12:10,929 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:12:10,929 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:12:10,929 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:12:10,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 06:12:10,944 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 06:12:10,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 06:12:10,964 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 06:12:10,964 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 06:12:10,965 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 06:12:10,965 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 06:12:10,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 06:12:10,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 06:12:10,966 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 2 states. [2018-01-21 06:12:10,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 06:12:10,973 INFO L93 Difference]: Finished difference Result 95 states and 110 transitions. [2018-01-21 06:12:10,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 06:12:10,973 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-01-21 06:12:10,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 06:12:10,975 INFO L225 Difference]: With dead ends: 95 [2018-01-21 06:12:10,975 INFO L226 Difference]: Without dead ends: 41 [2018-01-21 06:12:10,976 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 06:12:10,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-21 06:12:10,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-21 06:12:10,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-21 06:12:10,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-01-21 06:12:10,982 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 20 [2018-01-21 06:12:10,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 06:12:10,985 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-01-21 06:12:10,985 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 06:12:10,985 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-01-21 06:12:10,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-21 06:12:10,986 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:12:10,986 INFO L322 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-01-21 06:12:10,986 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err0EnsuresViolation]=== [2018-01-21 06:12:10,987 INFO L82 PathProgramCache]: Analyzing trace with hash -2126588567, now seen corresponding path program 1 times [2018-01-21 06:12:10,987 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:12:10,988 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:12:10,988 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:12:10,988 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:12:10,988 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:12:11,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 06:12:11,005 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 06:12:11,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 06:12:11,088 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 06:12:11,088 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 06:12:11,088 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 06:12:11,088 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 06:12:11,089 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 06:12:11,089 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 06:12:11,089 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 5 states. [2018-01-21 06:12:11,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 06:12:11,104 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2018-01-21 06:12:11,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 06:12:11,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-21 06:12:11,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 06:12:11,107 INFO L225 Difference]: With dead ends: 76 [2018-01-21 06:12:11,108 INFO L226 Difference]: Without dead ends: 43 [2018-01-21 06:12:11,108 INFO L525 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-01-21 06:12:11,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-21 06:12:11,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-01-21 06:12:11,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-21 06:12:11,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-21 06:12:11,113 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 22 [2018-01-21 06:12:11,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 06:12:11,113 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-21 06:12:11,113 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 06:12:11,113 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-21 06:12:11,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-21 06:12:11,114 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:12:11,114 INFO L322 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-01-21 06:12:11,114 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err0EnsuresViolation]=== [2018-01-21 06:12:11,114 INFO L82 PathProgramCache]: Analyzing trace with hash -367041401, now seen corresponding path program 1 times [2018-01-21 06:12:11,115 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:12:11,116 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:12:11,116 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:12:11,116 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:12:11,116 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:12:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 06:12:11,132 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 06:12:11,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 06:12:11,167 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 06:12:11,167 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 06:12:11,167 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 06:12:11,167 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 06:12:11,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 06:12:11,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 06:12:11,168 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-01-21 06:12:11,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 06:12:11,198 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-01-21 06:12:11,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 06:12:11,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-01-21 06:12:11,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 06:12:11,199 INFO L225 Difference]: With dead ends: 50 [2018-01-21 06:12:11,199 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 06:12:11,200 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 06:12:11,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 06:12:11,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 06:12:11,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 06:12:11,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 06:12:11,201 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2018-01-21 06:12:11,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 06:12:11,201 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 06:12:11,201 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 06:12:11,201 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 06:12:11,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 06:12:11,204 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 06:12:11,204 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 06:12:11,205 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 06:12:11,205 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 06:12:11,205 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 06:12:11,205 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 06:12:11,205 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 06:12:11,205 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 06:12:11,205 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 06:12:11,207 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-01-21 06:12:11,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-21 06:12:11,208 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:12:11,208 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 06:12:11,208 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 06:12:11,208 INFO L82 PathProgramCache]: Analyzing trace with hash 965137727, now seen corresponding path program 1 times [2018-01-21 06:12:11,208 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:12:11,210 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:12:11,210 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:12:11,210 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:12:11,210 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:12:11,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 06:12:11,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 06:12:11,234 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 06:12:11,236 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 06:12:11,236 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 06:12:11,237 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 06:12:11,237 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 06:12:11,237 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 06:12:11,241 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 06:12:11,241 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 06:12:11,241 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 06:12:11,241 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 06:12:11,241 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 06:12:11,241 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 06:12:11,241 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 06:12:11,242 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 06:12:11,242 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 06:12:11,243 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-01-21 06:12:11,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-21 06:12:11,244 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:12:11,244 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 06:12:11,244 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 06:12:11,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1802119621, now seen corresponding path program 1 times [2018-01-21 06:12:11,245 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:12:11,246 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:12:11,246 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:12:11,246 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:12:11,246 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:12:11,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 06:12:11,254 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 06:12:11,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 06:12:11,286 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 06:12:11,286 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 06:12:11,286 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 06:12:11,286 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 06:12:11,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 06:12:11,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 06:12:11,287 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 3 states. [2018-01-21 06:12:11,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 06:12:11,370 INFO L93 Difference]: Finished difference Result 102 states and 123 transitions. [2018-01-21 06:12:11,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 06:12:11,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-21 06:12:11,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 06:12:11,371 INFO L225 Difference]: With dead ends: 102 [2018-01-21 06:12:11,371 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 06:12:11,372 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-01-21 06:12:11,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 06:12:11,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 06:12:11,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 06:12:11,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 06:12:11,373 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-01-21 06:12:11,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 06:12:11,373 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 06:12:11,373 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 06:12:11,373 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 06:12:11,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 06:12:11,375 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 06:12:11,375 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 06:12:11,375 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 06:12:11,375 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 06:12:11,375 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 06:12:11,376 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 06:12:11,376 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 06:12:11,376 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == entry_pointErr0EnsuresViolation======== [2018-01-21 06:12:11,376 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 06:12:11,377 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-01-21 06:12:11,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-21 06:12:11,378 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:12:11,378 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 06:12:11,378 INFO L371 AbstractCegarLoop]: === Iteration 1 === [entry_pointErr0EnsuresViolation]=== [2018-01-21 06:12:11,379 INFO L82 PathProgramCache]: Analyzing trace with hash -2004826429, now seen corresponding path program 1 times [2018-01-21 06:12:11,379 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:12:11,380 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:12:11,380 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:12:11,380 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:12:11,380 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:12:11,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 06:12:11,389 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 06:12:11,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 06:12:11,421 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 06:12:11,421 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 06:12:11,421 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 06:12:11,422 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 06:12:11,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 06:12:11,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 06:12:11,422 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 3 states. [2018-01-21 06:12:11,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 06:12:11,485 INFO L93 Difference]: Finished difference Result 102 states and 123 transitions. [2018-01-21 06:12:11,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 06:12:11,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-01-21 06:12:11,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 06:12:11,486 INFO L225 Difference]: With dead ends: 102 [2018-01-21 06:12:11,487 INFO L226 Difference]: Without dead ends: 52 [2018-01-21 06:12:11,487 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-01-21 06:12:11,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-21 06:12:11,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2018-01-21 06:12:11,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-21 06:12:11,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-01-21 06:12:11,495 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 15 [2018-01-21 06:12:11,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 06:12:11,495 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-01-21 06:12:11,495 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 06:12:11,495 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-01-21 06:12:11,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-21 06:12:11,496 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:12:11,497 INFO L322 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-01-21 06:12:11,497 INFO L371 AbstractCegarLoop]: === Iteration 2 === [entry_pointErr0EnsuresViolation]=== [2018-01-21 06:12:11,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1907813883, now seen corresponding path program 1 times [2018-01-21 06:12:11,497 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:12:11,498 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:12:11,499 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:12:11,499 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:12:11,499 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:12:11,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 06:12:11,508 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 06:12:11,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 06:12:11,557 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 06:12:11,558 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 06:12:11,558 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 06:12:11,558 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 06:12:11,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 06:12:11,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 06:12:11,559 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 5 states. [2018-01-21 06:12:11,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 06:12:11,571 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2018-01-21 06:12:11,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 06:12:11,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-01-21 06:12:11,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 06:12:11,572 INFO L225 Difference]: With dead ends: 84 [2018-01-21 06:12:11,572 INFO L226 Difference]: Without dead ends: 47 [2018-01-21 06:12:11,573 INFO L525 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-01-21 06:12:11,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-21 06:12:11,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-01-21 06:12:11,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-21 06:12:11,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-01-21 06:12:11,577 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 26 [2018-01-21 06:12:11,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 06:12:11,578 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-01-21 06:12:11,578 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 06:12:11,578 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-01-21 06:12:11,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-21 06:12:11,579 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:12:11,579 INFO L322 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-01-21 06:12:11,579 INFO L371 AbstractCegarLoop]: === Iteration 3 === [entry_pointErr0EnsuresViolation]=== [2018-01-21 06:12:11,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1264500249, now seen corresponding path program 1 times [2018-01-21 06:12:11,579 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:12:11,580 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:12:11,580 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:12:11,580 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:12:11,580 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:12:11,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 06:12:11,589 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 06:12:11,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 06:12:11,619 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 06:12:11,619 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 06:12:11,619 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 06:12:11,620 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 06:12:11,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 06:12:11,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 06:12:11,620 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 4 states. [2018-01-21 06:12:11,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 06:12:11,642 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-01-21 06:12:11,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 06:12:11,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-01-21 06:12:11,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 06:12:11,643 INFO L225 Difference]: With dead ends: 54 [2018-01-21 06:12:11,643 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 06:12:11,644 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 06:12:11,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 06:12:11,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 06:12:11,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 06:12:11,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 06:12:11,645 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-01-21 06:12:11,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 06:12:11,645 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 06:12:11,645 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 06:12:11,645 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 06:12:11,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 06:12:11,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 06:12:11 BoogieIcfgContainer [2018-01-21 06:12:11,648 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 06:12:11,649 INFO L168 Benchmark]: Toolchain (without parser) took 1908.44 ms. Allocated memory was 304.1 MB in the beginning and 464.0 MB in the end (delta: 159.9 MB). Free memory was 261.2 MB in the beginning and 337.2 MB in the end (delta: -75.9 MB). Peak memory consumption was 84.0 MB. Max. memory is 5.3 GB. [2018-01-21 06:12:11,650 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 304.1 MB. Free memory is still 267.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 06:12:11,651 INFO L168 Benchmark]: CACSL2BoogieTranslator took 211.98 ms. Allocated memory is still 304.1 MB. Free memory was 261.2 MB in the beginning and 247.2 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-21 06:12:11,651 INFO L168 Benchmark]: Boogie Preprocessor took 37.74 ms. Allocated memory is still 304.1 MB. Free memory was 247.2 MB in the beginning and 245.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 06:12:11,651 INFO L168 Benchmark]: RCFGBuilder took 246.44 ms. Allocated memory is still 304.1 MB. Free memory was 245.2 MB in the beginning and 226.3 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. [2018-01-21 06:12:11,652 INFO L168 Benchmark]: TraceAbstraction took 1405.23 ms. Allocated memory was 304.1 MB in the beginning and 464.0 MB in the end (delta: 159.9 MB). Free memory was 226.3 MB in the beginning and 337.2 MB in the end (delta: -110.9 MB). Peak memory consumption was 49.0 MB. Max. memory is 5.3 GB. [2018-01-21 06:12:11,653 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.17 ms. Allocated memory is still 304.1 MB. Free memory is still 267.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 211.98 ms. Allocated memory is still 304.1 MB. Free memory was 261.2 MB in the beginning and 247.2 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.74 ms. Allocated memory is still 304.1 MB. Free memory was 247.2 MB in the beginning and 245.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 246.44 ms. Allocated memory is still 304.1 MB. Free memory was 245.2 MB in the beginning and 226.3 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1405.23 ms. Allocated memory was 304.1 MB in the beginning and 464.0 MB in the end (delta: 159.9 MB). Free memory was 226.3 MB in the beginning and 337.2 MB in the end (delta: -110.9 MB). Peak memory consumption was 49.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1072]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1472] CALL entry_point() [L1458] int i; [L1459] int len = 10; VAL [len=10] [L1460] CALL ldv_malloc(sizeof(struct A17*)*len) VAL [\old(size)=40] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=40, malloc(size)={42:0}, size=40] [L1074] return malloc(size); VAL [\old(size)=40, \result={42:0}, malloc(size)={42:0}, size=40] - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_mallocErr0EnsuresViolation CFG has 6 procedures, 55 locations, 6 error locations. UNSAFE Result, 0.6s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 48 SDtfs, 31 SDslu, 9 SDs, 0 SdLazy, 23 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=0, 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 160 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 6 procedures, 55 locations, 6 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=0, 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, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1439]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: alloc_17Err0EnsuresViolation CFG has 6 procedures, 55 locations, 6 error locations. SAFE Result, 0.2s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 117 SDtfs, 3 SDslu, 136 SDs, 0 SdLazy, 21 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=0, 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 66 NumberOfCodeBlocks, 66 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 63 ConstructedInterpolants, 0 QuantifiedInterpolants, 2111 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1472] CALL entry_point() [L1458] int i; [L1459] int len = 10; VAL [len=10] [L1460] CALL, EXPR ldv_malloc(sizeof(struct A17*)*len) VAL [\old(size)=40] [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; VAL [\old(size)=40, \result={0:0}, size=40] [L1460] EXPR ldv_malloc(sizeof(struct A17*)*len) VAL [ldv_malloc(sizeof(struct A17*)*len)={0:0}, len=10] [L1460] struct A17 **array = (struct A17 **)ldv_malloc(sizeof(struct A17*)*len); [L1461] COND FALSE, RET !(\read(**array)) VAL [array={0:0}, len=10] [L1472] entry_point() - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 6 procedures, 55 locations, 6 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=0, 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, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 19 NumberOfCodeBlocks, 19 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1471]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 6 procedures, 55 locations, 6 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 48 SDtfs, 26 SDslu, 9 SDs, 0 SdLazy, 23 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=0, 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 17 NumberOfCodeBlocks, 17 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 16 ConstructedInterpolants, 0 QuantifiedInterpolants, 640 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1457]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: entry_pointErr0EnsuresViolation CFG has 6 procedures, 55 locations, 6 error locations. SAFE Result, 0.2s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 108 SDtfs, 30 SDslu, 156 SDs, 0 SdLazy, 45 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=0, 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 69 NumberOfCodeBlocks, 69 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 66 ConstructedInterpolants, 0 QuantifiedInterpolants, 2726 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_3_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_06-12-11-666.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_3_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_06-12-11-666.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_3_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_06-12-11-666.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_3_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_06-12-11-666.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_3_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_06-12-11-666.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_3_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-21_06-12-11-666.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_3_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-21_06-12-11-666.csv Received shutdown request...