java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_2_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 22:21:25,736 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 22:21:25,738 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 22:21:25,752 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 22:21:25,753 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 22:21:25,754 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 22:21:25,755 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 22:21:25,756 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 22:21:25,758 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 22:21:25,759 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 22:21:25,760 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 22:21:25,760 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 22:21:25,761 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 22:21:25,763 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 22:21:25,764 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 22:21:25,766 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 22:21:25,768 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 22:21:25,770 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 22:21:25,772 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 22:21:25,773 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 22:21:25,775 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 22:21:25,775 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 22:21:25,776 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 22:21:25,777 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 22:21:25,777 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 22:21:25,779 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 22:21:25,779 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 22:21:25,780 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 22:21:25,780 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 22:21:25,780 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 22:21:25,781 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 22:21:25,781 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf [2018-01-20 22:21:25,791 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 22:21:25,791 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 22:21:25,792 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 22:21:25,792 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 22:21:25,792 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 22:21:25,792 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 22:21:25,793 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 22:21:25,793 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 22:21:25,793 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 22:21:25,793 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 22:21:25,793 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 22:21:25,794 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 22:21:25,794 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 22:21:25,794 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 22:21:25,794 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 22:21:25,794 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 22:21:25,794 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 22:21:25,794 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 22:21:25,795 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 22:21:25,795 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 22:21:25,795 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 22:21:25,795 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 22:21:25,795 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 22:21:25,795 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 22:21:25,796 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 22:21:25,796 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 22:21:25,796 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 22:21:25,796 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 22:21:25,796 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 22:21:25,796 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 22:21:25,797 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 22:21:25,797 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-20 22:21:25,797 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 22:21:25,797 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 22:21:25,797 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 22:21:25,798 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 22:21:25,798 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 22:21:25,832 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 22:21:25,844 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 22:21:25,848 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 22:21:25,849 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 22:21:25,849 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 22:21:25,850 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-20 22:21:26,049 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 22:21:26,053 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 22:21:26,054 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 22:21:26,054 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 22:21:26,059 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 22:21:26,060 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:21:26" (1/1) ... [2018-01-20 22:21:26,063 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@230ab197 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:21:26, skipping insertion in model container [2018-01-20 22:21:26,063 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:21:26" (1/1) ... [2018-01-20 22:21:26,077 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:21:26,126 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:21:26,248 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:21:26,274 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:21:26,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:21:26 WrapperNode [2018-01-20 22:21:26,283 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 22:21:26,284 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 22:21:26,284 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 22:21:26,285 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 22:21:26,298 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:21:26" (1/1) ... [2018-01-20 22:21:26,298 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:21:26" (1/1) ... [2018-01-20 22:21:26,308 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:21:26" (1/1) ... [2018-01-20 22:21:26,308 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:21:26" (1/1) ... [2018-01-20 22:21:26,312 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:21:26" (1/1) ... [2018-01-20 22:21:26,315 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:21:26" (1/1) ... [2018-01-20 22:21:26,317 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:21:26" (1/1) ... [2018-01-20 22:21:26,318 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 22:21:26,319 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 22:21:26,319 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 22:21:26,319 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 22:21:26,320 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:21:26" (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-20 22:21:26,368 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 22:21:26,368 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 22:21:26,369 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-20 22:21:26,369 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-01-20 22:21:26,369 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-01-20 22:21:26,369 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-01-20 22:21:26,369 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-01-20 22:21:26,369 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-01-20 22:21:26,370 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-20 22:21:26,370 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 22:21:26,370 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-20 22:21:26,370 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-20 22:21:26,370 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-20 22:21:26,370 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-20 22:21:26,371 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 22:21:26,371 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 22:21:26,371 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 22:21:26,371 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-20 22:21:26,371 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-20 22:21:26,371 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-20 22:21:26,372 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 22:21:26,372 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-20 22:21:26,372 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-20 22:21:26,372 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-01-20 22:21:26,372 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-01-20 22:21:26,372 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-01-20 22:21:26,373 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-01-20 22:21:26,373 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-01-20 22:21:26,373 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-20 22:21:26,373 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 22:21:26,373 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 22:21:26,373 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 22:21:26,611 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 22:21:26,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:21:26 BoogieIcfgContainer [2018-01-20 22:21:26,612 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 22:21:26,613 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 22:21:26,613 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 22:21:26,615 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 22:21:26,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 10:21:26" (1/3) ... [2018-01-20 22:21:26,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bc6c659 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:21:26, skipping insertion in model container [2018-01-20 22:21:26,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:21:26" (2/3) ... [2018-01-20 22:21:26,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bc6c659 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:21:26, skipping insertion in model container [2018-01-20 22:21:26,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:21:26" (3/3) ... [2018-01-20 22:21:26,620 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test22_2_false-valid-memtrack_true-termination.i [2018-01-20 22:21:26,627 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 22:21:26,633 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2018-01-20 22:21:26,671 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:21:26,672 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:21:26,672 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:21:26,672 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:21:26,672 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:21:26,672 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:21:26,672 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:21:26,673 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_kref_initErr0EnsuresViolation======== [2018-01-20 22:21:26,674 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:21:26,696 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-20 22:21:26,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-20 22:21:26,704 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:21:26,704 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-20 22:21:26,705 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0EnsuresViolation]=== [2018-01-20 22:21:26,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1187502660, now seen corresponding path program 1 times [2018-01-20 22:21:26,713 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:21:26,714 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:21:26,761 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:21:26,761 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:21:26,761 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:21:26,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:21:26,832 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:21:27,002 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-20 22:21:27,005 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:21:27,006 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 22:21:27,008 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:21:27,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:21:27,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:21:27,093 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 5 states. [2018-01-20 22:21:27,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:21:27,151 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2018-01-20 22:21:27,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:21:27,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-01-20 22:21:27,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:21:27,158 INFO L225 Difference]: With dead ends: 114 [2018-01-20 22:21:27,159 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:21:27,164 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-20 22:21:27,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:21:27,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:21:27,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:21:27,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:21:27,185 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2018-01-20 22:21:27,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:21:27,185 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:21:27,185 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:21:27,186 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:21:27,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:21:27,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-20 22:21:27,236 INFO L401 ceAbstractionStarter]: For program point ldv_kref_initFINAL(lines 1292 1295) no Hoare annotation was computed. [2018-01-20 22:21:27,236 INFO L401 ceAbstractionStarter]: For program point ldv_kref_initEXIT(lines 1292 1295) no Hoare annotation was computed. [2018-01-20 22:21:27,236 INFO L401 ceAbstractionStarter]: For program point ldv_kref_initErr0EnsuresViolation(lines 1292 1295) no Hoare annotation was computed. [2018-01-20 22:21:27,236 INFO L404 ceAbstractionStarter]: At program point ldv_kref_initENTRY(lines 1292 1295) the Hoare annotation is: true [2018-01-20 22:21:27,236 INFO L401 ceAbstractionStarter]: For program point L1294(line 1294) no Hoare annotation was computed. [2018-01-20 22:21:27,236 INFO L401 ceAbstractionStarter]: For program point L1411'(line 1411) no Hoare annotation was computed. [2018-01-20 22:21:27,237 INFO L401 ceAbstractionStarter]: For program point ldv_kobject_createErr0EnsuresViolation(lines 1404 1415) no Hoare annotation was computed. [2018-01-20 22:21:27,237 INFO L404 ceAbstractionStarter]: At program point L1411(line 1411) the Hoare annotation is: true [2018-01-20 22:21:27,237 INFO L401 ceAbstractionStarter]: For program point L1408'(line 1408) no Hoare annotation was computed. [2018-01-20 22:21:27,237 INFO L401 ceAbstractionStarter]: For program point L1413'(line 1413) no Hoare annotation was computed. [2018-01-20 22:21:27,237 INFO L404 ceAbstractionStarter]: At program point L1408(line 1408) the Hoare annotation is: true [2018-01-20 22:21:27,237 INFO L404 ceAbstractionStarter]: At program point ldv_kobject_createENTRY(lines 1404 1415) the Hoare annotation is: true [2018-01-20 22:21:27,237 INFO L404 ceAbstractionStarter]: At program point L1413(line 1413) the Hoare annotation is: true [2018-01-20 22:21:27,237 INFO L401 ceAbstractionStarter]: For program point ldv_kobject_createFINAL(lines 1404 1415) no Hoare annotation was computed. [2018-01-20 22:21:27,237 INFO L401 ceAbstractionStarter]: For program point L1409(lines 1409 1410) no Hoare annotation was computed. [2018-01-20 22:21:27,237 INFO L401 ceAbstractionStarter]: For program point ldv_kobject_createEXIT(lines 1404 1415) no Hoare annotation was computed. [2018-01-20 22:21:27,237 INFO L404 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: true [2018-01-20 22:21:27,237 INFO L401 ceAbstractionStarter]: For program point L1073(lines 1073 1077) no Hoare annotation was computed. [2018-01-20 22:21:27,238 INFO L401 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-20 22:21:27,238 INFO L401 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-20 22:21:27,238 INFO L401 ceAbstractionStarter]: For program point ldv_mallocErr0EnsuresViolation(lines 1072 1078) no Hoare annotation was computed. [2018-01-20 22:21:27,238 INFO L401 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-20 22:21:27,238 INFO L401 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-20 22:21:27,238 INFO L404 ceAbstractionStarter]: At program point ldv_kobject_initENTRY(lines 1390 1403) the Hoare annotation is: true [2018-01-20 22:21:27,238 INFO L401 ceAbstractionStarter]: For program point ldv_kobject_initErr0EnsuresViolation(lines 1390 1403) no Hoare annotation was computed. [2018-01-20 22:21:27,238 INFO L404 ceAbstractionStarter]: At program point L1398(line 1398) the Hoare annotation is: true [2018-01-20 22:21:27,238 INFO L404 ceAbstractionStarter]: At program point L1396(line 1396) the Hoare annotation is: true [2018-01-20 22:21:27,238 INFO L401 ceAbstractionStarter]: For program point L1394(lines 1394 1397) no Hoare annotation was computed. [2018-01-20 22:21:27,238 INFO L401 ceAbstractionStarter]: For program point ldv_kobject_initEXIT(lines 1390 1403) no Hoare annotation was computed. [2018-01-20 22:21:27,239 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 1443) no Hoare annotation was computed. [2018-01-20 22:21:27,239 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1443) no Hoare annotation was computed. [2018-01-20 22:21:27,239 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1443) the Hoare annotation is: true [2018-01-20 22:21:27,239 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1443) no Hoare annotation was computed. [2018-01-20 22:21:27,239 INFO L404 ceAbstractionStarter]: At program point #Ultimate.C_memsetENTRY(line -1) the Hoare annotation is: true [2018-01-20 22:21:27,239 INFO L404 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-01-20 22:21:27,239 INFO L401 ceAbstractionStarter]: For program point #Ultimate.C_memsetFINAL(line -1) no Hoare annotation was computed. [2018-01-20 22:21:27,239 INFO L401 ceAbstractionStarter]: For program point #Ultimate.C_memsetEXIT(line -1) no Hoare annotation was computed. [2018-01-20 22:21:27,239 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1443) the Hoare annotation is: true [2018-01-20 22:21:27,239 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1443) no Hoare annotation was computed. [2018-01-20 22:21:27,239 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 1443) the Hoare annotation is: true [2018-01-20 22:21:27,240 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 1443) no Hoare annotation was computed. [2018-01-20 22:21:27,240 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1443) no Hoare annotation was computed. [2018-01-20 22:21:27,240 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 1441 1443) the Hoare annotation is: true [2018-01-20 22:21:27,240 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 1441 1443) no Hoare annotation was computed. [2018-01-20 22:21:27,240 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 1441 1443) no Hoare annotation was computed. [2018-01-20 22:21:27,240 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1441 1443) no Hoare annotation was computed. [2018-01-20 22:21:27,240 INFO L404 ceAbstractionStarter]: At program point LDV_INIT_LIST_HEADENTRY(lines 1097 1101) the Hoare annotation is: true [2018-01-20 22:21:27,240 INFO L401 ceAbstractionStarter]: For program point LDV_INIT_LIST_HEADFINAL(lines 1097 1101) no Hoare annotation was computed. [2018-01-20 22:21:27,240 INFO L401 ceAbstractionStarter]: For program point L1099'(line 1099) no Hoare annotation was computed. [2018-01-20 22:21:27,240 INFO L401 ceAbstractionStarter]: For program point LDV_INIT_LIST_HEADErr0EnsuresViolation(lines 1097 1101) no Hoare annotation was computed. [2018-01-20 22:21:27,240 INFO L401 ceAbstractionStarter]: For program point LDV_INIT_LIST_HEADEXIT(lines 1097 1101) no Hoare annotation was computed. [2018-01-20 22:21:27,241 INFO L401 ceAbstractionStarter]: For program point L1099(line 1099) no Hoare annotation was computed. [2018-01-20 22:21:27,241 INFO L404 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1435 1439) the Hoare annotation is: true [2018-01-20 22:21:27,241 INFO L401 ceAbstractionStarter]: For program point entry_pointFINAL(lines 1435 1439) no Hoare annotation was computed. [2018-01-20 22:21:27,241 INFO L404 ceAbstractionStarter]: At program point L1437(line 1437) the Hoare annotation is: true [2018-01-20 22:21:27,241 INFO L401 ceAbstractionStarter]: For program point entry_pointErr0EnsuresViolation(lines 1435 1439) no Hoare annotation was computed. [2018-01-20 22:21:27,241 INFO L401 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1435 1439) no Hoare annotation was computed. [2018-01-20 22:21:27,241 INFO L401 ceAbstractionStarter]: For program point L1437'(line 1437) no Hoare annotation was computed. [2018-01-20 22:21:27,241 INFO L401 ceAbstractionStarter]: For program point L1380(lines 1380 1381) no Hoare annotation was computed. [2018-01-20 22:21:27,242 INFO L404 ceAbstractionStarter]: At program point L1382'(line 1382) the Hoare annotation is: true [2018-01-20 22:21:27,242 INFO L401 ceAbstractionStarter]: For program point ldv_kobject_init_internalErr0EnsuresViolation(lines 1378 1388) no Hoare annotation was computed. [2018-01-20 22:21:27,242 INFO L404 ceAbstractionStarter]: At program point ldv_kobject_init_internalENTRY(lines 1378 1388) the Hoare annotation is: true [2018-01-20 22:21:27,242 INFO L401 ceAbstractionStarter]: For program point ldv_kobject_init_internalFINAL(lines 1378 1388) no Hoare annotation was computed. [2018-01-20 22:21:27,242 INFO L401 ceAbstractionStarter]: For program point ldv_kobject_init_internalEXIT(lines 1378 1388) no Hoare annotation was computed. [2018-01-20 22:21:27,242 INFO L404 ceAbstractionStarter]: At program point L1382(line 1382) the Hoare annotation is: true [2018-01-20 22:21:27,245 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:21:27,245 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:21:27,245 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:21:27,245 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:21:27,246 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:21:27,246 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:21:27,246 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:21:27,246 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_kobject_createErr0EnsuresViolation======== [2018-01-20 22:21:27,246 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:21:27,247 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-20 22:21:27,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-20 22:21:27,248 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:21:27,248 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:21:27,248 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_kobject_createErr0EnsuresViolation]=== [2018-01-20 22:21:27,248 INFO L82 PathProgramCache]: Analyzing trace with hash 219487307, now seen corresponding path program 1 times [2018-01-20 22:21:27,249 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:21:27,249 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:21:27,250 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:21:27,250 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:21:27,250 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:21:27,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:21:27,268 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:21:27,305 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-20 22:21:27,306 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:21:27,306 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:21:27,306 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 22:21:27,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 22:21:27,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:21:27,307 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2018-01-20 22:21:27,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:21:27,403 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-01-20 22:21:27,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 22:21:27,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-20 22:21:27,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:21:27,404 INFO L225 Difference]: With dead ends: 67 [2018-01-20 22:21:27,404 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:21:27,405 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-20 22:21:27,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:21:27,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:21:27,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:21:27,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:21:27,406 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-01-20 22:21:27,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:21:27,406 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:21:27,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 22:21:27,406 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:21:27,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:21:27,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-20 22:21:27,487 INFO L401 ceAbstractionStarter]: For program point ldv_kref_initFINAL(lines 1292 1295) no Hoare annotation was computed. [2018-01-20 22:21:27,487 INFO L401 ceAbstractionStarter]: For program point ldv_kref_initEXIT(lines 1292 1295) no Hoare annotation was computed. [2018-01-20 22:21:27,487 INFO L401 ceAbstractionStarter]: For program point ldv_kref_initErr0EnsuresViolation(lines 1292 1295) no Hoare annotation was computed. [2018-01-20 22:21:27,487 INFO L404 ceAbstractionStarter]: At program point ldv_kref_initENTRY(lines 1292 1295) the Hoare annotation is: true [2018-01-20 22:21:27,487 INFO L401 ceAbstractionStarter]: For program point L1294(line 1294) no Hoare annotation was computed. [2018-01-20 22:21:27,488 INFO L401 ceAbstractionStarter]: For program point L1411'(line 1411) no Hoare annotation was computed. [2018-01-20 22:21:27,488 INFO L401 ceAbstractionStarter]: For program point ldv_kobject_createErr0EnsuresViolation(lines 1404 1415) no Hoare annotation was computed. [2018-01-20 22:21:27,488 INFO L397 ceAbstractionStarter]: At program point L1411(line 1411) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:21:27,488 INFO L401 ceAbstractionStarter]: For program point L1408'(line 1408) no Hoare annotation was computed. [2018-01-20 22:21:27,488 INFO L401 ceAbstractionStarter]: For program point L1413'(line 1413) no Hoare annotation was computed. [2018-01-20 22:21:27,488 INFO L397 ceAbstractionStarter]: At program point L1408(line 1408) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:21:27,488 INFO L397 ceAbstractionStarter]: At program point ldv_kobject_createENTRY(lines 1404 1415) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:21:27,488 INFO L397 ceAbstractionStarter]: At program point L1413(line 1413) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:21:27,488 INFO L401 ceAbstractionStarter]: For program point ldv_kobject_createFINAL(lines 1404 1415) no Hoare annotation was computed. [2018-01-20 22:21:27,489 INFO L401 ceAbstractionStarter]: For program point L1409(lines 1409 1410) no Hoare annotation was computed. [2018-01-20 22:21:27,489 INFO L401 ceAbstractionStarter]: For program point ldv_kobject_createEXIT(lines 1404 1415) no Hoare annotation was computed. [2018-01-20 22:21:27,489 INFO L397 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:21:27,489 INFO L401 ceAbstractionStarter]: For program point L1073(lines 1073 1077) no Hoare annotation was computed. [2018-01-20 22:21:27,489 INFO L401 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-20 22:21:27,489 INFO L401 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-20 22:21:27,489 INFO L401 ceAbstractionStarter]: For program point ldv_mallocErr0EnsuresViolation(lines 1072 1078) no Hoare annotation was computed. [2018-01-20 22:21:27,490 INFO L401 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-20 22:21:27,490 INFO L401 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-20 22:21:27,490 INFO L404 ceAbstractionStarter]: At program point ldv_kobject_initENTRY(lines 1390 1403) the Hoare annotation is: true [2018-01-20 22:21:27,490 INFO L401 ceAbstractionStarter]: For program point ldv_kobject_initErr0EnsuresViolation(lines 1390 1403) no Hoare annotation was computed. [2018-01-20 22:21:27,490 INFO L404 ceAbstractionStarter]: At program point L1398(line 1398) the Hoare annotation is: true [2018-01-20 22:21:27,490 INFO L404 ceAbstractionStarter]: At program point L1396(line 1396) the Hoare annotation is: true [2018-01-20 22:21:27,490 INFO L401 ceAbstractionStarter]: For program point L1394(lines 1394 1397) no Hoare annotation was computed. [2018-01-20 22:21:27,490 INFO L401 ceAbstractionStarter]: For program point ldv_kobject_initEXIT(lines 1390 1403) no Hoare annotation was computed. [2018-01-20 22:21:27,491 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 1443) no Hoare annotation was computed. [2018-01-20 22:21:27,491 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1443) no Hoare annotation was computed. [2018-01-20 22:21:27,491 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1443) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:21:27,491 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1443) no Hoare annotation was computed. [2018-01-20 22:21:27,491 INFO L404 ceAbstractionStarter]: At program point #Ultimate.C_memsetENTRY(line -1) the Hoare annotation is: true [2018-01-20 22:21:27,491 INFO L404 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-01-20 22:21:27,491 INFO L401 ceAbstractionStarter]: For program point #Ultimate.C_memsetFINAL(line -1) no Hoare annotation was computed. [2018-01-20 22:21:27,491 INFO L401 ceAbstractionStarter]: For program point #Ultimate.C_memsetEXIT(line -1) no Hoare annotation was computed. [2018-01-20 22:21:27,491 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1443) the Hoare annotation is: true [2018-01-20 22:21:27,491 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1443) no Hoare annotation was computed. [2018-01-20 22:21:27,491 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 1443) the Hoare annotation is: true [2018-01-20 22:21:27,491 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 1443) no Hoare annotation was computed. [2018-01-20 22:21:27,492 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1443) no Hoare annotation was computed. [2018-01-20 22:21:27,492 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 1441 1443) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:21:27,492 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 1441 1443) no Hoare annotation was computed. [2018-01-20 22:21:27,492 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 1441 1443) no Hoare annotation was computed. [2018-01-20 22:21:27,492 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1441 1443) no Hoare annotation was computed. [2018-01-20 22:21:27,492 INFO L404 ceAbstractionStarter]: At program point LDV_INIT_LIST_HEADENTRY(lines 1097 1101) the Hoare annotation is: true [2018-01-20 22:21:27,492 INFO L401 ceAbstractionStarter]: For program point LDV_INIT_LIST_HEADFINAL(lines 1097 1101) no Hoare annotation was computed. [2018-01-20 22:21:27,492 INFO L401 ceAbstractionStarter]: For program point L1099'(line 1099) no Hoare annotation was computed. [2018-01-20 22:21:27,492 INFO L401 ceAbstractionStarter]: For program point LDV_INIT_LIST_HEADErr0EnsuresViolation(lines 1097 1101) no Hoare annotation was computed. [2018-01-20 22:21:27,492 INFO L401 ceAbstractionStarter]: For program point LDV_INIT_LIST_HEADEXIT(lines 1097 1101) no Hoare annotation was computed. [2018-01-20 22:21:27,493 INFO L401 ceAbstractionStarter]: For program point L1099(line 1099) no Hoare annotation was computed. [2018-01-20 22:21:27,493 INFO L397 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1435 1439) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:21:27,493 INFO L401 ceAbstractionStarter]: For program point entry_pointFINAL(lines 1435 1439) no Hoare annotation was computed. [2018-01-20 22:21:27,493 INFO L397 ceAbstractionStarter]: At program point L1437(line 1437) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:21:27,493 INFO L401 ceAbstractionStarter]: For program point entry_pointErr0EnsuresViolation(lines 1435 1439) no Hoare annotation was computed. [2018-01-20 22:21:27,493 INFO L401 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1435 1439) no Hoare annotation was computed. [2018-01-20 22:21:27,493 INFO L401 ceAbstractionStarter]: For program point L1437'(line 1437) no Hoare annotation was computed. [2018-01-20 22:21:27,493 INFO L401 ceAbstractionStarter]: For program point L1380(lines 1380 1381) no Hoare annotation was computed. [2018-01-20 22:21:27,493 INFO L404 ceAbstractionStarter]: At program point L1382'(line 1382) the Hoare annotation is: true [2018-01-20 22:21:27,493 INFO L401 ceAbstractionStarter]: For program point ldv_kobject_init_internalErr0EnsuresViolation(lines 1378 1388) no Hoare annotation was computed. [2018-01-20 22:21:27,494 INFO L404 ceAbstractionStarter]: At program point ldv_kobject_init_internalENTRY(lines 1378 1388) the Hoare annotation is: true [2018-01-20 22:21:27,494 INFO L401 ceAbstractionStarter]: For program point ldv_kobject_init_internalFINAL(lines 1378 1388) no Hoare annotation was computed. [2018-01-20 22:21:27,494 INFO L401 ceAbstractionStarter]: For program point ldv_kobject_init_internalEXIT(lines 1378 1388) no Hoare annotation was computed. [2018-01-20 22:21:27,494 INFO L404 ceAbstractionStarter]: At program point L1382(line 1382) the Hoare annotation is: true [2018-01-20 22:21:27,495 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:21:27,495 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:21:27,495 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:21:27,496 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:21:27,496 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:21:27,496 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:21:27,496 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:21:27,496 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_mallocErr0EnsuresViolation======== [2018-01-20 22:21:27,496 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:21:27,497 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-20 22:21:27,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-20 22:21:27,498 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:21:27,498 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:21:27,498 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-20 22:21:27,498 INFO L82 PathProgramCache]: Analyzing trace with hash 517058824, now seen corresponding path program 1 times [2018-01-20 22:21:27,498 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:21:27,498 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:21:27,499 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:21:27,500 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:21:27,500 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:21:27,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:21:27,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:21:27,531 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-20 22:21:27,532 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:21:27,532 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:21:27,532 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 22:21:27,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 22:21:27,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:21:27,532 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2018-01-20 22:21:27,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:21:27,604 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-01-20 22:21:27,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 22:21:27,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-01-20 22:21:27,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:21:27,606 INFO L225 Difference]: With dead ends: 67 [2018-01-20 22:21:27,606 INFO L226 Difference]: Without dead ends: 16 [2018-01-20 22:21:27,607 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-20 22:21:27,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-01-20 22:21:27,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-01-20 22:21:27,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-01-20 22:21:27,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 15 transitions. [2018-01-20 22:21:27,618 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 15 transitions. Word has length 13 [2018-01-20 22:21:27,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:21:27,618 INFO L432 AbstractCegarLoop]: Abstraction has 16 states and 15 transitions. [2018-01-20 22:21:27,618 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 22:21:27,618 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2018-01-20 22:21:27,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-20 22:21:27,619 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:21:27,619 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:21:27,619 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-20 22:21:27,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1322768470, now seen corresponding path program 1 times [2018-01-20 22:21:27,620 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:21:27,620 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:21:27,621 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:21:27,621 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:21:27,622 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:21:27,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:21:27,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:21:27,676 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:21:27,682 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:21:27,684 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:21:27,693 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:21:27,694 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:21:27,694 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:21:27,694 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:21:27,694 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:21:27,694 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:21:27,694 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:21:27,694 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_kobject_initErr0EnsuresViolation======== [2018-01-20 22:21:27,694 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:21:27,695 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-20 22:21:27,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-20 22:21:27,696 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:21:27,696 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-20 22:21:27,696 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_kobject_initErr0EnsuresViolation]=== [2018-01-20 22:21:27,697 INFO L82 PathProgramCache]: Analyzing trace with hash 102404402, now seen corresponding path program 1 times [2018-01-20 22:21:27,697 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:21:27,697 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:21:27,698 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:21:27,698 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:21:27,698 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:21:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:21:27,711 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:21:27,772 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-20 22:21:27,772 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:21:27,773 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 22:21:27,773 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:21:27,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:21:27,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:21:27,773 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 5 states. [2018-01-20 22:21:27,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:21:27,796 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2018-01-20 22:21:27,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:21:27,797 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-01-20 22:21:27,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:21:27,797 INFO L225 Difference]: With dead ends: 114 [2018-01-20 22:21:27,797 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:21:27,798 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-20 22:21:27,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:21:27,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:21:27,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:21:27,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:21:27,798 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-01-20 22:21:27,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:21:27,799 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:21:27,799 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:21:27,799 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:21:27,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:21:27,800 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:21:27,800 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:21:27,801 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:21:27,801 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:21:27,801 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:21:27,801 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:21:27,801 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:21:27,801 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 22:21:27,801 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:21:27,802 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-20 22:21:27,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 22:21:27,803 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:21:27,803 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 22:21:27,803 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 22:21:27,803 INFO L82 PathProgramCache]: Analyzing trace with hash 110227, now seen corresponding path program 1 times [2018-01-20 22:21:27,804 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:21:27,804 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:21:27,805 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:21:27,805 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:21:27,805 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:21:27,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:21:27,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:21:27,811 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:21:27,812 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:21:27,813 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:21:27,814 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:21:27,814 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:21:27,814 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:21:27,814 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:21:27,814 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:21:27,814 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:21:27,814 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 22:21:27,815 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:21:27,815 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-20 22:21:27,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-20 22:21:27,816 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:21:27,816 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-20 22:21:27,816 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:21:27,817 INFO L82 PathProgramCache]: Analyzing trace with hash 225129469, now seen corresponding path program 1 times [2018-01-20 22:21:27,817 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:21:27,817 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:21:27,817 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:21:27,818 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:21:27,818 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:21:27,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:21:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:21:27,834 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:21:27,836 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:21:27,837 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:21:27,837 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:21:27,838 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:21:27,838 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:21:27,838 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:21:27,841 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:21:27,841 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:21:27,841 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:21:27,841 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:21:27,841 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:21:27,841 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:21:27,841 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:21:27,841 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 22:21:27,841 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:21:27,842 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-20 22:21:27,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-20 22:21:27,843 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:21:27,844 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-20 22:21:27,844 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 22:21:27,844 INFO L82 PathProgramCache]: Analyzing trace with hash 585708474, now seen corresponding path program 1 times [2018-01-20 22:21:27,844 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:21:27,844 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:21:27,845 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:21:27,846 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:21:27,846 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:21:27,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:21:27,854 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:21:27,882 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-20 22:21:27,883 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:21:27,883 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:21:27,883 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 22:21:27,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 22:21:27,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:21:27,884 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2018-01-20 22:21:27,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:21:27,948 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-01-20 22:21:27,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 22:21:27,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-01-20 22:21:27,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:21:27,950 INFO L225 Difference]: With dead ends: 67 [2018-01-20 22:21:27,950 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:21:27,951 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-20 22:21:27,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:21:27,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:21:27,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:21:27,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:21:27,952 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2018-01-20 22:21:27,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:21:27,952 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:21:27,952 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 22:21:27,952 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:21:27,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:21:27,954 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:21:27,954 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:21:27,954 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:21:27,954 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:21:27,954 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:21:27,954 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:21:27,955 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:21:27,955 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == LDV_INIT_LIST_HEADErr0EnsuresViolation======== [2018-01-20 22:21:27,955 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:21:27,956 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-20 22:21:27,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-20 22:21:27,958 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:21:27,958 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-20 22:21:27,958 INFO L371 AbstractCegarLoop]: === Iteration 1 === [LDV_INIT_LIST_HEADErr0EnsuresViolation]=== [2018-01-20 22:21:27,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1993763615, now seen corresponding path program 1 times [2018-01-20 22:21:27,958 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:21:27,958 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:21:27,960 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:21:27,960 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:21:27,960 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:21:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:21:27,977 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:21:28,046 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-20 22:21:28,047 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:21:28,047 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 22:21:28,047 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:21:28,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:21:28,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:21:28,048 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 5 states. [2018-01-20 22:21:28,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:21:28,098 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2018-01-20 22:21:28,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:21:28,098 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-01-20 22:21:28,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:21:28,099 INFO L225 Difference]: With dead ends: 114 [2018-01-20 22:21:28,099 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:21:28,099 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-20 22:21:28,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:21:28,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:21:28,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:21:28,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:21:28,100 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2018-01-20 22:21:28,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:21:28,101 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:21:28,101 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:21:28,101 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:21:28,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:21:28,102 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:21:28,102 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:21:28,102 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:21:28,103 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:21:28,103 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:21:28,103 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:21:28,103 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:21:28,103 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == entry_pointErr0EnsuresViolation======== [2018-01-20 22:21:28,103 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:21:28,104 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-20 22:21:28,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-20 22:21:28,105 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:21:28,105 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-20 22:21:28,105 INFO L371 AbstractCegarLoop]: === Iteration 1 === [entry_pointErr0EnsuresViolation]=== [2018-01-20 22:21:28,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1806194063, now seen corresponding path program 1 times [2018-01-20 22:21:28,106 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:21:28,106 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:21:28,107 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:21:28,107 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:21:28,107 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:21:28,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:21:28,116 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:21:28,143 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-20 22:21:28,143 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:21:28,143 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:21:28,143 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 22:21:28,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 22:21:28,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:21:28,144 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2018-01-20 22:21:28,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:21:28,202 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-01-20 22:21:28,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 22:21:28,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-01-20 22:21:28,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:21:28,203 INFO L225 Difference]: With dead ends: 67 [2018-01-20 22:21:28,203 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:21:28,204 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-20 22:21:28,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:21:28,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:21:28,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:21:28,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:21:28,205 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2018-01-20 22:21:28,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:21:28,205 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:21:28,205 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 22:21:28,205 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:21:28,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:21:28,207 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:21:28,207 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:21:28,207 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:21:28,207 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:21:28,207 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:21:28,207 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:21:28,208 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:21:28,208 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_kobject_init_internalErr0EnsuresViolation======== [2018-01-20 22:21:28,208 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:21:28,209 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-20 22:21:28,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-20 22:21:28,210 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:21:28,210 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-20 22:21:28,210 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_kobject_init_internalErr0EnsuresViolation]=== [2018-01-20 22:21:28,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1305563254, now seen corresponding path program 1 times [2018-01-20 22:21:28,211 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:21:28,211 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:21:28,212 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:21:28,212 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:21:28,212 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:21:28,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:21:28,222 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:21:28,302 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-20 22:21:28,302 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:21:28,302 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 22:21:28,303 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:21:28,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:21:28,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:21:28,303 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 5 states. [2018-01-20 22:21:28,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:21:28,326 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2018-01-20 22:21:28,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:21:28,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-20 22:21:28,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:21:28,327 INFO L225 Difference]: With dead ends: 114 [2018-01-20 22:21:28,327 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:21:28,328 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-20 22:21:28,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:21:28,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:21:28,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:21:28,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:21:28,329 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-01-20 22:21:28,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:21:28,330 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:21:28,330 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:21:28,330 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:21:28,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:21:28,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 10:21:28 BoogieIcfgContainer [2018-01-20 22:21:28,333 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-20 22:21:28,334 INFO L168 Benchmark]: Toolchain (without parser) took 2284.58 ms. Allocated memory was 308.8 MB in the beginning and 450.9 MB in the end (delta: 142.1 MB). Free memory was 267.7 MB in the beginning and 382.1 MB in the end (delta: -114.4 MB). Peak memory consumption was 27.7 MB. Max. memory is 5.3 GB. [2018-01-20 22:21:28,336 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 308.8 MB. Free memory is still 273.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 22:21:28,336 INFO L168 Benchmark]: CACSL2BoogieTranslator took 229.89 ms. Allocated memory is still 308.8 MB. Free memory was 267.7 MB in the beginning and 253.7 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-20 22:21:28,336 INFO L168 Benchmark]: Boogie Preprocessor took 34.37 ms. Allocated memory is still 308.8 MB. Free memory was 253.7 MB in the beginning and 251.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-20 22:21:28,336 INFO L168 Benchmark]: RCFGBuilder took 293.08 ms. Allocated memory is still 308.8 MB. Free memory was 251.7 MB in the beginning and 230.8 MB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 5.3 GB. [2018-01-20 22:21:28,337 INFO L168 Benchmark]: TraceAbstraction took 1720.41 ms. Allocated memory was 308.8 MB in the beginning and 450.9 MB in the end (delta: 142.1 MB). Free memory was 230.8 MB in the beginning and 382.1 MB in the end (delta: -151.3 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 22:21:28,338 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.14 ms. Allocated memory is still 308.8 MB. Free memory is still 273.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 229.89 ms. Allocated memory is still 308.8 MB. Free memory was 267.7 MB in the beginning and 253.7 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.37 ms. Allocated memory is still 308.8 MB. Free memory was 253.7 MB in the beginning and 251.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 293.08 ms. Allocated memory is still 308.8 MB. Free memory was 251.7 MB in the beginning and 230.8 MB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1720.41 ms. Allocated memory was 308.8 MB in the beginning and 450.9 MB in the end (delta: 142.1 MB). Free memory was 230.8 MB in the beginning and 382.1 MB in the end (delta: -151.3 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.0s 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.1s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s 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.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, 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.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, 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_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-20_22-21-28-349.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_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-20_22-21-28-349.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_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-20_22-21-28-349.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_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-20_22-21-28-349.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_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-20_22-21-28-349.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_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-20_22-21-28-349.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_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-20_22-21-28-349.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_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-6-2018-01-20_22-21-28-349.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_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-7-2018-01-20_22-21-28-349.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_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-8-2018-01-20_22-21-28-349.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_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-9-2018-01-20_22-21-28-349.csv Received shutdown request...