java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_2_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 08:54:55,255 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 08:54:55,257 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 08:54:55,272 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 08:54:55,272 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 08:54:55,273 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 08:54:55,274 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 08:54:55,276 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 08:54:55,278 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 08:54:55,279 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 08:54:55,280 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 08:54:55,280 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 08:54:55,281 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 08:54:55,282 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 08:54:55,283 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 08:54:55,286 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 08:54:55,288 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 08:54:55,290 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 08:54:55,292 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 08:54:55,293 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 08:54:55,295 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 08:54:55,296 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 08:54:55,296 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 08:54:55,297 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 08:54:55,298 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 08:54:55,299 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 08:54:55,299 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 08:54:55,300 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 08:54:55,300 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 08:54:55,300 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 08:54:55,301 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 08:54:55,301 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf [2018-01-21 08:54:55,310 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 08:54:55,310 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 08:54:55,311 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 08:54:55,311 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 08:54:55,311 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 08:54:55,311 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-21 08:54:55,311 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-21 08:54:55,312 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 08:54:55,312 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 08:54:55,312 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 08:54:55,312 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 08:54:55,313 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 08:54:55,313 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 08:54:55,313 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 08:54:55,313 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 08:54:55,313 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 08:54:55,313 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 08:54:55,313 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 08:54:55,314 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 08:54:55,314 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 08:54:55,314 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 08:54:55,314 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 08:54:55,314 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 08:54:55,315 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 08:54:55,315 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 08:54:55,315 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 08:54:55,315 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 08:54:55,315 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 08:54:55,315 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 08:54:55,316 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 08:54:55,316 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 08:54:55,316 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 08:54:55,316 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 08:54:55,316 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 08:54:55,316 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 08:54:55,316 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 08:54:55,316 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 08:54:55,316 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 08:54:55,317 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 08:54:55,317 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 08:54:55,351 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 08:54:55,362 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 08:54:55,365 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 08:54:55,366 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 08:54:55,367 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 08:54:55,367 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_2_false-valid-memtrack_true-termination.i [2018-01-21 08:54:55,561 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 08:54:55,564 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 08:54:55,565 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 08:54:55,565 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 08:54:55,570 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 08:54:55,571 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 08:54:55" (1/1) ... [2018-01-21 08:54:55,574 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53c7d0dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:54:55, skipping insertion in model container [2018-01-21 08:54:55,574 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 08:54:55" (1/1) ... [2018-01-21 08:54:55,587 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 08:54:55,636 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 08:54:55,751 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 08:54:55,772 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 08:54:55,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:54:55 WrapperNode [2018-01-21 08:54:55,780 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 08:54:55,781 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 08:54:55,781 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 08:54:55,781 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 08:54:55,797 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:54:55" (1/1) ... [2018-01-21 08:54:55,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:54:55" (1/1) ... [2018-01-21 08:54:55,810 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:54:55" (1/1) ... [2018-01-21 08:54:55,811 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:54:55" (1/1) ... [2018-01-21 08:54:55,816 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:54:55" (1/1) ... [2018-01-21 08:54:55,818 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:54:55" (1/1) ... [2018-01-21 08:54:55,820 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:54:55" (1/1) ... [2018-01-21 08:54:55,821 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 08:54:55,822 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 08:54:55,822 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 08:54:55,822 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 08:54:55,823 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:54:55" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 08:54:55,887 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 08:54:55,888 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 08:54:55,888 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-21 08:54:55,888 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-01-21 08:54:55,888 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-01-21 08:54:55,888 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-01-21 08:54:55,888 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-01-21 08:54:55,888 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-01-21 08:54:55,889 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-21 08:54:55,889 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 08:54:55,889 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 08:54:55,889 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 08:54:55,889 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 08:54:55,889 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 08:54:55,890 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 08:54:55,890 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 08:54:55,890 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 08:54:55,890 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-21 08:54:55,890 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-21 08:54:55,890 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 08:54:55,890 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 08:54:55,890 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-21 08:54:55,891 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-21 08:54:55,891 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-01-21 08:54:55,891 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-01-21 08:54:55,891 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-01-21 08:54:55,891 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-01-21 08:54:55,891 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-01-21 08:54:55,892 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-21 08:54:55,892 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 08:54:55,892 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 08:54:55,892 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 08:54:56,149 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 08:54:56,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 08:54:56 BoogieIcfgContainer [2018-01-21 08:54:56,150 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 08:54:56,151 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 08:54:56,151 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 08:54:56,154 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 08:54:56,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 08:54:55" (1/3) ... [2018-01-21 08:54:56,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@437cbfcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 08:54:56, skipping insertion in model container [2018-01-21 08:54:56,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:54:55" (2/3) ... [2018-01-21 08:54:56,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@437cbfcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 08:54:56, skipping insertion in model container [2018-01-21 08:54:56,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 08:54:56" (3/3) ... [2018-01-21 08:54:56,158 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test22_2_false-valid-memtrack_true-termination.i [2018-01-21 08:54:56,169 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 08:54:56,176 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2018-01-21 08:54:56,216 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:54:56,216 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:54:56,216 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:54:56,216 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:54:56,216 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:54:56,216 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:54:56,217 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:54:56,217 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_kref_initErr0EnsuresViolation======== [2018-01-21 08:54:56,217 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:54:56,235 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-21 08:54:56,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-21 08:54:56,242 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:54:56,244 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:54:56,244 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0EnsuresViolation]=== [2018-01-21 08:54:56,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1187502660, now seen corresponding path program 1 times [2018-01-21 08:54:56,251 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:54:56,301 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:54:56,301 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:54:56,302 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:54:56,302 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:54:56,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:54:56,372 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:54:56,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 08:54:56,552 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:54:56,553 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 08:54:56,553 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:54:56,555 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 08:54:56,634 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 08:54:56,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 08:54:56,637 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 5 states. [2018-01-21 08:54:56,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:54:56,707 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2018-01-21 08:54:56,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 08:54:56,708 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-01-21 08:54:56,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:54:56,715 INFO L225 Difference]: With dead ends: 114 [2018-01-21 08:54:56,715 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 08:54:56,720 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 08:54:56,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 08:54:56,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 08:54:56,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 08:54:56,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 08:54:56,742 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2018-01-21 08:54:56,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:54:56,742 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 08:54:56,742 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 08:54:56,742 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 08:54:56,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 08:54:56,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-21 08:54:56,785 INFO L401 ceAbstractionStarter]: For program point ldv_kref_initFINAL(lines 1292 1295) no Hoare annotation was computed. [2018-01-21 08:54:56,785 INFO L401 ceAbstractionStarter]: For program point ldv_kref_initEXIT(lines 1292 1295) no Hoare annotation was computed. [2018-01-21 08:54:56,785 INFO L401 ceAbstractionStarter]: For program point ldv_kref_initErr0EnsuresViolation(lines 1292 1295) no Hoare annotation was computed. [2018-01-21 08:54:56,785 INFO L404 ceAbstractionStarter]: At program point ldv_kref_initENTRY(lines 1292 1295) the Hoare annotation is: true [2018-01-21 08:54:56,785 INFO L401 ceAbstractionStarter]: For program point L1294(line 1294) no Hoare annotation was computed. [2018-01-21 08:54:56,786 INFO L401 ceAbstractionStarter]: For program point L1411'(line 1411) no Hoare annotation was computed. [2018-01-21 08:54:56,786 INFO L401 ceAbstractionStarter]: For program point ldv_kobject_createErr0EnsuresViolation(lines 1404 1415) no Hoare annotation was computed. [2018-01-21 08:54:56,786 INFO L404 ceAbstractionStarter]: At program point L1411(line 1411) the Hoare annotation is: true [2018-01-21 08:54:56,786 INFO L401 ceAbstractionStarter]: For program point L1408'(line 1408) no Hoare annotation was computed. [2018-01-21 08:54:56,786 INFO L401 ceAbstractionStarter]: For program point L1413'(line 1413) no Hoare annotation was computed. [2018-01-21 08:54:56,786 INFO L404 ceAbstractionStarter]: At program point L1408(line 1408) the Hoare annotation is: true [2018-01-21 08:54:56,786 INFO L404 ceAbstractionStarter]: At program point ldv_kobject_createENTRY(lines 1404 1415) the Hoare annotation is: true [2018-01-21 08:54:56,786 INFO L404 ceAbstractionStarter]: At program point L1413(line 1413) the Hoare annotation is: true [2018-01-21 08:54:56,786 INFO L401 ceAbstractionStarter]: For program point ldv_kobject_createFINAL(lines 1404 1415) no Hoare annotation was computed. [2018-01-21 08:54:56,786 INFO L401 ceAbstractionStarter]: For program point L1409(lines 1409 1410) no Hoare annotation was computed. [2018-01-21 08:54:56,787 INFO L401 ceAbstractionStarter]: For program point ldv_kobject_createEXIT(lines 1404 1415) no Hoare annotation was computed. [2018-01-21 08:54:56,787 INFO L404 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: true [2018-01-21 08:54:56,787 INFO L401 ceAbstractionStarter]: For program point L1073(lines 1073 1077) no Hoare annotation was computed. [2018-01-21 08:54:56,787 INFO L401 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-21 08:54:56,787 INFO L401 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 08:54:56,787 INFO L401 ceAbstractionStarter]: For program point ldv_mallocErr0EnsuresViolation(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 08:54:56,787 INFO L401 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 08:54:56,787 INFO L401 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-21 08:54:56,788 INFO L404 ceAbstractionStarter]: At program point ldv_kobject_initENTRY(lines 1390 1403) the Hoare annotation is: true [2018-01-21 08:54:56,788 INFO L401 ceAbstractionStarter]: For program point ldv_kobject_initErr0EnsuresViolation(lines 1390 1403) no Hoare annotation was computed. [2018-01-21 08:54:56,788 INFO L404 ceAbstractionStarter]: At program point L1398(line 1398) the Hoare annotation is: true [2018-01-21 08:54:56,788 INFO L404 ceAbstractionStarter]: At program point L1396(line 1396) the Hoare annotation is: true [2018-01-21 08:54:56,788 INFO L401 ceAbstractionStarter]: For program point L1394(lines 1394 1397) no Hoare annotation was computed. [2018-01-21 08:54:56,788 INFO L401 ceAbstractionStarter]: For program point ldv_kobject_initEXIT(lines 1390 1403) no Hoare annotation was computed. [2018-01-21 08:54:56,788 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 1443) no Hoare annotation was computed. [2018-01-21 08:54:56,789 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1443) no Hoare annotation was computed. [2018-01-21 08:54:56,789 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1443) the Hoare annotation is: true [2018-01-21 08:54:56,789 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1443) no Hoare annotation was computed. [2018-01-21 08:54:56,789 INFO L404 ceAbstractionStarter]: At program point #Ultimate.C_memsetENTRY(line -1) the Hoare annotation is: true [2018-01-21 08:54:56,789 INFO L404 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-01-21 08:54:56,789 INFO L401 ceAbstractionStarter]: For program point #Ultimate.C_memsetFINAL(line -1) no Hoare annotation was computed. [2018-01-21 08:54:56,790 INFO L401 ceAbstractionStarter]: For program point #Ultimate.C_memsetEXIT(line -1) no Hoare annotation was computed. [2018-01-21 08:54:56,790 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1443) the Hoare annotation is: true [2018-01-21 08:54:56,790 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1443) no Hoare annotation was computed. [2018-01-21 08:54:56,790 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 1443) the Hoare annotation is: true [2018-01-21 08:54:56,790 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 1443) no Hoare annotation was computed. [2018-01-21 08:54:56,790 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1443) no Hoare annotation was computed. [2018-01-21 08:54:56,790 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 1441 1443) the Hoare annotation is: true [2018-01-21 08:54:56,791 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 1441 1443) no Hoare annotation was computed. [2018-01-21 08:54:56,791 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 1441 1443) no Hoare annotation was computed. [2018-01-21 08:54:56,791 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1441 1443) no Hoare annotation was computed. [2018-01-21 08:54:56,791 INFO L404 ceAbstractionStarter]: At program point LDV_INIT_LIST_HEADENTRY(lines 1097 1101) the Hoare annotation is: true [2018-01-21 08:54:56,791 INFO L401 ceAbstractionStarter]: For program point LDV_INIT_LIST_HEADFINAL(lines 1097 1101) no Hoare annotation was computed. [2018-01-21 08:54:56,791 INFO L401 ceAbstractionStarter]: For program point L1099'(line 1099) no Hoare annotation was computed. [2018-01-21 08:54:56,791 INFO L401 ceAbstractionStarter]: For program point LDV_INIT_LIST_HEADErr0EnsuresViolation(lines 1097 1101) no Hoare annotation was computed. [2018-01-21 08:54:56,791 INFO L401 ceAbstractionStarter]: For program point LDV_INIT_LIST_HEADEXIT(lines 1097 1101) no Hoare annotation was computed. [2018-01-21 08:54:56,792 INFO L401 ceAbstractionStarter]: For program point L1099(line 1099) no Hoare annotation was computed. [2018-01-21 08:54:56,792 INFO L404 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1435 1439) the Hoare annotation is: true [2018-01-21 08:54:56,792 INFO L401 ceAbstractionStarter]: For program point entry_pointFINAL(lines 1435 1439) no Hoare annotation was computed. [2018-01-21 08:54:56,792 INFO L404 ceAbstractionStarter]: At program point L1437(line 1437) the Hoare annotation is: true [2018-01-21 08:54:56,792 INFO L401 ceAbstractionStarter]: For program point entry_pointErr0EnsuresViolation(lines 1435 1439) no Hoare annotation was computed. [2018-01-21 08:54:56,792 INFO L401 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1435 1439) no Hoare annotation was computed. [2018-01-21 08:54:56,793 INFO L401 ceAbstractionStarter]: For program point L1437'(line 1437) no Hoare annotation was computed. [2018-01-21 08:54:56,793 INFO L401 ceAbstractionStarter]: For program point L1380(lines 1380 1381) no Hoare annotation was computed. [2018-01-21 08:54:56,793 INFO L404 ceAbstractionStarter]: At program point L1382'(line 1382) the Hoare annotation is: true [2018-01-21 08:54:56,793 INFO L401 ceAbstractionStarter]: For program point ldv_kobject_init_internalErr0EnsuresViolation(lines 1378 1388) no Hoare annotation was computed. [2018-01-21 08:54:56,793 INFO L404 ceAbstractionStarter]: At program point ldv_kobject_init_internalENTRY(lines 1378 1388) the Hoare annotation is: true [2018-01-21 08:54:56,793 INFO L401 ceAbstractionStarter]: For program point ldv_kobject_init_internalFINAL(lines 1378 1388) no Hoare annotation was computed. [2018-01-21 08:54:56,793 INFO L401 ceAbstractionStarter]: For program point ldv_kobject_init_internalEXIT(lines 1378 1388) no Hoare annotation was computed. [2018-01-21 08:54:56,794 INFO L404 ceAbstractionStarter]: At program point L1382(line 1382) the Hoare annotation is: true [2018-01-21 08:54:56,797 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:54:56,798 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:54:56,798 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:54:56,798 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:54:56,798 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:54:56,798 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:54:56,798 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:54:56,798 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_kobject_createErr0EnsuresViolation======== [2018-01-21 08:54:56,799 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:54:56,801 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-21 08:54:56,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-21 08:54:56,802 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:54:56,802 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:54:56,802 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_kobject_createErr0EnsuresViolation]=== [2018-01-21 08:54:56,803 INFO L82 PathProgramCache]: Analyzing trace with hash 219487307, now seen corresponding path program 1 times [2018-01-21 08:54:56,803 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:54:56,804 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:54:56,805 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:54:56,805 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:54:56,805 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:54:56,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:54:56,824 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:54:56,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 08:54:56,872 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:54:56,872 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 08:54:56,872 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:54:56,872 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 08:54:56,873 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 08:54:56,873 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 08:54:56,873 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2018-01-21 08:54:56,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:54:56,999 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-01-21 08:54:56,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 08:54:56,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-21 08:54:57,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:54:57,000 INFO L225 Difference]: With dead ends: 67 [2018-01-21 08:54:57,000 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 08:54:57,001 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-21 08:54:57,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 08:54:57,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 08:54:57,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 08:54:57,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 08:54:57,002 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-01-21 08:54:57,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:54:57,003 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 08:54:57,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 08:54:57,003 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 08:54:57,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 08:54:57,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-21 08:54:57,044 INFO L401 ceAbstractionStarter]: For program point ldv_kref_initFINAL(lines 1292 1295) no Hoare annotation was computed. [2018-01-21 08:54:57,044 INFO L401 ceAbstractionStarter]: For program point ldv_kref_initEXIT(lines 1292 1295) no Hoare annotation was computed. [2018-01-21 08:54:57,044 INFO L401 ceAbstractionStarter]: For program point ldv_kref_initErr0EnsuresViolation(lines 1292 1295) no Hoare annotation was computed. [2018-01-21 08:54:57,044 INFO L404 ceAbstractionStarter]: At program point ldv_kref_initENTRY(lines 1292 1295) the Hoare annotation is: true [2018-01-21 08:54:57,044 INFO L401 ceAbstractionStarter]: For program point L1294(line 1294) no Hoare annotation was computed. [2018-01-21 08:54:57,044 INFO L401 ceAbstractionStarter]: For program point L1411'(line 1411) no Hoare annotation was computed. [2018-01-21 08:54:57,044 INFO L401 ceAbstractionStarter]: For program point ldv_kobject_createErr0EnsuresViolation(lines 1404 1415) no Hoare annotation was computed. [2018-01-21 08:54:57,044 INFO L397 ceAbstractionStarter]: At program point L1411(line 1411) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-21 08:54:57,045 INFO L401 ceAbstractionStarter]: For program point L1408'(line 1408) no Hoare annotation was computed. [2018-01-21 08:54:57,045 INFO L401 ceAbstractionStarter]: For program point L1413'(line 1413) no Hoare annotation was computed. [2018-01-21 08:54:57,045 INFO L397 ceAbstractionStarter]: At program point L1408(line 1408) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-21 08:54:57,045 INFO L397 ceAbstractionStarter]: At program point ldv_kobject_createENTRY(lines 1404 1415) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-21 08:54:57,045 INFO L397 ceAbstractionStarter]: At program point L1413(line 1413) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-21 08:54:57,045 INFO L401 ceAbstractionStarter]: For program point ldv_kobject_createFINAL(lines 1404 1415) no Hoare annotation was computed. [2018-01-21 08:54:57,045 INFO L401 ceAbstractionStarter]: For program point L1409(lines 1409 1410) no Hoare annotation was computed. [2018-01-21 08:54:57,046 INFO L401 ceAbstractionStarter]: For program point ldv_kobject_createEXIT(lines 1404 1415) no Hoare annotation was computed. [2018-01-21 08:54:57,046 INFO L397 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-21 08:54:57,046 INFO L401 ceAbstractionStarter]: For program point L1073(lines 1073 1077) no Hoare annotation was computed. [2018-01-21 08:54:57,046 INFO L401 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-21 08:54:57,046 INFO L401 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 08:54:57,046 INFO L401 ceAbstractionStarter]: For program point ldv_mallocErr0EnsuresViolation(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 08:54:57,046 INFO L401 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 08:54:57,046 INFO L401 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-21 08:54:57,046 INFO L404 ceAbstractionStarter]: At program point ldv_kobject_initENTRY(lines 1390 1403) the Hoare annotation is: true [2018-01-21 08:54:57,046 INFO L401 ceAbstractionStarter]: For program point ldv_kobject_initErr0EnsuresViolation(lines 1390 1403) no Hoare annotation was computed. [2018-01-21 08:54:57,047 INFO L404 ceAbstractionStarter]: At program point L1398(line 1398) the Hoare annotation is: true [2018-01-21 08:54:57,047 INFO L404 ceAbstractionStarter]: At program point L1396(line 1396) the Hoare annotation is: true [2018-01-21 08:54:57,047 INFO L401 ceAbstractionStarter]: For program point L1394(lines 1394 1397) no Hoare annotation was computed. [2018-01-21 08:54:57,047 INFO L401 ceAbstractionStarter]: For program point ldv_kobject_initEXIT(lines 1390 1403) no Hoare annotation was computed. [2018-01-21 08:54:57,047 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 1443) no Hoare annotation was computed. [2018-01-21 08:54:57,047 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1443) no Hoare annotation was computed. [2018-01-21 08:54:57,047 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1443) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-21 08:54:57,047 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1443) no Hoare annotation was computed. [2018-01-21 08:54:57,047 INFO L404 ceAbstractionStarter]: At program point #Ultimate.C_memsetENTRY(line -1) the Hoare annotation is: true [2018-01-21 08:54:57,047 INFO L404 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-01-21 08:54:57,047 INFO L401 ceAbstractionStarter]: For program point #Ultimate.C_memsetFINAL(line -1) no Hoare annotation was computed. [2018-01-21 08:54:57,047 INFO L401 ceAbstractionStarter]: For program point #Ultimate.C_memsetEXIT(line -1) no Hoare annotation was computed. [2018-01-21 08:54:57,048 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1443) the Hoare annotation is: true [2018-01-21 08:54:57,048 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1443) no Hoare annotation was computed. [2018-01-21 08:54:57,048 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 1443) the Hoare annotation is: true [2018-01-21 08:54:57,048 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 1443) no Hoare annotation was computed. [2018-01-21 08:54:57,048 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1443) no Hoare annotation was computed. [2018-01-21 08:54:57,048 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 1441 1443) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-21 08:54:57,048 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 1441 1443) no Hoare annotation was computed. [2018-01-21 08:54:57,048 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 1441 1443) no Hoare annotation was computed. [2018-01-21 08:54:57,048 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1441 1443) no Hoare annotation was computed. [2018-01-21 08:54:57,048 INFO L404 ceAbstractionStarter]: At program point LDV_INIT_LIST_HEADENTRY(lines 1097 1101) the Hoare annotation is: true [2018-01-21 08:54:57,049 INFO L401 ceAbstractionStarter]: For program point LDV_INIT_LIST_HEADFINAL(lines 1097 1101) no Hoare annotation was computed. [2018-01-21 08:54:57,049 INFO L401 ceAbstractionStarter]: For program point L1099'(line 1099) no Hoare annotation was computed. [2018-01-21 08:54:57,049 INFO L401 ceAbstractionStarter]: For program point LDV_INIT_LIST_HEADErr0EnsuresViolation(lines 1097 1101) no Hoare annotation was computed. [2018-01-21 08:54:57,049 INFO L401 ceAbstractionStarter]: For program point LDV_INIT_LIST_HEADEXIT(lines 1097 1101) no Hoare annotation was computed. [2018-01-21 08:54:57,049 INFO L401 ceAbstractionStarter]: For program point L1099(line 1099) no Hoare annotation was computed. [2018-01-21 08:54:57,049 INFO L397 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1435 1439) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-21 08:54:57,049 INFO L401 ceAbstractionStarter]: For program point entry_pointFINAL(lines 1435 1439) no Hoare annotation was computed. [2018-01-21 08:54:57,049 INFO L397 ceAbstractionStarter]: At program point L1437(line 1437) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-21 08:54:57,050 INFO L401 ceAbstractionStarter]: For program point entry_pointErr0EnsuresViolation(lines 1435 1439) no Hoare annotation was computed. [2018-01-21 08:54:57,050 INFO L401 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1435 1439) no Hoare annotation was computed. [2018-01-21 08:54:57,050 INFO L401 ceAbstractionStarter]: For program point L1437'(line 1437) no Hoare annotation was computed. [2018-01-21 08:54:57,050 INFO L401 ceAbstractionStarter]: For program point L1380(lines 1380 1381) no Hoare annotation was computed. [2018-01-21 08:54:57,050 INFO L404 ceAbstractionStarter]: At program point L1382'(line 1382) the Hoare annotation is: true [2018-01-21 08:54:57,050 INFO L401 ceAbstractionStarter]: For program point ldv_kobject_init_internalErr0EnsuresViolation(lines 1378 1388) no Hoare annotation was computed. [2018-01-21 08:54:57,050 INFO L404 ceAbstractionStarter]: At program point ldv_kobject_init_internalENTRY(lines 1378 1388) the Hoare annotation is: true [2018-01-21 08:54:57,050 INFO L401 ceAbstractionStarter]: For program point ldv_kobject_init_internalFINAL(lines 1378 1388) no Hoare annotation was computed. [2018-01-21 08:54:57,051 INFO L401 ceAbstractionStarter]: For program point ldv_kobject_init_internalEXIT(lines 1378 1388) no Hoare annotation was computed. [2018-01-21 08:54:57,051 INFO L404 ceAbstractionStarter]: At program point L1382(line 1382) the Hoare annotation is: true [2018-01-21 08:54:57,053 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:54:57,053 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:54:57,053 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:54:57,053 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:54:57,053 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:54:57,054 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:54:57,054 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:54:57,054 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_mallocErr0EnsuresViolation======== [2018-01-21 08:54:57,054 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:54:57,056 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-21 08:54:57,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-21 08:54:57,057 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:54:57,057 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:54:57,057 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-21 08:54:57,057 INFO L82 PathProgramCache]: Analyzing trace with hash 517058824, now seen corresponding path program 1 times [2018-01-21 08:54:57,057 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:54:57,059 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:54:57,059 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:54:57,059 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:54:57,059 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:54:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:54:57,071 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:54:57,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 08:54:57,093 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:54:57,093 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 08:54:57,093 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:54:57,094 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 08:54:57,094 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 08:54:57,094 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 08:54:57,094 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2018-01-21 08:54:57,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:54:57,204 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-01-21 08:54:57,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 08:54:57,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-01-21 08:54:57,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:54:57,207 INFO L225 Difference]: With dead ends: 67 [2018-01-21 08:54:57,208 INFO L226 Difference]: Without dead ends: 16 [2018-01-21 08:54:57,208 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-21 08:54:57,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-01-21 08:54:57,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-01-21 08:54:57,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-01-21 08:54:57,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 15 transitions. [2018-01-21 08:54:57,223 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 15 transitions. Word has length 13 [2018-01-21 08:54:57,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:54:57,223 INFO L432 AbstractCegarLoop]: Abstraction has 16 states and 15 transitions. [2018-01-21 08:54:57,223 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 08:54:57,223 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2018-01-21 08:54:57,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-21 08:54:57,224 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:54:57,224 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:54:57,224 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-21 08:54:57,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1322768470, now seen corresponding path program 1 times [2018-01-21 08:54:57,224 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:54:57,226 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:54:57,226 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:54:57,226 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:54:57,226 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:54:57,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 08:54:57,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 08:54:57,270 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 08:54:57,276 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:54:57,278 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:54:57,285 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:54:57,285 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:54:57,285 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:54:57,286 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:54:57,286 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:54:57,286 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:54:57,286 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:54:57,286 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_kobject_initErr0EnsuresViolation======== [2018-01-21 08:54:57,286 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:54:57,287 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-21 08:54:57,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-21 08:54:57,288 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:54:57,288 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-21 08:54:57,288 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_kobject_initErr0EnsuresViolation]=== [2018-01-21 08:54:57,288 INFO L82 PathProgramCache]: Analyzing trace with hash 102404402, now seen corresponding path program 1 times [2018-01-21 08:54:57,288 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:54:57,290 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:54:57,290 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:54:57,290 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:54:57,290 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:54:57,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:54:57,303 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:54:57,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 08:54:57,357 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:54:57,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 08:54:57,358 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:54:57,358 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 08:54:57,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 08:54:57,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 08:54:57,359 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 5 states. [2018-01-21 08:54:57,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:54:57,380 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2018-01-21 08:54:57,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 08:54:57,380 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-01-21 08:54:57,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:54:57,381 INFO L225 Difference]: With dead ends: 114 [2018-01-21 08:54:57,381 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 08:54:57,382 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 08:54:57,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 08:54:57,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 08:54:57,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 08:54:57,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 08:54:57,382 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-01-21 08:54:57,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:54:57,382 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 08:54:57,383 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 08:54:57,383 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 08:54:57,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 08:54:57,384 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:54:57,384 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:54:57,384 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:54:57,384 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:54:57,384 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:54:57,384 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:54:57,384 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:54:57,385 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 08:54:57,385 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:54:57,386 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-21 08:54:57,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 08:54:57,386 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:54:57,386 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 08:54:57,386 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 08:54:57,386 INFO L82 PathProgramCache]: Analyzing trace with hash 110227, now seen corresponding path program 1 times [2018-01-21 08:54:57,386 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:54:57,387 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:54:57,387 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:54:57,387 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:54:57,388 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:54:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 08:54:57,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 08:54:57,393 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 08:54:57,394 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:54:57,396 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:54:57,396 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:54:57,396 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:54:57,396 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:54:57,396 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:54:57,396 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:54:57,397 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:54:57,397 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 08:54:57,397 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:54:57,398 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-21 08:54:57,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-21 08:54:57,399 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:54:57,399 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] [2018-01-21 08:54:57,399 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 08:54:57,399 INFO L82 PathProgramCache]: Analyzing trace with hash 225129469, now seen corresponding path program 1 times [2018-01-21 08:54:57,399 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:54:57,400 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:54:57,400 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:54:57,400 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:54:57,400 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:54:57,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 08:54:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 08:54:57,420 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 08:54:57,423 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:54:57,423 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:54:57,424 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:54:57,424 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:54:57,424 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:54:57,425 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:54:57,427 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:54:57,427 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:54:57,427 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:54:57,427 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:54:57,427 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:54:57,427 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:54:57,428 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:54:57,428 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 08:54:57,428 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:54:57,428 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-21 08:54:57,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-21 08:54:57,429 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:54:57,429 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:54:57,429 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 08:54:57,430 INFO L82 PathProgramCache]: Analyzing trace with hash 585708474, now seen corresponding path program 1 times [2018-01-21 08:54:57,430 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:54:57,431 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:54:57,431 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:54:57,431 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:54:57,432 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:54:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:54:57,440 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:54:57,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 08:54:57,471 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:54:57,471 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 08:54:57,471 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:54:57,472 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 08:54:57,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 08:54:57,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 08:54:57,472 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2018-01-21 08:54:57,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:54:57,540 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-01-21 08:54:57,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 08:54:57,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-01-21 08:54:57,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:54:57,541 INFO L225 Difference]: With dead ends: 67 [2018-01-21 08:54:57,541 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 08:54:57,542 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-21 08:54:57,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 08:54:57,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 08:54:57,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 08:54:57,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 08:54:57,543 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2018-01-21 08:54:57,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:54:57,544 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 08:54:57,544 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 08:54:57,544 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 08:54:57,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 08:54:57,546 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:54:57,546 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:54:57,546 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:54:57,546 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:54:57,547 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:54:57,547 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:54:57,547 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:54:57,547 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == LDV_INIT_LIST_HEADErr0EnsuresViolation======== [2018-01-21 08:54:57,547 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:54:57,549 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-21 08:54:57,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-21 08:54:57,550 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:54:57,551 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:54:57,551 INFO L371 AbstractCegarLoop]: === Iteration 1 === [LDV_INIT_LIST_HEADErr0EnsuresViolation]=== [2018-01-21 08:54:57,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1993763615, now seen corresponding path program 1 times [2018-01-21 08:54:57,551 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:54:57,553 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:54:57,553 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:54:57,553 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:54:57,553 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:54:57,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:54:57,564 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:54:57,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 08:54:57,644 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:54:57,644 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 08:54:57,644 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:54:57,644 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 08:54:57,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 08:54:57,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 08:54:57,645 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 5 states. [2018-01-21 08:54:57,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:54:57,668 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2018-01-21 08:54:57,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 08:54:57,669 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-01-21 08:54:57,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:54:57,669 INFO L225 Difference]: With dead ends: 114 [2018-01-21 08:54:57,670 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 08:54:57,670 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 08:54:57,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 08:54:57,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 08:54:57,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 08:54:57,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 08:54:57,671 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2018-01-21 08:54:57,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:54:57,672 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 08:54:57,672 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 08:54:57,672 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 08:54:57,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 08:54:57,673 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:54:57,673 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:54:57,674 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:54:57,674 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:54:57,674 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:54:57,674 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:54:57,674 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:54:57,674 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == entry_pointErr0EnsuresViolation======== [2018-01-21 08:54:57,674 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:54:57,675 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-21 08:54:57,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-21 08:54:57,676 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:54:57,676 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:54:57,676 INFO L371 AbstractCegarLoop]: === Iteration 1 === [entry_pointErr0EnsuresViolation]=== [2018-01-21 08:54:57,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1806194063, now seen corresponding path program 1 times [2018-01-21 08:54:57,677 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:54:57,678 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:54:57,678 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:54:57,678 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:54:57,678 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:54:57,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:54:57,687 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:54:57,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 08:54:57,714 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:54:57,714 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 08:54:57,714 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:54:57,714 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 08:54:57,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 08:54:57,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 08:54:57,715 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2018-01-21 08:54:57,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:54:57,786 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-01-21 08:54:57,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 08:54:57,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-01-21 08:54:57,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:54:57,788 INFO L225 Difference]: With dead ends: 67 [2018-01-21 08:54:57,788 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 08:54:57,788 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-21 08:54:57,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 08:54:57,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 08:54:57,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 08:54:57,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 08:54:57,790 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2018-01-21 08:54:57,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:54:57,790 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 08:54:57,790 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 08:54:57,790 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 08:54:57,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 08:54:57,792 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:54:57,792 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:54:57,792 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:54:57,792 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:54:57,792 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:54:57,792 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:54:57,793 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:54:57,793 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_kobject_init_internalErr0EnsuresViolation======== [2018-01-21 08:54:57,793 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:54:57,794 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-21 08:54:57,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-21 08:54:57,795 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:54:57,795 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:54:57,795 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_kobject_init_internalErr0EnsuresViolation]=== [2018-01-21 08:54:57,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1305563254, now seen corresponding path program 1 times [2018-01-21 08:54:57,796 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:54:57,797 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:54:57,797 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:54:57,798 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:54:57,798 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:54:57,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:54:57,807 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:54:57,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 08:54:57,852 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:54:57,853 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 08:54:57,853 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:54:57,853 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 08:54:57,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 08:54:57,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 08:54:57,854 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 5 states. [2018-01-21 08:54:57,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:54:57,875 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2018-01-21 08:54:57,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 08:54:57,876 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-21 08:54:57,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:54:57,876 INFO L225 Difference]: With dead ends: 114 [2018-01-21 08:54:57,876 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 08:54:57,877 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 08:54:57,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 08:54:57,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 08:54:57,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 08:54:57,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 08:54:57,878 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-01-21 08:54:57,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:54:57,878 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 08:54:57,878 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 08:54:57,878 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 08:54:57,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 08:54:57,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 08:54:57 BoogieIcfgContainer [2018-01-21 08:54:57,880 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 08:54:57,881 INFO L168 Benchmark]: Toolchain (without parser) took 2320.01 ms. Allocated memory was 304.1 MB in the beginning and 475.5 MB in the end (delta: 171.4 MB). Free memory was 261.4 MB in the beginning and 430.4 MB in the end (delta: -169.0 MB). Peak memory consumption was 2.4 MB. Max. memory is 5.3 GB. [2018-01-21 08:54:57,882 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 304.1 MB. Free memory is still 268.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 08:54:57,882 INFO L168 Benchmark]: CACSL2BoogieTranslator took 215.59 ms. Allocated memory is still 304.1 MB. Free memory was 261.4 MB in the beginning and 248.1 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 5.3 GB. [2018-01-21 08:54:57,883 INFO L168 Benchmark]: Boogie Preprocessor took 40.80 ms. Allocated memory is still 304.1 MB. Free memory was 248.1 MB in the beginning and 246.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 08:54:57,883 INFO L168 Benchmark]: RCFGBuilder took 328.19 ms. Allocated memory is still 304.1 MB. Free memory was 246.1 MB in the beginning and 226.5 MB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 5.3 GB. [2018-01-21 08:54:57,883 INFO L168 Benchmark]: TraceAbstraction took 1729.40 ms. Allocated memory was 304.1 MB in the beginning and 475.5 MB in the end (delta: 171.4 MB). Free memory was 225.5 MB in the beginning and 430.4 MB in the end (delta: -204.9 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 08:54:57,885 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.11 ms. Allocated memory is still 304.1 MB. Free memory is still 268.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 215.59 ms. Allocated memory is still 304.1 MB. Free memory was 261.4 MB in the beginning and 248.1 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.80 ms. Allocated memory is still 304.1 MB. Free memory was 248.1 MB in the beginning and 246.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 328.19 ms. Allocated memory is still 304.1 MB. Free memory was 246.1 MB in the beginning and 226.5 MB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1729.40 ms. Allocated memory was 304.1 MB in the beginning and 475.5 MB in the end (delta: 171.4 MB). Free memory was 225.5 MB in the beginning and 430.4 MB in the end (delta: -204.9 MB). There was no memory consumed. 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: 1292]: 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: ldv_kref_initErr0EnsuresViolation CFG has 11 procedures, 65 locations, 10 error locations. SAFE Result, 0.5s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 63 SDtfs, 4 SDslu, 184 SDs, 0 SdLazy, 11 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred 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: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 31 PreInvPairs, 33 NumberOfFragments, 21 HoareAnnotationTreeSize, 31 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 32 NumberOfCodeBlocks, 32 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 31 ConstructedInterpolants, 0 QuantifiedInterpolants, 1705 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: 1404]: 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: ldv_kobject_createErr0EnsuresViolation CFG has 11 procedures, 65 locations, 10 error locations. SAFE Result, 0.2s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 48 SDtfs, 28 SDslu, 1 SDs, 0 SdLazy, 21 SolverSat, 16 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=65occurred 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: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 21 PreInvPairs, 21 NumberOfFragments, 39 HoareAnnotationTreeSize, 21 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 20 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 17 NumberOfCodeBlocks, 17 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 16 ConstructedInterpolants, 0 QuantifiedInterpolants, 544 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: 1072]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1442] CALL entry_point() [L1436] struct ldv_kobject *kobj; [L1437] CALL ldv_kobject_create() [L1406] struct ldv_kobject *kobj; [L1408] CALL ldv_malloc(sizeof(*kobj)) VAL [\old(size)=16] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=16, malloc(size)={18:0}, size=16] [L1074] return malloc(size); VAL [\old(size)=16, \result={18:0}, malloc(size)={18:0}, size=16] - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_mallocErr0EnsuresViolation CFG has 11 procedures, 65 locations, 10 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 48 SDtfs, 32 SDslu, 1 SDs, 0 SdLazy, 21 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s 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=65occurred 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 - PositiveResult [Line: 1390]: 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: ldv_kobject_initErr0EnsuresViolation CFG has 11 procedures, 65 locations, 10 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 63 SDtfs, 4 SDslu, 184 SDs, 0 SdLazy, 11 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred 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, 1225 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 11 procedures, 65 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=65occurred 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: [L1442] CALL entry_point() [L1436] struct ldv_kobject *kobj; [L1437] CALL, EXPR ldv_kobject_create() [L1406] struct ldv_kobject *kobj; [L1408] CALL, EXPR ldv_malloc(sizeof(*kobj)) VAL [\old(size)=16] [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; VAL [\old(size)=16, \result={0:0}, size=16] [L1408] EXPR ldv_malloc(sizeof(*kobj)) VAL [ldv_malloc(sizeof(*kobj))={0:0}] [L1408] kobj = ldv_malloc(sizeof(*kobj)) [L1409] COND TRUE !kobj [L1410] RET return 0; VAL [\result={0:0}, kobj={0:0}] [L1437] EXPR ldv_kobject_create() VAL [ldv_kobject_create()={0:0}] [L1437] RET kobj = ldv_kobject_create() [L1442] entry_point() - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 11 procedures, 65 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=65occurred 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, 24 NumberOfCodeBlocks, 24 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: 1441]: 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 11 procedures, 65 locations, 10 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 48 SDtfs, 24 SDslu, 1 SDs, 0 SdLazy, 21 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred 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, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 1155 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: 1097]: 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: LDV_INIT_LIST_HEADErr0EnsuresViolation CFG has 11 procedures, 65 locations, 10 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 63 SDtfs, 4 SDslu, 184 SDs, 0 SdLazy, 11 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred 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, 38 NumberOfCodeBlocks, 38 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 37 ConstructedInterpolants, 0 QuantifiedInterpolants, 2257 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: 1435]: 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 11 procedures, 65 locations, 10 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 48 SDtfs, 25 SDslu, 1 SDs, 0 SdLazy, 21 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred 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, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 19 ConstructedInterpolants, 0 QuantifiedInterpolants, 893 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: 1378]: 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: ldv_kobject_init_internalErr0EnsuresViolation CFG has 11 procedures, 65 locations, 10 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 63 SDtfs, 4 SDslu, 184 SDs, 0 SdLazy, 11 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred 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, 29 NumberOfCodeBlocks, 29 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 28 ConstructedInterpolants, 0 QuantifiedInterpolants, 1456 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 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1396]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_08-54-57-898.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_08-54-57-898.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_08-54-57-898.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_08-54-57-898.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_08-54-57-898.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-21_08-54-57-898.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-21_08-54-57-898.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-6-2018-01-21_08-54-57-898.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-7-2018-01-21_08-54-57-898.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-8-2018-01-21_08-54-57-898.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-9-2018-01-21_08-54-57-898.csv Received shutdown request...