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/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/array-memsafety/bubblesort-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:44:50,237 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:44:50,239 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:44:50,256 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:44:50,257 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:44:50,258 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:44:50,259 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:44:50,261 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:44:50,263 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:44:50,264 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:44:50,265 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:44:50,265 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:44:50,266 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:44:50,268 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:44:50,269 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:44:50,271 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:44:50,273 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:44:50,275 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:44:50,276 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:44:50,278 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:44:50,280 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:44:50,280 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:44:50,280 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:44:50,281 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:44:50,282 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:44:50,283 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:44:50,284 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:44:50,284 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:44:50,284 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:44:50,285 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:44:50,285 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:44:50,286 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf [2018-01-24 12:44:50,295 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:44:50,296 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:44:50,296 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:44:50,297 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:44:50,297 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:44:50,297 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:44:50,297 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:44:50,298 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:44:50,298 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:44:50,298 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:44:50,299 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:44:50,299 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:44:50,299 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:44:50,299 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:44:50,299 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:44:50,300 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:44:50,300 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:44:50,300 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:44:50,300 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:44:50,300 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:44:50,301 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:44:50,301 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:44:50,301 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:44:50,301 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:44:50,301 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:44:50,302 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:44:50,302 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:44:50,302 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:44:50,302 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 12:44:50,302 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:44:50,303 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:44:50,303 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:44:50,304 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:44:50,304 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:44:50,338 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:44:50,351 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:44:50,355 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:44:50,357 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:44:50,357 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:44:50,358 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/bubblesort-alloca_true-valid-memsafety_true-termination.i [2018-01-24 12:44:50,532 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:44:50,538 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:44:50,539 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:44:50,539 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:44:50,543 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:44:50,544 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:44:50" (1/1) ... [2018-01-24 12:44:50,546 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29a59f06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:50, skipping insertion in model container [2018-01-24 12:44:50,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:44:50" (1/1) ... [2018-01-24 12:44:50,563 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:44:50,603 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:44:50,711 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:44:50,726 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:44:50,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:50 WrapperNode [2018-01-24 12:44:50,733 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:44:50,734 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:44:50,734 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:44:50,734 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:44:50,745 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:50" (1/1) ... [2018-01-24 12:44:50,745 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:50" (1/1) ... [2018-01-24 12:44:50,755 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:50" (1/1) ... [2018-01-24 12:44:50,756 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:50" (1/1) ... [2018-01-24 12:44:50,758 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:50" (1/1) ... [2018-01-24 12:44:50,761 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:50" (1/1) ... [2018-01-24 12:44:50,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:50" (1/1) ... [2018-01-24 12:44:50,763 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:44:50,763 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:44:50,763 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:44:50,764 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:44:50,764 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:50" (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-24 12:44:50,809 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:44:50,810 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:44:50,810 INFO L136 BoogieDeclarations]: Found implementation of procedure bubbleSort [2018-01-24 12:44:50,810 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:44:50,810 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 12:44:50,810 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 12:44:50,810 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:44:50,810 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:44:50,811 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:44:50,811 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:44:50,811 INFO L128 BoogieDeclarations]: Found specification of procedure bubbleSort [2018-01-24 12:44:50,811 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:44:50,811 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:44:50,811 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:44:51,028 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:44:51,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:44:51 BoogieIcfgContainer [2018-01-24 12:44:51,028 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:44:51,029 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:44:51,029 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:44:51,031 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:44:51,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:44:50" (1/3) ... [2018-01-24 12:44:51,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cf3bd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:44:51, skipping insertion in model container [2018-01-24 12:44:51,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:50" (2/3) ... [2018-01-24 12:44:51,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cf3bd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:44:51, skipping insertion in model container [2018-01-24 12:44:51,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:44:51" (3/3) ... [2018-01-24 12:44:51,034 INFO L105 eAbstractionObserver]: Analyzing ICFG bubblesort-alloca_true-valid-memsafety_true-termination.i [2018-01-24 12:44:51,040 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:44:51,045 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-01-24 12:44:51,086 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:44:51,086 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:44:51,087 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:44:51,087 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:44:51,087 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:44:51,087 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:44:51,087 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:44:51,087 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:44:51,088 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:44:51,101 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-01-24 12:44:51,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 12:44:51,106 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:44:51,107 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:44:51,107 INFO L371 AbstractCegarLoop]: === Iteration 1 === [bubbleSortErr7RequiresViolation, bubbleSortErr11RequiresViolation, bubbleSortErr0RequiresViolation, bubbleSortErr3RequiresViolation, bubbleSortErr9RequiresViolation, bubbleSortErr1RequiresViolation, bubbleSortErr2RequiresViolation, bubbleSortErr8RequiresViolation, bubbleSortErr6RequiresViolation, bubbleSortErr10RequiresViolation, bubbleSortErr4RequiresViolation, bubbleSortErr5RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 12:44:51,112 INFO L82 PathProgramCache]: Analyzing trace with hash 334121063, now seen corresponding path program 1 times [2018-01-24 12:44:51,115 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:44:51,157 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:51,158 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:44:51,158 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:51,158 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:44:51,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:44:51,214 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:44:51,343 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-24 12:44:51,345 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:44:51,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:44:51,346 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:44:51,349 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:44:51,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:44:51,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:44:51,362 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 6 states. [2018-01-24 12:44:51,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:44:51,646 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2018-01-24 12:44:51,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:44:51,648 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-01-24 12:44:51,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:44:51,655 INFO L225 Difference]: With dead ends: 79 [2018-01-24 12:44:51,655 INFO L226 Difference]: Without dead ends: 39 [2018-01-24 12:44:51,658 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:44:51,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-24 12:44:51,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-01-24 12:44:51,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-24 12:44:51,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-01-24 12:44:51,688 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 16 [2018-01-24 12:44:51,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:44:51,688 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-01-24 12:44:51,688 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:44:51,689 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-01-24 12:44:51,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 12:44:51,689 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:44:51,689 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:44:51,689 INFO L371 AbstractCegarLoop]: === Iteration 2 === [bubbleSortErr7RequiresViolation, bubbleSortErr11RequiresViolation, bubbleSortErr0RequiresViolation, bubbleSortErr3RequiresViolation, bubbleSortErr9RequiresViolation, bubbleSortErr1RequiresViolation, bubbleSortErr2RequiresViolation, bubbleSortErr8RequiresViolation, bubbleSortErr6RequiresViolation, bubbleSortErr10RequiresViolation, bubbleSortErr4RequiresViolation, bubbleSortErr5RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 12:44:51,690 INFO L82 PathProgramCache]: Analyzing trace with hash 334121064, now seen corresponding path program 1 times [2018-01-24 12:44:51,690 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:44:51,690 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:51,691 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:44:51,691 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:51,691 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:44:51,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:44:51,715 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:44:51,891 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-24 12:44:51,891 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:44:51,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:44:51,891 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:44:51,893 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:44:51,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:44:51,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:44:51,894 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 8 states. [2018-01-24 12:44:52,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:44:52,282 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-01-24 12:44:52,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:44:52,283 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-01-24 12:44:52,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:44:52,287 INFO L225 Difference]: With dead ends: 62 [2018-01-24 12:44:52,287 INFO L226 Difference]: Without dead ends: 56 [2018-01-24 12:44:52,288 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-01-24 12:44:52,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-24 12:44:52,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2018-01-24 12:44:52,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 12:44:52,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-01-24 12:44:52,298 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 16 [2018-01-24 12:44:52,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:44:52,298 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-01-24 12:44:52,298 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:44:52,299 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-01-24 12:44:52,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 12:44:52,299 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:44:52,300 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:44:52,300 INFO L371 AbstractCegarLoop]: === Iteration 3 === [bubbleSortErr7RequiresViolation, bubbleSortErr11RequiresViolation, bubbleSortErr0RequiresViolation, bubbleSortErr3RequiresViolation, bubbleSortErr9RequiresViolation, bubbleSortErr1RequiresViolation, bubbleSortErr2RequiresViolation, bubbleSortErr8RequiresViolation, bubbleSortErr6RequiresViolation, bubbleSortErr10RequiresViolation, bubbleSortErr4RequiresViolation, bubbleSortErr5RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 12:44:52,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1789385763, now seen corresponding path program 1 times [2018-01-24 12:44:52,300 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:44:52,301 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:52,302 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:44:52,302 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:52,302 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:44:52,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:44:52,315 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:44:52,362 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-24 12:44:52,363 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:44:52,363 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:44:52,363 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:44:52,363 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:44:52,363 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:44:52,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:44:52,364 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 5 states. [2018-01-24 12:44:52,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:44:52,408 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2018-01-24 12:44:52,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:44:52,409 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-24 12:44:52,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:44:52,412 INFO L225 Difference]: With dead ends: 89 [2018-01-24 12:44:52,412 INFO L226 Difference]: Without dead ends: 82 [2018-01-24 12:44:52,412 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-24 12:44:52,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-24 12:44:52,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 52. [2018-01-24 12:44:52,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 12:44:52,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-01-24 12:44:52,424 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 19 [2018-01-24 12:44:52,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:44:52,424 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-01-24 12:44:52,425 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:44:52,425 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-01-24 12:44:52,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 12:44:52,426 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:44:52,426 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:44:52,426 INFO L371 AbstractCegarLoop]: === Iteration 4 === [bubbleSortErr7RequiresViolation, bubbleSortErr11RequiresViolation, bubbleSortErr0RequiresViolation, bubbleSortErr3RequiresViolation, bubbleSortErr9RequiresViolation, bubbleSortErr1RequiresViolation, bubbleSortErr2RequiresViolation, bubbleSortErr8RequiresViolation, bubbleSortErr6RequiresViolation, bubbleSortErr10RequiresViolation, bubbleSortErr4RequiresViolation, bubbleSortErr5RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 12:44:52,427 INFO L82 PathProgramCache]: Analyzing trace with hash -120775682, now seen corresponding path program 1 times [2018-01-24 12:44:52,427 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:44:52,428 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:52,428 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:44:52,428 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:52,428 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:44:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:44:52,443 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:44:52,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:44:52,518 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:44:52,518 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:44:52,519 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:44:52,519 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:44:52,519 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:44:52,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:44:52,520 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 5 states. [2018-01-24 12:44:52,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:44:52,575 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2018-01-24 12:44:52,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:44:52,575 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-24 12:44:52,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:44:52,576 INFO L225 Difference]: With dead ends: 58 [2018-01-24 12:44:52,576 INFO L226 Difference]: Without dead ends: 53 [2018-01-24 12:44:52,576 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:44:52,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-24 12:44:52,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 40. [2018-01-24 12:44:52,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-24 12:44:52,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-01-24 12:44:52,582 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 22 [2018-01-24 12:44:52,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:44:52,582 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-01-24 12:44:52,582 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:44:52,583 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-01-24 12:44:52,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 12:44:52,583 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:44:52,583 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:44:52,583 INFO L371 AbstractCegarLoop]: === Iteration 5 === [bubbleSortErr7RequiresViolation, bubbleSortErr11RequiresViolation, bubbleSortErr0RequiresViolation, bubbleSortErr3RequiresViolation, bubbleSortErr9RequiresViolation, bubbleSortErr1RequiresViolation, bubbleSortErr2RequiresViolation, bubbleSortErr8RequiresViolation, bubbleSortErr6RequiresViolation, bubbleSortErr10RequiresViolation, bubbleSortErr4RequiresViolation, bubbleSortErr5RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 12:44:52,584 INFO L82 PathProgramCache]: Analyzing trace with hash 550921116, now seen corresponding path program 1 times [2018-01-24 12:44:52,584 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:44:52,585 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:52,585 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:44:52,585 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:52,585 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:44:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:44:52,598 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:44:52,705 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:44:52,705 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:44:52,706 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:44:52,716 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:44:52,716 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:44:52,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:44:52,756 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:44:52,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 12:44:52,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:44:52,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:44:52,796 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-24 12:44:53,150 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:44:53,150 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:44:53,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:44:53,433 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:44:53,433 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 12:44:53,437 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:44:53,437 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:44:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:44:53,464 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:44:53,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 12:44:53,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:44:53,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:44:53,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-24 12:44:53,882 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:44:53,882 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:44:53,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:44:54,000 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:44:54,000 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 23 [2018-01-24 12:44:54,000 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:44:54,000 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 12:44:54,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 12:44:54,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=471, Unknown=1, NotChecked=0, Total=552 [2018-01-24 12:44:54,001 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 14 states. [2018-01-24 12:44:54,465 WARN L146 SmtUtils]: Spent 289ms on a formula simplification. DAG size of input: 43 DAG size of output 32 [2018-01-24 12:44:54,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:44:54,504 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-01-24 12:44:54,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:44:54,504 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-01-24 12:44:54,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:44:54,505 INFO L225 Difference]: With dead ends: 40 [2018-01-24 12:44:54,505 INFO L226 Difference]: Without dead ends: 39 [2018-01-24 12:44:54,505 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 72 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=133, Invalid=622, Unknown=1, NotChecked=0, Total=756 [2018-01-24 12:44:54,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-24 12:44:54,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2018-01-24 12:44:54,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-24 12:44:54,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-01-24 12:44:54,511 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 23 [2018-01-24 12:44:54,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:44:54,512 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-01-24 12:44:54,512 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 12:44:54,512 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-01-24 12:44:54,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 12:44:54,513 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:44:54,513 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:44:54,513 INFO L371 AbstractCegarLoop]: === Iteration 6 === [bubbleSortErr7RequiresViolation, bubbleSortErr11RequiresViolation, bubbleSortErr0RequiresViolation, bubbleSortErr3RequiresViolation, bubbleSortErr9RequiresViolation, bubbleSortErr1RequiresViolation, bubbleSortErr2RequiresViolation, bubbleSortErr8RequiresViolation, bubbleSortErr6RequiresViolation, bubbleSortErr10RequiresViolation, bubbleSortErr4RequiresViolation, bubbleSortErr5RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 12:44:54,514 INFO L82 PathProgramCache]: Analyzing trace with hash -996967546, now seen corresponding path program 1 times [2018-01-24 12:44:54,514 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:44:54,515 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:54,515 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:44:54,515 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:54,515 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:44:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:44:54,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:44:54,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:44:54,573 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:44:54,573 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:44:54,574 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:44:54,574 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:44:54,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:44:54,574 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:44:54,574 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 4 states. [2018-01-24 12:44:54,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:44:54,628 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-01-24 12:44:54,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:44:54,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-01-24 12:44:54,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:44:54,629 INFO L225 Difference]: With dead ends: 35 [2018-01-24 12:44:54,629 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 12:44:54,630 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-24 12:44:54,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 12:44:54,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 12:44:54,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 12:44:54,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 12:44:54,631 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2018-01-24 12:44:54,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:44:54,631 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 12:44:54,631 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:44:54,631 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 12:44:54,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 12:44:54,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 12:44:55,224 WARN L146 SmtUtils]: Spent 514ms on a formula simplification. DAG size of input: 61 DAG size of output 46 [2018-01-24 12:44:55,286 INFO L401 ceAbstractionStarter]: For program point bubbleSortErr2RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-24 12:44:55,286 INFO L401 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-24 12:44:55,286 INFO L401 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-01-24 12:44:55,286 INFO L401 ceAbstractionStarter]: For program point L544(lines 544 550) no Hoare annotation was computed. [2018-01-24 12:44:55,286 INFO L401 ceAbstractionStarter]: For program point bubbleSortErr3RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-24 12:44:55,286 INFO L401 ceAbstractionStarter]: For program point L543(lines 543 551) no Hoare annotation was computed. [2018-01-24 12:44:55,286 INFO L401 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-01-24 12:44:55,286 INFO L401 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-01-24 12:44:55,286 INFO L401 ceAbstractionStarter]: For program point bubbleSortErr1RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-24 12:44:55,286 INFO L401 ceAbstractionStarter]: For program point bubbleSortErr4RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-24 12:44:55,286 INFO L401 ceAbstractionStarter]: For program point L546'(line 546) no Hoare annotation was computed. [2018-01-24 12:44:55,287 INFO L401 ceAbstractionStarter]: For program point bubbleSortErr0RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-24 12:44:55,287 INFO L401 ceAbstractionStarter]: For program point bubbleSortErr10RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-24 12:44:55,287 INFO L397 ceAbstractionStarter]: At program point L543'''(lines 543 551) the Hoare annotation is: (or (not (exists ((v_main_~array_size~6_BEFORE_CALL_2 Int)) (and (<= |bubbleSort_#in~array_size| v_main_~array_size~6_BEFORE_CALL_2) (= (* 4 v_main_~array_size~6_BEFORE_CALL_2) (select |#length| |bubbleSort_#in~numbers.base|))))) (and (exists ((v_main_~array_size~6_BEFORE_CALL_1 Int)) (and (<= (+ bubbleSort_~i~2 1) v_main_~array_size~6_BEFORE_CALL_1) (= (* 4 v_main_~array_size~6_BEFORE_CALL_1) (select |#length| bubbleSort_~numbers.base)))) (and (= bubbleSort_~numbers.offset 0) (= 1 (select |#valid| bubbleSort_~numbers.base)))) (not (= (select |#valid| |bubbleSort_#in~numbers.base|) 1)) (not (= 0 |bubbleSort_#in~numbers.offset|))) [2018-01-24 12:44:55,287 INFO L401 ceAbstractionStarter]: For program point bubbleSortErr6RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-24 12:44:55,287 INFO L401 ceAbstractionStarter]: For program point L545''(line 545) no Hoare annotation was computed. [2018-01-24 12:44:55,287 INFO L401 ceAbstractionStarter]: For program point L543''(lines 543 551) no Hoare annotation was computed. [2018-01-24 12:44:55,287 INFO L401 ceAbstractionStarter]: For program point L547'(line 547) no Hoare annotation was computed. [2018-01-24 12:44:55,287 INFO L401 ceAbstractionStarter]: For program point L547''(line 547) no Hoare annotation was computed. [2018-01-24 12:44:55,287 INFO L397 ceAbstractionStarter]: At program point L544'''(lines 544 550) the Hoare annotation is: (or (let ((.cse0 (= bubbleSort_~numbers.offset 0)) (.cse1 (exists ((v_main_~array_size~6_BEFORE_CALL_1 Int)) (and (<= (+ bubbleSort_~i~2 1) v_main_~array_size~6_BEFORE_CALL_1) (= (* 4 v_main_~array_size~6_BEFORE_CALL_1) (select |#length| bubbleSort_~numbers.base))))) (.cse2 (= 1 (select |#valid| bubbleSort_~numbers.base)))) (or (and .cse0 (= bubbleSort_~j~2 1) .cse1 .cse2) (let ((.cse3 (+ (* 4 bubbleSort_~j~2) bubbleSort_~numbers.offset))) (and .cse0 (<= 8 .cse3) .cse1 (<= .cse3 (select |#length| bubbleSort_~numbers.base)) .cse2)))) (not (exists ((v_main_~array_size~6_BEFORE_CALL_2 Int)) (and (<= |bubbleSort_#in~array_size| v_main_~array_size~6_BEFORE_CALL_2) (= (* 4 v_main_~array_size~6_BEFORE_CALL_2) (select |#length| |bubbleSort_#in~numbers.base|))))) (not (= (select |#valid| |bubbleSort_#in~numbers.base|) 1)) (not (= 0 |bubbleSort_#in~numbers.offset|))) [2018-01-24 12:44:55,287 INFO L401 ceAbstractionStarter]: For program point bubbleSortErr7RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-24 12:44:55,288 INFO L401 ceAbstractionStarter]: For program point L543''''(lines 543 551) no Hoare annotation was computed. [2018-01-24 12:44:55,288 INFO L401 ceAbstractionStarter]: For program point bubbleSortErr8RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-24 12:44:55,288 INFO L401 ceAbstractionStarter]: For program point bubbleSortErr9RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-24 12:44:55,288 INFO L401 ceAbstractionStarter]: For program point bubbleSortEXIT(lines 540 552) no Hoare annotation was computed. [2018-01-24 12:44:55,288 INFO L401 ceAbstractionStarter]: For program point bubbleSortErr5RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-24 12:44:55,288 INFO L401 ceAbstractionStarter]: For program point bubbleSortErr11RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-24 12:44:55,288 INFO L401 ceAbstractionStarter]: For program point L545'(line 545) no Hoare annotation was computed. [2018-01-24 12:44:55,288 INFO L401 ceAbstractionStarter]: For program point L544''(lines 544 550) no Hoare annotation was computed. [2018-01-24 12:44:55,288 INFO L404 ceAbstractionStarter]: At program point bubbleSortENTRY(lines 540 552) the Hoare annotation is: true [2018-01-24 12:44:55,288 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 561) no Hoare annotation was computed. [2018-01-24 12:44:55,288 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 561) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 12:44:55,288 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 561) no Hoare annotation was computed. [2018-01-24 12:44:55,288 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 561) the Hoare annotation is: true [2018-01-24 12:44:55,288 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 561) no Hoare annotation was computed. [2018-01-24 12:44:55,289 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 561) the Hoare annotation is: true [2018-01-24 12:44:55,289 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 561) no Hoare annotation was computed. [2018-01-24 12:44:55,289 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 553 561) no Hoare annotation was computed. [2018-01-24 12:44:55,289 INFO L401 ceAbstractionStarter]: For program point L555(lines 555 557) no Hoare annotation was computed. [2018-01-24 12:44:55,289 INFO L397 ceAbstractionStarter]: At program point L559(line 559) the Hoare annotation is: (let ((.cse0 (* 4 main_~array_size~6))) (and (= .cse0 (select |#length| |main_#t~malloc9.base|)) (= 0 |main_#t~malloc9.offset|) (= 0 main_~numbers~6.offset) (<= 1 main_~array_size~6) (= 1 (select |#valid| |main_#t~malloc9.base|)) (= 1 (select |#valid| main_~numbers~6.base)) (= (store |#valid| |main_#t~malloc9.base| 0) |old(#valid)|) (= .cse0 (select |#length| main_~numbers~6.base)))) [2018-01-24 12:44:55,289 INFO L401 ceAbstractionStarter]: For program point L558(line 558) no Hoare annotation was computed. [2018-01-24 12:44:55,289 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 553 561) no Hoare annotation was computed. [2018-01-24 12:44:55,289 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 553 561) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 12:44:55,289 INFO L401 ceAbstractionStarter]: For program point L558''(line 558) no Hoare annotation was computed. [2018-01-24 12:44:55,289 INFO L401 ceAbstractionStarter]: For program point L558'(line 558) no Hoare annotation was computed. [2018-01-24 12:44:55,289 INFO L401 ceAbstractionStarter]: For program point L555''(lines 555 557) no Hoare annotation was computed. [2018-01-24 12:44:55,289 INFO L401 ceAbstractionStarter]: For program point L559'(line 559) no Hoare annotation was computed. [2018-01-24 12:44:55,290 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 553 561) no Hoare annotation was computed. [2018-01-24 12:44:55,294 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:44:55,295 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:44:55,296 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:44:55,296 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:44:55,296 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:44:55,296 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:44:55,298 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:55,298 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:55,298 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:55,299 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:55,303 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:44:55,303 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:44:55,303 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:44:55,303 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:44:55,304 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:44:55,304 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:44:55,304 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:55,305 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:55,305 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:55,305 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:55,308 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:44:55,308 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:44:55,309 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:44:55,309 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:44:55,309 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:55,309 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:55,311 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:44:55,311 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:44:55,312 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:44:55,312 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:44:55,312 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:55,312 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:55,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:44:55 BoogieIcfgContainer [2018-01-24 12:44:55,315 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:44:55,316 INFO L168 Benchmark]: Toolchain (without parser) took 4783.47 ms. Allocated memory was 308.3 MB in the beginning and 502.3 MB in the end (delta: 194.0 MB). Free memory was 268.2 MB in the beginning and 439.3 MB in the end (delta: -171.1 MB). Peak memory consumption was 131.8 MB. Max. memory is 5.3 GB. [2018-01-24 12:44:55,317 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 308.3 MB. Free memory is still 274.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:44:55,318 INFO L168 Benchmark]: CACSL2BoogieTranslator took 194.70 ms. Allocated memory is still 308.3 MB. Free memory was 267.2 MB in the beginning and 257.1 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-24 12:44:55,318 INFO L168 Benchmark]: Boogie Preprocessor took 29.58 ms. Allocated memory is still 308.3 MB. Free memory was 257.1 MB in the beginning and 255.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:44:55,318 INFO L168 Benchmark]: RCFGBuilder took 264.93 ms. Allocated memory is still 308.3 MB. Free memory was 255.1 MB in the beginning and 238.1 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:44:55,319 INFO L168 Benchmark]: TraceAbstraction took 4285.88 ms. Allocated memory was 308.3 MB in the beginning and 502.3 MB in the end (delta: 194.0 MB). Free memory was 237.1 MB in the beginning and 439.3 MB in the end (delta: -202.2 MB). Peak memory consumption was 100.7 MB. Max. memory is 5.3 GB. [2018-01-24 12:44:55,321 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.23 ms. Allocated memory is still 308.3 MB. Free memory is still 274.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 194.70 ms. Allocated memory is still 308.3 MB. Free memory was 267.2 MB in the beginning and 257.1 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.58 ms. Allocated memory is still 308.3 MB. Free memory was 257.1 MB in the beginning and 255.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 264.93 ms. Allocated memory is still 308.3 MB. Free memory was 255.1 MB in the beginning and 238.1 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 4285.88 ms. Allocated memory was 308.3 MB in the beginning and 502.3 MB in the end (delta: 194.0 MB). Free memory was 237.1 MB in the beginning and 439.3 MB in the end (delta: -202.2 MB). Peak memory consumption was 100.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 553]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 13 specifications checked. All of them hold - InvariantResult [Line: 544]: Loop Invariant [2018-01-24 12:44:55,325 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:44:55,326 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:44:55,326 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:44:55,326 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:44:55,326 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:44:55,326 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:44:55,326 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:55,327 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:55,327 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:55,327 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:55,329 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:44:55,329 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:44:55,329 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:44:55,329 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:44:55,330 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:44:55,330 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:44:55,330 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:55,330 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:55,330 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:55,330 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((numbers == 0 && j == 1) && (\exists v_main_~array_size~6_BEFORE_CALL_1 : int :: i + 1 <= v_main_~array_size~6_BEFORE_CALL_1 && 4 * v_main_~array_size~6_BEFORE_CALL_1 == unknown-#length-unknown[numbers])) && 1 == \valid[numbers]) || ((((numbers == 0 && 8 <= 4 * j + numbers) && (\exists v_main_~array_size~6_BEFORE_CALL_1 : int :: i + 1 <= v_main_~array_size~6_BEFORE_CALL_1 && 4 * v_main_~array_size~6_BEFORE_CALL_1 == unknown-#length-unknown[numbers])) && 4 * j + numbers <= unknown-#length-unknown[numbers]) && 1 == \valid[numbers])) || !(\exists v_main_~array_size~6_BEFORE_CALL_2 : int :: \old(array_size) <= v_main_~array_size~6_BEFORE_CALL_2 && 4 * v_main_~array_size~6_BEFORE_CALL_2 == unknown-#length-unknown[numbers])) || !(\valid[numbers] == 1)) || !(0 == numbers) - InvariantResult [Line: 543]: Loop Invariant [2018-01-24 12:44:55,331 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:44:55,331 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:44:55,331 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:44:55,331 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:44:55,332 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:55,332 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:55,332 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:44:55,332 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:44:55,332 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:44:55,333 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:44:55,333 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:55,333 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((!(\exists v_main_~array_size~6_BEFORE_CALL_2 : int :: \old(array_size) <= v_main_~array_size~6_BEFORE_CALL_2 && 4 * v_main_~array_size~6_BEFORE_CALL_2 == unknown-#length-unknown[numbers]) || ((\exists v_main_~array_size~6_BEFORE_CALL_1 : int :: i + 1 <= v_main_~array_size~6_BEFORE_CALL_1 && 4 * v_main_~array_size~6_BEFORE_CALL_1 == unknown-#length-unknown[numbers]) && numbers == 0 && 1 == \valid[numbers])) || !(\valid[numbers] == 1)) || !(0 == numbers) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 48 locations, 13 error locations. SAFE Result, 4.2s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 172 SDtfs, 348 SDslu, 389 SDs, 0 SdLazy, 414 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 79 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=3, 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, 6 MinimizatonAttempts, 53 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 11 NumberOfFragments, 187 HoareAnnotationTreeSize, 8 FomulaSimplifications, 284 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 258 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 166 NumberOfCodeBlocks, 166 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 202 ConstructedInterpolants, 52 QuantifiedInterpolants, 37569 SizeOfPredicates, 20 NumberOfNonLiveVariables, 180 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 10 InterpolantComputations, 5 PerfectInterpolantSequences, 15/25 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/bubblesort-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-44-55-338.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/bubblesort-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_12-44-55-338.csv Received shutdown request...