java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/test-bitfields-2.1_false-valid-free.i_15.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b8f97f7-m [2018-10-10 15:47:37,487 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 15:47:37,490 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 15:47:37,503 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 15:47:37,504 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 15:47:37,506 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 15:47:37,507 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 15:47:37,509 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 15:47:37,510 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 15:47:37,514 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 15:47:37,515 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 15:47:37,515 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 15:47:37,516 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 15:47:37,517 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 15:47:37,518 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 15:47:37,519 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 15:47:37,520 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 15:47:37,522 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 15:47:37,524 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 15:47:37,525 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 15:47:37,526 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 15:47:37,527 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 15:47:37,530 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 15:47:37,530 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 15:47:37,530 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 15:47:37,531 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 15:47:37,532 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 15:47:37,533 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 15:47:37,534 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 15:47:37,535 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 15:47:37,535 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 15:47:37,536 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 15:47:37,536 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 15:47:37,536 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 15:47:37,537 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 15:47:37,538 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 15:47:37,538 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-10 15:47:37,547 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 15:47:37,548 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 15:47:37,549 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-10 15:47:37,549 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-10 15:47:37,549 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-10 15:47:37,549 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-10 15:47:37,550 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 15:47:37,550 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-10 15:47:37,550 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 15:47:37,551 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-10 15:47:37,551 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-10 15:47:37,551 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-10 15:47:37,551 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-10 15:47:37,552 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-10 15:47:37,552 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-10 15:47:37,611 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 15:47:37,625 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 15:47:37,632 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 15:47:37,633 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-10 15:47:37,634 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-10 15:47:37,634 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/test-bitfields-2.1_false-valid-free.i_15.bpl [2018-10-10 15:47:37,634 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/test-bitfields-2.1_false-valid-free.i_15.bpl' [2018-10-10 15:47:37,707 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 15:47:37,709 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-10 15:47:37,709 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 15:47:37,709 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 15:47:37,710 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 15:47:37,737 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "test-bitfields-2.1_false-valid-free.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:47:37" (1/1) ... [2018-10-10 15:47:37,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "test-bitfields-2.1_false-valid-free.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:47:37" (1/1) ... [2018-10-10 15:47:37,763 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "test-bitfields-2.1_false-valid-free.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:47:37" (1/1) ... [2018-10-10 15:47:37,763 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "test-bitfields-2.1_false-valid-free.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:47:37" (1/1) ... [2018-10-10 15:47:37,782 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "test-bitfields-2.1_false-valid-free.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:47:37" (1/1) ... [2018-10-10 15:47:37,790 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "test-bitfields-2.1_false-valid-free.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:47:37" (1/1) ... [2018-10-10 15:47:37,792 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "test-bitfields-2.1_false-valid-free.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:47:37" (1/1) ... [2018-10-10 15:47:37,798 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 15:47:37,799 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 15:47:37,799 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 15:47:37,799 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 15:47:37,801 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "test-bitfields-2.1_false-valid-free.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:47:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-10 15:47:37,873 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-10 15:47:37,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 15:47:37,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 15:47:38,796 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 15:47:38,797 INFO L202 PluginConnector]: Adding new model test-bitfields-2.1_false-valid-free.i_15.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:47:38 BoogieIcfgContainer [2018-10-10 15:47:38,797 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 15:47:38,798 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 15:47:38,798 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 15:47:38,801 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 15:47:38,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "test-bitfields-2.1_false-valid-free.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:47:37" (1/2) ... [2018-10-10 15:47:38,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52bacb92 and model type test-bitfields-2.1_false-valid-free.i_15.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 03:47:38, skipping insertion in model container [2018-10-10 15:47:38,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "test-bitfields-2.1_false-valid-free.i_15.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:47:38" (2/2) ... [2018-10-10 15:47:38,805 INFO L112 eAbstractionObserver]: Analyzing ICFG test-bitfields-2.1_false-valid-free.i_15.bpl [2018-10-10 15:47:38,815 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-10 15:47:38,824 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-10 15:47:38,841 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-10 15:47:38,869 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 15:47:38,870 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 15:47:38,870 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 15:47:38,870 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-10 15:47:38,870 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 15:47:38,871 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 15:47:38,871 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 15:47:38,871 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 15:47:38,871 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 15:47:38,894 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states. [2018-10-10 15:47:38,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-10 15:47:38,910 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:47:38,912 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 15:47:38,913 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:47:38,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:47:38,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1602610748, now seen corresponding path program 1 times [2018-10-10 15:47:38,967 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:47:39,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:47:39,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:47:39,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:47:39,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 15:47:39,404 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-10 15:47:39,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-10 15:47:39,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-10 15:47:39,424 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 4 states. [2018-10-10 15:47:39,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:47:39,548 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-10-10 15:47:39,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-10 15:47:39,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2018-10-10 15:47:39,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:47:39,567 INFO L225 Difference]: With dead ends: 143 [2018-10-10 15:47:39,568 INFO L226 Difference]: Without dead ends: 143 [2018-10-10 15:47:39,570 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-10 15:47:39,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-10-10 15:47:39,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2018-10-10 15:47:39,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-10-10 15:47:39,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-10-10 15:47:39,630 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 137 [2018-10-10 15:47:39,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:47:39,632 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-10-10 15:47:39,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-10 15:47:39,632 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-10-10 15:47:39,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-10 15:47:39,636 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:47:39,637 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:47:39,638 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:47:39,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:47:39,639 INFO L82 PathProgramCache]: Analyzing trace with hash 725532715, now seen corresponding path program 1 times [2018-10-10 15:47:39,640 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:47:39,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:47:39,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:47:39,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:47:39,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-10 15:47:39,889 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 15:47:39,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 15:47:39,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-10 15:47:39,890 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 5 states. [2018-10-10 15:47:40,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:47:40,091 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-10-10 15:47:40,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 15:47:40,091 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 140 [2018-10-10 15:47:40,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:47:40,096 INFO L225 Difference]: With dead ends: 146 [2018-10-10 15:47:40,096 INFO L226 Difference]: Without dead ends: 146 [2018-10-10 15:47:40,097 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-10 15:47:40,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-10-10 15:47:40,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2018-10-10 15:47:40,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-10-10 15:47:40,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2018-10-10 15:47:40,109 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 140 [2018-10-10 15:47:40,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:47:40,110 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2018-10-10 15:47:40,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 15:47:40,111 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2018-10-10 15:47:40,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-10 15:47:40,113 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:47:40,114 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:47:40,114 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:47:40,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:47:40,115 INFO L82 PathProgramCache]: Analyzing trace with hash -979424156, now seen corresponding path program 2 times [2018-10-10 15:47:40,115 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:47:40,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:47:40,307 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:47:40,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:47:40,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-10 15:47:40,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 15:47:40,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 15:47:40,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-10 15:47:40,309 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 6 states. [2018-10-10 15:47:40,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:47:40,444 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-10-10 15:47:40,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 15:47:40,446 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2018-10-10 15:47:40,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:47:40,449 INFO L225 Difference]: With dead ends: 149 [2018-10-10 15:47:40,449 INFO L226 Difference]: Without dead ends: 149 [2018-10-10 15:47:40,450 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-10 15:47:40,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-10-10 15:47:40,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2018-10-10 15:47:40,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-10 15:47:40,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-10-10 15:47:40,459 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 143 [2018-10-10 15:47:40,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:47:40,460 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-10-10 15:47:40,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 15:47:40,460 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-10-10 15:47:40,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-10 15:47:40,463 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:47:40,463 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 15:47:40,463 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:47:40,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:47:40,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1066325621, now seen corresponding path program 3 times [2018-10-10 15:47:40,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:47:40,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:47:40,745 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:47:40,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:47:40,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-10 15:47:40,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 15:47:40,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 15:47:40,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-10 15:47:40,748 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 7 states. [2018-10-10 15:47:41,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:47:41,530 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-10-10 15:47:41,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 15:47:41,531 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 146 [2018-10-10 15:47:41,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:47:41,533 INFO L225 Difference]: With dead ends: 150 [2018-10-10 15:47:41,533 INFO L226 Difference]: Without dead ends: 150 [2018-10-10 15:47:41,534 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-10 15:47:41,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-10-10 15:47:41,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-10-10 15:47:41,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-10-10 15:47:41,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-10-10 15:47:41,558 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 146 [2018-10-10 15:47:41,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:47:41,559 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-10-10 15:47:41,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 15:47:41,559 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-10-10 15:47:41,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-10 15:47:41,564 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:47:41,565 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 15:47:41,568 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:47:41,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:47:41,569 INFO L82 PathProgramCache]: Analyzing trace with hash -82589948, now seen corresponding path program 4 times [2018-10-10 15:47:41,570 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:47:41,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:47:42,015 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-10 15:47:42,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:47:42,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 15:47:42,016 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 15:47:42,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 15:47:42,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 15:47:42,017 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 8 states. [2018-10-10 15:47:42,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:47:42,356 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-10-10 15:47:42,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 15:47:42,357 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 149 [2018-10-10 15:47:42,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:47:42,357 INFO L225 Difference]: With dead ends: 148 [2018-10-10 15:47:42,358 INFO L226 Difference]: Without dead ends: 0 [2018-10-10 15:47:42,358 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:47:42,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-10 15:47:42,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-10 15:47:42,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-10 15:47:42,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-10 15:47:42,359 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 149 [2018-10-10 15:47:42,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:47:42,360 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-10 15:47:42,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 15:47:42,360 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-10 15:47:42,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-10 15:47:42,365 INFO L202 PluginConnector]: Adding new model test-bitfields-2.1_false-valid-free.i_15.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 03:47:42 BoogieIcfgContainer [2018-10-10 15:47:42,365 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 15:47:42,366 INFO L168 Benchmark]: Toolchain (without parser) took 4658.22 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 327.7 MB). Peak memory consumption was 327.7 MB. Max. memory is 7.1 GB. [2018-10-10 15:47:42,368 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 15:47:42,368 INFO L168 Benchmark]: Boogie Preprocessor took 89.00 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 15:47:42,369 INFO L168 Benchmark]: RCFGBuilder took 998.40 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-10 15:47:42,370 INFO L168 Benchmark]: TraceAbstraction took 3566.75 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 285.4 MB). Peak memory consumption was 285.4 MB. Max. memory is 7.1 GB. [2018-10-10 15:47:42,374 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 89.00 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 998.40 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3566.75 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 285.4 MB). Peak memory consumption was 285.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 206]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 142 locations, 1 error locations. SAFE Result, 3.5s OverallTime, 5 OverallIterations, 4 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 640 SDtfs, 571 SDslu, 1499 SDs, 0 SdLazy, 213 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=150occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 715 NumberOfCodeBlocks, 715 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 710 ConstructedInterpolants, 0 QuantifiedInterpolants, 231654 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 22/40 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/test-bitfields-2.1_false-valid-free.i_15.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-10_15-47-42-385.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/test-bitfields-2.1_false-valid-free.i_15.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-10_15-47-42-385.csv Received shutdown request...