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_mostprecise.epf -i ../../../trunk/examples/svcomp/list-properties/simple_built_from_end_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 03:37:15,965 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 03:37:15,968 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 03:37:15,981 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 03:37:15,981 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 03:37:15,982 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 03:37:15,983 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 03:37:15,985 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 03:37:15,987 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 03:37:15,988 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 03:37:15,989 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 03:37:15,989 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 03:37:15,990 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 03:37:15,991 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 03:37:15,992 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 03:37:15,994 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 03:37:15,996 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 03:37:15,999 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 03:37:16,000 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 03:37:16,001 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 03:37:16,003 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 03:37:16,004 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 03:37:16,004 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 03:37:16,005 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 03:37:16,006 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 03:37:16,007 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 03:37:16,008 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 03:37:16,008 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 03:37:16,009 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 03:37:16,009 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 03:37:16,009 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 03:37:16,010 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_mostprecise.epf [2018-01-21 03:37:16,021 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 03:37:16,021 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 03:37:16,022 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 03:37:16,022 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 03:37:16,022 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 03:37:16,022 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-21 03:37:16,022 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 03:37:16,023 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-21 03:37:16,023 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 03:37:16,023 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 03:37:16,024 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 03:37:16,024 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 03:37:16,024 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 03:37:16,024 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 03:37:16,024 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 03:37:16,025 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 03:37:16,025 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 03:37:16,025 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 03:37:16,025 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 03:37:16,025 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 03:37:16,025 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 03:37:16,026 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 03:37:16,026 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 03:37:16,026 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 03:37:16,026 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 03:37:16,026 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 03:37:16,027 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 03:37:16,027 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 03:37:16,027 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 03:37:16,027 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 03:37:16,027 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 03:37:16,027 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 03:37:16,028 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 03:37:16,028 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 03:37:16,028 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 03:37:16,028 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 03:37:16,028 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 03:37:16,028 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 03:37:16,029 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 03:37:16,030 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 03:37:16,065 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 03:37:16,078 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 03:37:16,083 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 03:37:16,085 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 03:37:16,085 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 03:37:16,086 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/simple_built_from_end_true-unreach-call_false-valid-memtrack.i [2018-01-21 03:37:16,313 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 03:37:16,318 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 03:37:16,319 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 03:37:16,319 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 03:37:16,325 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 03:37:16,325 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 03:37:16" (1/1) ... [2018-01-21 03:37:16,328 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d4b0388 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:37:16, skipping insertion in model container [2018-01-21 03:37:16,329 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 03:37:16" (1/1) ... [2018-01-21 03:37:16,343 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 03:37:16,380 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 03:37:16,502 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 03:37:16,519 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 03:37:16,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:37:16 WrapperNode [2018-01-21 03:37:16,527 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 03:37:16,528 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 03:37:16,528 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 03:37:16,528 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 03:37:16,539 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:37:16" (1/1) ... [2018-01-21 03:37:16,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:37:16" (1/1) ... [2018-01-21 03:37:16,549 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:37:16" (1/1) ... [2018-01-21 03:37:16,550 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:37:16" (1/1) ... [2018-01-21 03:37:16,554 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:37:16" (1/1) ... [2018-01-21 03:37:16,558 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:37:16" (1/1) ... [2018-01-21 03:37:16,559 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:37:16" (1/1) ... [2018-01-21 03:37:16,561 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 03:37:16,561 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 03:37:16,561 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 03:37:16,561 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 03:37:16,562 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:37:16" (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 03:37:16,624 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 03:37:16,624 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 03:37:16,624 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-01-21 03:37:16,624 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 03:37:16,624 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 03:37:16,625 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 03:37:16,625 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 03:37:16,625 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 03:37:16,625 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 03:37:16,625 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 03:37:16,625 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 03:37:16,625 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-21 03:37:16,625 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 03:37:16,625 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 03:37:16,626 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-01-21 03:37:16,626 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 03:37:16,626 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 03:37:16,626 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 03:37:16,803 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 03:37:16,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 03:37:16 BoogieIcfgContainer [2018-01-21 03:37:16,804 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 03:37:16,804 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 03:37:16,805 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 03:37:16,806 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 03:37:16,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 03:37:16" (1/3) ... [2018-01-21 03:37:16,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7639b29e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 03:37:16, skipping insertion in model container [2018-01-21 03:37:16,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:37:16" (2/3) ... [2018-01-21 03:37:16,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7639b29e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 03:37:16, skipping insertion in model container [2018-01-21 03:37:16,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 03:37:16" (3/3) ... [2018-01-21 03:37:16,811 INFO L105 eAbstractionObserver]: Analyzing ICFG simple_built_from_end_true-unreach-call_false-valid-memtrack.i [2018-01-21 03:37:16,818 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 03:37:16,824 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-21 03:37:16,872 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:37:16,873 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:37:16,873 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:37:16,873 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:37:16,873 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:37:16,873 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:37:16,873 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:37:16,874 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == exitErr0EnsuresViolation======== [2018-01-21 03:37:16,874 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:37:16,897 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-01-21 03:37:16,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 03:37:16,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 32 states. [2018-01-21 03:37:16,987 INFO L401 ceAbstractionStarter]: For program point exitErr0EnsuresViolation(line 525) no Hoare annotation was computed. [2018-01-21 03:37:16,987 INFO L401 ceAbstractionStarter]: For program point exitFINAL(lines 619 621) no Hoare annotation was computed. [2018-01-21 03:37:16,988 INFO L404 ceAbstractionStarter]: At program point exitENTRY(lines 619 621) the Hoare annotation is: true [2018-01-21 03:37:16,988 INFO L401 ceAbstractionStarter]: For program point L620(line 620) no Hoare annotation was computed. [2018-01-21 03:37:16,988 INFO L401 ceAbstractionStarter]: For program point exitEXIT(lines 619 621) no Hoare annotation was computed. [2018-01-21 03:37:16,988 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 642) no Hoare annotation was computed. [2018-01-21 03:37:16,989 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 642) no Hoare annotation was computed. [2018-01-21 03:37:16,989 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 642) the Hoare annotation is: true [2018-01-21 03:37:16,989 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 642) no Hoare annotation was computed. [2018-01-21 03:37:16,989 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 642) the Hoare annotation is: true [2018-01-21 03:37:16,989 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 642) no Hoare annotation was computed. [2018-01-21 03:37:16,990 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 642) the Hoare annotation is: true [2018-01-21 03:37:16,990 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 642) no Hoare annotation was computed. [2018-01-21 03:37:16,990 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 642) no Hoare annotation was computed. [2018-01-21 03:37:16,990 INFO L401 ceAbstractionStarter]: For program point L640(line 640) no Hoare annotation was computed. [2018-01-21 03:37:16,990 INFO L401 ceAbstractionStarter]: For program point L630'(line 630) no Hoare annotation was computed. [2018-01-21 03:37:16,990 INFO L401 ceAbstractionStarter]: For program point L637'(line 637) no Hoare annotation was computed. [2018-01-21 03:37:16,990 INFO L401 ceAbstractionStarter]: For program point L629(lines 629 635) no Hoare annotation was computed. [2018-01-21 03:37:16,991 INFO L404 ceAbstractionStarter]: At program point L631'(line 631) the Hoare annotation is: true [2018-01-21 03:37:16,991 INFO L401 ceAbstractionStarter]: For program point L631'''(line 631) no Hoare annotation was computed. [2018-01-21 03:37:16,991 INFO L401 ceAbstractionStarter]: For program point L629'(lines 629 635) no Hoare annotation was computed. [2018-01-21 03:37:16,991 INFO L401 ceAbstractionStarter]: For program point L637'''(lines 637 639) no Hoare annotation was computed. [2018-01-21 03:37:16,991 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 626 642) no Hoare annotation was computed. [2018-01-21 03:37:16,991 INFO L401 ceAbstractionStarter]: For program point L630(line 630) no Hoare annotation was computed. [2018-01-21 03:37:16,992 INFO L401 ceAbstractionStarter]: For program point L633(line 633) no Hoare annotation was computed. [2018-01-21 03:37:16,992 INFO L401 ceAbstractionStarter]: For program point L632(line 632) no Hoare annotation was computed. [2018-01-21 03:37:16,992 INFO L401 ceAbstractionStarter]: For program point L631(line 631) no Hoare annotation was computed. [2018-01-21 03:37:16,992 INFO L404 ceAbstractionStarter]: At program point L629'''(lines 629 635) the Hoare annotation is: true [2018-01-21 03:37:16,992 INFO L401 ceAbstractionStarter]: For program point L638(line 638) no Hoare annotation was computed. [2018-01-21 03:37:16,992 INFO L401 ceAbstractionStarter]: For program point L636''(lines 636 641) no Hoare annotation was computed. [2018-01-21 03:37:16,993 INFO L401 ceAbstractionStarter]: For program point L637(line 637) no Hoare annotation was computed. [2018-01-21 03:37:16,993 INFO L401 ceAbstractionStarter]: For program point L636(lines 636 641) no Hoare annotation was computed. [2018-01-21 03:37:16,993 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 626 642) no Hoare annotation was computed. [2018-01-21 03:37:16,993 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 626 642) the Hoare annotation is: true [2018-01-21 03:37:16,993 INFO L401 ceAbstractionStarter]: For program point L636'''(lines 636 641) no Hoare annotation was computed. [2018-01-21 03:37:16,997 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:37:16,997 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:37:16,998 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:37:16,998 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:37:16,998 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:37:16,998 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:37:16,998 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:37:16,998 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 03:37:16,999 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:37:17,000 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-01-21 03:37:17,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 03:37:17,001 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:37:17,002 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 03:37:17,003 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 03:37:17,008 INFO L82 PathProgramCache]: Analyzing trace with hash 95043, now seen corresponding path program 1 times [2018-01-21 03:37:17,011 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:37:17,033 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:37:17,034 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:37:17,034 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:37:17,034 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:37:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:37:17,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:37:17,104 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 03:37:17,111 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:37:17,116 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:37:17,117 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:37:17,117 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:37:17,117 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:37:17,117 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:37:17,117 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:37:17,117 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:37:17,117 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 03:37:17,117 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:37:17,119 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-01-21 03:37:17,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-21 03:37:17,120 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:37:17,120 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:37:17,120 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 03:37:17,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1525649768, now seen corresponding path program 1 times [2018-01-21 03:37:17,121 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:37:17,122 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:37:17,122 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:37:17,123 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:37:17,123 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:37:17,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:37:17,143 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:37:17,184 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 03:37:17,186 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:37:17,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 03:37:17,187 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:37:17,189 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 03:37:17,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 03:37:17,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 03:37:17,207 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2018-01-21 03:37:17,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:37:17,295 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-01-21 03:37:17,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 03:37:17,297 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-01-21 03:37:17,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:37:17,306 INFO L225 Difference]: With dead ends: 45 [2018-01-21 03:37:17,306 INFO L226 Difference]: Without dead ends: 25 [2018-01-21 03:37:17,308 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 03:37:17,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-01-21 03:37:17,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-01-21 03:37:17,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-01-21 03:37:17,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-01-21 03:37:17,335 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 11 [2018-01-21 03:37:17,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:37:17,335 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-01-21 03:37:17,336 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 03:37:17,336 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-01-21 03:37:17,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-21 03:37:17,337 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:37:17,337 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:37:17,337 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 03:37:17,337 INFO L82 PathProgramCache]: Analyzing trace with hash 935347966, now seen corresponding path program 1 times [2018-01-21 03:37:17,337 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:37:17,338 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:37:17,339 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:37:17,339 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:37:17,339 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:37:17,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:37:17,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:37:17,367 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 03:37:17,370 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:37:17,371 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:37:17,371 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:37:17,376 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:37:17,376 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:37:17,376 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:37:17,376 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:37:17,376 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:37:17,376 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:37:17,376 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:37:17,376 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 03:37:17,376 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:37:17,377 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-01-21 03:37:17,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-21 03:37:17,378 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:37:17,378 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:37:17,378 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 03:37:17,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1051865729, now seen corresponding path program 1 times [2018-01-21 03:37:17,378 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:37:17,379 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:37:17,379 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:37:17,379 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:37:17,379 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:37:17,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:37:17,388 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:37:17,398 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 03:37:17,399 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:37:17,399 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 03:37:17,399 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:37:17,399 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 03:37:17,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 03:37:17,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 03:37:17,400 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2018-01-21 03:37:17,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:37:17,404 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-01-21 03:37:17,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 03:37:17,404 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-01-21 03:37:17,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:37:17,405 INFO L225 Difference]: With dead ends: 45 [2018-01-21 03:37:17,405 INFO L226 Difference]: Without dead ends: 23 [2018-01-21 03:37:17,406 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 03:37:17,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-01-21 03:37:17,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-01-21 03:37:17,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-01-21 03:37:17,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-01-21 03:37:17,409 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 9 [2018-01-21 03:37:17,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:37:17,409 INFO L432 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-01-21 03:37:17,409 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 03:37:17,409 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-01-21 03:37:17,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-21 03:37:17,410 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:37:17,410 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:37:17,410 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 03:37:17,410 INFO L82 PathProgramCache]: Analyzing trace with hash -691763355, now seen corresponding path program 1 times [2018-01-21 03:37:17,410 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:37:17,411 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:37:17,411 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:37:17,411 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:37:17,411 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:37:17,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:37:17,423 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:37:17,455 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 03:37:17,455 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:37:17,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 03:37:17,456 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:37:17,456 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 03:37:17,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 03:37:17,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 03:37:17,457 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 3 states. [2018-01-21 03:37:17,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:37:17,484 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-01-21 03:37:17,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 03:37:17,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-01-21 03:37:17,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:37:17,485 INFO L225 Difference]: With dead ends: 35 [2018-01-21 03:37:17,485 INFO L226 Difference]: Without dead ends: 27 [2018-01-21 03:37:17,486 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 03:37:17,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-01-21 03:37:17,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-01-21 03:37:17,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-01-21 03:37:17,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-01-21 03:37:17,491 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 12 [2018-01-21 03:37:17,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:37:17,492 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-01-21 03:37:17,492 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 03:37:17,492 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-01-21 03:37:17,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-21 03:37:17,493 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:37:17,493 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:37:17,493 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 03:37:17,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1352814088, now seen corresponding path program 1 times [2018-01-21 03:37:17,494 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:37:17,495 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:37:17,495 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:37:17,495 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:37:17,495 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:37:17,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:37:17,538 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:37:17,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 03:37:17,611 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:37:17,611 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 03:37:17,611 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:37:17,612 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 03:37:17,612 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 03:37:17,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 03:37:17,613 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 5 states. [2018-01-21 03:37:17,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:37:17,696 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-01-21 03:37:17,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 03:37:17,696 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-01-21 03:37:17,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:37:17,698 INFO L225 Difference]: With dead ends: 40 [2018-01-21 03:37:17,698 INFO L226 Difference]: Without dead ends: 38 [2018-01-21 03:37:17,698 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-21 03:37:17,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-21 03:37:17,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2018-01-21 03:37:17,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-01-21 03:37:17,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-01-21 03:37:17,704 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 21 [2018-01-21 03:37:17,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:37:17,704 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-01-21 03:37:17,704 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 03:37:17,705 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-01-21 03:37:17,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-21 03:37:17,705 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:37:17,706 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:37:17,706 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-21 03:37:17,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1708332906, now seen corresponding path program 1 times [2018-01-21 03:37:17,706 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:37:17,707 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:37:17,707 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:37:17,707 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:37:17,707 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:37:17,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:37:17,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:37:17,753 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 03:37:17,759 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:37:17,763 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:37:17,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 03:37:17 BoogieIcfgContainer [2018-01-21 03:37:17,771 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 03:37:17,772 INFO L168 Benchmark]: Toolchain (without parser) took 1457.99 ms. Allocated memory was 300.9 MB in the beginning and 456.1 MB in the end (delta: 155.2 MB). Free memory was 258.3 MB in the beginning and 394.1 MB in the end (delta: -135.8 MB). Peak memory consumption was 19.4 MB. Max. memory is 5.3 GB. [2018-01-21 03:37:17,773 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 300.9 MB. Free memory is still 264.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 03:37:17,774 INFO L168 Benchmark]: CACSL2BoogieTranslator took 208.47 ms. Allocated memory is still 300.9 MB. Free memory was 258.3 MB in the beginning and 248.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-21 03:37:17,774 INFO L168 Benchmark]: Boogie Preprocessor took 32.95 ms. Allocated memory is still 300.9 MB. Free memory was 248.3 MB in the beginning and 246.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 03:37:17,774 INFO L168 Benchmark]: RCFGBuilder took 242.90 ms. Allocated memory is still 300.9 MB. Free memory was 246.3 MB in the beginning and 231.7 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. [2018-01-21 03:37:17,775 INFO L168 Benchmark]: TraceAbstraction took 966.34 ms. Allocated memory was 300.9 MB in the beginning and 456.1 MB in the end (delta: 155.2 MB). Free memory was 231.7 MB in the beginning and 394.1 MB in the end (delta: -162.4 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 03:37:17,777 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.21 ms. Allocated memory is still 300.9 MB. Free memory is still 264.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 208.47 ms. Allocated memory is still 300.9 MB. Free memory was 258.3 MB in the beginning and 248.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.95 ms. Allocated memory is still 300.9 MB. Free memory was 248.3 MB in the beginning and 246.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 242.90 ms. Allocated memory is still 300.9 MB. Free memory was 246.3 MB in the beginning and 231.7 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 966.34 ms. Allocated memory was 300.9 MB in the beginning and 456.1 MB in the end (delta: 155.2 MB). Free memory was 231.7 MB in the beginning and 394.1 MB in the end (delta: -162.4 MB). There was no memory consumed. 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) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 525]: 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: exitErr0EnsuresViolation CFG has 4 procedures, 35 locations, 4 error locations. SAFE Result, 0.1s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred 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: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 7 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: 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 4 procedures, 35 locations, 4 error locations. UNSAFE Result, 0.1s 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=32occurred 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 - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L627] List t; [L628] List p = 0; VAL [p={0:0}] [L629] COND FALSE !(__VERIFIER_nondet_int()) [L636] COND FALSE !(p!=0) - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 35 locations, 4 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 33 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred 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, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 100 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: 626]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L627] List t; [L628] List p = 0; VAL [p={0:0}] [L629] COND TRUE __VERIFIER_nondet_int() [L630] EXPR, FCALL malloc(sizeof(struct node)) VAL [malloc(sizeof(struct node))={11:0}, p={0:0}] [L630] t = (List) malloc(sizeof(struct node)) VAL [malloc(sizeof(struct node))={11:0}, p={0:0}, t={11:0}] [L631] COND FALSE !(t == 0) VAL [malloc(sizeof(struct node))={11:0}, p={0:0}, t={11:0}] [L632] FCALL t->h = 1 VAL [malloc(sizeof(struct node))={11:0}, p={0:0}, t={11:0}] [L633] FCALL t->n = p VAL [malloc(sizeof(struct node))={11:0}, p={0:0}, t={11:0}] [L634] p = t VAL [malloc(sizeof(struct node))={11:0}, p={11:0}, t={11:0}] [L629] COND FALSE !(__VERIFIER_nondet_int()) [L636] COND TRUE p!=0 VAL [malloc(sizeof(struct node))={11:0}, p={11:0}, t={11:0}] [L637] EXPR, FCALL p->h VAL [malloc(sizeof(struct node))={11:0}, p={11:0}, p->h=1, t={11:0}] [L637] COND FALSE !(p->h != 1) [L640] EXPR, FCALL p->n VAL [malloc(sizeof(struct node))={11:0}, p={11:0}, p->n={0:0}, t={11:0}] [L640] p = p->n [L636] COND FALSE !(p!=0) VAL [malloc(sizeof(struct node))={11:0}, p={0:0}, t={11:0}] - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 4 procedures, 35 locations, 4 error locations. UNSAFE Result, 0.3s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 75 SDtfs, 58 SDslu, 46 SDs, 0 SdLazy, 30 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred 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, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 69 NumberOfCodeBlocks, 69 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 39 ConstructedInterpolants, 0 QuantifiedInterpolants, 1339 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 3/3 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - InvariantResult [Line: 629]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple_built_from_end_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_03-37-17-787.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple_built_from_end_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_03-37-17-787.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple_built_from_end_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_03-37-17-787.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple_built_from_end_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_03-37-17-787.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple_built_from_end_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_03-37-17-787.csv Received shutdown request...