java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/memsafety-ext2/length_test03_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-47db877 [2018-01-23 14:33:23,512 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-23 14:33:23,514 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-23 14:33:23,530 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-23 14:33:23,530 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-23 14:33:23,531 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-23 14:33:23,532 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-23 14:33:23,534 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-23 14:33:23,536 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-23 14:33:23,537 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-23 14:33:23,538 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-23 14:33:23,538 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-23 14:33:23,539 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-23 14:33:23,541 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-23 14:33:23,541 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-23 14:33:23,544 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-23 14:33:23,546 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-23 14:33:23,548 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-23 14:33:23,549 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-23 14:33:23,550 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-23 14:33:23,552 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-23 14:33:23,553 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-23 14:33:23,553 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-23 14:33:23,554 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-23 14:33:23,555 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-23 14:33:23,556 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-23 14:33:23,556 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-23 14:33:23,557 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-23 14:33:23,557 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-23 14:33:23,557 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-23 14:33:23,558 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-23 14:33:23,558 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf [2018-01-23 14:33:23,568 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-23 14:33:23,568 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-23 14:33:23,569 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-23 14:33:23,569 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-23 14:33:23,569 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-23 14:33:23,569 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-23 14:33:23,570 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-23 14:33:23,570 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-23 14:33:23,570 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-23 14:33:23,571 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-23 14:33:23,571 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-23 14:33:23,571 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-23 14:33:23,571 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-23 14:33:23,571 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-23 14:33:23,572 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-23 14:33:23,572 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-23 14:33:23,572 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-23 14:33:23,572 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-23 14:33:23,572 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-23 14:33:23,573 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-23 14:33:23,573 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-23 14:33:23,573 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-23 14:33:23,573 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-23 14:33:23,573 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-23 14:33:23,573 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-23 14:33:23,574 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-23 14:33:23,574 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-23 14:33:23,574 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-23 14:33:23,574 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-23 14:33:23,574 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-23 14:33:23,575 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-23 14:33:23,575 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-23 14:33:23,575 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-23 14:33:23,575 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-23 14:33:23,575 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-23 14:33:23,576 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-23 14:33:23,576 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-23 14:33:23,611 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-23 14:33:23,623 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-23 14:33:23,627 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-23 14:33:23,628 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-23 14:33:23,629 INFO L276 PluginConnector]: CDTParser initialized [2018-01-23 14:33:23,630 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/length_test03_true-valid-memsafety.i [2018-01-23 14:33:23,836 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-23 14:33:23,840 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-23 14:33:23,841 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-23 14:33:23,841 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-23 14:33:23,846 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-23 14:33:23,847 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:33:23" (1/1) ... [2018-01-23 14:33:23,849 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41741684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:33:23, skipping insertion in model container [2018-01-23 14:33:23,849 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:33:23" (1/1) ... [2018-01-23 14:33:23,862 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:33:23,900 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:33:24,020 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:33:24,044 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:33:24,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:33:24 WrapperNode [2018-01-23 14:33:24,054 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-23 14:33:24,055 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-23 14:33:24,055 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-23 14:33:24,055 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-23 14:33:24,070 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:33:24" (1/1) ... [2018-01-23 14:33:24,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:33:24" (1/1) ... [2018-01-23 14:33:24,080 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:33:24" (1/1) ... [2018-01-23 14:33:24,080 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:33:24" (1/1) ... [2018-01-23 14:33:24,087 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:33:24" (1/1) ... [2018-01-23 14:33:24,091 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:33:24" (1/1) ... [2018-01-23 14:33:24,092 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:33:24" (1/1) ... [2018-01-23 14:33:24,095 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-23 14:33:24,096 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-23 14:33:24,096 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-23 14:33:24,096 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-23 14:33:24,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:33:24" (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-23 14:33:24,144 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-23 14:33:24,145 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-23 14:33:24,145 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-23 14:33:24,145 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-23 14:33:24,145 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-23 14:33:24,145 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-23 14:33:24,145 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-23 14:33:24,145 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-23 14:33:24,145 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-23 14:33:24,145 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-23 14:33:24,146 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-23 14:33:24,146 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-23 14:33:24,146 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-01-23 14:33:24,146 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-23 14:33:24,146 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-23 14:33:24,146 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-23 14:33:24,146 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-23 14:33:24,146 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-23 14:33:24,464 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-23 14:33:24,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:33:24 BoogieIcfgContainer [2018-01-23 14:33:24,465 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-23 14:33:24,466 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-23 14:33:24,466 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-23 14:33:24,468 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-23 14:33:24,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 02:33:23" (1/3) ... [2018-01-23 14:33:24,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e936bb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:33:24, skipping insertion in model container [2018-01-23 14:33:24,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:33:24" (2/3) ... [2018-01-23 14:33:24,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e936bb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:33:24, skipping insertion in model container [2018-01-23 14:33:24,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:33:24" (3/3) ... [2018-01-23 14:33:24,473 INFO L105 eAbstractionObserver]: Analyzing ICFG length_test03_true-valid-memsafety.i [2018-01-23 14:33:24,479 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-23 14:33:24,485 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-23 14:33:24,533 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:33:24,533 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:33:24,533 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:33:24,533 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:33:24,534 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:33:24,534 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:33:24,534 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:33:24,534 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-23 14:33:24,535 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:33:24,552 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2018-01-23 14:33:24,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-23 14:33:24,558 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:24,559 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-23 14:33:24,559 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-23 14:33:24,564 INFO L82 PathProgramCache]: Analyzing trace with hash 159493, now seen corresponding path program 1 times [2018-01-23 14:33:24,565 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:24,566 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:24,606 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:24,606 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:24,607 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:24,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:33:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:33:24,656 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:33:24,662 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:33:24,669 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:33:24,669 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:33:24,669 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:33:24,669 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:33:24,670 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:33:24,670 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:33:24,670 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:33:24,670 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-23 14:33:24,670 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:33:24,673 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2018-01-23 14:33:24,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-23 14:33:24,677 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:24,677 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:33:24,677 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:33:24,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1690254578, now seen corresponding path program 1 times [2018-01-23 14:33:24,678 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:24,678 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:24,679 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:24,679 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:24,679 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:24,724 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:24,779 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-23 14:33:24,782 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:33:24,782 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:33:24,783 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:33:24,884 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:33:24,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:33:24,886 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 2 states. [2018-01-23 14:33:24,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:24,912 INFO L93 Difference]: Finished difference Result 141 states and 158 transitions. [2018-01-23 14:33:24,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:33:24,913 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 34 [2018-01-23 14:33:24,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:24,923 INFO L225 Difference]: With dead ends: 141 [2018-01-23 14:33:24,924 INFO L226 Difference]: Without dead ends: 76 [2018-01-23 14:33:24,926 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:33:24,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-23 14:33:24,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-01-23 14:33:24,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-23 14:33:24,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-01-23 14:33:24,964 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 34 [2018-01-23 14:33:24,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:24,964 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-01-23 14:33:24,965 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:33:24,965 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-01-23 14:33:24,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-23 14:33:24,968 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:24,968 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:33:24,968 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:33:24,968 INFO L82 PathProgramCache]: Analyzing trace with hash -767510167, now seen corresponding path program 1 times [2018-01-23 14:33:24,968 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:24,969 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:24,969 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:24,970 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:24,970 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:25,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:25,004 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:25,063 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-23 14:33:25,063 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:33:25,064 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:33:25,065 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:33:25,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:33:25,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:33:25,066 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 3 states. [2018-01-23 14:33:25,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:25,095 INFO L93 Difference]: Finished difference Result 139 states and 154 transitions. [2018-01-23 14:33:25,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:33:25,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-01-23 14:33:25,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:25,097 INFO L225 Difference]: With dead ends: 139 [2018-01-23 14:33:25,097 INFO L226 Difference]: Without dead ends: 77 [2018-01-23 14:33:25,098 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:33:25,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-23 14:33:25,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-01-23 14:33:25,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-23 14:33:25,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-01-23 14:33:25,104 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 54 [2018-01-23 14:33:25,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:25,105 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-01-23 14:33:25,105 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:33:25,105 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-01-23 14:33:25,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-23 14:33:25,107 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:25,107 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:33:25,107 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:33:25,107 INFO L82 PathProgramCache]: Analyzing trace with hash 667417900, now seen corresponding path program 1 times [2018-01-23 14:33:25,107 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:25,107 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:25,108 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:25,108 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:25,108 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:25,148 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:25,210 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-23 14:33:25,210 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:33:25,210 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:33:25,211 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:33:25,211 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:33:25,211 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:33:25,211 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 3 states. [2018-01-23 14:33:25,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:25,251 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2018-01-23 14:33:25,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:33:25,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-01-23 14:33:25,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:25,253 INFO L225 Difference]: With dead ends: 117 [2018-01-23 14:33:25,254 INFO L226 Difference]: Without dead ends: 88 [2018-01-23 14:33:25,254 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:33:25,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-23 14:33:25,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2018-01-23 14:33:25,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-23 14:33:25,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2018-01-23 14:33:25,265 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 56 [2018-01-23 14:33:25,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:25,265 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2018-01-23 14:33:25,266 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:33:25,266 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2018-01-23 14:33:25,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-01-23 14:33:25,268 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:25,269 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-01-23 14:33:25,269 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:33:25,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1090926838, now seen corresponding path program 1 times [2018-01-23 14:33:25,269 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:25,269 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:25,270 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:25,271 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:25,271 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:25,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:25,305 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:25,383 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-23 14:33:25,384 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:33:25,384 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-23 14:33:25,393 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:25,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:25,481 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:33:25,527 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|append_#t~malloc0.base| Int)) (and (<= (select |c_old(#valid)| |append_#t~malloc0.base|) 0) (= |c_#valid| (store |c_old(#valid)| |append_#t~malloc0.base| 1)))) is different from true [2018-01-23 14:33:25,574 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-23 14:33:25,609 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:33:25,609 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-01-23 14:33:25,610 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:33:25,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:33:25,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2018-01-23 14:33:25,611 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 5 states. [2018-01-23 14:33:25,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:25,688 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2018-01-23 14:33:25,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:33:25,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2018-01-23 14:33:25,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:25,689 INFO L225 Difference]: With dead ends: 108 [2018-01-23 14:33:25,689 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:33:25,691 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2018-01-23 14:33:25,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:33:25,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:33:25,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:33:25,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:33:25,693 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2018-01-23 14:33:25,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:25,693 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:33:25,693 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:33:25,693 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:33:25,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:33:25,698 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:33:25,698 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:33:25,698 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:33:25,698 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:33:25,698 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:33:25,699 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:33:25,699 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:33:25,699 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-23 14:33:25,699 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:33:25,701 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2018-01-23 14:33:25,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-23 14:33:25,703 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:25,703 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:33:25,703 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-23 14:33:25,703 INFO L82 PathProgramCache]: Analyzing trace with hash -315559237, now seen corresponding path program 1 times [2018-01-23 14:33:25,704 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:25,704 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:25,705 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:25,705 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:25,705 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:25,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:25,715 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:25,726 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-23 14:33:25,726 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:33:25,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:33:25,727 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:33:25,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:33:25,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:33:25,728 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 2 states. [2018-01-23 14:33:25,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:25,733 INFO L93 Difference]: Finished difference Result 141 states and 158 transitions. [2018-01-23 14:33:25,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:33:25,734 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-01-23 14:33:25,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:25,735 INFO L225 Difference]: With dead ends: 141 [2018-01-23 14:33:25,735 INFO L226 Difference]: Without dead ends: 74 [2018-01-23 14:33:25,736 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:33:25,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-23 14:33:25,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-23 14:33:25,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-23 14:33:25,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-01-23 14:33:25,743 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 32 [2018-01-23 14:33:25,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:25,743 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-01-23 14:33:25,778 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:33:25,778 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-01-23 14:33:25,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-23 14:33:25,780 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:25,780 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:33:25,780 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-23 14:33:25,780 INFO L82 PathProgramCache]: Analyzing trace with hash 2131042546, now seen corresponding path program 1 times [2018-01-23 14:33:25,780 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:25,780 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:25,781 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:25,781 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:25,782 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:25,796 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:25,830 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-23 14:33:25,830 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:33:25,830 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:33:25,831 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:33:25,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:33:25,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:33:25,831 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 3 states. [2018-01-23 14:33:25,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:25,842 INFO L93 Difference]: Finished difference Result 135 states and 150 transitions. [2018-01-23 14:33:25,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:33:25,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-01-23 14:33:25,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:25,843 INFO L225 Difference]: With dead ends: 135 [2018-01-23 14:33:25,843 INFO L226 Difference]: Without dead ends: 75 [2018-01-23 14:33:25,843 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:33:25,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-23 14:33:25,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-01-23 14:33:25,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-23 14:33:25,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2018-01-23 14:33:25,848 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 52 [2018-01-23 14:33:25,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:25,849 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2018-01-23 14:33:25,849 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:33:25,849 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2018-01-23 14:33:25,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-23 14:33:25,850 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:25,850 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:33:25,850 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-23 14:33:25,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1509918347, now seen corresponding path program 1 times [2018-01-23 14:33:25,851 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:25,851 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:25,852 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:25,852 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:25,852 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:25,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:25,873 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:25,910 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-23 14:33:25,911 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:33:25,911 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:33:25,911 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:33:25,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:33:25,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:33:25,912 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 3 states. [2018-01-23 14:33:25,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:25,944 INFO L93 Difference]: Finished difference Result 113 states and 123 transitions. [2018-01-23 14:33:25,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:33:25,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-01-23 14:33:25,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:25,956 INFO L225 Difference]: With dead ends: 113 [2018-01-23 14:33:25,956 INFO L226 Difference]: Without dead ends: 86 [2018-01-23 14:33:25,956 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:33:25,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-23 14:33:25,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2018-01-23 14:33:25,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-23 14:33:25,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-01-23 14:33:25,966 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 54 [2018-01-23 14:33:25,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:25,966 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-01-23 14:33:25,966 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:33:25,966 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-01-23 14:33:25,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-23 14:33:25,967 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:25,968 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-01-23 14:33:25,968 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-23 14:33:25,968 INFO L82 PathProgramCache]: Analyzing trace with hash 407838655, now seen corresponding path program 1 times [2018-01-23 14:33:25,968 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:25,968 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:25,969 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:25,969 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:25,969 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:25,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:25,991 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:26,048 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-23 14:33:26,048 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:33:26,048 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:33:26,057 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:26,125 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:33:26,133 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|append_#t~malloc0.base| Int)) (and (<= (select |c_old(#valid)| |append_#t~malloc0.base|) 0) (= |c_#valid| (store |c_old(#valid)| |append_#t~malloc0.base| 1)))) is different from true [2018-01-23 14:33:26,166 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-23 14:33:26,199 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:33:26,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-01-23 14:33:26,200 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:33:26,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:33:26,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2018-01-23 14:33:26,201 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 5 states. [2018-01-23 14:33:26,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:26,261 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2018-01-23 14:33:26,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:33:26,261 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2018-01-23 14:33:26,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:26,261 INFO L225 Difference]: With dead ends: 106 [2018-01-23 14:33:26,261 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:33:26,262 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2018-01-23 14:33:26,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:33:26,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:33:26,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:33:26,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:33:26,263 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 81 [2018-01-23 14:33:26,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:26,264 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:33:26,264 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:33:26,264 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:33:26,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:33:26,266 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:33:26,266 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:33:26,266 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:33:26,266 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:33:26,267 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:33:26,267 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:33:26,267 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:33:26,267 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == appendErr0EnsuresViolation======== [2018-01-23 14:33:26,267 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:33:26,269 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2018-01-23 14:33:26,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-23 14:33:26,270 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:26,270 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:33:26,270 INFO L371 AbstractCegarLoop]: === Iteration 1 === [appendErr0EnsuresViolation]=== [2018-01-23 14:33:26,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1183827267, now seen corresponding path program 1 times [2018-01-23 14:33:26,271 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:26,271 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:26,272 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:26,272 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:26,272 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:26,281 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:26,308 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-23 14:33:26,308 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:33:26,308 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:33:26,308 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:33:26,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:33:26,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:33:26,309 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 3 states. [2018-01-23 14:33:26,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:26,322 INFO L93 Difference]: Finished difference Result 146 states and 169 transitions. [2018-01-23 14:33:26,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:33:26,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-01-23 14:33:26,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:26,323 INFO L225 Difference]: With dead ends: 146 [2018-01-23 14:33:26,323 INFO L226 Difference]: Without dead ends: 49 [2018-01-23 14:33:26,324 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:33:26,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-23 14:33:26,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-23 14:33:26,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-23 14:33:26,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-01-23 14:33:26,328 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 29 [2018-01-23 14:33:26,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:26,329 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-01-23 14:33:26,329 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:33:26,329 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-01-23 14:33:26,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-23 14:33:26,329 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:26,330 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:33:26,330 INFO L371 AbstractCegarLoop]: === Iteration 2 === [appendErr0EnsuresViolation]=== [2018-01-23 14:33:26,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1135019040, now seen corresponding path program 1 times [2018-01-23 14:33:26,330 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:26,330 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:26,331 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:26,331 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:26,331 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:33:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:33:26,385 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:33:26,393 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:33:26,399 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:33:26,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.01 02:33:26 BoogieIcfgContainer [2018-01-23 14:33:26,414 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-23 14:33:26,415 INFO L168 Benchmark]: Toolchain (without parser) took 2579.22 ms. Allocated memory was 305.1 MB in the beginning and 487.1 MB in the end (delta: 181.9 MB). Free memory was 263.4 MB in the beginning and 382.2 MB in the end (delta: -118.8 MB). Peak memory consumption was 63.2 MB. Max. memory is 5.3 GB. [2018-01-23 14:33:26,417 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 305.1 MB. Free memory is still 269.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-23 14:33:26,417 INFO L168 Benchmark]: CACSL2BoogieTranslator took 213.24 ms. Allocated memory is still 305.1 MB. Free memory was 262.4 MB in the beginning and 251.5 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:33:26,418 INFO L168 Benchmark]: Boogie Preprocessor took 40.64 ms. Allocated memory is still 305.1 MB. Free memory was 251.5 MB in the beginning and 249.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:33:26,418 INFO L168 Benchmark]: RCFGBuilder took 369.40 ms. Allocated memory is still 305.1 MB. Free memory was 249.5 MB in the beginning and 223.9 MB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 5.3 GB. [2018-01-23 14:33:26,418 INFO L168 Benchmark]: TraceAbstraction took 1948.53 ms. Allocated memory was 305.1 MB in the beginning and 487.1 MB in the end (delta: 181.9 MB). Free memory was 223.9 MB in the beginning and 382.2 MB in the end (delta: -158.3 MB). Peak memory consumption was 23.6 MB. Max. memory is 5.3 GB. [2018-01-23 14:33:26,420 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.19 ms. Allocated memory is still 305.1 MB. Free memory is still 269.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 213.24 ms. Allocated memory is still 305.1 MB. Free memory was 262.4 MB in the beginning and 251.5 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.64 ms. Allocated memory is still 305.1 MB. Free memory was 251.5 MB in the beginning and 249.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 369.40 ms. Allocated memory is still 305.1 MB. Free memory was 249.5 MB in the beginning and 223.9 MB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1948.53 ms. Allocated memory was 305.1 MB in the beginning and 487.1 MB in the end (delta: 181.9 MB). Free memory was 223.9 MB in the beginning and 382.2 MB in the end (delta: -158.3 MB). Peak memory consumption was 23.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 4 procedures, 80 locations, 4 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 80 locations, 4 error locations. SAFE Result, 1.0s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 283 SDtfs, 20 SDslu, 187 SDs, 0 SdLazy, 32 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred 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, 4 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 310 NumberOfCodeBlocks, 310 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 305 ConstructedInterpolants, 13 QuantifiedInterpolants, 37290 SizeOfPredicates, 3 NumberOfNonLiveVariables, 302 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 24/40 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 554]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 4 procedures, 80 locations, 4 error locations. SAFE Result, 0.5s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 279 SDtfs, 20 SDslu, 183 SDs, 0 SdLazy, 32 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 300 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 295 ConstructedInterpolants, 13 QuantifiedInterpolants, 35674 SizeOfPredicates, 3 NumberOfNonLiveVariables, 299 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 24/40 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 539]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L555] EXPR, FCALL malloc(sizeof *list) VAL [malloc(sizeof *list)={19:0}] [L555] struct list_t *list = malloc(sizeof *list); VAL [list={19:0}, malloc(sizeof *list)={19:0}] [L556] FCALL list->first = ((void *)0) VAL [list={19:0}, malloc(sizeof *list)={19:0}] [L557] FCALL list->last = ((void *)0) VAL [list={19:0}, malloc(sizeof *list)={19:0}] [L558] EXPR, FCALL malloc(sizeof *list2) VAL [list={19:0}, malloc(sizeof *list)={19:0}, malloc(sizeof *list2)={16:0}] [L558] struct list_t *list2 = malloc(sizeof *list2); VAL [list={19:0}, list2={16:0}, malloc(sizeof *list)={19:0}, malloc(sizeof *list2)={16:0}] [L559] FCALL list2->first = ((void *)0) VAL [list={19:0}, list2={16:0}, malloc(sizeof *list)={19:0}, malloc(sizeof *list2)={16:0}] [L560] FCALL list2->last = ((void *)0) VAL [list={19:0}, list2={16:0}, malloc(sizeof *list)={19:0}, malloc(sizeof *list2)={16:0}] [L561] char userInput; VAL [list={19:0}, list2={16:0}, malloc(sizeof *list)={19:0}, malloc(sizeof *list2)={16:0}] [L563] char userInput = __VERIFIER_nondet_char(); [L564] CALL append(list, userInput) VAL [\old(input)=0, head={19:0}] [L540] EXPR, FCALL malloc(sizeof *node) VAL [\old(input)=0, head={19:0}, head={19:0}, input=0, malloc(sizeof *node)={12:0}] [L540] struct node_t *node = malloc(sizeof *node); VAL [\old(input)=0, head={19:0}, head={19:0}, input=0, malloc(sizeof *node)={12:0}, node={12:0}] [L541] FCALL node->data = input VAL [\old(input)=0, head={19:0}, head={19:0}, input=0, malloc(sizeof *node)={12:0}, node={12:0}] [L542] EXPR, FCALL head->first VAL [\old(input)=0, head={19:0}, head={19:0}, head->first={0:0}, input=0, malloc(sizeof *node)={12:0}, node={12:0}] [L542] head->first == ((void *)0) && head->last == ((void *)0) VAL [\old(input)=0, head={19:0}, head={19:0}, head->first={0:0}, head->first == ((void *)0) && head->last == ((void *)0)=1, input=0, malloc(sizeof *node)={12:0}, node={12:0}] [L542] EXPR, FCALL head->last VAL [\old(input)=0, head={19:0}, head={19:0}, head->first={0:0}, head->first == ((void *)0) && head->last == ((void *)0)=1, head->last={0:0}, input=0, malloc(sizeof *node)={12:0}, node={12:0}] [L542] head->first == ((void *)0) && head->last == ((void *)0) VAL [\old(input)=0, head={19:0}, head={19:0}, head->first={0:0}, head->first == ((void *)0) && head->last == ((void *)0)=1, head->last={0:0}, input=0, malloc(sizeof *node)={12:0}, node={12:0}] [L542] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L543] FCALL head->first = node VAL [\old(input)=0, head={19:0}, head={19:0}, input=0, malloc(sizeof *node)={12:0}, node={12:0}] [L544] FCALL head->last= node VAL [\old(input)=0, head={19:0}, head={19:0}, input=0, malloc(sizeof *node)={12:0}, node={12:0}] [L545] FCALL node->prev = ((void *)0) VAL [\old(input)=0, head={19:0}, head={19:0}, input=0, malloc(sizeof *node)={12:0}, node={12:0}] [L546] FCALL node->next = ((void *)0) VAL [\old(input)=0, head={19:0}, head={19:0}, input=0, malloc(sizeof *node)={12:0}, node={12:0}] - StatisticsResult: Ultimate Automizer benchmark data for error location: appendErr0EnsuresViolation CFG has 4 procedures, 80 locations, 4 error locations. UNSAFE Result, 0.1s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 85 SDtfs, 0 SDslu, 80 SDs, 0 SdLazy, 6 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 60 NumberOfCodeBlocks, 60 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 28 ConstructedInterpolants, 0 QuantifiedInterpolants, 812 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/length_test03_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-23_14-33-26-429.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/length_test03_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-23_14-33-26-429.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/length_test03_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-23_14-33-26-429.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/length_test03_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-23_14-33-26-429.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/length_test03_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-23_14-33-26-429.csv Received shutdown request...