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_imprecise.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cmemset-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 00:30:22,100 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 00:30:22,103 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 00:30:22,115 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 00:30:22,115 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 00:30:22,116 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 00:30:22,117 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 00:30:22,118 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 00:30:22,120 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 00:30:22,120 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 00:30:22,121 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 00:30:22,121 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 00:30:22,122 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 00:30:22,123 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 00:30:22,123 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 00:30:22,126 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 00:30:22,128 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 00:30:22,131 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 00:30:22,132 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 00:30:22,133 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 00:30:22,135 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 00:30:22,136 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 00:30:22,136 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 00:30:22,137 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 00:30:22,138 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 00:30:22,139 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 00:30:22,140 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 00:30:22,140 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 00:30:22,140 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 00:30:22,141 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 00:30:22,141 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 00:30:22,142 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_imprecise.epf [2018-01-21 00:30:22,151 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 00:30:22,152 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 00:30:22,153 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 00:30:22,153 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 00:30:22,153 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 00:30:22,153 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 00:30:22,153 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 00:30:22,154 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 00:30:22,154 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 00:30:22,154 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 00:30:22,155 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 00:30:22,155 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 00:30:22,155 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 00:30:22,155 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 00:30:22,155 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 00:30:22,156 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 00:30:22,156 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 00:30:22,156 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 00:30:22,156 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 00:30:22,156 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 00:30:22,156 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 00:30:22,157 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 00:30:22,157 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 00:30:22,157 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 00:30:22,157 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 00:30:22,157 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 00:30:22,158 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 00:30:22,158 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 00:30:22,158 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 00:30:22,158 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 00:30:22,158 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 00:30:22,159 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 00:30:22,159 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 00:30:22,159 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 00:30:22,159 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 00:30:22,159 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 00:30:22,159 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 00:30:22,160 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 00:30:22,160 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 00:30:22,193 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 00:30:22,202 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 00:30:22,205 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 00:30:22,206 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 00:30:22,207 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 00:30:22,207 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cmemset-alloca_true-valid-memsafety_true-termination.i [2018-01-21 00:30:22,356 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 00:30:22,361 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 00:30:22,362 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 00:30:22,362 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 00:30:22,368 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 00:30:22,369 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:30:22" (1/1) ... [2018-01-21 00:30:22,371 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57588e48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:22, skipping insertion in model container [2018-01-21 00:30:22,371 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:30:22" (1/1) ... [2018-01-21 00:30:22,391 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:30:22,433 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:30:22,542 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:30:22,556 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:30:22,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:22 WrapperNode [2018-01-21 00:30:22,563 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 00:30:22,564 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 00:30:22,564 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 00:30:22,564 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 00:30:22,580 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:22" (1/1) ... [2018-01-21 00:30:22,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:22" (1/1) ... [2018-01-21 00:30:22,592 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:22" (1/1) ... [2018-01-21 00:30:22,592 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:22" (1/1) ... [2018-01-21 00:30:22,595 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:22" (1/1) ... [2018-01-21 00:30:22,598 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:22" (1/1) ... [2018-01-21 00:30:22,599 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:22" (1/1) ... [2018-01-21 00:30:22,600 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 00:30:22,601 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 00:30:22,601 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 00:30:22,601 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 00:30:22,602 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:22" (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 00:30:22,648 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 00:30:22,649 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 00:30:22,649 INFO L136 BoogieDeclarations]: Found implementation of procedure cmemset [2018-01-21 00:30:22,649 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 00:30:22,649 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 00:30:22,649 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 00:30:22,649 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 00:30:22,649 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 00:30:22,650 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 00:30:22,650 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 00:30:22,650 INFO L128 BoogieDeclarations]: Found specification of procedure cmemset [2018-01-21 00:30:22,650 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 00:30:22,650 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 00:30:22,650 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 00:30:22,823 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 00:30:22,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:30:22 BoogieIcfgContainer [2018-01-21 00:30:22,824 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 00:30:22,824 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 00:30:22,825 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 00:30:22,826 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 00:30:22,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 12:30:22" (1/3) ... [2018-01-21 00:30:22,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@baf4b8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:30:22, skipping insertion in model container [2018-01-21 00:30:22,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:22" (2/3) ... [2018-01-21 00:30:22,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@baf4b8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:30:22, skipping insertion in model container [2018-01-21 00:30:22,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:30:22" (3/3) ... [2018-01-21 00:30:22,830 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cmemset-alloca_true-valid-memsafety_true-termination.i [2018-01-21 00:30:22,836 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 00:30:22,842 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-21 00:30:22,890 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:30:22,890 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:30:22,890 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:30:22,890 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:30:22,891 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:30:22,891 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:30:22,891 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:30:22,891 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 00:30:22,892 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:30:22,912 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-01-21 00:30:22,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 00:30:22,919 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:30:22,920 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 00:30:22,920 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 00:30:22,926 INFO L82 PathProgramCache]: Analyzing trace with hash 81687, now seen corresponding path program 1 times [2018-01-21 00:30:22,929 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:30:22,979 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:22,979 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:30:22,979 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:22,979 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:30:23,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:30:23,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:30:23,033 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:30:23,039 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:30:23,045 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:30:23,046 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:30:23,046 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:30:23,046 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:30:23,046 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:30:23,046 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:30:23,046 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:30:23,046 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 00:30:23,046 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:30:23,048 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-01-21 00:30:23,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-21 00:30:23,049 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:30:23,049 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 00:30:23,049 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:30:23,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1611459697, now seen corresponding path program 1 times [2018-01-21 00:30:23,049 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:30:23,050 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:23,051 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:30:23,051 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:23,051 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:30:23,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:30:23,089 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:30:23,240 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 00:30:23,242 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:30:23,242 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 00:30:23,242 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:30:23,244 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 00:30:23,321 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 00:30:23,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 00:30:23,324 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 5 states. [2018-01-21 00:30:23,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:30:23,410 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2018-01-21 00:30:23,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:30:23,412 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-21 00:30:23,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:30:23,430 INFO L225 Difference]: With dead ends: 60 [2018-01-21 00:30:23,430 INFO L226 Difference]: Without dead ends: 43 [2018-01-21 00:30:23,433 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:30:23,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-21 00:30:23,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2018-01-21 00:30:23,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-21 00:30:23,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-01-21 00:30:23,469 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 22 [2018-01-21 00:30:23,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:30:23,469 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-01-21 00:30:23,469 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 00:30:23,469 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-01-21 00:30:23,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-21 00:30:23,471 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:30:23,471 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 00:30:23,471 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:30:23,471 INFO L82 PathProgramCache]: Analyzing trace with hash 331596019, now seen corresponding path program 1 times [2018-01-21 00:30:23,472 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:30:23,472 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:23,473 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:30:23,473 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:23,473 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:30:23,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:30:23,496 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:30:23,578 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 00:30:23,578 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:30:23,578 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 00:30:23,578 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:30:23,582 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:30:23,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:30:23,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:30:23,583 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 6 states. [2018-01-21 00:30:23,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:30:23,628 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-01-21 00:30:23,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-21 00:30:23,663 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-21 00:30:23,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:30:23,664 INFO L225 Difference]: With dead ends: 45 [2018-01-21 00:30:23,664 INFO L226 Difference]: Without dead ends: 35 [2018-01-21 00:30:23,665 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-01-21 00:30:23,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-21 00:30:23,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2018-01-21 00:30:23,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-01-21 00:30:23,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-01-21 00:30:23,670 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 22 [2018-01-21 00:30:23,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:30:23,671 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-01-21 00:30:23,671 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:30:23,671 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-01-21 00:30:23,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-21 00:30:23,672 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:30:23,672 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] [2018-01-21 00:30:23,672 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:30:23,673 INFO L82 PathProgramCache]: Analyzing trace with hash -558937752, now seen corresponding path program 1 times [2018-01-21 00:30:23,673 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:30:23,673 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:23,674 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:30:23,674 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:23,674 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:30:23,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:30:23,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:30:23,724 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:30:23,731 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:30:23,734 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:30:23,735 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:30:23,736 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:30:23,748 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:30:23,748 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:30:23,748 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:30:23,748 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:30:23,748 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:30:23,749 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:30:23,749 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:30:23,749 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 00:30:23,749 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:30:23,750 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-01-21 00:30:23,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-21 00:30:23,751 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:30:23,751 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 00:30:23,752 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 00:30:23,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1303349627, now seen corresponding path program 1 times [2018-01-21 00:30:23,752 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:30:23,753 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:23,753 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:30:23,753 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:23,753 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:30:23,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:30:23,764 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:30:23,823 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 00:30:23,824 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:30:23,824 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 00:30:23,824 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:30:23,824 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 00:30:23,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 00:30:23,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 00:30:23,825 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 5 states. [2018-01-21 00:30:23,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:30:23,880 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2018-01-21 00:30:23,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:30:23,881 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-21 00:30:23,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:30:23,882 INFO L225 Difference]: With dead ends: 60 [2018-01-21 00:30:23,882 INFO L226 Difference]: Without dead ends: 41 [2018-01-21 00:30:23,883 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:30:23,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-21 00:30:23,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2018-01-21 00:30:23,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-01-21 00:30:23,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-01-21 00:30:23,889 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 20 [2018-01-21 00:30:23,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:30:23,889 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-01-21 00:30:23,889 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 00:30:23,890 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-01-21 00:30:23,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-21 00:30:23,891 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:30:23,891 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 00:30:23,891 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 00:30:23,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1890155641, now seen corresponding path program 1 times [2018-01-21 00:30:23,891 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:30:23,892 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:23,892 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:30:23,892 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:23,893 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:30:23,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:30:23,907 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:30:23,963 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 00:30:23,964 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:30:23,964 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 00:30:23,964 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:30:23,964 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 00:30:23,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 00:30:23,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 00:30:23,965 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 4 states. [2018-01-21 00:30:24,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:30:24,119 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-01-21 00:30:24,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:30:24,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-21 00:30:24,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:30:24,120 INFO L225 Difference]: With dead ends: 32 [2018-01-21 00:30:24,120 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:30:24,120 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-21 00:30:24,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:30:24,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:30:24,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:30:24,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:30:24,121 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2018-01-21 00:30:24,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:30:24,121 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:30:24,121 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 00:30:24,122 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:30:24,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:30:24,124 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:30:24,124 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:30:24,124 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:30:24,124 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:30:24,124 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:30:24,124 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:30:24,124 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:30:24,124 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == cmemsetErr0EnsuresViolation======== [2018-01-21 00:30:24,125 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:30:24,126 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-01-21 00:30:24,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-21 00:30:24,127 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:30:24,127 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:30:24,127 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cmemsetErr0EnsuresViolation]=== [2018-01-21 00:30:24,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1029791130, now seen corresponding path program 1 times [2018-01-21 00:30:24,127 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:30:24,128 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:24,128 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:30:24,128 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:24,128 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:30:24,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:30:24,137 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:30:24,147 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 00:30:24,147 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:30:24,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-01-21 00:30:24,147 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:30:24,148 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:30:24,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:30:24,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:30:24,148 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2018-01-21 00:30:24,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:30:24,151 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-01-21 00:30:24,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:30:24,152 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-01-21 00:30:24,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:30:24,152 INFO L225 Difference]: With dead ends: 44 [2018-01-21 00:30:24,152 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:30:24,153 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 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 00:30:24,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:30:24,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:30:24,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:30:24,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:30:24,154 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2018-01-21 00:30:24,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:30:24,154 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:30:24,154 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:30:24,155 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:30:24,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:30:24,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 12:30:24 BoogieIcfgContainer [2018-01-21 00:30:24,158 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 00:30:24,158 INFO L168 Benchmark]: Toolchain (without parser) took 1801.68 ms. Allocated memory was 303.0 MB in the beginning and 462.9 MB in the end (delta: 159.9 MB). Free memory was 261.4 MB in the beginning and 370.5 MB in the end (delta: -109.1 MB). Peak memory consumption was 50.8 MB. Max. memory is 5.3 GB. [2018-01-21 00:30:24,160 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 303.0 MB. Free memory is still 267.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 00:30:24,160 INFO L168 Benchmark]: CACSL2BoogieTranslator took 201.57 ms. Allocated memory is still 303.0 MB. Free memory was 261.4 MB in the beginning and 250.4 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:30:24,161 INFO L168 Benchmark]: Boogie Preprocessor took 36.71 ms. Allocated memory is still 303.0 MB. Free memory was 250.4 MB in the beginning and 249.4 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-21 00:30:24,161 INFO L168 Benchmark]: RCFGBuilder took 223.07 ms. Allocated memory is still 303.0 MB. Free memory was 249.4 MB in the beginning and 234.4 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:30:24,161 INFO L168 Benchmark]: TraceAbstraction took 1333.23 ms. Allocated memory was 303.0 MB in the beginning and 462.9 MB in the end (delta: 159.9 MB). Free memory was 234.4 MB in the beginning and 370.5 MB in the end (delta: -136.1 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. [2018-01-21 00:30:24,162 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.14 ms. Allocated memory is still 303.0 MB. Free memory is still 267.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 201.57 ms. Allocated memory is still 303.0 MB. Free memory was 261.4 MB in the beginning and 250.4 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.71 ms. Allocated memory is still 303.0 MB. Free memory was 250.4 MB in the beginning and 249.4 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 223.07 ms. Allocated memory is still 303.0 MB. Free memory was 249.4 MB in the beginning and 234.4 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1333.23 ms. Allocated memory was 303.0 MB in the beginning and 462.9 MB in the end (delta: 159.9 MB). Free memory was 234.4 MB in the beginning and 370.5 MB in the end (delta: -136.1 MB). Peak memory consumption was 23.8 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) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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, 32 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: [L552] int length = __VERIFIER_nondet_int(); [L553] int n = __VERIFIER_nondet_int(); [L554] int c = __VERIFIER_nondet_int(); [L555] COND TRUE length < 1 [L556] length = 1 VAL [c=0, length=1, n=0] [L558] COND TRUE n < 1 [L559] n = 1 VAL [c=0, length=1, n=1] [L561] EXPR, FCALL __builtin_alloca (n * sizeof(char)) VAL [__builtin_alloca (n * sizeof(char))={3:0}, c=0, length=1, n=1] [L561] char* nondetArea = (char*) __builtin_alloca (n * sizeof(char)); VAL [__builtin_alloca (n * sizeof(char))={3:0}, c=0, length=1, n=1, nondetArea={3:0}] [L562] CALL cmemset(nondetArea, c, n) VAL [\old(c)=0, \old(n)=1, dst={3:0}] [L543] COND TRUE n != 0 [L544] unsigned char *d = dst; VAL [\old(c)=0, \old(n)=1, c=0, d={3:0}, dst={3:0}, dst={3:0}, n=1] [L546] EXPR d++ VAL [\old(c)=0, \old(n)=1, c=0, d={3:1}, d++={3:0}, dst={3:0}, dst={3:0}, n=1] [L546] FCALL *d++ = (unsigned char)c VAL [\old(c)=0, \old(n)=1, c=0, d={3:1}, d++={3:0}, dst={3:0}, dst={3:0}, n=1] [L547] EXPR --n VAL [--n=0, \old(c)=0, \old(n)=1, c=0, d={3:1}, dst={3:0}, dst={3:0}, n=0] [L547] COND FALSE !(--n != 0) [L549] RET return (dst); VAL [\old(c)=0, \old(n)=1, \result={3:0}, c=0, d={3:1}, dst={3:0}, dst={3:0}, n=0] [L562] cmemset(nondetArea, c, n) VAL [__builtin_alloca (n * sizeof(char))={3:0}, c=0, cmemset(nondetArea, c, n)={3:0}, length=1, n=1, nondetArea={3:0}] [L563] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 32 locations, 4 error locations. UNSAFE Result, 0.7s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 61 SDtfs, 27 SDslu, 175 SDs, 0 SdLazy, 47 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=1, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 16 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 71 NumberOfCodeBlocks, 71 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 42 ConstructedInterpolants, 0 QuantifiedInterpolants, 2562 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 551]: 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 4 procedures, 32 locations, 4 error locations. SAFE Result, 0.3s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 59 SDtfs, 25 SDslu, 101 SDs, 0 SdLazy, 50 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 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, 2 MinimizatonAttempts, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 40 NumberOfCodeBlocks, 40 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 38 ConstructedInterpolants, 0 QuantifiedInterpolants, 2470 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 540]: 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: cmemsetErr0EnsuresViolation CFG has 4 procedures, 32 locations, 4 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 34 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 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, 15 NumberOfCodeBlocks, 15 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 14 ConstructedInterpolants, 0 QuantifiedInterpolants, 196 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 RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cmemset-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_00-30-24-171.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cmemset-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_00-30-24-171.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cmemset-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_00-30-24-171.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cmemset-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_00-30-24-171.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cmemset-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_00-30-24-171.csv Received shutdown request...