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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_2_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 03:14:56,111 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 03:14:56,113 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 03:14:56,126 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 03:14:56,126 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 03:14:56,127 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 03:14:56,128 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 03:14:56,129 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 03:14:56,131 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 03:14:56,132 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 03:14:56,132 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 03:14:56,132 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 03:14:56,133 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 03:14:56,134 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 03:14:56,135 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 03:14:56,137 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 03:14:56,138 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 03:14:56,140 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 03:14:56,141 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 03:14:56,141 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 03:14:56,143 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 03:14:56,143 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 03:14:56,144 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 03:14:56,144 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 03:14:56,145 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 03:14:56,146 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 03:14:56,146 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 03:14:56,147 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 03:14:56,147 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 03:14:56,147 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 03:14:56,148 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 03:14:56,148 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-04 03:14:56,157 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 03:14:56,158 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 03:14:56,159 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 03:14:56,159 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 03:14:56,159 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 03:14:56,159 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 03:14:56,159 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 03:14:56,159 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 03:14:56,160 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 03:14:56,160 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 03:14:56,160 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 03:14:56,160 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 03:14:56,160 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 03:14:56,160 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 03:14:56,160 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 03:14:56,161 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 03:14:56,161 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 03:14:56,161 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 03:14:56,161 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 03:14:56,161 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 03:14:56,161 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 03:14:56,162 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 03:14:56,162 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 03:14:56,194 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 03:14:56,204 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 03:14:56,207 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 03:14:56,208 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 03:14:56,209 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 03:14:56,209 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_2_false-valid-memtrack_true-termination.i [2018-02-04 03:14:56,369 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 03:14:56,370 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 03:14:56,371 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 03:14:56,371 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 03:14:56,376 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 03:14:56,377 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:14:56" (1/1) ... [2018-02-04 03:14:56,380 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f13972f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:14:56, skipping insertion in model container [2018-02-04 03:14:56,380 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:14:56" (1/1) ... [2018-02-04 03:14:56,394 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 03:14:56,431 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 03:14:56,511 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 03:14:56,524 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 03:14:56,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:14:56 WrapperNode [2018-02-04 03:14:56,530 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 03:14:56,530 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 03:14:56,530 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 03:14:56,530 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 03:14:56,539 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:14:56" (1/1) ... [2018-02-04 03:14:56,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:14:56" (1/1) ... [2018-02-04 03:14:56,547 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:14:56" (1/1) ... [2018-02-04 03:14:56,547 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:14:56" (1/1) ... [2018-02-04 03:14:56,550 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:14:56" (1/1) ... [2018-02-04 03:14:56,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:14:56" (1/1) ... [2018-02-04 03:14:56,553 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:14:56" (1/1) ... [2018-02-04 03:14:56,555 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 03:14:56,555 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 03:14:56,555 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 03:14:56,555 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 03:14:56,556 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:14:56" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-04 03:14:56,595 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 03:14:56,595 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 03:14:56,595 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 03:14:56,596 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-02-04 03:14:56,596 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-02-04 03:14:56,596 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-02-04 03:14:56,596 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-02-04 03:14:56,596 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-02-04 03:14:56,596 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 03:14:56,596 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 03:14:56,596 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 03:14:56,596 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 03:14:56,596 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 03:14:56,596 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 03:14:56,596 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 03:14:56,596 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 03:14:56,597 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 03:14:56,597 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-04 03:14:56,597 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-04 03:14:56,597 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 03:14:56,597 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 03:14:56,597 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-04 03:14:56,597 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 03:14:56,597 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-02-04 03:14:56,597 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-02-04 03:14:56,597 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-02-04 03:14:56,597 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-02-04 03:14:56,597 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-02-04 03:14:56,597 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 03:14:56,598 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 03:14:56,598 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 03:14:56,598 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 03:14:56,717 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-04 03:14:56,787 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 03:14:56,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:14:56 BoogieIcfgContainer [2018-02-04 03:14:56,788 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 03:14:56,788 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 03:14:56,788 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 03:14:56,791 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 03:14:56,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 03:14:56" (1/3) ... [2018-02-04 03:14:56,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32a3f2ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:14:56, skipping insertion in model container [2018-02-04 03:14:56,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:14:56" (2/3) ... [2018-02-04 03:14:56,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32a3f2ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:14:56, skipping insertion in model container [2018-02-04 03:14:56,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:14:56" (3/3) ... [2018-02-04 03:14:56,794 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test22_2_false-valid-memtrack_true-termination.i [2018-02-04 03:14:56,799 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 03:14:56,803 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-04 03:14:56,827 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 03:14:56,827 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 03:14:56,827 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 03:14:56,827 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 03:14:56,828 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 03:14:56,828 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 03:14:56,828 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 03:14:56,828 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 03:14:56,829 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 03:14:56,841 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-02-04 03:14:56,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 03:14:56,850 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:14:56,851 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:14:56,851 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:14:56,855 INFO L82 PathProgramCache]: Analyzing trace with hash 13572496, now seen corresponding path program 1 times [2018-02-04 03:14:56,895 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:14:56,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:14:56,934 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:14:57,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-02-04 03:14:57,049 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:14:57,049 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:14:57,050 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:14:57,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:57,051 INFO L182 omatonBuilderFactory]: Interpolants [68#true, 69#false, 70#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 71#(and (= 0 |ldv_kobject_create_#t~ret8.offset|) (= 0 |ldv_kobject_create_#t~ret8.base|)), 72#(and (= 0 ldv_kobject_create_~kobj~0.base) (= ldv_kobject_create_~kobj~0.offset 0))] [2018-02-04 03:14:57,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:57,052 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:14:57,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:14:57,108 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:14:57,109 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 5 states. [2018-02-04 03:14:57,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:14:57,143 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-02-04 03:14:57,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:14:57,145 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 03:14:57,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:14:57,153 INFO L225 Difference]: With dead ends: 71 [2018-02-04 03:14:57,153 INFO L226 Difference]: Without dead ends: 68 [2018-02-04 03:14:57,154 INFO L554 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-02-04 03:14:57,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-04 03:14:57,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2018-02-04 03:14:57,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-04 03:14:57,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-02-04 03:14:57,180 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 17 [2018-02-04 03:14:57,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:14:57,180 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-02-04 03:14:57,181 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:14:57,181 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-02-04 03:14:57,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 03:14:57,182 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:14:57,182 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:14:57,182 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:14:57,182 INFO L82 PathProgramCache]: Analyzing trace with hash 64872882, now seen corresponding path program 1 times [2018-02-04 03:14:57,184 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:14:57,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:14:57,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:14:57,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:57,246 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:14:57,246 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:14:57,246 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:14:57,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:57,247 INFO L182 omatonBuilderFactory]: Interpolants [210#true, 211#false, 212#(= 1 (select |#valid| |ldv_malloc_#t~malloc4.base|)), 213#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 214#(= 1 (select |#valid| |ldv_kobject_create_#t~ret8.base|)), 215#(= 1 (select |#valid| ldv_kobject_create_~kobj~0.base))] [2018-02-04 03:14:57,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:57,248 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:14:57,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:14:57,249 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:14:57,249 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 6 states. [2018-02-04 03:14:57,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:14:57,346 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-02-04 03:14:57,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:14:57,346 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 03:14:57,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:14:57,347 INFO L225 Difference]: With dead ends: 67 [2018-02-04 03:14:57,347 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 03:14:57,348 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:14:57,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 03:14:57,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2018-02-04 03:14:57,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-04 03:14:57,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-02-04 03:14:57,352 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 19 [2018-02-04 03:14:57,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:14:57,353 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-02-04 03:14:57,353 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:14:57,353 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-02-04 03:14:57,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 03:14:57,353 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:14:57,353 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:14:57,353 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:14:57,354 INFO L82 PathProgramCache]: Analyzing trace with hash 64872883, now seen corresponding path program 1 times [2018-02-04 03:14:57,355 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:14:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:14:57,367 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:14:57,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:57,541 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:14:57,541 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 03:14:57,541 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:14:57,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:57,542 INFO L182 omatonBuilderFactory]: Interpolants [352#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0))), 353#(and (= 0 |ldv_malloc_#t~malloc4.offset|) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc4.base|)) (<= 2147483648 |ldv_malloc_#in~size|))), 354#(and (= 0 |ldv_malloc_#res.offset|) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)) (<= 2147483648 |ldv_malloc_#in~size|))), 355#(and (<= 16 (select |#length| |ldv_kobject_create_#t~ret8.base|)) (= 0 |ldv_kobject_create_#t~ret8.offset|)), 356#(and (<= 16 (select |#length| ldv_kobject_create_~kobj~0.base)) (= ldv_kobject_create_~kobj~0.offset 0)), 350#true, 351#false] [2018-02-04 03:14:57,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:57,542 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 03:14:57,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 03:14:57,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:14:57,543 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 7 states. [2018-02-04 03:14:57,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:14:57,680 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-02-04 03:14:57,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:14:57,681 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-02-04 03:14:57,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:14:57,682 INFO L225 Difference]: With dead ends: 66 [2018-02-04 03:14:57,682 INFO L226 Difference]: Without dead ends: 66 [2018-02-04 03:14:57,682 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:14:57,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-04 03:14:57,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-02-04 03:14:57,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 03:14:57,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-02-04 03:14:57,687 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 19 [2018-02-04 03:14:57,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:14:57,687 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-02-04 03:14:57,687 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 03:14:57,687 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-02-04 03:14:57,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 03:14:57,688 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:14:57,688 INFO L351 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-02-04 03:14:57,688 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:14:57,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1610907055, now seen corresponding path program 1 times [2018-02-04 03:14:57,690 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:14:57,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:14:57,698 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:14:57,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:57,723 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:14:57,723 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 03:14:57,724 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:14:57,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:57,724 INFO L182 omatonBuilderFactory]: Interpolants [491#true, 492#false, 493#(= |#valid| |old(#valid)|)] [2018-02-04 03:14:57,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:57,724 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 03:14:57,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 03:14:57,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 03:14:57,725 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 3 states. [2018-02-04 03:14:57,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:14:57,767 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-02-04 03:14:57,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 03:14:57,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-02-04 03:14:57,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:14:57,769 INFO L225 Difference]: With dead ends: 70 [2018-02-04 03:14:57,769 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 03:14:57,769 INFO L554 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-02-04 03:14:57,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 03:14:57,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-04 03:14:57,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 03:14:57,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-02-04 03:14:57,773 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 22 [2018-02-04 03:14:57,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:14:57,774 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-02-04 03:14:57,774 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 03:14:57,774 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-02-04 03:14:57,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 03:14:57,775 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:14:57,775 INFO L351 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-02-04 03:14:57,775 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:14:57,775 INFO L82 PathProgramCache]: Analyzing trace with hash -655458449, now seen corresponding path program 1 times [2018-02-04 03:14:57,776 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:14:57,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:14:57,785 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:14:57,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:57,812 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:14:57,812 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 03:14:57,812 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:14:57,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:57,813 INFO L182 omatonBuilderFactory]: Interpolants [624#true, 625#false, 626#(not (= |ldv_malloc_#t~malloc4.base| 0)), 627#(not (= |ldv_malloc_#res.base| 0)), 628#(not (= |ldv_kobject_create_#t~ret8.base| 0)), 629#(not (= ldv_kobject_create_~kobj~0.base 0))] [2018-02-04 03:14:57,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:57,813 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:14:57,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:14:57,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:14:57,813 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 6 states. [2018-02-04 03:14:57,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:14:57,826 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-02-04 03:14:57,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:14:57,827 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 03:14:57,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:14:57,827 INFO L225 Difference]: With dead ends: 60 [2018-02-04 03:14:57,827 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 03:14:57,827 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:14:57,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 03:14:57,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-04 03:14:57,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 03:14:57,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-02-04 03:14:57,830 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 24 [2018-02-04 03:14:57,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:14:57,830 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-02-04 03:14:57,830 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:14:57,830 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-02-04 03:14:57,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 03:14:57,831 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:14:57,831 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:14:57,831 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:14:57,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1673666846, now seen corresponding path program 1 times [2018-02-04 03:14:57,832 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:14:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:14:57,840 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:14:57,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:57,895 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:14:57,895 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 03:14:57,895 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:14:57,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:57,896 INFO L182 omatonBuilderFactory]: Interpolants [752#true, 753#false, 754#(= 1 (select |#valid| |#Ultimate.C_memset_#ptr.base|)), 755#(= 1 (select |#valid| ldv_kobject_create_~kobj~0.base)), 756#(= 1 (select |#valid| |ldv_kobject_init_#in~kobj.base|)), 757#(= 1 (select |#valid| ldv_kobject_init_~kobj.base)), 758#(= 1 (select |#valid| |ldv_kobject_init_internal_#in~kobj.base|)), 759#(= 1 (select |#valid| ldv_kobject_init_internal_~kobj.base)), 760#(= 1 (select |#valid| |ldv_kref_init_#in~kref.base|)), 761#(= 1 (select |#valid| ldv_kref_init_~kref.base))] [2018-02-04 03:14:57,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:57,896 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 03:14:57,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 03:14:57,896 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:14:57,897 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 10 states. [2018-02-04 03:14:58,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:14:58,040 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-02-04 03:14:58,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:14:58,040 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-02-04 03:14:58,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:14:58,041 INFO L225 Difference]: With dead ends: 59 [2018-02-04 03:14:58,046 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 03:14:58,046 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:14:58,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 03:14:58,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-02-04 03:14:58,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-04 03:14:58,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-02-04 03:14:58,049 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 34 [2018-02-04 03:14:58,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:14:58,049 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-02-04 03:14:58,049 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 03:14:58,049 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-02-04 03:14:58,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 03:14:58,050 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:14:58,050 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:14:58,050 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:14:58,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1673666845, now seen corresponding path program 1 times [2018-02-04 03:14:58,052 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:14:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:14:58,065 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:14:58,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:58,095 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:14:58,095 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 03:14:58,095 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:14:58,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:58,095 INFO L182 omatonBuilderFactory]: Interpolants [886#true, 887#false, 888#(= |#Ultimate.C_memset_#t~loopctr11| 0), 889#(<= |#Ultimate.C_memset_#amount| 0)] [2018-02-04 03:14:58,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:58,096 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 03:14:58,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 03:14:58,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 03:14:58,096 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 4 states. [2018-02-04 03:14:58,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:14:58,109 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-02-04 03:14:58,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 03:14:58,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-02-04 03:14:58,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:14:58,111 INFO L225 Difference]: With dead ends: 62 [2018-02-04 03:14:58,111 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 03:14:58,111 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:14:58,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 03:14:58,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-04 03:14:58,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 03:14:58,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-02-04 03:14:58,114 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2018-02-04 03:14:58,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:14:58,115 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-02-04 03:14:58,115 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 03:14:58,115 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-02-04 03:14:58,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 03:14:58,116 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:14:58,116 INFO L351 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] [2018-02-04 03:14:58,116 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:14:58,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1908152085, now seen corresponding path program 1 times [2018-02-04 03:14:58,117 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:14:58,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:14:58,129 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:14:58,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:58,155 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:14:58,155 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-04 03:14:58,155 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:14:58,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:58,156 INFO L182 omatonBuilderFactory]: Interpolants [1014#true, 1015#false, 1016#(= |#Ultimate.C_memset_#t~loopctr11| 0), 1017#(<= |#Ultimate.C_memset_#t~loopctr11| 1), 1018#(<= |#Ultimate.C_memset_#amount| 1)] [2018-02-04 03:14:58,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:58,156 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:14:58,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:14:58,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:14:58,157 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 5 states. [2018-02-04 03:14:58,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:14:58,175 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-02-04 03:14:58,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:14:58,176 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-02-04 03:14:58,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:14:58,177 INFO L225 Difference]: With dead ends: 63 [2018-02-04 03:14:58,177 INFO L226 Difference]: Without dead ends: 61 [2018-02-04 03:14:58,178 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:14:58,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-04 03:14:58,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-02-04 03:14:58,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-04 03:14:58,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-02-04 03:14:58,181 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 35 [2018-02-04 03:14:58,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:14:58,182 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-02-04 03:14:58,182 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:14:58,182 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-02-04 03:14:58,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 03:14:58,183 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:14:58,183 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:14:58,183 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:14:58,183 INFO L82 PathProgramCache]: Analyzing trace with hash -587259933, now seen corresponding path program 2 times [2018-02-04 03:14:58,184 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:14:58,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:14:58,196 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:14:58,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:58,230 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:14:58,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 03:14:58,230 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:14:58,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:58,231 INFO L182 omatonBuilderFactory]: Interpolants [1145#true, 1146#false, 1147#(= |#Ultimate.C_memset_#t~loopctr11| 0), 1148#(<= |#Ultimate.C_memset_#t~loopctr11| 1), 1149#(<= |#Ultimate.C_memset_#t~loopctr11| 2), 1150#(<= |#Ultimate.C_memset_#amount| 2)] [2018-02-04 03:14:58,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:58,231 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:14:58,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:14:58,231 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:14:58,231 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 6 states. [2018-02-04 03:14:58,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:14:58,249 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2018-02-04 03:14:58,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:14:58,249 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-02-04 03:14:58,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:14:58,250 INFO L225 Difference]: With dead ends: 64 [2018-02-04 03:14:58,250 INFO L226 Difference]: Without dead ends: 62 [2018-02-04 03:14:58,250 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:14:58,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-04 03:14:58,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-02-04 03:14:58,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 03:14:58,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-02-04 03:14:58,253 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 36 [2018-02-04 03:14:58,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:14:58,253 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-02-04 03:14:58,253 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:14:58,253 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-02-04 03:14:58,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 03:14:58,254 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:14:58,254 INFO L351 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-04 03:14:58,254 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:14:58,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1705691115, now seen corresponding path program 3 times [2018-02-04 03:14:58,255 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:14:58,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:14:58,268 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:14:58,310 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:58,310 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:14:58,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 03:14:58,311 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:14:58,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:58,311 INFO L182 omatonBuilderFactory]: Interpolants [1280#false, 1281#(= |#Ultimate.C_memset_#t~loopctr11| 0), 1282#(<= |#Ultimate.C_memset_#t~loopctr11| 1), 1283#(<= |#Ultimate.C_memset_#t~loopctr11| 2), 1284#(<= |#Ultimate.C_memset_#t~loopctr11| 3), 1285#(<= |#Ultimate.C_memset_#amount| 3), 1279#true] [2018-02-04 03:14:58,311 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:58,311 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 03:14:58,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 03:14:58,312 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:14:58,312 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 7 states. [2018-02-04 03:14:58,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:14:58,334 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2018-02-04 03:14:58,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:14:58,335 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-02-04 03:14:58,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:14:58,336 INFO L225 Difference]: With dead ends: 65 [2018-02-04 03:14:58,336 INFO L226 Difference]: Without dead ends: 63 [2018-02-04 03:14:58,336 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:14:58,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-04 03:14:58,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-02-04 03:14:58,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-04 03:14:58,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2018-02-04 03:14:58,340 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 37 [2018-02-04 03:14:58,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:14:58,340 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2018-02-04 03:14:58,340 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 03:14:58,340 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-02-04 03:14:58,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 03:14:58,341 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:14:58,341 INFO L351 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-04 03:14:58,341 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:14:58,342 INFO L82 PathProgramCache]: Analyzing trace with hash -227270429, now seen corresponding path program 4 times [2018-02-04 03:14:58,342 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:14:58,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:14:58,356 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:14:58,400 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:58,400 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:14:58,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 03:14:58,400 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:14:58,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:58,401 INFO L182 omatonBuilderFactory]: Interpolants [1416#true, 1417#false, 1418#(= |#Ultimate.C_memset_#t~loopctr11| 0), 1419#(<= |#Ultimate.C_memset_#t~loopctr11| 1), 1420#(<= |#Ultimate.C_memset_#t~loopctr11| 2), 1421#(<= |#Ultimate.C_memset_#t~loopctr11| 3), 1422#(<= |#Ultimate.C_memset_#t~loopctr11| 4), 1423#(<= |#Ultimate.C_memset_#amount| 4)] [2018-02-04 03:14:58,401 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:58,401 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:14:58,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:14:58,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:14:58,402 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 8 states. [2018-02-04 03:14:58,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:14:58,428 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-02-04 03:14:58,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 03:14:58,430 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-02-04 03:14:58,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:14:58,430 INFO L225 Difference]: With dead ends: 66 [2018-02-04 03:14:58,431 INFO L226 Difference]: Without dead ends: 64 [2018-02-04 03:14:58,431 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:14:58,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-04 03:14:58,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-02-04 03:14:58,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 03:14:58,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2018-02-04 03:14:58,434 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 38 [2018-02-04 03:14:58,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:14:58,434 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2018-02-04 03:14:58,434 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:14:58,435 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2018-02-04 03:14:58,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 03:14:58,435 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:14:58,435 INFO L351 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-04 03:14:58,435 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:14:58,436 INFO L82 PathProgramCache]: Analyzing trace with hash -19536149, now seen corresponding path program 5 times [2018-02-04 03:14:58,437 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:14:58,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:14:58,452 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:14:58,500 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:58,500 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:14:58,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 03:14:58,500 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:14:58,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:58,501 INFO L182 omatonBuilderFactory]: Interpolants [1556#true, 1557#false, 1558#(= |#Ultimate.C_memset_#t~loopctr11| 0), 1559#(<= |#Ultimate.C_memset_#t~loopctr11| 1), 1560#(<= |#Ultimate.C_memset_#t~loopctr11| 2), 1561#(<= |#Ultimate.C_memset_#t~loopctr11| 3), 1562#(<= |#Ultimate.C_memset_#t~loopctr11| 4), 1563#(<= |#Ultimate.C_memset_#t~loopctr11| 5), 1564#(<= |#Ultimate.C_memset_#amount| 5)] [2018-02-04 03:14:58,501 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:58,501 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 03:14:58,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 03:14:58,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:14:58,502 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 9 states. [2018-02-04 03:14:58,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:14:58,525 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-02-04 03:14:58,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 03:14:58,526 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-02-04 03:14:58,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:14:58,527 INFO L225 Difference]: With dead ends: 67 [2018-02-04 03:14:58,527 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 03:14:58,527 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:14:58,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 03:14:58,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-02-04 03:14:58,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-04 03:14:58,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2018-02-04 03:14:58,531 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 39 [2018-02-04 03:14:58,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:14:58,531 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2018-02-04 03:14:58,531 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 03:14:58,531 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2018-02-04 03:14:58,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 03:14:58,532 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:14:58,532 INFO L351 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-04 03:14:58,532 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:14:58,532 INFO L82 PathProgramCache]: Analyzing trace with hash 2125259235, now seen corresponding path program 6 times [2018-02-04 03:14:58,533 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:14:58,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:14:58,546 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:14:58,607 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:58,607 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:14:58,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 03:14:58,608 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:14:58,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:58,608 INFO L182 omatonBuilderFactory]: Interpolants [1699#true, 1700#false, 1701#(= |#Ultimate.C_memset_#t~loopctr11| 0), 1702#(<= |#Ultimate.C_memset_#t~loopctr11| 1), 1703#(<= |#Ultimate.C_memset_#t~loopctr11| 2), 1704#(<= |#Ultimate.C_memset_#t~loopctr11| 3), 1705#(<= |#Ultimate.C_memset_#t~loopctr11| 4), 1706#(<= |#Ultimate.C_memset_#t~loopctr11| 5), 1707#(<= |#Ultimate.C_memset_#t~loopctr11| 6), 1708#(<= |#Ultimate.C_memset_#amount| 6)] [2018-02-04 03:14:58,608 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:58,608 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 03:14:58,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 03:14:58,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:14:58,609 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 10 states. [2018-02-04 03:14:58,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:14:58,634 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2018-02-04 03:14:58,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:14:58,635 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2018-02-04 03:14:58,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:14:58,635 INFO L225 Difference]: With dead ends: 68 [2018-02-04 03:14:58,635 INFO L226 Difference]: Without dead ends: 66 [2018-02-04 03:14:58,636 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:14:58,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-04 03:14:58,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-02-04 03:14:58,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-04 03:14:58,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2018-02-04 03:14:58,638 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 40 [2018-02-04 03:14:58,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:14:58,638 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2018-02-04 03:14:58,638 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 03:14:58,639 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-02-04 03:14:58,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 03:14:58,639 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:14:58,639 INFO L351 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-04 03:14:58,639 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:14:58,639 INFO L82 PathProgramCache]: Analyzing trace with hash -105560597, now seen corresponding path program 7 times [2018-02-04 03:14:58,640 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:14:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:14:58,651 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:14:58,712 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:58,712 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:14:58,712 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 03:14:58,713 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:14:58,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:58,713 INFO L182 omatonBuilderFactory]: Interpolants [1845#true, 1846#false, 1847#(= |#Ultimate.C_memset_#t~loopctr11| 0), 1848#(<= |#Ultimate.C_memset_#t~loopctr11| 1), 1849#(<= |#Ultimate.C_memset_#t~loopctr11| 2), 1850#(<= |#Ultimate.C_memset_#t~loopctr11| 3), 1851#(<= |#Ultimate.C_memset_#t~loopctr11| 4), 1852#(<= |#Ultimate.C_memset_#t~loopctr11| 5), 1853#(<= |#Ultimate.C_memset_#t~loopctr11| 6), 1854#(<= |#Ultimate.C_memset_#t~loopctr11| 7), 1855#(<= |#Ultimate.C_memset_#amount| 7)] [2018-02-04 03:14:58,713 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:58,713 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 03:14:58,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 03:14:58,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:14:58,714 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 11 states. [2018-02-04 03:14:58,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:14:58,741 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2018-02-04 03:14:58,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 03:14:58,742 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-02-04 03:14:58,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:14:58,742 INFO L225 Difference]: With dead ends: 69 [2018-02-04 03:14:58,742 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 03:14:58,743 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-02-04 03:14:58,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 03:14:58,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-02-04 03:14:58,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-04 03:14:58,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-02-04 03:14:58,746 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 41 [2018-02-04 03:14:58,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:14:58,746 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-02-04 03:14:58,746 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 03:14:58,746 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-02-04 03:14:58,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 03:14:58,747 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:14:58,747 INFO L351 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-04 03:14:58,747 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:14:58,747 INFO L82 PathProgramCache]: Analyzing trace with hash -541498653, now seen corresponding path program 8 times [2018-02-04 03:14:58,748 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:14:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:14:58,761 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:14:58,850 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:58,850 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:14:58,850 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 03:14:58,850 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:14:58,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:58,851 INFO L182 omatonBuilderFactory]: Interpolants [2000#(<= |#Ultimate.C_memset_#t~loopctr11| 4), 2001#(<= |#Ultimate.C_memset_#t~loopctr11| 5), 2002#(<= |#Ultimate.C_memset_#t~loopctr11| 6), 2003#(<= |#Ultimate.C_memset_#t~loopctr11| 7), 2004#(<= |#Ultimate.C_memset_#t~loopctr11| 8), 2005#(<= |#Ultimate.C_memset_#amount| 8), 1994#true, 1995#false, 1996#(= |#Ultimate.C_memset_#t~loopctr11| 0), 1997#(<= |#Ultimate.C_memset_#t~loopctr11| 1), 1998#(<= |#Ultimate.C_memset_#t~loopctr11| 2), 1999#(<= |#Ultimate.C_memset_#t~loopctr11| 3)] [2018-02-04 03:14:58,851 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:58,851 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 03:14:58,851 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 03:14:58,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-02-04 03:14:58,852 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 12 states. [2018-02-04 03:14:58,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:14:58,882 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2018-02-04 03:14:58,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 03:14:58,883 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-02-04 03:14:58,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:14:58,883 INFO L225 Difference]: With dead ends: 70 [2018-02-04 03:14:58,883 INFO L226 Difference]: Without dead ends: 68 [2018-02-04 03:14:58,884 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:14:58,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-04 03:14:58,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-02-04 03:14:58,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-04 03:14:58,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2018-02-04 03:14:58,886 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 42 [2018-02-04 03:14:58,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:14:58,886 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2018-02-04 03:14:58,891 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 03:14:58,891 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2018-02-04 03:14:58,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 03:14:58,892 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:14:58,892 INFO L351 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-04 03:14:58,892 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:14:58,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1170676501, now seen corresponding path program 9 times [2018-02-04 03:14:58,893 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:14:58,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:14:58,912 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:14:58,991 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:58,991 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:14:58,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 03:14:58,991 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:14:58,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:58,992 INFO L182 omatonBuilderFactory]: Interpolants [2146#true, 2147#false, 2148#(= |#Ultimate.C_memset_#t~loopctr11| 0), 2149#(<= |#Ultimate.C_memset_#t~loopctr11| 1), 2150#(<= |#Ultimate.C_memset_#t~loopctr11| 2), 2151#(<= |#Ultimate.C_memset_#t~loopctr11| 3), 2152#(<= |#Ultimate.C_memset_#t~loopctr11| 4), 2153#(<= |#Ultimate.C_memset_#t~loopctr11| 5), 2154#(<= |#Ultimate.C_memset_#t~loopctr11| 6), 2155#(<= |#Ultimate.C_memset_#t~loopctr11| 7), 2156#(<= |#Ultimate.C_memset_#t~loopctr11| 8), 2157#(<= |#Ultimate.C_memset_#t~loopctr11| 9), 2158#(<= |#Ultimate.C_memset_#amount| 9)] [2018-02-04 03:14:58,992 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:58,992 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 03:14:58,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 03:14:58,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:14:58,993 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 13 states. [2018-02-04 03:14:59,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:14:59,016 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2018-02-04 03:14:59,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 03:14:59,017 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-02-04 03:14:59,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:14:59,017 INFO L225 Difference]: With dead ends: 71 [2018-02-04 03:14:59,017 INFO L226 Difference]: Without dead ends: 69 [2018-02-04 03:14:59,017 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:14:59,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-04 03:14:59,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-02-04 03:14:59,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-04 03:14:59,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2018-02-04 03:14:59,020 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 43 [2018-02-04 03:14:59,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:14:59,020 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2018-02-04 03:14:59,020 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 03:14:59,020 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2018-02-04 03:14:59,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 03:14:59,021 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:14:59,021 INFO L351 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-04 03:14:59,021 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:14:59,021 INFO L82 PathProgramCache]: Analyzing trace with hash 799646691, now seen corresponding path program 10 times [2018-02-04 03:14:59,022 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:14:59,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:14:59,036 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:14:59,130 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:59,130 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:14:59,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 03:14:59,130 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:14:59,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:59,131 INFO L182 omatonBuilderFactory]: Interpolants [2304#(<= |#Ultimate.C_memset_#t~loopctr11| 1), 2305#(<= |#Ultimate.C_memset_#t~loopctr11| 2), 2306#(<= |#Ultimate.C_memset_#t~loopctr11| 3), 2307#(<= |#Ultimate.C_memset_#t~loopctr11| 4), 2308#(<= |#Ultimate.C_memset_#t~loopctr11| 5), 2309#(<= |#Ultimate.C_memset_#t~loopctr11| 6), 2310#(<= |#Ultimate.C_memset_#t~loopctr11| 7), 2311#(<= |#Ultimate.C_memset_#t~loopctr11| 8), 2312#(<= |#Ultimate.C_memset_#t~loopctr11| 9), 2313#(<= |#Ultimate.C_memset_#t~loopctr11| 10), 2314#(<= |#Ultimate.C_memset_#amount| 10), 2301#true, 2302#false, 2303#(= |#Ultimate.C_memset_#t~loopctr11| 0)] [2018-02-04 03:14:59,131 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:59,131 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 03:14:59,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 03:14:59,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:14:59,132 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 14 states. [2018-02-04 03:14:59,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:14:59,168 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-02-04 03:14:59,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 03:14:59,169 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-02-04 03:14:59,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:14:59,169 INFO L225 Difference]: With dead ends: 72 [2018-02-04 03:14:59,169 INFO L226 Difference]: Without dead ends: 70 [2018-02-04 03:14:59,170 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2018-02-04 03:14:59,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-04 03:14:59,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-02-04 03:14:59,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 03:14:59,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2018-02-04 03:14:59,172 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 44 [2018-02-04 03:14:59,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:14:59,172 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2018-02-04 03:14:59,172 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 03:14:59,173 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2018-02-04 03:14:59,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 03:14:59,173 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:14:59,173 INFO L351 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-04 03:14:59,173 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:14:59,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1750123499, now seen corresponding path program 11 times [2018-02-04 03:14:59,174 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:14:59,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:14:59,187 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:14:59,285 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:59,285 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:14:59,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 03:14:59,285 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:14:59,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:59,286 INFO L182 omatonBuilderFactory]: Interpolants [2464#(<= |#Ultimate.C_memset_#t~loopctr11| 3), 2465#(<= |#Ultimate.C_memset_#t~loopctr11| 4), 2466#(<= |#Ultimate.C_memset_#t~loopctr11| 5), 2467#(<= |#Ultimate.C_memset_#t~loopctr11| 6), 2468#(<= |#Ultimate.C_memset_#t~loopctr11| 7), 2469#(<= |#Ultimate.C_memset_#t~loopctr11| 8), 2470#(<= |#Ultimate.C_memset_#t~loopctr11| 9), 2471#(<= |#Ultimate.C_memset_#t~loopctr11| 10), 2472#(<= |#Ultimate.C_memset_#t~loopctr11| 11), 2473#(<= |#Ultimate.C_memset_#amount| 11), 2459#true, 2460#false, 2461#(= |#Ultimate.C_memset_#t~loopctr11| 0), 2462#(<= |#Ultimate.C_memset_#t~loopctr11| 1), 2463#(<= |#Ultimate.C_memset_#t~loopctr11| 2)] [2018-02-04 03:14:59,286 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:59,286 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 03:14:59,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 03:14:59,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-02-04 03:14:59,286 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 15 states. [2018-02-04 03:14:59,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:14:59,312 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2018-02-04 03:14:59,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 03:14:59,315 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2018-02-04 03:14:59,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:14:59,315 INFO L225 Difference]: With dead ends: 73 [2018-02-04 03:14:59,316 INFO L226 Difference]: Without dead ends: 71 [2018-02-04 03:14:59,316 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=97, Invalid=143, Unknown=0, NotChecked=0, Total=240 [2018-02-04 03:14:59,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-02-04 03:14:59,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-02-04 03:14:59,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-04 03:14:59,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2018-02-04 03:14:59,318 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 45 [2018-02-04 03:14:59,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:14:59,319 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2018-02-04 03:14:59,319 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 03:14:59,319 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2018-02-04 03:14:59,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 03:14:59,319 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:14:59,320 INFO L351 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-04 03:14:59,320 INFO L371 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:14:59,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1150133475, now seen corresponding path program 12 times [2018-02-04 03:14:59,321 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:14:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:14:59,335 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:14:59,451 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:59,452 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:14:59,452 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 03:14:59,452 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:14:59,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:59,452 INFO L182 omatonBuilderFactory]: Interpolants [2624#(<= |#Ultimate.C_memset_#t~loopctr11| 2), 2625#(<= |#Ultimate.C_memset_#t~loopctr11| 3), 2626#(<= |#Ultimate.C_memset_#t~loopctr11| 4), 2627#(<= |#Ultimate.C_memset_#t~loopctr11| 5), 2628#(<= |#Ultimate.C_memset_#t~loopctr11| 6), 2629#(<= |#Ultimate.C_memset_#t~loopctr11| 7), 2630#(<= |#Ultimate.C_memset_#t~loopctr11| 8), 2631#(<= |#Ultimate.C_memset_#t~loopctr11| 9), 2632#(<= |#Ultimate.C_memset_#t~loopctr11| 10), 2633#(<= |#Ultimate.C_memset_#t~loopctr11| 11), 2634#(<= |#Ultimate.C_memset_#t~loopctr11| 12), 2635#(<= |#Ultimate.C_memset_#amount| 12), 2620#true, 2621#false, 2622#(= |#Ultimate.C_memset_#t~loopctr11| 0), 2623#(<= |#Ultimate.C_memset_#t~loopctr11| 1)] [2018-02-04 03:14:59,453 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:59,453 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 03:14:59,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 03:14:59,453 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2018-02-04 03:14:59,453 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 16 states. [2018-02-04 03:14:59,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:14:59,482 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2018-02-04 03:14:59,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 03:14:59,482 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2018-02-04 03:14:59,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:14:59,483 INFO L225 Difference]: With dead ends: 74 [2018-02-04 03:14:59,483 INFO L226 Difference]: Without dead ends: 72 [2018-02-04 03:14:59,483 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=111, Invalid=161, Unknown=0, NotChecked=0, Total=272 [2018-02-04 03:14:59,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-04 03:14:59,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-02-04 03:14:59,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-04 03:14:59,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2018-02-04 03:14:59,484 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 46 [2018-02-04 03:14:59,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:14:59,485 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2018-02-04 03:14:59,485 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 03:14:59,485 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2018-02-04 03:14:59,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 03:14:59,485 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:14:59,485 INFO L351 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-04 03:14:59,485 INFO L371 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:14:59,485 INFO L82 PathProgramCache]: Analyzing trace with hash -269688085, now seen corresponding path program 13 times [2018-02-04 03:14:59,486 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:14:59,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:14:59,498 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:14:59,614 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:59,614 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:14:59,614 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 03:14:59,615 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:14:59,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:59,615 INFO L182 omatonBuilderFactory]: Interpolants [2784#true, 2785#false, 2786#(= |#Ultimate.C_memset_#t~loopctr11| 0), 2787#(<= |#Ultimate.C_memset_#t~loopctr11| 1), 2788#(<= |#Ultimate.C_memset_#t~loopctr11| 2), 2789#(<= |#Ultimate.C_memset_#t~loopctr11| 3), 2790#(<= |#Ultimate.C_memset_#t~loopctr11| 4), 2791#(<= |#Ultimate.C_memset_#t~loopctr11| 5), 2792#(<= |#Ultimate.C_memset_#t~loopctr11| 6), 2793#(<= |#Ultimate.C_memset_#t~loopctr11| 7), 2794#(<= |#Ultimate.C_memset_#t~loopctr11| 8), 2795#(<= |#Ultimate.C_memset_#t~loopctr11| 9), 2796#(<= |#Ultimate.C_memset_#t~loopctr11| 10), 2797#(<= |#Ultimate.C_memset_#t~loopctr11| 11), 2798#(<= |#Ultimate.C_memset_#t~loopctr11| 12), 2799#(<= |#Ultimate.C_memset_#t~loopctr11| 13), 2800#(<= |#Ultimate.C_memset_#amount| 13)] [2018-02-04 03:14:59,615 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:59,616 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 03:14:59,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 03:14:59,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-02-04 03:14:59,616 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 17 states. [2018-02-04 03:14:59,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:14:59,650 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2018-02-04 03:14:59,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 03:14:59,651 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2018-02-04 03:14:59,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:14:59,652 INFO L225 Difference]: With dead ends: 75 [2018-02-04 03:14:59,652 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 03:14:59,652 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=126, Invalid=180, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:14:59,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 03:14:59,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-02-04 03:14:59,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-04 03:14:59,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2018-02-04 03:14:59,669 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 47 [2018-02-04 03:14:59,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:14:59,669 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2018-02-04 03:14:59,669 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 03:14:59,669 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2018-02-04 03:14:59,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 03:14:59,670 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:14:59,670 INFO L351 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-04 03:14:59,670 INFO L371 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:14:59,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1334483485, now seen corresponding path program 14 times [2018-02-04 03:14:59,671 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:14:59,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:14:59,690 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:14:59,815 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:59,815 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:14:59,815 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 03:14:59,815 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:14:59,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:59,816 INFO L182 omatonBuilderFactory]: Interpolants [2951#true, 2952#false, 2953#(= |#Ultimate.C_memset_#t~loopctr11| 0), 2954#(<= |#Ultimate.C_memset_#t~loopctr11| 1), 2955#(<= |#Ultimate.C_memset_#t~loopctr11| 2), 2956#(<= |#Ultimate.C_memset_#t~loopctr11| 3), 2957#(<= |#Ultimate.C_memset_#t~loopctr11| 4), 2958#(<= |#Ultimate.C_memset_#t~loopctr11| 5), 2959#(<= |#Ultimate.C_memset_#t~loopctr11| 6), 2960#(<= |#Ultimate.C_memset_#t~loopctr11| 7), 2961#(<= |#Ultimate.C_memset_#t~loopctr11| 8), 2962#(<= |#Ultimate.C_memset_#t~loopctr11| 9), 2963#(<= |#Ultimate.C_memset_#t~loopctr11| 10), 2964#(<= |#Ultimate.C_memset_#t~loopctr11| 11), 2965#(<= |#Ultimate.C_memset_#t~loopctr11| 12), 2966#(<= |#Ultimate.C_memset_#t~loopctr11| 13), 2967#(<= |#Ultimate.C_memset_#t~loopctr11| 14), 2968#(<= |#Ultimate.C_memset_#amount| 14)] [2018-02-04 03:14:59,816 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:59,816 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 03:14:59,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 03:14:59,816 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:14:59,817 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 18 states. [2018-02-04 03:14:59,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:14:59,846 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2018-02-04 03:14:59,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 03:14:59,846 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2018-02-04 03:14:59,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:14:59,847 INFO L225 Difference]: With dead ends: 76 [2018-02-04 03:14:59,847 INFO L226 Difference]: Without dead ends: 74 [2018-02-04 03:14:59,847 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=200, Unknown=0, NotChecked=0, Total=342 [2018-02-04 03:14:59,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-04 03:14:59,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-02-04 03:14:59,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 03:14:59,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2018-02-04 03:14:59,848 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 48 [2018-02-04 03:14:59,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:14:59,848 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2018-02-04 03:14:59,848 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 03:14:59,849 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2018-02-04 03:14:59,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 03:14:59,849 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:14:59,849 INFO L351 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-04 03:14:59,849 INFO L371 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:14:59,849 INFO L82 PathProgramCache]: Analyzing trace with hash 16597483, now seen corresponding path program 15 times [2018-02-04 03:14:59,850 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:14:59,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:14:59,858 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:14:59,980 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:59,980 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:14:59,980 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 03:14:59,980 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:14:59,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:59,980 INFO L182 omatonBuilderFactory]: Interpolants [3136#(<= |#Ultimate.C_memset_#t~loopctr11| 13), 3137#(<= |#Ultimate.C_memset_#t~loopctr11| 14), 3138#(<= |#Ultimate.C_memset_#t~loopctr11| 15), 3139#(<= |#Ultimate.C_memset_#amount| 15), 3121#true, 3122#false, 3123#(= |#Ultimate.C_memset_#t~loopctr11| 0), 3124#(<= |#Ultimate.C_memset_#t~loopctr11| 1), 3125#(<= |#Ultimate.C_memset_#t~loopctr11| 2), 3126#(<= |#Ultimate.C_memset_#t~loopctr11| 3), 3127#(<= |#Ultimate.C_memset_#t~loopctr11| 4), 3128#(<= |#Ultimate.C_memset_#t~loopctr11| 5), 3129#(<= |#Ultimate.C_memset_#t~loopctr11| 6), 3130#(<= |#Ultimate.C_memset_#t~loopctr11| 7), 3131#(<= |#Ultimate.C_memset_#t~loopctr11| 8), 3132#(<= |#Ultimate.C_memset_#t~loopctr11| 9), 3133#(<= |#Ultimate.C_memset_#t~loopctr11| 10), 3134#(<= |#Ultimate.C_memset_#t~loopctr11| 11), 3135#(<= |#Ultimate.C_memset_#t~loopctr11| 12)] [2018-02-04 03:14:59,980 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:14:59,980 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 03:14:59,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 03:14:59,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-02-04 03:14:59,981 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand 19 states. [2018-02-04 03:15:00,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:15:00,006 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-02-04 03:15:00,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 03:15:00,006 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-02-04 03:15:00,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:15:00,007 INFO L225 Difference]: With dead ends: 77 [2018-02-04 03:15:00,007 INFO L226 Difference]: Without dead ends: 75 [2018-02-04 03:15:00,007 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=159, Invalid=221, Unknown=0, NotChecked=0, Total=380 [2018-02-04 03:15:00,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-04 03:15:00,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-02-04 03:15:00,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-04 03:15:00,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2018-02-04 03:15:00,009 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 49 [2018-02-04 03:15:00,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:15:00,009 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2018-02-04 03:15:00,009 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 03:15:00,009 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2018-02-04 03:15:00,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-04 03:15:00,009 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:15:00,010 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-04 03:15:00,010 INFO L371 AbstractCegarLoop]: === Iteration 23 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:15:00,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1049565469, now seen corresponding path program 16 times [2018-02-04 03:15:00,010 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:15:00,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:15:00,019 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:15:00,158 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-04 03:15:00,158 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:15:00,158 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-04 03:15:00,158 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:15:00,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:00,159 INFO L182 omatonBuilderFactory]: Interpolants [3296#(= 0 |ldv_malloc_#t~malloc4.offset|), 3297#(= 0 |ldv_malloc_#res.offset|), 3298#(= 0 |ldv_kobject_create_#t~ret8.offset|), 3299#(= 0 ldv_kobject_create_~kobj~0.offset), 3300#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 3301#(and (<= 16 (select |#length| ldv_kobject_create_~kobj~0.base)) (= 0 ldv_kobject_create_~kobj~0.offset)), 3302#(and (= 0 |ldv_kobject_init_#in~kobj.offset|) (<= 16 (select |#length| |ldv_kobject_init_#in~kobj.base|))), 3303#(and (= 0 ldv_kobject_init_~kobj.offset) (<= 16 (select |#length| ldv_kobject_init_~kobj.base))), 3304#(and (<= 16 (select |#length| |ldv_kobject_init_internal_#in~kobj.base|)) (= 0 |ldv_kobject_init_internal_#in~kobj.offset|)), 3305#(and (<= 16 (select |#length| ldv_kobject_init_internal_~kobj.base)) (= ldv_kobject_init_internal_~kobj.offset 0)), 3306#(and (<= (+ |ldv_kref_init_#in~kref.offset| 4) (select |#length| |ldv_kref_init_#in~kref.base|)) (<= 12 |ldv_kref_init_#in~kref.offset|)), 3307#(and (<= 12 ldv_kref_init_~kref.offset) (<= (+ ldv_kref_init_~kref.offset 4) (select |#length| ldv_kref_init_~kref.base))), 3294#true, 3295#false] [2018-02-04 03:15:00,159 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-04 03:15:00,159 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 03:15:00,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 03:15:00,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:15:00,160 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand 14 states. [2018-02-04 03:15:00,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:15:00,321 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2018-02-04 03:15:00,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 03:15:00,321 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2018-02-04 03:15:00,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:15:00,322 INFO L225 Difference]: With dead ends: 74 [2018-02-04 03:15:00,322 INFO L226 Difference]: Without dead ends: 74 [2018-02-04 03:15:00,322 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:15:00,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-04 03:15:00,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-02-04 03:15:00,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 03:15:00,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2018-02-04 03:15:00,324 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 50 [2018-02-04 03:15:00,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:15:00,324 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2018-02-04 03:15:00,324 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 03:15:00,324 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2018-02-04 03:15:00,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 03:15:00,324 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:15:00,324 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-04 03:15:00,324 INFO L371 AbstractCegarLoop]: === Iteration 24 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:15:00,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1618778490, now seen corresponding path program 1 times [2018-02-04 03:15:00,325 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:15:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:15:00,337 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:15:00,429 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-04 03:15:00,429 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:15:00,429 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 03:15:00,430 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:15:00,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:00,430 INFO L182 omatonBuilderFactory]: Interpolants [3472#(= 1 (select |#valid| |LDV_INIT_LIST_HEAD_#in~list.base|)), 3473#(= 1 (select |#valid| LDV_INIT_LIST_HEAD_~list.base)), 3464#true, 3465#false, 3466#(= 1 (select |#valid| |#Ultimate.C_memset_#ptr.base|)), 3467#(= 1 (select |#valid| ldv_kobject_create_~kobj~0.base)), 3468#(= 1 (select |#valid| |ldv_kobject_init_#in~kobj.base|)), 3469#(= 1 (select |#valid| ldv_kobject_init_~kobj.base)), 3470#(= 1 (select |#valid| |ldv_kobject_init_internal_#in~kobj.base|)), 3471#(= 1 (select |#valid| ldv_kobject_init_internal_~kobj.base))] [2018-02-04 03:15:00,430 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-04 03:15:00,430 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 03:15:00,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 03:15:00,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:15:00,431 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand 10 states. [2018-02-04 03:15:00,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:15:00,548 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-02-04 03:15:00,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:15:00,548 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-02-04 03:15:00,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:15:00,548 INFO L225 Difference]: With dead ends: 72 [2018-02-04 03:15:00,548 INFO L226 Difference]: Without dead ends: 72 [2018-02-04 03:15:00,549 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:15:00,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-04 03:15:00,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-02-04 03:15:00,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-04 03:15:00,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2018-02-04 03:15:00,550 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 55 [2018-02-04 03:15:00,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:15:00,550 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2018-02-04 03:15:00,550 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 03:15:00,550 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2018-02-04 03:15:00,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 03:15:00,551 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:15:00,551 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-04 03:15:00,551 INFO L371 AbstractCegarLoop]: === Iteration 25 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:15:00,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1618778489, now seen corresponding path program 1 times [2018-02-04 03:15:00,552 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:15:00,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:15:00,565 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:15:00,726 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-04 03:15:00,726 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:15:00,726 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-04 03:15:00,726 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:15:00,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:00,726 INFO L182 omatonBuilderFactory]: Interpolants [3624#true, 3625#false, 3626#(= 0 |ldv_malloc_#t~malloc4.offset|), 3627#(= 0 |ldv_malloc_#res.offset|), 3628#(= 0 |ldv_kobject_create_#t~ret8.offset|), 3629#(= 0 ldv_kobject_create_~kobj~0.offset), 3630#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 3631#(and (<= 16 (select |#length| ldv_kobject_create_~kobj~0.base)) (= 0 ldv_kobject_create_~kobj~0.offset)), 3632#(and (= 0 |ldv_kobject_init_#in~kobj.offset|) (<= 16 (select |#length| |ldv_kobject_init_#in~kobj.base|))), 3633#(and (= 0 ldv_kobject_init_~kobj.offset) (<= 16 (select |#length| ldv_kobject_init_~kobj.base))), 3634#(and (<= 16 (select |#length| |ldv_kobject_init_internal_#in~kobj.base|)) (= 0 |ldv_kobject_init_internal_#in~kobj.offset|)), 3635#(and (<= 16 (select |#length| ldv_kobject_init_internal_~kobj.base)) (= ldv_kobject_init_internal_~kobj.offset 0)), 3636#(and (<= 4 |LDV_INIT_LIST_HEAD_#in~list.offset|) (<= (+ |LDV_INIT_LIST_HEAD_#in~list.offset| 12) (select |#length| |LDV_INIT_LIST_HEAD_#in~list.base|))), 3637#(and (<= (+ LDV_INIT_LIST_HEAD_~list.offset 12) (select |#length| LDV_INIT_LIST_HEAD_~list.base)) (<= 4 LDV_INIT_LIST_HEAD_~list.offset))] [2018-02-04 03:15:00,727 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-04 03:15:00,727 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 03:15:00,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 03:15:00,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:15:00,727 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 14 states. [2018-02-04 03:15:00,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:15:00,856 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2018-02-04 03:15:00,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 03:15:00,856 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2018-02-04 03:15:00,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:15:00,857 INFO L225 Difference]: With dead ends: 70 [2018-02-04 03:15:00,857 INFO L226 Difference]: Without dead ends: 70 [2018-02-04 03:15:00,857 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:15:00,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-04 03:15:00,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-02-04 03:15:00,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 03:15:00,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2018-02-04 03:15:00,858 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 55 [2018-02-04 03:15:00,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:15:00,858 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2018-02-04 03:15:00,858 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 03:15:00,859 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2018-02-04 03:15:00,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-04 03:15:00,859 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:15:00,859 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-04 03:15:00,859 INFO L371 AbstractCegarLoop]: === Iteration 26 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:15:00,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1141007541, now seen corresponding path program 1 times [2018-02-04 03:15:00,860 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:15:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:15:00,867 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:15:00,917 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-04 03:15:00,918 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:15:00,918 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 03:15:00,918 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:15:00,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:00,918 INFO L182 omatonBuilderFactory]: Interpolants [3792#(= ldv_kobject_init_~kobj.base |ldv_kobject_init_#in~kobj.base|), 3793#(= 0 |ldv_kobject_init_#in~kobj.base|), 3786#true, 3787#false, 3788#(not (= |ldv_malloc_#t~malloc4.base| 0)), 3789#(not (= |ldv_malloc_#res.base| 0)), 3790#(not (= |ldv_kobject_create_#t~ret8.base| 0)), 3791#(not (= ldv_kobject_create_~kobj~0.base 0))] [2018-02-04 03:15:00,919 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-04 03:15:00,919 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:15:00,919 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:15:00,919 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:15:00,919 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 8 states. [2018-02-04 03:15:00,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:15:00,956 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2018-02-04 03:15:00,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 03:15:00,956 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-02-04 03:15:00,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:15:00,957 INFO L225 Difference]: With dead ends: 72 [2018-02-04 03:15:00,957 INFO L226 Difference]: Without dead ends: 70 [2018-02-04 03:15:00,957 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:15:00,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-04 03:15:00,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-02-04 03:15:00,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 03:15:00,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2018-02-04 03:15:00,959 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 53 [2018-02-04 03:15:00,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:15:00,960 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2018-02-04 03:15:00,960 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:15:00,960 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2018-02-04 03:15:00,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-04 03:15:00,960 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:15:00,960 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-04 03:15:00,960 INFO L371 AbstractCegarLoop]: === Iteration 27 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:15:00,961 INFO L82 PathProgramCache]: Analyzing trace with hash 360285006, now seen corresponding path program 1 times [2018-02-04 03:15:00,961 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:15:00,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:15:00,972 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:15:01,028 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-04 03:15:01,029 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:15:01,029 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 03:15:01,029 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:15:01,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:01,029 INFO L182 omatonBuilderFactory]: Interpolants [3940#true, 3941#false, 3942#(not (= |ldv_malloc_#t~malloc4.base| 0)), 3943#(not (= |ldv_malloc_#res.base| 0)), 3944#(not (= |ldv_kobject_create_#t~ret8.base| 0)), 3945#(not (= ldv_kobject_create_~kobj~0.base 0)), 3946#(= ldv_kobject_init_~kobj.base |ldv_kobject_init_#in~kobj.base|), 3947#(= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|), 3948#(= 0 |ldv_kobject_init_internal_#in~kobj.base|), 3949#(= 0 |ldv_kobject_init_#in~kobj.base|)] [2018-02-04 03:15:01,029 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-04 03:15:01,030 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 03:15:01,030 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 03:15:01,030 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:15:01,030 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 10 states. [2018-02-04 03:15:01,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:15:01,098 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-02-04 03:15:01,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:15:01,098 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2018-02-04 03:15:01,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:15:01,098 INFO L225 Difference]: With dead ends: 74 [2018-02-04 03:15:01,099 INFO L226 Difference]: Without dead ends: 70 [2018-02-04 03:15:01,099 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:15:01,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-04 03:15:01,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-02-04 03:15:01,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 03:15:01,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-02-04 03:15:01,101 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 58 [2018-02-04 03:15:01,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:15:01,101 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-02-04 03:15:01,101 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 03:15:01,101 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-02-04 03:15:01,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-04 03:15:01,102 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:15:01,102 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-04 03:15:01,102 INFO L371 AbstractCegarLoop]: === Iteration 28 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 03:15:01,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1589707118, now seen corresponding path program 1 times [2018-02-04 03:15:01,103 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:15:01,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 03:15:01,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 03:15:01,172 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 03:15:01,184 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-02-04 03:15:01,187 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-04 03:15:01,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 03:15:01 BoogieIcfgContainer [2018-02-04 03:15:01,198 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 03:15:01,199 INFO L168 Benchmark]: Toolchain (without parser) took 4829.71 ms. Allocated memory was 401.6 MB in the beginning and 750.3 MB in the end (delta: 348.7 MB). Free memory was 358.5 MB in the beginning and 473.6 MB in the end (delta: -115.1 MB). Peak memory consumption was 233.5 MB. Max. memory is 5.3 GB. [2018-02-04 03:15:01,200 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 401.6 MB. Free memory is still 365.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 03:15:01,200 INFO L168 Benchmark]: CACSL2BoogieTranslator took 159.15 ms. Allocated memory is still 401.6 MB. Free memory was 358.5 MB in the beginning and 345.3 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 03:15:01,201 INFO L168 Benchmark]: Boogie Preprocessor took 24.92 ms. Allocated memory is still 401.6 MB. Free memory was 345.3 MB in the beginning and 343.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 03:15:01,201 INFO L168 Benchmark]: RCFGBuilder took 232.72 ms. Allocated memory is still 401.6 MB. Free memory was 343.9 MB in the beginning and 320.6 MB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 5.3 GB. [2018-02-04 03:15:01,201 INFO L168 Benchmark]: TraceAbstraction took 4410.03 ms. Allocated memory was 401.6 MB in the beginning and 750.3 MB in the end (delta: 348.7 MB). Free memory was 320.6 MB in the beginning and 473.6 MB in the end (delta: -153.0 MB). Peak memory consumption was 195.6 MB. Max. memory is 5.3 GB. [2018-02-04 03:15:01,202 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.17 ms. Allocated memory is still 401.6 MB. Free memory is still 365.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 159.15 ms. Allocated memory is still 401.6 MB. Free memory was 358.5 MB in the beginning and 345.3 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 24.92 ms. Allocated memory is still 401.6 MB. Free memory was 345.3 MB in the beginning and 343.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 232.72 ms. Allocated memory is still 401.6 MB. Free memory was 343.9 MB in the beginning and 320.6 MB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 4410.03 ms. Allocated memory was 401.6 MB in the beginning and 750.3 MB in the end (delta: 348.7 MB). Free memory was 320.6 MB in the beginning and 473.6 MB in the end (delta: -153.0 MB). Peak memory consumption was 195.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; 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: - UnprovableResult [Line: 1441]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1441. Possible 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 TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=16, malloc(size)={19:0}, size=16] [L1074] RET return malloc(size); VAL [\old(size)=16, \result={19:0}, malloc(size)={19:0}, size=16] [L1408] EXPR ldv_malloc(sizeof(*kobj)) VAL [ldv_malloc(sizeof(*kobj))={19:0}] [L1408] kobj = ldv_malloc(sizeof(*kobj)) [L1409] COND FALSE !(!kobj) VAL [kobj={19:0}] [L1411] FCALL memset(kobj, 0, sizeof(*kobj)) VAL [kobj={19:0}, memset(kobj, 0, sizeof(*kobj))={19:0}] [L1413] CALL ldv_kobject_init(kobj) VAL [kobj={19:0}] [L1394] COND FALSE !(!kobj) VAL [kobj={19:0}, kobj={19:0}] [L1398] CALL ldv_kobject_init_internal(kobj) VAL [kobj={19:0}] [L1380] COND FALSE !(!kobj) VAL [kobj={19:0}, kobj={19:0}] [L1382] CALL ldv_kref_init(&kobj->kref) VAL [kref={19:12}] [L1294] RET, FCALL ((&kref->refcount)->counter) = (1) VAL [kref={19:12}, kref={19:12}] [L1382] ldv_kref_init(&kobj->kref) VAL [kobj={19:0}, kobj={19:0}] [L1383] CALL LDV_INIT_LIST_HEAD(&kobj->entry) VAL [list={19:4}] [L1099] FCALL list->next = list VAL [list={19:4}, list={19:4}] [L1100] FCALL list->prev = list VAL [list={19:4}, list={19:4}] [L1383] RET, FCALL LDV_INIT_LIST_HEAD(&kobj->entry) VAL [kobj={19:0}, kobj={19:0}] [L1413] ldv_kobject_init(kobj) VAL [kobj={19:0}] [L1414] RET return kobj; VAL [\result={19:0}, kobj={19:0}] [L1437] EXPR ldv_kobject_create() VAL [ldv_kobject_create()={19:0}] [L1437] RET kobj = ldv_kobject_create() [L1442] entry_point() - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 65 locations, 9 error locations. UNSAFE Result, 4.3s OverallTime, 28 OverallIterations, 16 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1502 SDtfs, 199 SDslu, 10072 SDs, 0 SdLazy, 1696 SolverSat, 52 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 318 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 262 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 680/1360 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 27 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1139 NumberOfCodeBlocks, 1139 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1043 ConstructedInterpolants, 0 QuantifiedInterpolants, 107216 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 12 PerfectInterpolantSequences, 680/1360 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_03-15-01-208.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_03-15-01-208.csv Received shutdown request...