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_NoArray.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_2_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 04:17:36,574 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 04:17:36,575 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 04:17:36,585 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 04:17:36,586 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 04:17:36,586 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 04:17:36,587 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 04:17:36,589 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 04:17:36,590 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 04:17:36,591 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 04:17:36,591 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 04:17:36,591 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 04:17:36,592 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 04:17:36,593 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 04:17:36,594 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 04:17:36,595 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 04:17:36,597 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 04:17:36,598 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 04:17:36,599 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 04:17:36,600 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 04:17:36,601 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 04:17:36,601 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 04:17:36,602 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 04:17:36,602 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 04:17:36,603 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 04:17:36,604 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 04:17:36,604 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 04:17:36,604 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 04:17:36,605 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 04:17:36,605 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 04:17:36,605 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 04:17:36,605 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_NoArray.epf [2018-02-04 04:17:36,614 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 04:17:36,615 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 04:17:36,616 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 04:17:36,616 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 04:17:36,616 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 04:17:36,616 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 04:17:36,616 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 04:17:36,616 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 04:17:36,617 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 04:17:36,617 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 04:17:36,617 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 04:17:36,617 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 04:17:36,617 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 04:17:36,617 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 04:17:36,617 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 04:17:36,618 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 04:17:36,618 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 04:17:36,618 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 04:17:36,618 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 04:17:36,618 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 04:17:36,618 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 04:17:36,619 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 04:17:36,619 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 04:17:36,619 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 04:17:36,619 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 04:17:36,647 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 04:17:36,658 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 04:17:36,661 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 04:17:36,663 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 04:17:36,664 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 04:17:36,664 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_true-valid-memsafety_true-termination.i [2018-02-04 04:17:36,817 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 04:17:36,818 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 04:17:36,818 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 04:17:36,819 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 04:17:36,824 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 04:17:36,824 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:17:36" (1/1) ... [2018-02-04 04:17:36,827 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fc89e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:36, skipping insertion in model container [2018-02-04 04:17:36,827 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:17:36" (1/1) ... [2018-02-04 04:17:36,840 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:17:36,876 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:17:36,960 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:17:36,976 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:17:36,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:36 WrapperNode [2018-02-04 04:17:36,983 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 04:17:36,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 04:17:36,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 04:17:36,984 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 04:17:36,993 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:36" (1/1) ... [2018-02-04 04:17:36,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:36" (1/1) ... [2018-02-04 04:17:37,001 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:36" (1/1) ... [2018-02-04 04:17:37,001 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:36" (1/1) ... [2018-02-04 04:17:37,007 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:36" (1/1) ... [2018-02-04 04:17:37,009 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:36" (1/1) ... [2018-02-04 04:17:37,010 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:36" (1/1) ... [2018-02-04 04:17:37,012 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 04:17:37,013 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 04:17:37,013 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 04:17:37,013 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 04:17:37,014 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:36" (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 04:17:37,050 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 04:17:37,050 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 04:17:37,050 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-02-04 04:17:37,050 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 04:17:37,050 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-02-04 04:17:37,050 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2018-02-04 04:17:37,050 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-02-04 04:17:37,050 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-02-04 04:17:37,051 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-02-04 04:17:37,051 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2018-02-04 04:17:37,051 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-02-04 04:17:37,051 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-02-04 04:17:37,051 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-02-04 04:17:37,051 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-02-04 04:17:37,051 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2018-02-04 04:17:37,051 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-02-04 04:17:37,051 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-02-04 04:17:37,051 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-02-04 04:17:37,051 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 04:17:37,051 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 04:17:37,051 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 04:17:37,051 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 04:17:37,052 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 04:17:37,052 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 04:17:37,052 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 04:17:37,052 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 04:17:37,052 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 04:17:37,052 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-04 04:17:37,052 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-04 04:17:37,052 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 04:17:37,052 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 04:17:37,052 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 04:17:37,052 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-04 04:17:37,052 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 04:17:37,053 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-02-04 04:17:37,053 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2018-02-04 04:17:37,053 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-02-04 04:17:37,053 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-02-04 04:17:37,053 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-02-04 04:17:37,053 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-02-04 04:17:37,053 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2018-02-04 04:17:37,053 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-02-04 04:17:37,054 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-02-04 04:17:37,054 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-02-04 04:17:37,054 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-02-04 04:17:37,054 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2018-02-04 04:17:37,054 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-02-04 04:17:37,054 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-02-04 04:17:37,054 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-02-04 04:17:37,054 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 04:17:37,055 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 04:17:37,055 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 04:17:37,055 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 04:17:37,223 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-04 04:17:37,355 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 04:17:37,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:17:37 BoogieIcfgContainer [2018-02-04 04:17:37,356 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 04:17:37,357 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 04:17:37,357 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 04:17:37,359 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 04:17:37,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 04:17:36" (1/3) ... [2018-02-04 04:17:37,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5291325f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:17:37, skipping insertion in model container [2018-02-04 04:17:37,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:36" (2/3) ... [2018-02-04 04:17:37,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5291325f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:17:37, skipping insertion in model container [2018-02-04 04:17:37,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:17:37" (3/3) ... [2018-02-04 04:17:37,362 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test22_2_true-valid-memsafety_true-termination.i [2018-02-04 04:17:37,368 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 04:17:37,375 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-02-04 04:17:37,405 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 04:17:37,405 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 04:17:37,405 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 04:17:37,406 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 04:17:37,406 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 04:17:37,406 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 04:17:37,406 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 04:17:37,406 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 04:17:37,407 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 04:17:37,419 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2018-02-04 04:17:37,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 04:17:37,427 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:37,428 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 04:17:37,428 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:17:37,432 INFO L82 PathProgramCache]: Analyzing trace with hash -998986606, now seen corresponding path program 1 times [2018-02-04 04:17:37,433 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:37,434 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:37,487 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:37,487 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:37,487 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:37,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:37,534 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:37,685 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 04:17:37,687 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:37,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 04:17:37,688 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:17:37,696 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:17:37,696 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:17:37,697 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 5 states. [2018-02-04 04:17:37,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:37,740 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2018-02-04 04:17:37,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:17:37,741 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 04:17:37,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:37,750 INFO L225 Difference]: With dead ends: 149 [2018-02-04 04:17:37,750 INFO L226 Difference]: Without dead ends: 146 [2018-02-04 04:17:37,751 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 04:17:37,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-04 04:17:37,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2018-02-04 04:17:37,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-04 04:17:37,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 153 transitions. [2018-02-04 04:17:37,784 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 153 transitions. Word has length 17 [2018-02-04 04:17:37,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:37,784 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 153 transitions. [2018-02-04 04:17:37,784 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:17:37,785 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2018-02-04 04:17:37,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 04:17:37,785 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:37,785 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 04:17:37,785 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:17:37,786 INFO L82 PathProgramCache]: Analyzing trace with hash -2077747980, now seen corresponding path program 1 times [2018-02-04 04:17:37,786 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:37,786 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:37,787 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:37,787 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:37,787 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:37,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:37,804 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:37,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 04:17:37,851 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:37,851 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 04:17:37,852 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:17:37,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:17:37,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:17:37,853 INFO L87 Difference]: Start difference. First operand 144 states and 153 transitions. Second operand 6 states. [2018-02-04 04:17:37,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:37,954 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2018-02-04 04:17:37,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:17:37,954 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 04:17:37,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:37,956 INFO L225 Difference]: With dead ends: 145 [2018-02-04 04:17:37,956 INFO L226 Difference]: Without dead ends: 145 [2018-02-04 04:17:37,957 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 04:17:37,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-04 04:17:37,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2018-02-04 04:17:37,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-04 04:17:37,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 152 transitions. [2018-02-04 04:17:37,966 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 152 transitions. Word has length 19 [2018-02-04 04:17:37,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:37,966 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 152 transitions. [2018-02-04 04:17:37,966 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:17:37,966 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 152 transitions. [2018-02-04 04:17:37,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 04:17:37,967 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:37,967 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 04:17:37,967 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:17:37,967 INFO L82 PathProgramCache]: Analyzing trace with hash -2077747979, now seen corresponding path program 1 times [2018-02-04 04:17:37,967 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:37,967 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:37,968 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:37,968 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:37,968 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:37,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:37,982 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:38,126 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 04:17:38,126 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:38,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 04:17:38,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 04:17:38,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 04:17:38,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:17:38,127 INFO L87 Difference]: Start difference. First operand 143 states and 152 transitions. Second operand 7 states. [2018-02-04 04:17:38,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:38,303 INFO L93 Difference]: Finished difference Result 144 states and 153 transitions. [2018-02-04 04:17:38,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 04:17:38,304 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-02-04 04:17:38,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:38,305 INFO L225 Difference]: With dead ends: 144 [2018-02-04 04:17:38,305 INFO L226 Difference]: Without dead ends: 144 [2018-02-04 04:17:38,306 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 04:17:38,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-02-04 04:17:38,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2018-02-04 04:17:38,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-04 04:17:38,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 151 transitions. [2018-02-04 04:17:38,313 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 151 transitions. Word has length 19 [2018-02-04 04:17:38,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:38,314 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 151 transitions. [2018-02-04 04:17:38,314 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 04:17:38,314 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2018-02-04 04:17:38,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 04:17:38,314 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:38,315 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] [2018-02-04 04:17:38,315 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:17:38,315 INFO L82 PathProgramCache]: Analyzing trace with hash -471802203, now seen corresponding path program 1 times [2018-02-04 04:17:38,315 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:38,315 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:38,316 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:38,317 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:38,317 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:38,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:38,328 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:38,382 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 04:17:38,382 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:38,382 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 04:17:38,382 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 04:17:38,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 04:17:38,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:17:38,383 INFO L87 Difference]: Start difference. First operand 142 states and 151 transitions. Second operand 7 states. [2018-02-04 04:17:38,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:38,415 INFO L93 Difference]: Finished difference Result 159 states and 170 transitions. [2018-02-04 04:17:38,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 04:17:38,416 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-02-04 04:17:38,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:38,418 INFO L225 Difference]: With dead ends: 159 [2018-02-04 04:17:38,418 INFO L226 Difference]: Without dead ends: 159 [2018-02-04 04:17:38,418 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 04:17:38,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-02-04 04:17:38,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 151. [2018-02-04 04:17:38,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-04 04:17:38,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2018-02-04 04:17:38,429 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 27 [2018-02-04 04:17:38,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:38,429 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2018-02-04 04:17:38,429 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 04:17:38,429 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2018-02-04 04:17:38,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 04:17:38,430 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:38,430 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 04:17:38,430 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:17:38,431 INFO L82 PathProgramCache]: Analyzing trace with hash 131109242, now seen corresponding path program 1 times [2018-02-04 04:17:38,431 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:38,431 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:38,432 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:38,432 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:38,432 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:38,445 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:38,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:17:38,508 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:38,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 04:17:38,508 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 04:17:38,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 04:17:38,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 04:17:38,509 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand 10 states. [2018-02-04 04:17:38,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:38,684 INFO L93 Difference]: Finished difference Result 150 states and 159 transitions. [2018-02-04 04:17:38,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 04:17:38,685 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-02-04 04:17:38,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:38,686 INFO L225 Difference]: With dead ends: 150 [2018-02-04 04:17:38,686 INFO L226 Difference]: Without dead ends: 150 [2018-02-04 04:17:38,686 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 04:17:38,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-04 04:17:38,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-02-04 04:17:38,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-04 04:17:38,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 159 transitions. [2018-02-04 04:17:38,693 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 159 transitions. Word has length 34 [2018-02-04 04:17:38,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:38,693 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 159 transitions. [2018-02-04 04:17:38,693 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 04:17:38,694 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 159 transitions. [2018-02-04 04:17:38,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 04:17:38,694 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:38,695 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 04:17:38,695 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:17:38,695 INFO L82 PathProgramCache]: Analyzing trace with hash 131109243, now seen corresponding path program 1 times [2018-02-04 04:17:38,695 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:38,695 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:38,696 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:38,696 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:38,696 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:38,709 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:38,748 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 04:17:38,748 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:38,748 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 04:17:38,748 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 04:17:38,749 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 04:17:38,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 04:17:38,749 INFO L87 Difference]: Start difference. First operand 150 states and 159 transitions. Second operand 4 states. [2018-02-04 04:17:38,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:38,759 INFO L93 Difference]: Finished difference Result 153 states and 162 transitions. [2018-02-04 04:17:38,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 04:17:38,759 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-02-04 04:17:38,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:38,760 INFO L225 Difference]: With dead ends: 153 [2018-02-04 04:17:38,760 INFO L226 Difference]: Without dead ends: 151 [2018-02-04 04:17:38,760 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 04:17:38,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-04 04:17:38,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-02-04 04:17:38,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-04 04:17:38,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2018-02-04 04:17:38,766 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 34 [2018-02-04 04:17:38,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:38,766 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2018-02-04 04:17:38,766 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 04:17:38,766 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2018-02-04 04:17:38,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 04:17:38,767 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:38,767 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 04:17:38,768 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:17:38,768 INFO L82 PathProgramCache]: Analyzing trace with hash -2110897305, now seen corresponding path program 1 times [2018-02-04 04:17:38,768 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:38,768 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:38,769 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:38,769 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:38,769 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:38,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:38,780 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:38,812 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 04:17:38,813 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:17:38,813 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:17:38,814 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:38,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:38,838 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:17:38,854 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 04:17:38,854 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:17:38,854 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-02-04 04:17:38,854 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:17:38,855 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:17:38,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:17:38,855 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand 6 states. [2018-02-04 04:17:38,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:38,875 INFO L93 Difference]: Finished difference Result 154 states and 163 transitions. [2018-02-04 04:17:38,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:17:38,875 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-02-04 04:17:38,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:38,876 INFO L225 Difference]: With dead ends: 154 [2018-02-04 04:17:38,876 INFO L226 Difference]: Without dead ends: 152 [2018-02-04 04:17:38,876 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:17:38,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-04 04:17:38,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-02-04 04:17:38,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-04 04:17:38,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 161 transitions. [2018-02-04 04:17:38,882 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 161 transitions. Word has length 35 [2018-02-04 04:17:38,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:38,882 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 161 transitions. [2018-02-04 04:17:38,882 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:17:38,882 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 161 transitions. [2018-02-04 04:17:38,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 04:17:38,883 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:38,883 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, 1] [2018-02-04 04:17:38,883 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:17:38,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1181841647, now seen corresponding path program 1 times [2018-02-04 04:17:38,884 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:38,884 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:38,885 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:38,885 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:38,885 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:38,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:38,896 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:38,945 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 04:17:38,946 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:38,946 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 04:17:38,946 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 04:17:38,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 04:17:38,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:17:38,946 INFO L87 Difference]: Start difference. First operand 152 states and 161 transitions. Second operand 7 states. [2018-02-04 04:17:38,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:38,972 INFO L93 Difference]: Finished difference Result 163 states and 174 transitions. [2018-02-04 04:17:38,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 04:17:38,973 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-02-04 04:17:38,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:38,974 INFO L225 Difference]: With dead ends: 163 [2018-02-04 04:17:38,974 INFO L226 Difference]: Without dead ends: 163 [2018-02-04 04:17:38,974 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 04:17:38,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-04 04:17:38,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2018-02-04 04:17:38,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-04 04:17:38,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 169 transitions. [2018-02-04 04:17:38,979 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 169 transitions. Word has length 36 [2018-02-04 04:17:38,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:38,980 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 169 transitions. [2018-02-04 04:17:38,980 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 04:17:38,980 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 169 transitions. [2018-02-04 04:17:38,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 04:17:38,981 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:38,981 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 04:17:38,981 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:17:38,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1401343739, now seen corresponding path program 2 times [2018-02-04 04:17:38,981 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:38,981 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:38,983 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:38,983 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:38,983 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:38,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:38,994 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:39,029 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 04:17:39,029 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:17:39,030 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:17:39,030 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:17:39,051 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 04:17:39,052 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:17:39,055 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:17:39,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-02-04 04:17:39,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:17:39,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-02-04 04:17:39,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 04:17:39,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 04:17:39,116 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 04:17:39,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 04:17:39,353 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:17:39,353 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [6] total 20 [2018-02-04 04:17:39,355 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 04:17:39,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 04:17:39,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2018-02-04 04:17:39,355 INFO L87 Difference]: Start difference. First operand 159 states and 169 transitions. Second operand 20 states. [2018-02-04 04:17:39,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:39,911 INFO L93 Difference]: Finished difference Result 181 states and 191 transitions. [2018-02-04 04:17:39,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 04:17:39,911 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-02-04 04:17:39,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:39,912 INFO L225 Difference]: With dead ends: 181 [2018-02-04 04:17:39,912 INFO L226 Difference]: Without dead ends: 179 [2018-02-04 04:17:39,913 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=708, Unknown=0, NotChecked=0, Total=812 [2018-02-04 04:17:39,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-02-04 04:17:39,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 159. [2018-02-04 04:17:39,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-04 04:17:39,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 169 transitions. [2018-02-04 04:17:39,918 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 169 transitions. Word has length 36 [2018-02-04 04:17:39,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:39,918 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 169 transitions. [2018-02-04 04:17:39,918 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 04:17:39,918 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 169 transitions. [2018-02-04 04:17:39,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 04:17:39,919 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:39,920 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:17:39,922 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:17:39,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1379512829, now seen corresponding path program 1 times [2018-02-04 04:17:39,923 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:39,923 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:39,923 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:39,923 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:17:39,924 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:39,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:39,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:39,954 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 04:17:39,954 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:39,954 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 04:17:39,955 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 04:17:39,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 04:17:39,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:17:39,955 INFO L87 Difference]: Start difference. First operand 159 states and 169 transitions. Second operand 3 states. [2018-02-04 04:17:40,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:40,048 INFO L93 Difference]: Finished difference Result 177 states and 190 transitions. [2018-02-04 04:17:40,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 04:17:40,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-02-04 04:17:40,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:40,050 INFO L225 Difference]: With dead ends: 177 [2018-02-04 04:17:40,050 INFO L226 Difference]: Without dead ends: 163 [2018-02-04 04:17:40,050 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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 04:17:40,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-04 04:17:40,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 155. [2018-02-04 04:17:40,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-04 04:17:40,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 164 transitions. [2018-02-04 04:17:40,058 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 164 transitions. Word has length 39 [2018-02-04 04:17:40,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:40,058 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 164 transitions. [2018-02-04 04:17:40,058 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 04:17:40,058 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 164 transitions. [2018-02-04 04:17:40,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 04:17:40,059 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:40,059 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, 1, 1, 1, 1, 1] [2018-02-04 04:17:40,059 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:17:40,060 INFO L82 PathProgramCache]: Analyzing trace with hash 710655878, now seen corresponding path program 1 times [2018-02-04 04:17:40,060 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:40,060 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:40,061 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:40,061 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:40,061 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:40,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:40,071 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:40,134 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 04:17:40,134 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:40,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 04:17:40,134 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 04:17:40,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 04:17:40,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 04:17:40,135 INFO L87 Difference]: Start difference. First operand 155 states and 164 transitions. Second operand 10 states. [2018-02-04 04:17:40,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:40,316 INFO L93 Difference]: Finished difference Result 153 states and 162 transitions. [2018-02-04 04:17:40,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 04:17:40,316 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-02-04 04:17:40,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:40,317 INFO L225 Difference]: With dead ends: 153 [2018-02-04 04:17:40,318 INFO L226 Difference]: Without dead ends: 153 [2018-02-04 04:17:40,318 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 04:17:40,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-02-04 04:17:40,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-02-04 04:17:40,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-02-04 04:17:40,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 162 transitions. [2018-02-04 04:17:40,322 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 162 transitions. Word has length 42 [2018-02-04 04:17:40,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:40,323 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 162 transitions. [2018-02-04 04:17:40,323 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 04:17:40,323 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 162 transitions. [2018-02-04 04:17:40,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 04:17:40,324 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:40,324 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, 1, 1, 1, 1, 1] [2018-02-04 04:17:40,324 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:17:40,324 INFO L82 PathProgramCache]: Analyzing trace with hash 710655879, now seen corresponding path program 1 times [2018-02-04 04:17:40,324 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:40,324 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:40,325 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:40,325 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:40,325 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:40,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:40,336 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:40,379 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 04:17:40,380 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:17:40,380 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:17:40,381 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:40,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:40,397 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:17:40,408 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 04:17:40,408 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:17:40,409 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-02-04 04:17:40,409 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 04:17:40,409 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 04:17:40,409 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-02-04 04:17:40,409 INFO L87 Difference]: Start difference. First operand 153 states and 162 transitions. Second operand 8 states. [2018-02-04 04:17:40,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:40,429 INFO L93 Difference]: Finished difference Result 156 states and 165 transitions. [2018-02-04 04:17:40,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 04:17:40,429 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-02-04 04:17:40,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:40,430 INFO L225 Difference]: With dead ends: 156 [2018-02-04 04:17:40,430 INFO L226 Difference]: Without dead ends: 154 [2018-02-04 04:17:40,431 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-04 04:17:40,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-02-04 04:17:40,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-02-04 04:17:40,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-02-04 04:17:40,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 163 transitions. [2018-02-04 04:17:40,435 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 163 transitions. Word has length 42 [2018-02-04 04:17:40,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:40,435 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 163 transitions. [2018-02-04 04:17:40,435 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 04:17:40,436 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 163 transitions. [2018-02-04 04:17:40,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 04:17:40,436 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:40,437 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:17:40,437 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:17:40,437 INFO L82 PathProgramCache]: Analyzing trace with hash -495427355, now seen corresponding path program 1 times [2018-02-04 04:17:40,437 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:40,437 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:40,438 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:40,438 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:40,438 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:40,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:40,443 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:40,475 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 04:17:40,475 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:40,475 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 04:17:40,476 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:17:40,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:17:40,476 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:17:40,476 INFO L87 Difference]: Start difference. First operand 154 states and 163 transitions. Second operand 6 states. [2018-02-04 04:17:40,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:40,507 INFO L93 Difference]: Finished difference Result 138 states and 145 transitions. [2018-02-04 04:17:40,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:17:40,507 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-02-04 04:17:40,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:40,508 INFO L225 Difference]: With dead ends: 138 [2018-02-04 04:17:40,508 INFO L226 Difference]: Without dead ends: 138 [2018-02-04 04:17:40,508 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 04:17:40,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-04 04:17:40,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-02-04 04:17:40,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-02-04 04:17:40,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 145 transitions. [2018-02-04 04:17:40,512 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 145 transitions. Word has length 41 [2018-02-04 04:17:40,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:40,512 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 145 transitions. [2018-02-04 04:17:40,512 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:17:40,512 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 145 transitions. [2018-02-04 04:17:40,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 04:17:40,512 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:40,513 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, 1, 1, 1, 1, 1] [2018-02-04 04:17:40,513 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:17:40,513 INFO L82 PathProgramCache]: Analyzing trace with hash -141638285, now seen corresponding path program 2 times [2018-02-04 04:17:40,513 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:40,513 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:40,514 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:40,514 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:40,514 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:40,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:40,524 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:40,563 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 04:17:40,563 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:17:40,563 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:17:40,564 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:17:40,579 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 04:17:40,579 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:17:40,583 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:17:40,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-02-04 04:17:40,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:17:40,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-02-04 04:17:40,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 04:17:40,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 04:17:40,620 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 04:17:40,845 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 04:17:40,846 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:17:40,846 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 22 [2018-02-04 04:17:40,846 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 04:17:40,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 04:17:40,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2018-02-04 04:17:40,846 INFO L87 Difference]: Start difference. First operand 138 states and 145 transitions. Second operand 22 states. [2018-02-04 04:17:41,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:41,419 INFO L93 Difference]: Finished difference Result 139 states and 146 transitions. [2018-02-04 04:17:41,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 04:17:41,420 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 43 [2018-02-04 04:17:41,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:41,420 INFO L225 Difference]: With dead ends: 139 [2018-02-04 04:17:41,420 INFO L226 Difference]: Without dead ends: 137 [2018-02-04 04:17:41,421 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=917, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 04:17:41,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-02-04 04:17:41,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-02-04 04:17:41,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-04 04:17:41,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 144 transitions. [2018-02-04 04:17:41,429 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 144 transitions. Word has length 43 [2018-02-04 04:17:41,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:41,429 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 144 transitions. [2018-02-04 04:17:41,429 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 04:17:41,429 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 144 transitions. [2018-02-04 04:17:41,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 04:17:41,429 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:41,429 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:17:41,429 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:17:41,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1517747909, now seen corresponding path program 1 times [2018-02-04 04:17:41,430 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:41,430 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:41,430 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:41,430 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:17:41,431 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:41,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:41,436 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:41,489 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-04 04:17:41,489 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:41,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 04:17:41,489 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 04:17:41,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 04:17:41,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 04:17:41,490 INFO L87 Difference]: Start difference. First operand 137 states and 144 transitions. Second operand 8 states. [2018-02-04 04:17:41,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:41,525 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2018-02-04 04:17:41,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 04:17:41,526 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-02-04 04:17:41,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:41,527 INFO L225 Difference]: With dead ends: 139 [2018-02-04 04:17:41,527 INFO L226 Difference]: Without dead ends: 137 [2018-02-04 04:17:41,527 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 04:17:41,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-02-04 04:17:41,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-02-04 04:17:41,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-04 04:17:41,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 143 transitions. [2018-02-04 04:17:41,530 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 143 transitions. Word has length 47 [2018-02-04 04:17:41,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:41,531 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 143 transitions. [2018-02-04 04:17:41,531 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 04:17:41,531 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 143 transitions. [2018-02-04 04:17:41,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 04:17:41,531 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:41,531 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:17:41,531 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:17:41,532 INFO L82 PathProgramCache]: Analyzing trace with hash 2035822852, now seen corresponding path program 1 times [2018-02-04 04:17:41,532 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:41,532 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:41,532 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:41,533 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:41,533 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:41,540 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:41,593 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-04 04:17:41,594 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:41,594 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 04:17:41,594 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 04:17:41,594 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 04:17:41,594 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 04:17:41,595 INFO L87 Difference]: Start difference. First operand 137 states and 143 transitions. Second operand 10 states. [2018-02-04 04:17:41,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:41,655 INFO L93 Difference]: Finished difference Result 141 states and 146 transitions. [2018-02-04 04:17:41,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 04:17:41,663 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2018-02-04 04:17:41,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:41,663 INFO L225 Difference]: With dead ends: 141 [2018-02-04 04:17:41,664 INFO L226 Difference]: Without dead ends: 137 [2018-02-04 04:17:41,664 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 04:17:41,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-02-04 04:17:41,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-02-04 04:17:41,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-04 04:17:41,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 142 transitions. [2018-02-04 04:17:41,667 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 142 transitions. Word has length 52 [2018-02-04 04:17:41,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:41,667 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 142 transitions. [2018-02-04 04:17:41,667 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 04:17:41,667 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 142 transitions. [2018-02-04 04:17:41,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-04 04:17:41,667 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:41,668 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, 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 04:17:41,668 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:17:41,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1511828740, now seen corresponding path program 1 times [2018-02-04 04:17:41,668 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:41,668 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:41,669 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:41,669 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:41,669 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:41,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:41,681 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:41,766 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-04 04:17:41,766 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:41,766 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-04 04:17:41,766 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 04:17:41,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 04:17:41,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-02-04 04:17:41,767 INFO L87 Difference]: Start difference. First operand 137 states and 142 transitions. Second operand 13 states. [2018-02-04 04:17:41,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:41,939 INFO L93 Difference]: Finished difference Result 135 states and 140 transitions. [2018-02-04 04:17:41,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 04:17:41,939 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 63 [2018-02-04 04:17:41,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:41,940 INFO L225 Difference]: With dead ends: 135 [2018-02-04 04:17:41,940 INFO L226 Difference]: Without dead ends: 135 [2018-02-04 04:17:41,940 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-02-04 04:17:41,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-04 04:17:41,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-02-04 04:17:41,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-04 04:17:41,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 140 transitions. [2018-02-04 04:17:41,943 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 140 transitions. Word has length 63 [2018-02-04 04:17:41,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:41,943 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 140 transitions. [2018-02-04 04:17:41,943 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 04:17:41,943 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 140 transitions. [2018-02-04 04:17:41,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-04 04:17:41,944 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:41,944 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, 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 04:17:41,944 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:17:41,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1511828741, now seen corresponding path program 1 times [2018-02-04 04:17:41,945 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:41,945 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:41,945 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:41,945 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:41,946 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:41,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:41,957 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:42,003 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 04:17:42,004 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:17:42,004 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:17:42,005 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:42,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:42,026 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:17:42,045 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 04:17:42,046 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:17:42,046 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-02-04 04:17:42,046 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 04:17:42,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 04:17:42,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-02-04 04:17:42,047 INFO L87 Difference]: Start difference. First operand 135 states and 140 transitions. Second operand 10 states. [2018-02-04 04:17:42,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:42,070 INFO L93 Difference]: Finished difference Result 138 states and 143 transitions. [2018-02-04 04:17:42,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 04:17:42,070 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2018-02-04 04:17:42,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:42,071 INFO L225 Difference]: With dead ends: 138 [2018-02-04 04:17:42,071 INFO L226 Difference]: Without dead ends: 136 [2018-02-04 04:17:42,071 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-02-04 04:17:42,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-02-04 04:17:42,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-02-04 04:17:42,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-02-04 04:17:42,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 141 transitions. [2018-02-04 04:17:42,075 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 141 transitions. Word has length 63 [2018-02-04 04:17:42,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:42,075 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 141 transitions. [2018-02-04 04:17:42,075 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 04:17:42,075 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 141 transitions. [2018-02-04 04:17:42,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-04 04:17:42,076 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:42,076 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, 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 04:17:42,076 INFO L371 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:17:42,076 INFO L82 PathProgramCache]: Analyzing trace with hash 2058801817, now seen corresponding path program 2 times [2018-02-04 04:17:42,076 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:42,076 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:42,077 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:42,077 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:42,077 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:42,090 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:42,145 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 04:17:42,145 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:17:42,145 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:17:42,146 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:17:42,169 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 04:17:42,169 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:17:42,174 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:17:42,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-02-04 04:17:42,186 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:17:42,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-02-04 04:17:42,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 04:17:42,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 04:17:42,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 04:17:42,547 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-02-04 04:17:42,547 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:17:42,547 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [10] total 27 [2018-02-04 04:17:42,547 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 04:17:42,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 04:17:42,548 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2018-02-04 04:17:42,548 INFO L87 Difference]: Start difference. First operand 136 states and 141 transitions. Second operand 27 states. [2018-02-04 04:17:43,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:43,144 INFO L93 Difference]: Finished difference Result 137 states and 142 transitions. [2018-02-04 04:17:43,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 04:17:43,144 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 64 [2018-02-04 04:17:43,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:43,145 INFO L225 Difference]: With dead ends: 137 [2018-02-04 04:17:43,145 INFO L226 Difference]: Without dead ends: 135 [2018-02-04 04:17:43,145 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=201, Invalid=1439, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 04:17:43,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-04 04:17:43,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-02-04 04:17:43,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-04 04:17:43,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 140 transitions. [2018-02-04 04:17:43,147 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 140 transitions. Word has length 64 [2018-02-04 04:17:43,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:43,147 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 140 transitions. [2018-02-04 04:17:43,147 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 04:17:43,147 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 140 transitions. [2018-02-04 04:17:43,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-04 04:17:43,148 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:43,148 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:17:43,148 INFO L371 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:17:43,148 INFO L82 PathProgramCache]: Analyzing trace with hash -243629328, now seen corresponding path program 1 times [2018-02-04 04:17:43,148 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:43,148 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:43,149 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:43,149 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:17:43,149 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:43,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:43,158 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:43,215 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-02-04 04:17:43,215 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:43,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 04:17:43,215 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 04:17:43,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 04:17:43,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-04 04:17:43,216 INFO L87 Difference]: Start difference. First operand 135 states and 140 transitions. Second operand 11 states. [2018-02-04 04:17:43,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:43,280 INFO L93 Difference]: Finished difference Result 138 states and 142 transitions. [2018-02-04 04:17:43,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 04:17:43,281 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2018-02-04 04:17:43,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:43,282 INFO L225 Difference]: With dead ends: 138 [2018-02-04 04:17:43,282 INFO L226 Difference]: Without dead ends: 135 [2018-02-04 04:17:43,282 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-02-04 04:17:43,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-04 04:17:43,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-02-04 04:17:43,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-04 04:17:43,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2018-02-04 04:17:43,285 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 74 [2018-02-04 04:17:43,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:43,285 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2018-02-04 04:17:43,285 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 04:17:43,285 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2018-02-04 04:17:43,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-04 04:17:43,286 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:43,286 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:17:43,286 INFO L371 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:17:43,287 INFO L82 PathProgramCache]: Analyzing trace with hash 254396120, now seen corresponding path program 1 times [2018-02-04 04:17:43,287 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:43,287 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:43,287 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:43,288 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:43,288 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:43,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:43,303 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:43,485 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-02-04 04:17:43,485 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:43,486 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-04 04:17:43,486 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 04:17:43,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 04:17:43,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-02-04 04:17:43,487 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand 18 states. [2018-02-04 04:17:43,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:43,816 INFO L93 Difference]: Finished difference Result 163 states and 174 transitions. [2018-02-04 04:17:43,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 04:17:43,816 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2018-02-04 04:17:43,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:43,817 INFO L225 Difference]: With dead ends: 163 [2018-02-04 04:17:43,817 INFO L226 Difference]: Without dead ends: 163 [2018-02-04 04:17:43,818 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2018-02-04 04:17:43,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-04 04:17:43,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 158. [2018-02-04 04:17:43,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-04 04:17:43,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 170 transitions. [2018-02-04 04:17:43,821 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 170 transitions. Word has length 87 [2018-02-04 04:17:43,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:43,821 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 170 transitions. [2018-02-04 04:17:43,821 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 04:17:43,821 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 170 transitions. [2018-02-04 04:17:43,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-04 04:17:43,822 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:43,822 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:17:43,822 INFO L371 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:17:43,822 INFO L82 PathProgramCache]: Analyzing trace with hash 254396121, now seen corresponding path program 1 times [2018-02-04 04:17:43,822 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:43,822 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:43,823 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:43,823 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:43,823 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:43,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:43,833 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:43,890 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 04:17:43,890 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:17:43,890 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:17:43,891 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:43,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:43,914 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:17:43,933 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 04:17:43,934 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:17:43,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-02-04 04:17:43,934 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 04:17:43,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 04:17:43,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-02-04 04:17:43,936 INFO L87 Difference]: Start difference. First operand 158 states and 170 transitions. Second operand 12 states. [2018-02-04 04:17:43,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:43,956 INFO L93 Difference]: Finished difference Result 161 states and 173 transitions. [2018-02-04 04:17:43,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 04:17:43,958 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 87 [2018-02-04 04:17:43,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:43,959 INFO L225 Difference]: With dead ends: 161 [2018-02-04 04:17:43,959 INFO L226 Difference]: Without dead ends: 159 [2018-02-04 04:17:43,959 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2018-02-04 04:17:43,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-02-04 04:17:43,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-02-04 04:17:43,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-04 04:17:43,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 171 transitions. [2018-02-04 04:17:43,963 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 171 transitions. Word has length 87 [2018-02-04 04:17:43,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:43,963 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 171 transitions. [2018-02-04 04:17:43,964 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 04:17:43,964 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 171 transitions. [2018-02-04 04:17:43,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-04 04:17:43,964 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:43,965 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:17:43,965 INFO L371 AbstractCegarLoop]: === Iteration 23 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:17:43,965 INFO L82 PathProgramCache]: Analyzing trace with hash -388927379, now seen corresponding path program 2 times [2018-02-04 04:17:43,965 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:43,965 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:43,966 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:43,966 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:43,966 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:43,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:43,980 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:44,057 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 04:17:44,057 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:17:44,057 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:17:44,058 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:17:44,104 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 04:17:44,105 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:17:44,109 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:17:44,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-02-04 04:17:44,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:17:44,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-02-04 04:17:44,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 04:17:44,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 04:17:44,152 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 04:17:44,539 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-04 04:17:44,539 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:17:44,539 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [12] total 31 [2018-02-04 04:17:44,539 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 04:17:44,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 04:17:44,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=819, Unknown=0, NotChecked=0, Total=930 [2018-02-04 04:17:44,540 INFO L87 Difference]: Start difference. First operand 159 states and 171 transitions. Second operand 31 states. [2018-02-04 04:17:45,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:45,263 INFO L93 Difference]: Finished difference Result 160 states and 170 transitions. [2018-02-04 04:17:45,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 04:17:45,263 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 88 [2018-02-04 04:17:45,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:45,264 INFO L225 Difference]: With dead ends: 160 [2018-02-04 04:17:45,264 INFO L226 Difference]: Without dead ends: 158 [2018-02-04 04:17:45,264 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=271, Invalid=1985, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 04:17:45,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-04 04:17:45,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-02-04 04:17:45,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-04 04:17:45,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 168 transitions. [2018-02-04 04:17:45,267 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 168 transitions. Word has length 88 [2018-02-04 04:17:45,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:45,267 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 168 transitions. [2018-02-04 04:17:45,267 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 04:17:45,267 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 168 transitions. [2018-02-04 04:17:45,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-04 04:17:45,267 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:45,267 INFO L351 BasicCegarLoop]: trace histogram [9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:17:45,267 INFO L371 AbstractCegarLoop]: === Iteration 24 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:17:45,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1868073210, now seen corresponding path program 1 times [2018-02-04 04:17:45,268 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:45,268 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:45,268 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:45,268 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:17:45,268 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:45,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:45,277 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:45,366 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-02-04 04:17:45,366 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:17:45,366 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:17:45,367 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:45,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:45,386 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:17:45,481 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 04:17:45,481 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:17:45,481 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 22 [2018-02-04 04:17:45,482 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 04:17:45,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 04:17:45,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-02-04 04:17:45,482 INFO L87 Difference]: Start difference. First operand 158 states and 168 transitions. Second operand 22 states. [2018-02-04 04:17:45,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:45,625 INFO L93 Difference]: Finished difference Result 162 states and 168 transitions. [2018-02-04 04:17:45,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 04:17:45,625 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 92 [2018-02-04 04:17:45,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:45,626 INFO L225 Difference]: With dead ends: 162 [2018-02-04 04:17:45,626 INFO L226 Difference]: Without dead ends: 156 [2018-02-04 04:17:45,626 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2018-02-04 04:17:45,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-02-04 04:17:45,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-02-04 04:17:45,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-02-04 04:17:45,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 162 transitions. [2018-02-04 04:17:45,630 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 162 transitions. Word has length 92 [2018-02-04 04:17:45,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:45,630 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 162 transitions. [2018-02-04 04:17:45,630 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 04:17:45,631 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 162 transitions. [2018-02-04 04:17:45,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-02-04 04:17:45,631 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:45,632 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:17:45,632 INFO L371 AbstractCegarLoop]: === Iteration 25 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:17:45,632 INFO L82 PathProgramCache]: Analyzing trace with hash -63866368, now seen corresponding path program 1 times [2018-02-04 04:17:45,632 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:45,632 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:45,633 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:45,633 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:45,633 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:45,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:45,650 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:45,876 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-02-04 04:17:45,876 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:45,876 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-02-04 04:17:45,877 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 04:17:45,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 04:17:45,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-02-04 04:17:45,877 INFO L87 Difference]: Start difference. First operand 156 states and 162 transitions. Second operand 21 states. [2018-02-04 04:17:46,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:46,235 INFO L93 Difference]: Finished difference Result 166 states and 175 transitions. [2018-02-04 04:17:46,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 04:17:46,235 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 104 [2018-02-04 04:17:46,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:46,236 INFO L225 Difference]: With dead ends: 166 [2018-02-04 04:17:46,236 INFO L226 Difference]: Without dead ends: 166 [2018-02-04 04:17:46,236 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2018-02-04 04:17:46,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-02-04 04:17:46,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2018-02-04 04:17:46,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-02-04 04:17:46,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 172 transitions. [2018-02-04 04:17:46,238 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 172 transitions. Word has length 104 [2018-02-04 04:17:46,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:46,238 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 172 transitions. [2018-02-04 04:17:46,238 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 04:17:46,238 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 172 transitions. [2018-02-04 04:17:46,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-02-04 04:17:46,239 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:46,239 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:17:46,239 INFO L371 AbstractCegarLoop]: === Iteration 26 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:17:46,239 INFO L82 PathProgramCache]: Analyzing trace with hash -63866367, now seen corresponding path program 1 times [2018-02-04 04:17:46,239 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:46,239 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:46,240 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:46,240 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:46,240 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:46,257 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:46,351 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 04:17:46,351 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:17:46,351 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:17:46,352 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:46,378 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:17:46,401 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 04:17:46,401 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:17:46,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-02-04 04:17:46,402 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 04:17:46,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 04:17:46,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-02-04 04:17:46,402 INFO L87 Difference]: Start difference. First operand 162 states and 172 transitions. Second operand 15 states. [2018-02-04 04:17:46,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:46,439 INFO L93 Difference]: Finished difference Result 165 states and 175 transitions. [2018-02-04 04:17:46,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 04:17:46,466 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 104 [2018-02-04 04:17:46,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:46,467 INFO L225 Difference]: With dead ends: 165 [2018-02-04 04:17:46,467 INFO L226 Difference]: Without dead ends: 163 [2018-02-04 04:17:46,468 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=97, Invalid=143, Unknown=0, NotChecked=0, Total=240 [2018-02-04 04:17:46,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-04 04:17:46,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-02-04 04:17:46,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-02-04 04:17:46,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 173 transitions. [2018-02-04 04:17:46,471 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 173 transitions. Word has length 104 [2018-02-04 04:17:46,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:46,472 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 173 transitions. [2018-02-04 04:17:46,472 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 04:17:46,472 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 173 transitions. [2018-02-04 04:17:46,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-02-04 04:17:46,472 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:46,473 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:17:46,473 INFO L371 AbstractCegarLoop]: === Iteration 27 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:17:46,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1207457043, now seen corresponding path program 2 times [2018-02-04 04:17:46,473 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:46,473 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:46,474 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:46,474 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:46,474 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:46,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:46,489 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:46,606 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 04:17:46,606 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:17:46,606 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:17:46,607 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:17:46,631 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 04:17:46,631 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:17:46,637 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:17:46,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-02-04 04:17:46,647 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:17:46,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-02-04 04:17:46,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 04:17:46,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 04:17:46,670 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 04:17:47,331 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-02-04 04:17:47,331 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:17:47,331 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [15] total 38 [2018-02-04 04:17:47,332 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-04 04:17:47,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-04 04:17:47,332 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1247, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 04:17:47,333 INFO L87 Difference]: Start difference. First operand 163 states and 173 transitions. Second operand 38 states. [2018-02-04 04:17:48,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:48,399 INFO L93 Difference]: Finished difference Result 164 states and 173 transitions. [2018-02-04 04:17:48,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 04:17:48,400 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 105 [2018-02-04 04:17:48,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:48,400 INFO L225 Difference]: With dead ends: 164 [2018-02-04 04:17:48,401 INFO L226 Difference]: Without dead ends: 162 [2018-02-04 04:17:48,402 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 78 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=404, Invalid=3136, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 04:17:48,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-04 04:17:48,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-02-04 04:17:48,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-02-04 04:17:48,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 171 transitions. [2018-02-04 04:17:48,405 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 171 transitions. Word has length 105 [2018-02-04 04:17:48,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:48,406 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 171 transitions. [2018-02-04 04:17:48,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-04 04:17:48,406 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 171 transitions. [2018-02-04 04:17:48,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-02-04 04:17:48,406 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:48,407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:17:48,407 INFO L371 AbstractCegarLoop]: === Iteration 28 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:17:48,407 INFO L82 PathProgramCache]: Analyzing trace with hash 2055534530, now seen corresponding path program 1 times [2018-02-04 04:17:48,407 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:48,407 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:48,408 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:48,408 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:17:48,408 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:48,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:48,425 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:48,550 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 04:17:48,551 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:17:48,551 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:17:48,551 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:48,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:48,609 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:17:48,624 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 04:17:48,624 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:17:48,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-02-04 04:17:48,625 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 04:17:48,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 04:17:48,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-02-04 04:17:48,626 INFO L87 Difference]: Start difference. First operand 162 states and 171 transitions. Second operand 17 states. [2018-02-04 04:17:48,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:48,660 INFO L93 Difference]: Finished difference Result 165 states and 174 transitions. [2018-02-04 04:17:48,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 04:17:48,661 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 110 [2018-02-04 04:17:48,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:48,662 INFO L225 Difference]: With dead ends: 165 [2018-02-04 04:17:48,662 INFO L226 Difference]: Without dead ends: 163 [2018-02-04 04:17:48,662 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=126, Invalid=180, Unknown=0, NotChecked=0, Total=306 [2018-02-04 04:17:48,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-04 04:17:48,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-02-04 04:17:48,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-02-04 04:17:48,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 172 transitions. [2018-02-04 04:17:48,665 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 172 transitions. Word has length 110 [2018-02-04 04:17:48,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:48,666 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 172 transitions. [2018-02-04 04:17:48,666 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 04:17:48,666 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 172 transitions. [2018-02-04 04:17:48,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-02-04 04:17:48,666 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:48,667 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:17:48,667 INFO L371 AbstractCegarLoop]: === Iteration 29 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:17:48,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1832241070, now seen corresponding path program 2 times [2018-02-04 04:17:48,667 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:48,667 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:48,668 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:48,668 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:48,668 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:48,683 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:48,807 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 04:17:48,807 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:17:48,807 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:17:48,808 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:17:48,843 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 04:17:48,843 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:17:48,850 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:17:48,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 04:17:48,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 04:17:48,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 04:17:48,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 04:17:48,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 04:17:48,930 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-02-04 04:17:48,996 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 04:17:48,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 04:17:49,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 04:17:49,000 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:26 [2018-02-04 04:17:49,002 WARN L1033 $PredicateComparison]: unable to prove that (exists ((LDV_INIT_LIST_HEAD_~list.offset Int) (v_DerPreprocessor_2 Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (let ((.cse0 (+ LDV_INIT_LIST_HEAD_~list.offset 4))) (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) LDV_INIT_LIST_HEAD_~list.offset v_DerPreprocessor_2) .cse0 (select (select |c_#memory_int| |c_LDV_INIT_LIST_HEAD_#in~list.base|) .cse0))))) (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) is different from true [2018-02-04 04:17:49,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2018-02-04 04:17:49,010 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 04:17:49,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-02-04 04:17:49,016 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 04:17:49,017 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 04:17:49,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-02-04 04:17:49,020 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 04:17:49,024 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 04:17:49,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 04:17:49,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 04:17:49,030 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:37, output treesize:9 [2018-02-04 04:17:49,241 WARN L1033 $PredicateComparison]: unable to prove that (exists ((ldv_atomic_add_return_~temp~0 Int)) (let ((.cse0 (select |c_old(#memory_int)| |c_ldv_atomic_add_return_#in~v.base|))) (and (<= (+ |c_ldv_atomic_add_return_#in~i| (select .cse0 |c_ldv_atomic_add_return_#in~v.offset|)) ldv_atomic_add_return_~temp~0) (= |c_#memory_int| (store |c_old(#memory_int)| |c_ldv_atomic_add_return_#in~v.base| (store .cse0 |c_ldv_atomic_add_return_#in~v.offset| ldv_atomic_add_return_~temp~0)))))) is different from true [2018-02-04 04:17:49,254 WARN L1033 $PredicateComparison]: unable to prove that (exists ((ldv_atomic_add_return_~temp~0 Int)) (let ((.cse0 (select |c_old(#memory_int)| |c_ldv_kref_get_#in~kref.base|))) (and (= (store |c_old(#memory_int)| |c_ldv_kref_get_#in~kref.base| (store .cse0 |c_ldv_kref_get_#in~kref.offset| ldv_atomic_add_return_~temp~0)) |c_#memory_int|) (<= (+ (select .cse0 |c_ldv_kref_get_#in~kref.offset|) 1) ldv_atomic_add_return_~temp~0)))) is different from true [2018-02-04 04:17:49,257 WARN L1033 $PredicateComparison]: unable to prove that (exists ((ldv_atomic_add_return_~temp~0 Int)) (let ((.cse0 (select |c_old(#memory_int)| |c_ldv_kobject_get_#in~kobj.base|)) (.cse1 (+ |c_ldv_kobject_get_#in~kobj.offset| 12))) (and (= (store |c_old(#memory_int)| |c_ldv_kobject_get_#in~kobj.base| (store .cse0 .cse1 ldv_atomic_add_return_~temp~0)) |c_#memory_int|) (<= (+ (select .cse0 .cse1) 1) ldv_atomic_add_return_~temp~0)))) is different from true [2018-02-04 04:17:49,263 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 04:17:49,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-02-04 04:17:49,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2018-02-04 04:17:49,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 04:17:49,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 04:17:49,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 04:17:49,270 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:7 [2018-02-04 04:17:49,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-02-04 04:17:49,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2018-02-04 04:17:49,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 04:17:49,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 04:17:49,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 04:17:49,523 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:8 [2018-02-04 04:17:49,765 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-02-04 04:17:49,765 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:17:49,766 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [49] imperfect sequences [17] total 64 [2018-02-04 04:17:49,766 INFO L409 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-02-04 04:17:49,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-02-04 04:17:49,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=3322, Unknown=4, NotChecked=476, Total=4032 [2018-02-04 04:17:49,767 INFO L87 Difference]: Start difference. First operand 163 states and 172 transitions. Second operand 64 states. [2018-02-04 04:17:51,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:51,548 INFO L93 Difference]: Finished difference Result 168 states and 171 transitions. [2018-02-04 04:17:51,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-02-04 04:17:51,549 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 111 [2018-02-04 04:17:51,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:51,549 INFO L225 Difference]: With dead ends: 168 [2018-02-04 04:17:51,549 INFO L226 Difference]: Without dead ends: 157 [2018-02-04 04:17:51,550 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1403 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=381, Invalid=7463, Unknown=4, NotChecked=708, Total=8556 [2018-02-04 04:17:51,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-02-04 04:17:51,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-02-04 04:17:51,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-02-04 04:17:51,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 160 transitions. [2018-02-04 04:17:51,552 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 160 transitions. Word has length 111 [2018-02-04 04:17:51,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:51,552 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 160 transitions. [2018-02-04 04:17:51,552 INFO L433 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-02-04 04:17:51,552 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 160 transitions. [2018-02-04 04:17:51,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-02-04 04:17:51,553 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:51,553 INFO L351 BasicCegarLoop]: trace histogram [14, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:17:51,553 INFO L371 AbstractCegarLoop]: === Iteration 30 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:17:51,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1142789455, now seen corresponding path program 1 times [2018-02-04 04:17:51,553 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:51,553 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:51,553 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:51,554 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:17:51,554 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:51,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:51,568 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:51,770 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-02-04 04:17:51,770 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:17:51,770 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:17:51,772 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:51,801 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:17:52,080 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 04:17:52,080 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:17:52,080 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2018-02-04 04:17:52,081 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 04:17:52,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 04:17:52,081 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1016, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 04:17:52,082 INFO L87 Difference]: Start difference. First operand 157 states and 160 transitions. Second operand 35 states. [2018-02-04 04:17:53,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:53,000 INFO L93 Difference]: Finished difference Result 169 states and 172 transitions. [2018-02-04 04:17:53,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 04:17:53,000 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 119 [2018-02-04 04:17:53,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:53,001 INFO L225 Difference]: With dead ends: 169 [2018-02-04 04:17:53,001 INFO L226 Difference]: Without dead ends: 167 [2018-02-04 04:17:53,002 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=521, Invalid=3639, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 04:17:53,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-02-04 04:17:53,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-02-04 04:17:53,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-04 04:17:53,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 168 transitions. [2018-02-04 04:17:53,004 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 168 transitions. Word has length 119 [2018-02-04 04:17:53,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:53,004 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 168 transitions. [2018-02-04 04:17:53,004 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 04:17:53,004 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 168 transitions. [2018-02-04 04:17:53,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-02-04 04:17:53,004 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:53,004 INFO L351 BasicCegarLoop]: trace histogram [15, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:17:53,004 INFO L371 AbstractCegarLoop]: === Iteration 31 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:17:53,004 INFO L82 PathProgramCache]: Analyzing trace with hash -577478985, now seen corresponding path program 1 times [2018-02-04 04:17:53,005 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:53,005 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:53,005 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:53,005 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:53,005 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:53,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:53,016 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:53,216 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-02-04 04:17:53,216 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:17:53,216 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:17:53,217 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:53,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:53,247 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:17:53,528 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-02-04 04:17:53,528 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:17:53,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 39 [2018-02-04 04:17:53,529 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-04 04:17:53,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-04 04:17:53,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1287, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 04:17:53,529 INFO L87 Difference]: Start difference. First operand 165 states and 168 transitions. Second operand 39 states. [2018-02-04 04:17:54,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:54,515 INFO L93 Difference]: Finished difference Result 169 states and 172 transitions. [2018-02-04 04:17:54,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 04:17:54,516 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 134 [2018-02-04 04:17:54,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:54,516 INFO L225 Difference]: With dead ends: 169 [2018-02-04 04:17:54,516 INFO L226 Difference]: Without dead ends: 167 [2018-02-04 04:17:54,517 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=595, Invalid=4807, Unknown=0, NotChecked=0, Total=5402 [2018-02-04 04:17:54,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-02-04 04:17:54,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-02-04 04:17:54,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-04 04:17:54,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 168 transitions. [2018-02-04 04:17:54,520 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 168 transitions. Word has length 134 [2018-02-04 04:17:54,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:54,520 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 168 transitions. [2018-02-04 04:17:54,520 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-04 04:17:54,521 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 168 transitions. [2018-02-04 04:17:54,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-02-04 04:17:54,521 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:54,521 INFO L351 BasicCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:17:54,522 INFO L371 AbstractCegarLoop]: === Iteration 32 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 04:17:54,522 INFO L82 PathProgramCache]: Analyzing trace with hash -460832411, now seen corresponding path program 1 times [2018-02-04 04:17:54,522 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:54,522 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:54,523 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:54,523 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:54,523 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:54,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:54,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:54,629 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: Unknown lemma type! at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-04 04:17:54,632 INFO L168 Benchmark]: Toolchain (without parser) took 17815.27 ms. Allocated memory was 395.3 MB in the beginning and 949.5 MB in the end (delta: 554.2 MB). Free memory was 349.4 MB in the beginning and 553.3 MB in the end (delta: -203.9 MB). Peak memory consumption was 350.2 MB. Max. memory is 5.3 GB. [2018-02-04 04:17:54,633 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 395.3 MB. Free memory is still 356.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 04:17:54,634 INFO L168 Benchmark]: CACSL2BoogieTranslator took 165.24 ms. Allocated memory is still 395.3 MB. Free memory was 349.4 MB in the beginning and 334.8 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. [2018-02-04 04:17:54,634 INFO L168 Benchmark]: Boogie Preprocessor took 28.74 ms. Allocated memory is still 395.3 MB. Free memory was 334.8 MB in the beginning and 333.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 04:17:54,634 INFO L168 Benchmark]: RCFGBuilder took 343.17 ms. Allocated memory is still 395.3 MB. Free memory was 333.5 MB in the beginning and 296.3 MB in the end (delta: 37.2 MB). Peak memory consumption was 37.2 MB. Max. memory is 5.3 GB. [2018-02-04 04:17:54,634 INFO L168 Benchmark]: TraceAbstraction took 17275.23 ms. Allocated memory was 395.3 MB in the beginning and 949.5 MB in the end (delta: 554.2 MB). Free memory was 296.3 MB in the beginning and 553.3 MB in the end (delta: -256.9 MB). Peak memory consumption was 297.2 MB. Max. memory is 5.3 GB. [2018-02-04 04:17:54,636 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 395.3 MB. Free memory is still 356.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 165.24 ms. Allocated memory is still 395.3 MB. Free memory was 349.4 MB in the beginning and 334.8 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.74 ms. Allocated memory is still 395.3 MB. Free memory was 334.8 MB in the beginning and 333.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 343.17 ms. Allocated memory is still 395.3 MB. Free memory was 333.5 MB in the beginning and 296.3 MB in the end (delta: 37.2 MB). Peak memory consumption was 37.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 17275.23 ms. Allocated memory was 395.3 MB in the beginning and 949.5 MB in the end (delta: 554.2 MB). Free memory was 296.3 MB in the beginning and 553.3 MB in the end (delta: -256.9 MB). Peak memory consumption was 297.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: Unknown lemma type! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Unknown lemma type!: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_04-17-54-641.csv Received shutdown request...