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/ldv-memsafety/memleaks_test19_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-47db877 [2018-01-23 14:48:03,630 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-23 14:48:03,632 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-23 14:48:03,647 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-23 14:48:03,647 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-23 14:48:03,648 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-23 14:48:03,649 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-23 14:48:03,650 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-23 14:48:03,652 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-23 14:48:03,653 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-23 14:48:03,653 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-23 14:48:03,654 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-23 14:48:03,655 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-23 14:48:03,656 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-23 14:48:03,657 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-23 14:48:03,660 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-23 14:48:03,662 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-23 14:48:03,664 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-23 14:48:03,666 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-23 14:48:03,667 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-23 14:48:03,669 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-23 14:48:03,670 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-23 14:48:03,670 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-23 14:48:03,671 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-23 14:48:03,672 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-23 14:48:03,673 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-23 14:48:03,673 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-23 14:48:03,674 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-23 14:48:03,674 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-23 14:48:03,675 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-23 14:48:03,675 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-23 14:48:03,676 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:48:03,686 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-23 14:48:03,686 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-23 14:48:03,687 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-23 14:48:03,687 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-23 14:48:03,687 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-23 14:48:03,688 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-23 14:48:03,688 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-23 14:48:03,688 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-23 14:48:03,689 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-23 14:48:03,689 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-23 14:48:03,689 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-23 14:48:03,689 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-23 14:48:03,689 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-23 14:48:03,690 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-23 14:48:03,690 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-23 14:48:03,690 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-23 14:48:03,690 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-23 14:48:03,690 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-23 14:48:03,691 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-23 14:48:03,691 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-23 14:48:03,691 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-23 14:48:03,691 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-23 14:48:03,691 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-23 14:48:03,692 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-23 14:48:03,692 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-23 14:48:03,692 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-23 14:48:03,692 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-23 14:48:03,693 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-23 14:48:03,693 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-23 14:48:03,693 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-23 14:48:03,693 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-23 14:48:03,693 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-23 14:48:03,693 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-23 14:48:03,694 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-23 14:48:03,694 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-23 14:48:03,695 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-23 14:48:03,695 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-23 14:48:03,730 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-23 14:48:03,741 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-23 14:48:03,744 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-23 14:48:03,745 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-23 14:48:03,745 INFO L276 PluginConnector]: CDTParser initialized [2018-01-23 14:48:03,746 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test19_true-valid-memsafety_true-termination.i [2018-01-23 14:48:03,947 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-23 14:48:03,952 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-23 14:48:03,953 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-23 14:48:03,953 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-23 14:48:03,958 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-23 14:48:03,959 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:48:03" (1/1) ... [2018-01-23 14:48:03,962 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c4b3da0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:48:03, skipping insertion in model container [2018-01-23 14:48:03,962 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:48:03" (1/1) ... [2018-01-23 14:48:03,976 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:48:04,024 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:48:04,142 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:48:04,159 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:48:04,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:48:04 WrapperNode [2018-01-23 14:48:04,168 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-23 14:48:04,169 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-23 14:48:04,169 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-23 14:48:04,169 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-23 14:48:04,186 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:48:04" (1/1) ... [2018-01-23 14:48:04,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:48:04" (1/1) ... [2018-01-23 14:48:04,198 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:48:04" (1/1) ... [2018-01-23 14:48:04,198 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:48:04" (1/1) ... [2018-01-23 14:48:04,202 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:48:04" (1/1) ... [2018-01-23 14:48:04,203 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:48:04" (1/1) ... [2018-01-23 14:48:04,205 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:48:04" (1/1) ... [2018-01-23 14:48:04,206 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-23 14:48:04,207 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-23 14:48:04,207 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-23 14:48:04,207 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-23 14:48:04,208 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:48:04" (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:48:04,259 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-23 14:48:04,259 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-23 14:48:04,260 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-23 14:48:04,260 INFO L136 BoogieDeclarations]: Found implementation of procedure f19 [2018-01-23 14:48:04,260 INFO L136 BoogieDeclarations]: Found implementation of procedure f19_undo [2018-01-23 14:48:04,260 INFO L136 BoogieDeclarations]: Found implementation of procedure g19 [2018-01-23 14:48:04,260 INFO L136 BoogieDeclarations]: Found implementation of procedure probe_19 [2018-01-23 14:48:04,260 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_19 [2018-01-23 14:48:04,261 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-23 14:48:04,261 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-23 14:48:04,261 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-23 14:48:04,261 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-23 14:48:04,261 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-23 14:48:04,261 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-23 14:48:04,262 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-23 14:48:04,262 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-23 14:48:04,262 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-23 14:48:04,262 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-23 14:48:04,262 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-23 14:48:04,262 INFO L128 BoogieDeclarations]: Found specification of procedure f19 [2018-01-23 14:48:04,263 INFO L128 BoogieDeclarations]: Found specification of procedure f19_undo [2018-01-23 14:48:04,263 INFO L128 BoogieDeclarations]: Found specification of procedure g19 [2018-01-23 14:48:04,263 INFO L128 BoogieDeclarations]: Found specification of procedure probe_19 [2018-01-23 14:48:04,263 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_19 [2018-01-23 14:48:04,263 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-23 14:48:04,264 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-23 14:48:04,264 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-23 14:48:04,264 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-23 14:48:04,512 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-23 14:48:04,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:48:04 BoogieIcfgContainer [2018-01-23 14:48:04,513 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-23 14:48:04,514 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-23 14:48:04,514 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-23 14:48:04,517 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-23 14:48:04,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 02:48:03" (1/3) ... [2018-01-23 14:48:04,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@473fce73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:48:04, skipping insertion in model container [2018-01-23 14:48:04,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:48:04" (2/3) ... [2018-01-23 14:48:04,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@473fce73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:48:04, skipping insertion in model container [2018-01-23 14:48:04,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:48:04" (3/3) ... [2018-01-23 14:48:04,520 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test19_true-valid-memsafety_true-termination.i [2018-01-23 14:48:04,528 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-23 14:48:04,534 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2018-01-23 14:48:04,573 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:48:04,573 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:48:04,573 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:48:04,574 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:48:04,574 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:48:04,574 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:48:04,574 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:48:04,574 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == disconnect_19Err0EnsuresViolation======== [2018-01-23 14:48:04,575 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:48:04,592 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2018-01-23 14:48:04,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-23 14:48:04,600 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:48:04,601 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] [2018-01-23 14:48:04,601 INFO L371 AbstractCegarLoop]: === Iteration 1 === [disconnect_19Err0EnsuresViolation]=== [2018-01-23 14:48:04,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1982394711, now seen corresponding path program 1 times [2018-01-23 14:48:04,607 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:48:04,607 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:48:04,655 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:48:04,655 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:48:04,655 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:48:04,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:48:04,739 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:48:04,929 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:48:04,932 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:48:04,933 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-23 14:48:04,935 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-23 14:48:05,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-23 14:48:05,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-23 14:48:05,018 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 6 states. [2018-01-23 14:48:05,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:48:05,103 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2018-01-23 14:48:05,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-23 14:48:05,105 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-01-23 14:48:05,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:48:05,116 INFO L225 Difference]: With dead ends: 116 [2018-01-23 14:48:05,116 INFO L226 Difference]: Without dead ends: 60 [2018-01-23 14:48:05,120 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-23 14:48:05,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-23 14:48:05,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-01-23 14:48:05,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-23 14:48:05,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-01-23 14:48:05,169 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 36 [2018-01-23 14:48:05,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:48:05,172 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-01-23 14:48:05,172 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-23 14:48:05,172 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-01-23 14:48:05,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-23 14:48:05,175 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:48:05,175 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:05,176 INFO L371 AbstractCegarLoop]: === Iteration 2 === [disconnect_19Err0EnsuresViolation]=== [2018-01-23 14:48:05,176 INFO L82 PathProgramCache]: Analyzing trace with hash 904331275, now seen corresponding path program 1 times [2018-01-23 14:48:05,176 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:48:05,176 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:48:05,178 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:48:05,178 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:48:05,178 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:48:05,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:48:05,204 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:48:05,373 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-23 14:48:05,373 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:48:05,373 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:48:05,384 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:48:05,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:48:05,452 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:48:05,526 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-23 14:48:05,562 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:48:05,562 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2018-01-23 14:48:05,563 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-23 14:48:05,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-23 14:48:05,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-23 14:48:05,564 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 9 states. [2018-01-23 14:48:05,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:48:05,669 INFO L93 Difference]: Finished difference Result 118 states and 129 transitions. [2018-01-23 14:48:05,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-23 14:48:05,670 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-01-23 14:48:05,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:48:05,672 INFO L225 Difference]: With dead ends: 118 [2018-01-23 14:48:05,672 INFO L226 Difference]: Without dead ends: 68 [2018-01-23 14:48:05,674 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-23 14:48:05,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-23 14:48:05,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2018-01-23 14:48:05,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-23 14:48:05,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2018-01-23 14:48:05,684 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 54 [2018-01-23 14:48:05,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:48:05,685 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2018-01-23 14:48:05,685 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-23 14:48:05,685 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2018-01-23 14:48:05,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-23 14:48:05,687 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:48:05,687 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:05,688 INFO L371 AbstractCegarLoop]: === Iteration 3 === [disconnect_19Err0EnsuresViolation]=== [2018-01-23 14:48:05,688 INFO L82 PathProgramCache]: Analyzing trace with hash -46966680, now seen corresponding path program 1 times [2018-01-23 14:48:05,688 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:48:05,688 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:48:05,690 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:48:05,690 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:48:05,690 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:48:05,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:48:05,712 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:48:05,770 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:48:05,770 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:48:05,770 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:48:05,781 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:48:05,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:48:05,830 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:48:05,845 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc1.base| 1)) (<= (select |c_old(#valid)| |ldv_malloc_#t~malloc1.base|) 0))) is different from true [2018-01-23 14:48:05,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-23 14:48:05,883 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:48:05,883 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-01-23 14:48:05,884 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:48:05,884 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:48:05,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2018-01-23 14:48:05,885 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 5 states. [2018-01-23 14:48:05,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:48:05,947 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2018-01-23 14:48:05,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:48:05,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-01-23 14:48:05,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:48:05,948 INFO L225 Difference]: With dead ends: 73 [2018-01-23 14:48:05,948 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:48:05,949 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=12, Unknown=2, NotChecked=6, Total=30 [2018-01-23 14:48:05,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:48:05,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:48:05,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:48:05,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:48:05,950 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2018-01-23 14:48:05,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:48:05,950 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:48:05,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:48:05,951 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:48:05,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:48:05,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-23 14:48:06,018 INFO L401 ceAbstractionStarter]: For program point disconnect_19FINAL(lines 1477 1480) no Hoare annotation was computed. [2018-01-23 14:48:06,018 INFO L401 ceAbstractionStarter]: For program point disconnect_19EXIT(lines 1477 1480) no Hoare annotation was computed. [2018-01-23 14:48:06,018 INFO L401 ceAbstractionStarter]: For program point disconnect_19Err0EnsuresViolation(lines 1477 1480) no Hoare annotation was computed. [2018-01-23 14:48:06,018 INFO L401 ceAbstractionStarter]: For program point L1478(line 1478) no Hoare annotation was computed. [2018-01-23 14:48:06,019 INFO L404 ceAbstractionStarter]: At program point L1479(line 1479) the Hoare annotation is: true [2018-01-23 14:48:06,019 INFO L404 ceAbstractionStarter]: At program point disconnect_19ENTRY(lines 1477 1480) the Hoare annotation is: true [2018-01-23 14:48:06,019 INFO L401 ceAbstractionStarter]: For program point L1478'(line 1478) no Hoare annotation was computed. [2018-01-23 14:48:06,019 INFO L401 ceAbstractionStarter]: For program point L1478''(line 1478) no Hoare annotation was computed. [2018-01-23 14:48:06,019 INFO L397 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:48:06,019 INFO L401 ceAbstractionStarter]: For program point L1073(lines 1073 1077) no Hoare annotation was computed. [2018-01-23 14:48:06,019 INFO L401 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-23 14:48:06,019 INFO L401 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-23 14:48:06,020 INFO L401 ceAbstractionStarter]: For program point ldv_mallocErr0EnsuresViolation(lines 1072 1078) no Hoare annotation was computed. [2018-01-23 14:48:06,020 INFO L401 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-23 14:48:06,020 INFO L401 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-23 14:48:06,020 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 1492) no Hoare annotation was computed. [2018-01-23 14:48:06,020 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1492) no Hoare annotation was computed. [2018-01-23 14:48:06,020 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1492) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:48:06,020 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1492) no Hoare annotation was computed. [2018-01-23 14:48:06,020 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1492) the Hoare annotation is: true [2018-01-23 14:48:06,021 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1492) no Hoare annotation was computed. [2018-01-23 14:48:06,021 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 1492) the Hoare annotation is: true [2018-01-23 14:48:06,021 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 1492) no Hoare annotation was computed. [2018-01-23 14:48:06,021 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1492) no Hoare annotation was computed. [2018-01-23 14:48:06,021 INFO L401 ceAbstractionStarter]: For program point L1447(line 1447) no Hoare annotation was computed. [2018-01-23 14:48:06,021 INFO L401 ceAbstractionStarter]: For program point f19_undoEXIT(lines 1446 1448) no Hoare annotation was computed. [2018-01-23 14:48:06,021 INFO L401 ceAbstractionStarter]: For program point f19_undoErr0EnsuresViolation(lines 1446 1448) no Hoare annotation was computed. [2018-01-23 14:48:06,021 INFO L404 ceAbstractionStarter]: At program point f19_undoENTRY(lines 1446 1448) the Hoare annotation is: true [2018-01-23 14:48:06,022 INFO L401 ceAbstractionStarter]: For program point L1447'(line 1447) no Hoare annotation was computed. [2018-01-23 14:48:06,022 INFO L401 ceAbstractionStarter]: For program point L1447''(line 1447) no Hoare annotation was computed. [2018-01-23 14:48:06,022 INFO L401 ceAbstractionStarter]: For program point f19_undoFINAL(lines 1446 1448) no Hoare annotation was computed. [2018-01-23 14:48:06,022 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 1490 1492) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:48:06,022 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 1490 1492) no Hoare annotation was computed. [2018-01-23 14:48:06,022 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 1490 1492) no Hoare annotation was computed. [2018-01-23 14:48:06,022 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1490 1492) no Hoare annotation was computed. [2018-01-23 14:48:06,022 INFO L401 ceAbstractionStarter]: For program point L1485'(lines 1485 1487) no Hoare annotation was computed. [2018-01-23 14:48:06,023 INFO L401 ceAbstractionStarter]: For program point L1483'(line 1483) no Hoare annotation was computed. [2018-01-23 14:48:06,023 INFO L401 ceAbstractionStarter]: For program point entry_pointErr0EnsuresViolation(lines 1482 1488) no Hoare annotation was computed. [2018-01-23 14:48:06,023 INFO L401 ceAbstractionStarter]: For program point L1485(lines 1485 1487) no Hoare annotation was computed. [2018-01-23 14:48:06,023 INFO L401 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1482 1488) no Hoare annotation was computed. [2018-01-23 14:48:06,023 INFO L397 ceAbstractionStarter]: At program point L1486(line 1486) the Hoare annotation is: false [2018-01-23 14:48:06,023 INFO L397 ceAbstractionStarter]: At program point L1483(line 1483) the Hoare annotation is: (not (= |#valid| |old(#valid)|)) [2018-01-23 14:48:06,023 INFO L401 ceAbstractionStarter]: For program point L1484(line 1484) no Hoare annotation was computed. [2018-01-23 14:48:06,023 INFO L397 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1482 1488) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:48:06,024 INFO L401 ceAbstractionStarter]: For program point entry_pointFINAL(lines 1482 1488) no Hoare annotation was computed. [2018-01-23 14:48:06,024 INFO L401 ceAbstractionStarter]: For program point g19Err0EnsuresViolation(lines 1450 1452) no Hoare annotation was computed. [2018-01-23 14:48:06,024 INFO L404 ceAbstractionStarter]: At program point g19ENTRY(lines 1450 1452) the Hoare annotation is: true [2018-01-23 14:48:06,024 INFO L401 ceAbstractionStarter]: For program point g19FINAL(lines 1450 1452) no Hoare annotation was computed. [2018-01-23 14:48:06,024 INFO L401 ceAbstractionStarter]: For program point g19EXIT(lines 1450 1452) no Hoare annotation was computed. [2018-01-23 14:48:06,024 INFO L401 ceAbstractionStarter]: For program point L1441'(line 1441) no Hoare annotation was computed. [2018-01-23 14:48:06,024 INFO L401 ceAbstractionStarter]: For program point f19EXIT(lines 1439 1444) no Hoare annotation was computed. [2018-01-23 14:48:06,024 INFO L401 ceAbstractionStarter]: For program point f19FINAL(lines 1439 1444) no Hoare annotation was computed. [2018-01-23 14:48:06,025 INFO L401 ceAbstractionStarter]: For program point L1440'(line 1440) no Hoare annotation was computed. [2018-01-23 14:48:06,025 INFO L401 ceAbstractionStarter]: For program point L1440''(line 1440) no Hoare annotation was computed. [2018-01-23 14:48:06,025 INFO L401 ceAbstractionStarter]: For program point f19Err0EnsuresViolation(lines 1439 1444) no Hoare annotation was computed. [2018-01-23 14:48:06,025 INFO L404 ceAbstractionStarter]: At program point f19ENTRY(lines 1439 1444) the Hoare annotation is: true [2018-01-23 14:48:06,025 INFO L401 ceAbstractionStarter]: For program point L1441(line 1441) no Hoare annotation was computed. [2018-01-23 14:48:06,025 INFO L404 ceAbstractionStarter]: At program point L1440(line 1440) the Hoare annotation is: true [2018-01-23 14:48:06,025 INFO L401 ceAbstractionStarter]: For program point probe_19Err0EnsuresViolation(lines 1454 1475) no Hoare annotation was computed. [2018-01-23 14:48:06,026 INFO L401 ceAbstractionStarter]: For program point probe_19FINAL(lines 1454 1475) no Hoare annotation was computed. [2018-01-23 14:48:06,026 INFO L401 ceAbstractionStarter]: For program point L1472(line 1472) no Hoare annotation was computed. [2018-01-23 14:48:06,026 INFO L401 ceAbstractionStarter]: For program point L1457'(line 1457) no Hoare annotation was computed. [2018-01-23 14:48:06,026 INFO L397 ceAbstractionStarter]: At program point L1473(lines 1473 1474) the Hoare annotation is: (<= 3 probe_19_~ret~10) [2018-01-23 14:48:06,026 INFO L397 ceAbstractionStarter]: At program point L1470(line 1470) the Hoare annotation is: false [2018-01-23 14:48:06,026 INFO L397 ceAbstractionStarter]: At program point probe_19ENTRY(lines 1454 1475) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:48:06,026 INFO L401 ceAbstractionStarter]: For program point L1458(line 1458) no Hoare annotation was computed. [2018-01-23 14:48:06,027 INFO L397 ceAbstractionStarter]: At program point L1457(line 1457) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (<= 3 probe_19_~ret~10)) [2018-01-23 14:48:06,027 INFO L401 ceAbstractionStarter]: For program point L1457''(line 1457) no Hoare annotation was computed. [2018-01-23 14:48:06,027 INFO L401 ceAbstractionStarter]: For program point L1464''(lines 1464 1467) no Hoare annotation was computed. [2018-01-23 14:48:06,027 INFO L401 ceAbstractionStarter]: For program point L1464'(line 1464) no Hoare annotation was computed. [2018-01-23 14:48:06,027 INFO L401 ceAbstractionStarter]: For program point L1460'(line 1460) no Hoare annotation was computed. [2018-01-23 14:48:06,027 INFO L401 ceAbstractionStarter]: For program point L1472'(line 1472) no Hoare annotation was computed. [2018-01-23 14:48:06,027 INFO L397 ceAbstractionStarter]: At program point L1466(line 1466) the Hoare annotation is: false [2018-01-23 14:48:06,027 INFO L397 ceAbstractionStarter]: At program point L1464(line 1464) the Hoare annotation is: false [2018-01-23 14:48:06,027 INFO L401 ceAbstractionStarter]: For program point L1461(lines 1461 1463) no Hoare annotation was computed. [2018-01-23 14:48:06,028 INFO L401 ceAbstractionStarter]: For program point L1458'(line 1458) no Hoare annotation was computed. [2018-01-23 14:48:06,028 INFO L397 ceAbstractionStarter]: At program point L1460(line 1460) the Hoare annotation is: false [2018-01-23 14:48:06,028 INFO L401 ceAbstractionStarter]: For program point probe_19EXIT(lines 1454 1475) no Hoare annotation was computed. [2018-01-23 14:48:06,032 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:48:06,032 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:48:06,032 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:48:06,032 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:48:06,032 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:48:06,032 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:48:06,032 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:48:06,033 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_mallocErr0EnsuresViolation======== [2018-01-23 14:48:06,033 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:48:06,035 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2018-01-23 14:48:06,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-23 14:48:06,036 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:48:06,036 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:48:06,036 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-23 14:48:06,036 INFO L82 PathProgramCache]: Analyzing trace with hash 993359901, now seen corresponding path program 1 times [2018-01-23 14:48:06,036 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:48:06,036 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:48:06,038 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:48:06,038 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:48:06,038 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:48:06,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:48:06,048 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:48:06,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:48:06,064 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:48:06,064 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:48:06,064 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:48:06,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:48:06,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:48:06,065 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 3 states. [2018-01-23 14:48:06,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:48:06,223 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2018-01-23 14:48:06,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:48:06,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-01-23 14:48:06,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:48:06,224 INFO L225 Difference]: With dead ends: 83 [2018-01-23 14:48:06,224 INFO L226 Difference]: Without dead ends: 25 [2018-01-23 14:48:06,225 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:48:06,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-01-23 14:48:06,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-01-23 14:48:06,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-01-23 14:48:06,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-01-23 14:48:06,230 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 13 [2018-01-23 14:48:06,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:48:06,230 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-01-23 14:48:06,230 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:48:06,230 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-01-23 14:48:06,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-23 14:48:06,231 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:48:06,231 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:48:06,231 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-23 14:48:06,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1136033055, now seen corresponding path program 1 times [2018-01-23 14:48:06,232 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:48:06,232 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:48:06,233 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:48:06,233 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:48:06,233 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:48:06,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:48:06,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:48:06,280 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:48:06,287 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:48:06,289 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:48:06,303 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:48:06,304 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:48:06,304 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:48:06,304 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:48:06,304 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:48:06,304 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:48:06,304 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:48:06,304 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-23 14:48:06,304 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:48:06,306 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2018-01-23 14:48:06,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-23 14:48:06,307 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:48:06,307 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-23 14:48:06,307 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-23 14:48:06,307 INFO L82 PathProgramCache]: Analyzing trace with hash 126180, now seen corresponding path program 1 times [2018-01-23 14:48:06,307 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:48:06,308 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:48:06,309 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:48:06,309 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:48:06,309 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:48:06,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:48:06,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:48:06,316 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:48:06,317 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:48:06,319 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:48:06,319 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:48:06,320 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:48:06,320 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:48:06,320 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:48:06,320 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:48:06,320 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:48:06,320 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-23 14:48:06,320 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:48:06,322 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2018-01-23 14:48:06,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-23 14:48:06,323 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:48:06,324 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] [2018-01-23 14:48:06,324 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:48:06,324 INFO L82 PathProgramCache]: Analyzing trace with hash 234896565, now seen corresponding path program 1 times [2018-01-23 14:48:06,325 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:48:06,325 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:48:06,326 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:48:06,326 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:48:06,326 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:48:06,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:48:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:48:06,356 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:48:06,359 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:48:06,360 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:48:06,362 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:48:06,363 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:48:06,363 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:48:06,364 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:48:06,368 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:48:06,368 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:48:06,368 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:48:06,368 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:48:06,368 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:48:06,369 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:48:06,369 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:48:06,369 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == f19_undoErr0EnsuresViolation======== [2018-01-23 14:48:06,369 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:48:06,370 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2018-01-23 14:48:06,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-23 14:48:06,372 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:48:06,372 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:48:06,372 INFO L371 AbstractCegarLoop]: === Iteration 1 === [f19_undoErr0EnsuresViolation]=== [2018-01-23 14:48:06,373 INFO L82 PathProgramCache]: Analyzing trace with hash -359604350, now seen corresponding path program 1 times [2018-01-23 14:48:06,373 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:48:06,373 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:48:06,374 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:48:06,374 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:48:06,375 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:48:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:48:06,388 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:48:06,458 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:48:06,458 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:48:06,459 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-23 14:48:06,459 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-23 14:48:06,459 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-23 14:48:06,459 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-23 14:48:06,459 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 6 states. [2018-01-23 14:48:06,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:48:06,493 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2018-01-23 14:48:06,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-23 14:48:06,494 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-01-23 14:48:06,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:48:06,495 INFO L225 Difference]: With dead ends: 116 [2018-01-23 14:48:06,495 INFO L226 Difference]: Without dead ends: 59 [2018-01-23 14:48:06,496 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-23 14:48:06,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-23 14:48:06,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-01-23 14:48:06,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-23 14:48:06,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2018-01-23 14:48:06,507 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 34 [2018-01-23 14:48:06,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:48:06,507 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2018-01-23 14:48:06,507 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-23 14:48:06,507 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2018-01-23 14:48:06,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-23 14:48:06,510 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:48:06,510 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:48:06,511 INFO L371 AbstractCegarLoop]: === Iteration 2 === [f19_undoErr0EnsuresViolation]=== [2018-01-23 14:48:06,511 INFO L82 PathProgramCache]: Analyzing trace with hash -181300129, now seen corresponding path program 1 times [2018-01-23 14:48:06,511 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:48:06,511 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:48:06,512 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:48:06,512 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:48:06,512 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:48:06,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:48:06,522 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:48:06,597 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-23 14:48:06,597 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:48:06,598 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:48:06,609 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:48:06,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:48:06,648 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:48:06,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-23 14:48:06,726 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-23 14:48:06,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:48:06,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:48:06,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:48:06,730 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-01-23 14:48:06,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-23 14:48:06,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-01-23 14:48:06,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:48:06,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:48:06,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:48:06,850 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:7 [2018-01-23 14:48:06,875 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:48:06,900 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:48:06,900 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 16 [2018-01-23 14:48:06,901 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-23 14:48:06,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-23 14:48:06,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-01-23 14:48:06,902 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand 16 states. [2018-01-23 14:48:07,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:48:07,358 INFO L93 Difference]: Finished difference Result 154 states and 167 transitions. [2018-01-23 14:48:07,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-23 14:48:07,359 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 45 [2018-01-23 14:48:07,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:48:07,360 INFO L225 Difference]: With dead ends: 154 [2018-01-23 14:48:07,360 INFO L226 Difference]: Without dead ends: 104 [2018-01-23 14:48:07,361 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2018-01-23 14:48:07,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-23 14:48:07,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2018-01-23 14:48:07,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-23 14:48:07,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2018-01-23 14:48:07,372 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 45 [2018-01-23 14:48:07,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:48:07,373 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2018-01-23 14:48:07,373 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-23 14:48:07,373 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2018-01-23 14:48:07,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-23 14:48:07,374 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:48:07,374 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-23 14:48:07,374 INFO L371 AbstractCegarLoop]: === Iteration 3 === [f19_undoErr0EnsuresViolation]=== [2018-01-23 14:48:07,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1561118879, now seen corresponding path program 1 times [2018-01-23 14:48:07,374 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:48:07,374 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:48:07,375 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:48:07,375 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:48:07,375 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:48:07,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:48:07,387 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:48:07,442 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:48:07,443 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:48:07,443 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:48:07,454 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:48:07,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:48:07,497 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:48:07,508 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc1.base| 1)) (<= (select |c_old(#valid)| |ldv_malloc_#t~malloc1.base|) 0))) is different from true [2018-01-23 14:48:07,516 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-23 14:48:07,537 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:48:07,537 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-01-23 14:48:07,537 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:48:07,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:48:07,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2018-01-23 14:48:07,538 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 5 states. [2018-01-23 14:48:07,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:48:07,564 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2018-01-23 14:48:07,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:48:07,565 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-01-23 14:48:07,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:48:07,565 INFO L225 Difference]: With dead ends: 108 [2018-01-23 14:48:07,565 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:48:07,566 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=12, Unknown=2, NotChecked=6, Total=30 [2018-01-23 14:48:07,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:48:07,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:48:07,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:48:07,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:48:07,566 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2018-01-23 14:48:07,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:48:07,566 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:48:07,567 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:48:07,567 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:48:07,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:48:07,568 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:48:07,568 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:48:07,568 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:48:07,569 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:48:07,569 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:48:07,569 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:48:07,569 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:48:07,569 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-23 14:48:07,569 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:48:07,570 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2018-01-23 14:48:07,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-23 14:48:07,570 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:48:07,570 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] [2018-01-23 14:48:07,570 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-23 14:48:07,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1492491345, now seen corresponding path program 1 times [2018-01-23 14:48:07,571 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:48:07,571 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:48:07,572 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:48:07,572 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:48:07,572 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:48:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:48:07,580 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:48:07,614 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:48:07,614 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:48:07,615 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:48:07,615 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:48:07,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:48:07,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:48:07,616 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 3 states. [2018-01-23 14:48:07,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:48:07,712 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2018-01-23 14:48:07,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:48:07,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-01-23 14:48:07,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:48:07,714 INFO L225 Difference]: With dead ends: 83 [2018-01-23 14:48:07,714 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:48:07,714 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:48:07,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:48:07,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:48:07,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:48:07,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:48:07,715 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-01-23 14:48:07,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:48:07,715 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:48:07,715 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:48:07,715 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:48:07,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:48:07,718 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:48:07,718 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:48:07,718 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:48:07,718 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:48:07,718 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:48:07,718 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:48:07,718 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:48:07,719 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == entry_pointErr0EnsuresViolation======== [2018-01-23 14:48:07,719 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:48:07,720 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2018-01-23 14:48:07,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-23 14:48:07,720 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:48:07,721 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] [2018-01-23 14:48:07,721 INFO L371 AbstractCegarLoop]: === Iteration 1 === [entry_pointErr0EnsuresViolation]=== [2018-01-23 14:48:07,721 INFO L82 PathProgramCache]: Analyzing trace with hash 364926977, now seen corresponding path program 1 times [2018-01-23 14:48:07,721 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:48:07,721 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:48:07,722 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:48:07,722 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:48:07,722 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:48:07,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:48:07,736 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:48:07,800 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:48:07,801 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:48:07,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:48:07,801 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-23 14:48:07,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-23 14:48:07,801 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:48:07,802 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 4 states. [2018-01-23 14:48:07,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:48:07,983 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2018-01-23 14:48:07,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:48:07,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-01-23 14:48:07,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:48:07,984 INFO L225 Difference]: With dead ends: 83 [2018-01-23 14:48:07,984 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:48:07,985 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:48:07,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:48:07,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:48:07,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:48:07,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:48:07,985 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-01-23 14:48:07,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:48:07,986 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:48:07,986 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-23 14:48:07,986 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:48:07,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:48:07,987 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:48:07,987 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:48:07,988 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:48:07,988 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:48:07,988 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:48:07,988 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:48:07,988 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:48:07,988 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == g19Err0EnsuresViolation======== [2018-01-23 14:48:07,988 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:48:07,989 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2018-01-23 14:48:07,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-23 14:48:07,990 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:48:07,990 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:48:07,990 INFO L371 AbstractCegarLoop]: === Iteration 1 === [g19Err0EnsuresViolation]=== [2018-01-23 14:48:07,991 INFO L82 PathProgramCache]: Analyzing trace with hash 276982510, now seen corresponding path program 1 times [2018-01-23 14:48:07,991 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:48:07,991 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:48:07,992 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:48:07,992 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:48:07,992 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:48:08,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:48:08,001 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:48:08,061 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-23 14:48:08,061 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:48:08,061 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:48:08,071 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:48:08,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:48:08,089 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:48:08,093 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-23 14:48:08,114 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:48:08,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [6] total 6 [2018-01-23 14:48:08,114 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-23 14:48:08,114 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-23 14:48:08,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-23 14:48:08,115 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 6 states. [2018-01-23 14:48:08,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:48:08,168 INFO L93 Difference]: Finished difference Result 151 states and 166 transitions. [2018-01-23 14:48:08,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-23 14:48:08,168 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-01-23 14:48:08,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:48:08,168 INFO L225 Difference]: With dead ends: 151 [2018-01-23 14:48:08,168 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:48:08,169 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-23 14:48:08,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:48:08,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:48:08,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:48:08,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:48:08,169 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2018-01-23 14:48:08,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:48:08,170 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:48:08,170 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-23 14:48:08,170 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:48:08,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:48:08,171 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:48:08,171 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:48:08,171 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:48:08,171 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:48:08,171 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:48:08,171 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:48:08,171 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:48:08,171 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == f19Err0EnsuresViolation======== [2018-01-23 14:48:08,171 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:48:08,172 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2018-01-23 14:48:08,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-23 14:48:08,173 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:48:08,173 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:48:08,173 INFO L371 AbstractCegarLoop]: === Iteration 1 === [f19Err0EnsuresViolation]=== [2018-01-23 14:48:08,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1963878671, now seen corresponding path program 1 times [2018-01-23 14:48:08,173 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:48:08,173 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:48:08,175 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:48:08,175 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:48:08,175 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:48:08,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:48:08,183 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:48:08,249 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-23 14:48:08,249 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:48:08,250 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:48:08,257 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:48:08,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:48:08,281 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:48:08,307 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:48:08,328 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:48:08,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2018-01-23 14:48:08,329 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-23 14:48:08,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-23 14:48:08,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-23 14:48:08,329 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 7 states. [2018-01-23 14:48:08,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:48:08,483 INFO L93 Difference]: Finished difference Result 149 states and 169 transitions. [2018-01-23 14:48:08,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-23 14:48:08,484 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-01-23 14:48:08,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:48:08,484 INFO L225 Difference]: With dead ends: 149 [2018-01-23 14:48:08,484 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:48:08,485 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-01-23 14:48:08,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:48:08,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:48:08,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:48:08,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:48:08,485 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2018-01-23 14:48:08,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:48:08,485 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:48:08,485 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-23 14:48:08,485 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:48:08,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:48:08,486 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:48:08,486 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:48:08,486 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:48:08,487 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:48:08,487 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:48:08,487 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:48:08,487 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:48:08,487 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == probe_19Err0EnsuresViolation======== [2018-01-23 14:48:08,487 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:48:08,487 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2018-01-23 14:48:08,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-23 14:48:08,488 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:48:08,488 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:48:08,488 INFO L371 AbstractCegarLoop]: === Iteration 1 === [probe_19Err0EnsuresViolation]=== [2018-01-23 14:48:08,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1465372054, now seen corresponding path program 1 times [2018-01-23 14:48:08,488 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:48:08,488 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:48:08,489 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:48:08,489 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:48:08,489 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:48:08,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:48:08,495 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:48:08,508 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:48:08,509 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:48:08,509 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:48:08,509 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:48:08,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:48:08,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:48:08,509 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 3 states. [2018-01-23 14:48:08,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:48:08,564 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2018-01-23 14:48:08,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:48:08,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-01-23 14:48:08,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:48:08,565 INFO L225 Difference]: With dead ends: 83 [2018-01-23 14:48:08,565 INFO L226 Difference]: Without dead ends: 51 [2018-01-23 14:48:08,565 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:48:08,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-23 14:48:08,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-01-23 14:48:08,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-23 14:48:08,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-01-23 14:48:08,569 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 20 [2018-01-23 14:48:08,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:48:08,570 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-01-23 14:48:08,570 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:48:08,570 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-01-23 14:48:08,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-23 14:48:08,570 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:48:08,570 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:48:08,570 INFO L371 AbstractCegarLoop]: === Iteration 2 === [probe_19Err0EnsuresViolation]=== [2018-01-23 14:48:08,570 INFO L82 PathProgramCache]: Analyzing trace with hash -185941256, now seen corresponding path program 1 times [2018-01-23 14:48:08,571 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:48:08,571 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:48:08,571 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:48:08,571 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:48:08,572 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:48:08,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:48:08,578 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:48:08,645 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-23 14:48:08,645 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:48:08,645 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:48:08,650 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:48:08,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:48:08,669 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:48:08,687 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-23 14:48:08,707 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:48:08,707 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2018-01-23 14:48:08,707 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-23 14:48:08,707 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-23 14:48:08,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-23 14:48:08,708 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 9 states. [2018-01-23 14:48:08,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:48:08,748 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2018-01-23 14:48:08,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-23 14:48:08,749 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-01-23 14:48:08,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:48:08,750 INFO L225 Difference]: With dead ends: 96 [2018-01-23 14:48:08,750 INFO L226 Difference]: Without dead ends: 56 [2018-01-23 14:48:08,751 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-23 14:48:08,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-23 14:48:08,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-01-23 14:48:08,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-23 14:48:08,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-01-23 14:48:08,757 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 38 [2018-01-23 14:48:08,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:48:08,758 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-01-23 14:48:08,758 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-23 14:48:08,758 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-01-23 14:48:08,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-23 14:48:08,759 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:48:08,759 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:48:08,759 INFO L371 AbstractCegarLoop]: === Iteration 3 === [probe_19Err0EnsuresViolation]=== [2018-01-23 14:48:08,759 INFO L82 PathProgramCache]: Analyzing trace with hash 103118165, now seen corresponding path program 1 times [2018-01-23 14:48:08,759 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:48:08,759 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:48:08,760 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:48:08,760 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:48:08,760 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:48:08,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:48:08,766 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:48:08,785 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:48:08,785 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:48:08,785 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:48:08,790 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:48:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:48:08,808 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:48:08,811 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc1.base| 1)) (<= (select |c_old(#valid)| |ldv_malloc_#t~malloc1.base|) 0))) is different from true [2018-01-23 14:48:08,816 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-23 14:48:08,839 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:48:08,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-01-23 14:48:08,839 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:48:08,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:48:08,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2018-01-23 14:48:08,840 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 5 states. [2018-01-23 14:48:08,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:48:08,871 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2018-01-23 14:48:08,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:48:08,871 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-01-23 14:48:08,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:48:08,871 INFO L225 Difference]: With dead ends: 63 [2018-01-23 14:48:08,871 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:48:08,872 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 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:48:08,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:48:08,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:48:08,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:48:08,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:48:08,873 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2018-01-23 14:48:08,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:48:08,873 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:48:08,873 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:48:08,873 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:48:08,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:48:08,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.01 02:48:08 BoogieIcfgContainer [2018-01-23 14:48:08,877 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-23 14:48:08,878 INFO L168 Benchmark]: Toolchain (without parser) took 4929.77 ms. Allocated memory was 308.3 MB in the beginning and 523.2 MB in the end (delta: 215.0 MB). Free memory was 265.6 MB in the beginning and 379.7 MB in the end (delta: -114.1 MB). Peak memory consumption was 100.8 MB. Max. memory is 5.3 GB. [2018-01-23 14:48:08,879 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 308.3 MB. Free memory is still 272.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-23 14:48:08,879 INFO L168 Benchmark]: CACSL2BoogieTranslator took 215.72 ms. Allocated memory is still 308.3 MB. Free memory was 265.6 MB in the beginning and 252.5 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 5.3 GB. [2018-01-23 14:48:08,879 INFO L168 Benchmark]: Boogie Preprocessor took 37.43 ms. Allocated memory is still 308.3 MB. Free memory was 252.5 MB in the beginning and 250.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:48:08,880 INFO L168 Benchmark]: RCFGBuilder took 306.46 ms. Allocated memory is still 308.3 MB. Free memory was 250.5 MB in the beginning and 228.9 MB in the end (delta: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 5.3 GB. [2018-01-23 14:48:08,880 INFO L168 Benchmark]: TraceAbstraction took 4362.66 ms. Allocated memory was 308.3 MB in the beginning and 523.2 MB in the end (delta: 215.0 MB). Free memory was 228.9 MB in the beginning and 379.7 MB in the end (delta: -150.9 MB). Peak memory consumption was 64.1 MB. Max. memory is 5.3 GB. [2018-01-23 14:48:08,882 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.15 ms. Allocated memory is still 308.3 MB. Free memory is still 272.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 215.72 ms. Allocated memory is still 308.3 MB. Free memory was 265.6 MB in the beginning and 252.5 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.43 ms. Allocated memory is still 308.3 MB. Free memory was 252.5 MB in the beginning and 250.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 306.46 ms. Allocated memory is still 308.3 MB. Free memory was 250.5 MB in the beginning and 228.9 MB in the end (delta: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 4362.66 ms. Allocated memory was 308.3 MB in the beginning and 523.2 MB in the end (delta: 215.0 MB). Free memory was 228.9 MB in the beginning and 379.7 MB in the end (delta: -150.9 MB). Peak memory consumption was 64.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1477]: 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: disconnect_19Err0EnsuresViolation CFG has 10 procedures, 78 locations, 10 error locations. SAFE Result, 1.4s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 156 SDtfs, 19 SDslu, 736 SDs, 0 SdLazy, 83 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 34 PreInvPairs, 35 NumberOfFragments, 42 HoareAnnotationTreeSize, 34 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 256 NumberOfCodeBlocks, 256 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 251 ConstructedInterpolants, 2 QuantifiedInterpolants, 19507 SizeOfPredicates, 3 NumberOfNonLiveVariables, 431 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 10/16 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1072]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1491] CALL entry_point() [L1483] FCALL struct A19 a19; VAL [a19={11:0}] [L1484] CALL probe_19(&a19) VAL [a={11:0}] [L1455] int ret = - -3; VAL [a={11:0}, a={11:0}, ret=3] [L1457] CALL ldv_malloc(sizeof(int)) VAL [\old(size)=4] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=4, malloc(size)={10:0}, size=4] [L1074] return malloc(size); VAL [\old(size)=4, \result={10:0}, malloc(size)={10:0}, size=4] - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_mallocErr0EnsuresViolation CFG has 10 procedures, 78 locations, 10 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 66 SDtfs, 31 SDslu, 9 SDs, 0 SdLazy, 35 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred 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, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 216 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 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 10 procedures, 78 locations, 10 error locations. UNSAFE Result, 0.0s 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=78occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1491] CALL entry_point() [L1483] FCALL struct A19 a19; VAL [a19={10:0}] [L1484] CALL, EXPR probe_19(&a19) VAL [a={10:0}] [L1455] int ret = - -3; VAL [a={10:0}, a={10:0}, ret=3] [L1457] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4] [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; VAL [\old(size)=4, \result={0:0}, size=4] [L1457] EXPR ldv_malloc(sizeof(int)) VAL [a={10:0}, a={10:0}, ldv_malloc(sizeof(int))={0:0}, ret=3] [L1457] FCALL a->q = (int *)ldv_malloc(sizeof(int)) VAL [a={10:0}, a={10:0}, ldv_malloc(sizeof(int))={0:0}, ret=3] [L1458] EXPR, FCALL a->q VAL [a={10:0}, a={10:0}, a->q={0:0}, ret=3] [L1458] COND TRUE !a->q [L1474] RET return ret; VAL [\result=3, a={10:0}, a={10:0}, ret=3] [L1484] EXPR probe_19(&a19) VAL [a19={10:0}, probe_19(&a19)=3] [L1484] int ret = probe_19(&a19); [L1485] COND FALSE, RET !(ret==0) VAL [a19={10:0}, ret=3] [L1491] entry_point() - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 10 procedures, 78 locations, 10 error locations. UNSAFE Result, 0.0s 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=78occurred 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, 30 NumberOfCodeBlocks, 30 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: 1446]: 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: f19_undoErr0EnsuresViolation CFG has 10 procedures, 78 locations, 10 error locations. SAFE Result, 1.1s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 135 SDtfs, 115 SDslu, 712 SDs, 0 SdLazy, 450 SolverSat, 51 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 222 NumberOfCodeBlocks, 222 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 217 ConstructedInterpolants, 5 QuantifiedInterpolants, 20869 SizeOfPredicates, 12 NumberOfNonLiveVariables, 382 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 12/20 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1490]: 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 10 procedures, 78 locations, 10 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 66 SDtfs, 33 SDslu, 9 SDs, 0 SdLazy, 35 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred 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, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 891 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 - PositiveResult [Line: 1482]: 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: entry_pointErr0EnsuresViolation CFG has 10 procedures, 78 locations, 10 error locations. SAFE Result, 0.2s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 61 SDtfs, 25 SDslu, 39 SDs, 0 SdLazy, 80 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred 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, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 25 ConstructedInterpolants, 0 QuantifiedInterpolants, 1975 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 - PositiveResult [Line: 1450]: 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: g19Err0EnsuresViolation CFG has 10 procedures, 78 locations, 10 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 2 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 81 SDtfs, 6 SDslu, 314 SDs, 0 SdLazy, 24 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred 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, 72 NumberOfCodeBlocks, 72 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 4550 SizeOfPredicates, 0 NumberOfNonLiveVariables, 156 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 6/8 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1439]: 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: f19Err0EnsuresViolation CFG has 10 procedures, 78 locations, 10 error locations. SAFE Result, 0.3s OverallTime, 1 OverallIterations, 2 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 63 SDtfs, 34 SDslu, 244 SDs, 0 SdLazy, 130 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred 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, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 4060 SizeOfPredicates, 0 NumberOfNonLiveVariables, 140 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 6/8 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1454]: 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: probe_19Err0EnsuresViolation CFG has 10 procedures, 78 locations, 10 error locations. SAFE Result, 0.3s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 127 SDtfs, 31 SDslu, 340 SDs, 0 SdLazy, 96 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 176 NumberOfCodeBlocks, 176 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 171 ConstructedInterpolants, 2 QuantifiedInterpolants, 10751 SizeOfPredicates, 3 NumberOfNonLiveVariables, 329 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 10/16 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - InvariantResult [Line: 1470]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1466]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1473]: Loop Invariant Derived loop invariant: 3 <= ret RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test19_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-23_14-48-08-893.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test19_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-23_14-48-08-893.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test19_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-23_14-48-08-893.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test19_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-23_14-48-08-893.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test19_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-23_14-48-08-893.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test19_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-23_14-48-08-893.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test19_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-23_14-48-08-893.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test19_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-6-2018-01-23_14-48-08-893.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test19_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-7-2018-01-23_14-48-08-893.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test19_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-8-2018-01-23_14-48-08-893.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test19_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-9-2018-01-23_14-48-08-893.csv Received shutdown request...