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_5_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 21:06:19,544 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 21:06:19,546 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 21:06:19,560 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 21:06:19,560 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 21:06:19,561 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 21:06:19,562 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 21:06:19,563 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 21:06:19,565 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 21:06:19,566 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 21:06:19,566 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 21:06:19,566 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 21:06:19,567 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 21:06:19,568 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 21:06:19,569 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 21:06:19,571 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 21:06:19,572 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 21:06:19,574 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 21:06:19,575 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 21:06:19,576 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 21:06:19,577 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 21:06:19,577 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 21:06:19,577 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 21:06:19,578 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 21:06:19,579 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 21:06:19,580 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 21:06:19,580 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 21:06:19,581 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 21:06:19,581 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 21:06:19,581 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 21:06:19,581 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 21:06:19,582 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-02 21:06:19,591 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 21:06:19,591 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 21:06:19,592 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 21:06:19,592 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 21:06:19,592 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 21:06:19,592 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 21:06:19,592 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 21:06:19,593 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 21:06:19,593 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 21:06:19,593 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 21:06:19,593 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 21:06:19,593 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 21:06:19,593 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 21:06:19,593 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 21:06:19,594 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 21:06:19,594 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 21:06:19,594 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 21:06:19,594 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 21:06:19,594 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 21:06:19,594 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 21:06:19,594 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 21:06:19,595 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 21:06:19,595 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 21:06:19,595 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 21:06:19,595 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-02 21:06:19,624 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 21:06:19,632 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 21:06:19,636 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 21:06:19,637 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 21:06:19,637 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 21:06:19,638 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_5_false-valid-deref.i [2018-02-02 21:06:19,782 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 21:06:19,783 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 21:06:19,783 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 21:06:19,783 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 21:06:19,787 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 21:06:19,788 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:06:19" (1/1) ... [2018-02-02 21:06:19,790 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30ce2b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:06:19, skipping insertion in model container [2018-02-02 21:06:19,790 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:06:19" (1/1) ... [2018-02-02 21:06:19,801 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 21:06:19,839 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 21:06:19,932 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 21:06:19,953 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 21:06:19,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:06:19 WrapperNode [2018-02-02 21:06:19,963 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 21:06:19,963 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 21:06:19,964 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 21:06:19,964 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 21:06:19,973 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:06:19" (1/1) ... [2018-02-02 21:06:19,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:06:19" (1/1) ... [2018-02-02 21:06:19,983 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:06:19" (1/1) ... [2018-02-02 21:06:19,983 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:06:19" (1/1) ... [2018-02-02 21:06:19,990 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:06:19" (1/1) ... [2018-02-02 21:06:19,993 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:06:19" (1/1) ... [2018-02-02 21:06:19,995 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:06:19" (1/1) ... [2018-02-02 21:06:19,997 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 21:06:19,998 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 21:06:19,998 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 21:06:19,998 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 21:06:19,999 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:06:19" (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-02 21:06:20,034 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 21:06:20,034 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 21:06:20,034 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-02-02 21:06:20,034 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 21:06:20,034 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-02-02 21:06:20,034 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-02-02 21:06:20,034 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-02-02 21:06:20,034 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-02-02 21:06:20,034 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-02-02 21:06:20,035 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-02-02 21:06:20,035 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-02-02 21:06:20,035 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-02-02 21:06:20,035 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-02-02 21:06:20,035 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-02-02 21:06:20,035 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-02-02 21:06:20,035 INFO L136 BoogieDeclarations]: Found implementation of procedure f_22_put [2018-02-02 21:06:20,035 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 21:06:20,035 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 21:06:20,035 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 21:06:20,035 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 21:06:20,035 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 21:06:20,035 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 21:06:20,036 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 21:06:20,036 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 21:06:20,036 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 21:06:20,036 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-02 21:06:20,036 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-02 21:06:20,036 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 21:06:20,036 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 21:06:20,036 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 21:06:20,036 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-02 21:06:20,036 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 21:06:20,036 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-02-02 21:06:20,036 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-02-02 21:06:20,036 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-02-02 21:06:20,036 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-02-02 21:06:20,037 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-02-02 21:06:20,037 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-02-02 21:06:20,037 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-02-02 21:06:20,037 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-02-02 21:06:20,037 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-02-02 21:06:20,037 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-02-02 21:06:20,037 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-02-02 21:06:20,037 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-02-02 21:06:20,037 INFO L128 BoogieDeclarations]: Found specification of procedure f_22_put [2018-02-02 21:06:20,037 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 21:06:20,037 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 21:06:20,037 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 21:06:20,037 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 21:06:20,205 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-02 21:06:20,300 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 21:06:20,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:06:20 BoogieIcfgContainer [2018-02-02 21:06:20,300 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 21:06:20,301 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 21:06:20,301 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 21:06:20,304 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 21:06:20,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:06:19" (1/3) ... [2018-02-02 21:06:20,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@338e42b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:06:20, skipping insertion in model container [2018-02-02 21:06:20,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:06:19" (2/3) ... [2018-02-02 21:06:20,306 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@338e42b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:06:20, skipping insertion in model container [2018-02-02 21:06:20,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:06:20" (3/3) ... [2018-02-02 21:06:20,308 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test22_5_false-valid-deref.i [2018-02-02 21:06:20,316 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 21:06:20,323 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-02-02 21:06:20,353 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 21:06:20,354 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 21:06:20,354 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 21:06:20,354 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 21:06:20,354 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 21:06:20,354 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 21:06:20,354 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 21:06:20,354 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 21:06:20,354 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 21:06:20,365 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states. [2018-02-02 21:06:20,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 21:06:20,373 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:20,374 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:06:20,374 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_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-02 21:06:20,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1211515492, now seen corresponding path program 1 times [2018-02-02 21:06:20,379 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:20,379 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:20,419 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:20,419 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:20,419 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:20,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:20,464 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:20,543 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-02 21:06:20,544 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:06:20,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 21:06:20,545 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 21:06:20,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 21:06:20,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 21:06:20,555 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 5 states. [2018-02-02 21:06:20,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:20,675 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2018-02-02 21:06:20,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 21:06:20,677 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 21:06:20,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:20,686 INFO L225 Difference]: With dead ends: 129 [2018-02-02 21:06:20,686 INFO L226 Difference]: Without dead ends: 126 [2018-02-02 21:06:20,688 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-02 21:06:20,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-02 21:06:20,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2018-02-02 21:06:20,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-02 21:06:20,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2018-02-02 21:06:20,725 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 17 [2018-02-02 21:06:20,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:20,726 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2018-02-02 21:06:20,726 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 21:06:20,726 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2018-02-02 21:06:20,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 21:06:20,727 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:20,727 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-02 21:06:20,727 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_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-02 21:06:20,727 INFO L82 PathProgramCache]: Analyzing trace with hash 774524518, now seen corresponding path program 1 times [2018-02-02 21:06:20,728 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:20,728 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:20,729 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:20,729 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:20,729 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:20,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:20,746 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:20,799 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-02 21:06:20,799 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:06:20,799 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 21:06:20,801 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 21:06:20,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 21:06:20,801 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 21:06:20,802 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand 6 states. [2018-02-02 21:06:20,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:20,952 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2018-02-02 21:06:20,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 21:06:20,952 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 21:06:20,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:20,954 INFO L225 Difference]: With dead ends: 125 [2018-02-02 21:06:20,954 INFO L226 Difference]: Without dead ends: 125 [2018-02-02 21:06:20,954 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-02 21:06:20,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-02 21:06:20,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-02-02 21:06:20,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-02 21:06:20,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2018-02-02 21:06:20,963 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 19 [2018-02-02 21:06:20,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:20,963 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2018-02-02 21:06:20,963 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 21:06:20,963 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2018-02-02 21:06:20,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 21:06:20,964 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:20,964 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-02 21:06:20,964 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_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-02 21:06:20,964 INFO L82 PathProgramCache]: Analyzing trace with hash 774524519, now seen corresponding path program 1 times [2018-02-02 21:06:20,964 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:20,965 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:20,966 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:20,966 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:20,966 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:20,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:20,983 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:21,121 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-02 21:06:21,121 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:06:21,121 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 21:06:21,121 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 21:06:21,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 21:06:21,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 21:06:21,121 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand 7 states. [2018-02-02 21:06:21,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:21,280 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions. [2018-02-02 21:06:21,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 21:06:21,280 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-02-02 21:06:21,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:21,281 INFO L225 Difference]: With dead ends: 124 [2018-02-02 21:06:21,281 INFO L226 Difference]: Without dead ends: 124 [2018-02-02 21:06:21,282 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-02 21:06:21,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-02 21:06:21,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-02-02 21:06:21,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-02 21:06:21,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2018-02-02 21:06:21,289 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 19 [2018-02-02 21:06:21,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:21,289 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2018-02-02 21:06:21,289 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 21:06:21,290 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2018-02-02 21:06:21,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 21:06:21,290 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:21,291 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] [2018-02-02 21:06:21,291 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_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-02 21:06:21,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1886266821, now seen corresponding path program 1 times [2018-02-02 21:06:21,291 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:21,291 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:21,295 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:21,295 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:21,295 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:21,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:21,314 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:21,381 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-02 21:06:21,381 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:06:21,381 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 21:06:21,381 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 21:06:21,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 21:06:21,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 21:06:21,382 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand 9 states. [2018-02-02 21:06:21,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:21,447 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions. [2018-02-02 21:06:21,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 21:06:21,448 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-02-02 21:06:21,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:21,449 INFO L225 Difference]: With dead ends: 139 [2018-02-02 21:06:21,449 INFO L226 Difference]: Without dead ends: 139 [2018-02-02 21:06:21,449 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 21:06:21,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-02 21:06:21,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2018-02-02 21:06:21,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-02 21:06:21,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 144 transitions. [2018-02-02 21:06:21,458 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 144 transitions. Word has length 31 [2018-02-02 21:06:21,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:21,458 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 144 transitions. [2018-02-02 21:06:21,458 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 21:06:21,458 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 144 transitions. [2018-02-02 21:06:21,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 21:06:21,459 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:21,459 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-02 21:06:21,459 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_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-02 21:06:21,459 INFO L82 PathProgramCache]: Analyzing trace with hash 107698799, now seen corresponding path program 1 times [2018-02-02 21:06:21,459 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:21,459 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:21,460 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:21,460 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:21,461 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:21,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:21,475 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:21,546 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-02 21:06:21,546 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:06:21,546 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 21:06:21,546 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 21:06:21,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 21:06:21,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 21:06:21,547 INFO L87 Difference]: Start difference. First operand 135 states and 144 transitions. Second operand 10 states. [2018-02-02 21:06:21,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:21,735 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2018-02-02 21:06:21,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 21:06:21,735 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-02-02 21:06:21,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:21,736 INFO L225 Difference]: With dead ends: 134 [2018-02-02 21:06:21,736 INFO L226 Difference]: Without dead ends: 134 [2018-02-02 21:06:21,737 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-02 21:06:21,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-02 21:06:21,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-02-02 21:06:21,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-02 21:06:21,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 143 transitions. [2018-02-02 21:06:21,742 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 143 transitions. Word has length 34 [2018-02-02 21:06:21,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:21,743 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 143 transitions. [2018-02-02 21:06:21,743 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 21:06:21,743 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 143 transitions. [2018-02-02 21:06:21,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 21:06:21,744 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:21,744 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-02 21:06:21,744 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_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-02 21:06:21,744 INFO L82 PathProgramCache]: Analyzing trace with hash 107698800, now seen corresponding path program 1 times [2018-02-02 21:06:21,744 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:21,744 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:21,745 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:21,745 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:21,745 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:21,758 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:21,777 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-02 21:06:21,777 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:06:21,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 21:06:21,778 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 21:06:21,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 21:06:21,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 21:06:21,778 INFO L87 Difference]: Start difference. First operand 134 states and 143 transitions. Second operand 4 states. [2018-02-02 21:06:21,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:21,795 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2018-02-02 21:06:21,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 21:06:21,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-02-02 21:06:21,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:21,797 INFO L225 Difference]: With dead ends: 137 [2018-02-02 21:06:21,797 INFO L226 Difference]: Without dead ends: 135 [2018-02-02 21:06:21,797 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-02 21:06:21,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-02 21:06:21,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-02-02 21:06:21,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-02 21:06:21,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 144 transitions. [2018-02-02 21:06:21,803 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 144 transitions. Word has length 34 [2018-02-02 21:06:21,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:21,803 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 144 transitions. [2018-02-02 21:06:21,803 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 21:06:21,804 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 144 transitions. [2018-02-02 21:06:21,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 21:06:21,804 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:21,805 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-02 21:06:21,805 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_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-02 21:06:21,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1590593736, now seen corresponding path program 1 times [2018-02-02 21:06:21,805 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:21,805 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:21,806 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:21,806 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:21,806 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:21,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:21,818 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:21,842 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-02 21:06:21,842 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:06:21,842 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:06:21,843 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:21,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:21,869 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:06:21,890 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-02 21:06:21,890 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:06:21,890 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-02-02 21:06:21,891 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 21:06:21,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 21:06:21,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-02 21:06:21,891 INFO L87 Difference]: Start difference. First operand 135 states and 144 transitions. Second operand 6 states. [2018-02-02 21:06:21,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:21,908 INFO L93 Difference]: Finished difference Result 138 states and 147 transitions. [2018-02-02 21:06:21,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 21:06:21,909 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-02-02 21:06:21,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:21,909 INFO L225 Difference]: With dead ends: 138 [2018-02-02 21:06:21,910 INFO L226 Difference]: Without dead ends: 136 [2018-02-02 21:06:21,910 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-02 21:06:21,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-02-02 21:06:21,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-02-02 21:06:21,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-02-02 21:06:21,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 145 transitions. [2018-02-02 21:06:21,915 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 145 transitions. Word has length 35 [2018-02-02 21:06:21,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:21,916 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 145 transitions. [2018-02-02 21:06:21,916 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 21:06:21,916 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 145 transitions. [2018-02-02 21:06:21,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 21:06:21,917 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:21,917 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-02 21:06:21,917 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_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-02 21:06:21,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1596912496, now seen corresponding path program 2 times [2018-02-02 21:06:21,917 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:21,917 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:21,918 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:21,919 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:21,919 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:21,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:21,962 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-02 21:06:21,962 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:06:21,962 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:06:21,963 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:06:21,988 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-02 21:06:21,988 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:06:21,992 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:06:22,022 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-02 21:06:22,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:06:22,034 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-02 21:06:22,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 21:06:22,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 21:06:22,044 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-02 21:06:22,266 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-02 21:06:22,267 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 21:06:22,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [6] total 20 [2018-02-02 21:06:22,267 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 21:06:22,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 21:06:22,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2018-02-02 21:06:22,268 INFO L87 Difference]: Start difference. First operand 136 states and 145 transitions. Second operand 20 states. [2018-02-02 21:06:22,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:22,923 INFO L93 Difference]: Finished difference Result 155 states and 164 transitions. [2018-02-02 21:06:22,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 21:06:22,923 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-02-02 21:06:22,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:22,924 INFO L225 Difference]: With dead ends: 155 [2018-02-02 21:06:22,924 INFO L226 Difference]: Without dead ends: 153 [2018-02-02 21:06:22,924 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-02 21:06:22,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-02-02 21:06:22,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 136. [2018-02-02 21:06:22,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-02-02 21:06:22,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 145 transitions. [2018-02-02 21:06:22,929 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 145 transitions. Word has length 36 [2018-02-02 21:06:22,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:22,929 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 145 transitions. [2018-02-02 21:06:22,929 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 21:06:22,929 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 145 transitions. [2018-02-02 21:06:22,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 21:06:22,930 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:22,931 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] [2018-02-02 21:06:22,931 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_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-02 21:06:22,931 INFO L82 PathProgramCache]: Analyzing trace with hash 2040634480, now seen corresponding path program 1 times [2018-02-02 21:06:22,931 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:22,931 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:22,932 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:22,933 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:06:22,933 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:22,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:22,957 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-02 21:06:22,957 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:06:22,957 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 21:06:22,957 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 21:06:22,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 21:06:22,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 21:06:22,958 INFO L87 Difference]: Start difference. First operand 136 states and 145 transitions. Second operand 3 states. [2018-02-02 21:06:23,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:23,038 INFO L93 Difference]: Finished difference Result 154 states and 165 transitions. [2018-02-02 21:06:23,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 21:06:23,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-02-02 21:06:23,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:23,040 INFO L225 Difference]: With dead ends: 154 [2018-02-02 21:06:23,040 INFO L226 Difference]: Without dead ends: 142 [2018-02-02 21:06:23,040 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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-02 21:06:23,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-02-02 21:06:23,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 132. [2018-02-02 21:06:23,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-02-02 21:06:23,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 140 transitions. [2018-02-02 21:06:23,046 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 140 transitions. Word has length 36 [2018-02-02 21:06:23,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:23,046 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 140 transitions. [2018-02-02 21:06:23,046 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 21:06:23,046 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 140 transitions. [2018-02-02 21:06:23,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 21:06:23,047 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:23,047 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] [2018-02-02 21:06:23,048 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_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-02 21:06:23,048 INFO L82 PathProgramCache]: Analyzing trace with hash 746437934, now seen corresponding path program 1 times [2018-02-02 21:06:23,048 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:23,048 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:23,049 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:23,049 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:23,049 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:23,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:23,055 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:23,084 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-02 21:06:23,085 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:06:23,085 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 21:06:23,085 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 21:06:23,085 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 21:06:23,085 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 21:06:23,085 INFO L87 Difference]: Start difference. First operand 132 states and 140 transitions. Second operand 6 states. [2018-02-02 21:06:23,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:23,094 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2018-02-02 21:06:23,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 21:06:23,099 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-02-02 21:06:23,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:23,099 INFO L225 Difference]: With dead ends: 119 [2018-02-02 21:06:23,099 INFO L226 Difference]: Without dead ends: 119 [2018-02-02 21:06:23,100 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-02 21:06:23,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-02 21:06:23,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-02-02 21:06:23,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-02 21:06:23,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 125 transitions. [2018-02-02 21:06:23,103 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 125 transitions. Word has length 38 [2018-02-02 21:06:23,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:23,103 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 125 transitions. [2018-02-02 21:06:23,103 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 21:06:23,103 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2018-02-02 21:06:23,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 21:06:23,104 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:23,104 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-02 21:06:23,104 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_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-02 21:06:23,104 INFO L82 PathProgramCache]: Analyzing trace with hash -98646161, now seen corresponding path program 1 times [2018-02-02 21:06:23,104 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:23,104 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:23,105 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:23,105 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:23,105 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:23,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:23,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:23,179 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-02 21:06:23,179 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:06:23,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 21:06:23,179 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 21:06:23,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 21:06:23,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 21:06:23,180 INFO L87 Difference]: Start difference. First operand 119 states and 125 transitions. Second operand 10 states. [2018-02-02 21:06:23,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:23,351 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2018-02-02 21:06:23,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 21:06:23,351 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-02-02 21:06:23,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:23,352 INFO L225 Difference]: With dead ends: 117 [2018-02-02 21:06:23,352 INFO L226 Difference]: Without dead ends: 117 [2018-02-02 21:06:23,352 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-02 21:06:23,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-02 21:06:23,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-02-02 21:06:23,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-02 21:06:23,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 123 transitions. [2018-02-02 21:06:23,358 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 123 transitions. Word has length 42 [2018-02-02 21:06:23,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:23,359 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 123 transitions. [2018-02-02 21:06:23,359 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 21:06:23,359 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2018-02-02 21:06:23,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 21:06:23,360 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:23,360 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-02 21:06:23,360 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_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-02 21:06:23,360 INFO L82 PathProgramCache]: Analyzing trace with hash -98646160, now seen corresponding path program 1 times [2018-02-02 21:06:23,360 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:23,360 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:23,361 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:23,361 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:23,361 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:23,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:23,371 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:23,427 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-02 21:06:23,427 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:06:23,427 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:06:23,428 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:23,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:23,450 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:06:23,461 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-02 21:06:23,462 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:06:23,462 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-02-02 21:06:23,462 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 21:06:23,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 21:06:23,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-02-02 21:06:23,463 INFO L87 Difference]: Start difference. First operand 117 states and 123 transitions. Second operand 8 states. [2018-02-02 21:06:23,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:23,486 INFO L93 Difference]: Finished difference Result 120 states and 126 transitions. [2018-02-02 21:06:23,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 21:06:23,486 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-02-02 21:06:23,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:23,487 INFO L225 Difference]: With dead ends: 120 [2018-02-02 21:06:23,487 INFO L226 Difference]: Without dead ends: 118 [2018-02-02 21:06:23,488 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-02 21:06:23,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-02-02 21:06:23,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-02-02 21:06:23,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-02 21:06:23,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 124 transitions. [2018-02-02 21:06:23,491 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 124 transitions. Word has length 42 [2018-02-02 21:06:23,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:23,492 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 124 transitions. [2018-02-02 21:06:23,492 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 21:06:23,492 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2018-02-02 21:06:23,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 21:06:23,504 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:23,504 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-02 21:06:23,504 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_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-02 21:06:23,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1065378760, now seen corresponding path program 2 times [2018-02-02 21:06:23,505 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:23,505 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:23,506 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:23,506 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:23,506 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:23,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:23,518 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:23,551 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-02 21:06:23,552 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:06:23,552 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:06:23,553 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:06:23,569 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-02 21:06:23,569 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:06:23,573 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:06:23,587 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-02 21:06:23,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:06:23,601 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-02 21:06:23,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 21:06:23,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 21:06:23,614 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-02 21:06:23,888 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-02 21:06:23,888 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 21:06:23,888 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 22 [2018-02-02 21:06:23,888 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 21:06:23,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 21:06:23,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2018-02-02 21:06:23,889 INFO L87 Difference]: Start difference. First operand 118 states and 124 transitions. Second operand 22 states. [2018-02-02 21:06:24,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:24,378 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2018-02-02 21:06:24,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 21:06:24,378 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 43 [2018-02-02 21:06:24,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:24,379 INFO L225 Difference]: With dead ends: 119 [2018-02-02 21:06:24,379 INFO L226 Difference]: Without dead ends: 117 [2018-02-02 21:06:24,380 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=917, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 21:06:24,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-02 21:06:24,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-02-02 21:06:24,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-02 21:06:24,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 123 transitions. [2018-02-02 21:06:24,382 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 123 transitions. Word has length 43 [2018-02-02 21:06:24,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:24,382 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 123 transitions. [2018-02-02 21:06:24,382 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 21:06:24,383 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2018-02-02 21:06:24,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 21:06:24,384 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:24,384 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] [2018-02-02 21:06:24,384 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_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-02 21:06:24,384 INFO L82 PathProgramCache]: Analyzing trace with hash -403711437, now seen corresponding path program 1 times [2018-02-02 21:06:24,384 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:24,384 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:24,385 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:24,385 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:06:24,386 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:24,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:24,395 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:24,450 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-02 21:06:24,450 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:06:24,451 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 21:06:24,451 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 21:06:24,451 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 21:06:24,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 21:06:24,451 INFO L87 Difference]: Start difference. First operand 117 states and 123 transitions. Second operand 8 states. [2018-02-02 21:06:24,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:24,488 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2018-02-02 21:06:24,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 21:06:24,489 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-02-02 21:06:24,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:24,490 INFO L225 Difference]: With dead ends: 119 [2018-02-02 21:06:24,490 INFO L226 Difference]: Without dead ends: 117 [2018-02-02 21:06:24,490 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-02 21:06:24,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-02 21:06:24,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-02-02 21:06:24,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-02 21:06:24,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 122 transitions. [2018-02-02 21:06:24,493 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 122 transitions. Word has length 51 [2018-02-02 21:06:24,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:24,493 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 122 transitions. [2018-02-02 21:06:24,494 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 21:06:24,494 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2018-02-02 21:06:24,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 21:06:24,494 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:24,494 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] [2018-02-02 21:06:24,494 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_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-02 21:06:24,495 INFO L82 PathProgramCache]: Analyzing trace with hash 90191936, now seen corresponding path program 1 times [2018-02-02 21:06:24,495 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:24,495 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:24,496 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:24,496 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:24,496 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:24,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:24,505 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:24,560 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-02 21:06:24,560 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:06:24,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 21:06:24,560 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 21:06:24,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 21:06:24,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 21:06:24,561 INFO L87 Difference]: Start difference. First operand 117 states and 122 transitions. Second operand 10 states. [2018-02-02 21:06:24,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:24,613 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2018-02-02 21:06:24,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 21:06:24,614 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-02-02 21:06:24,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:24,615 INFO L225 Difference]: With dead ends: 121 [2018-02-02 21:06:24,615 INFO L226 Difference]: Without dead ends: 117 [2018-02-02 21:06:24,615 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-02 21:06:24,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-02 21:06:24,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-02-02 21:06:24,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-02 21:06:24,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 121 transitions. [2018-02-02 21:06:24,619 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 121 transitions. Word has length 56 [2018-02-02 21:06:24,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:24,619 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 121 transitions. [2018-02-02 21:06:24,619 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 21:06:24,620 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2018-02-02 21:06:24,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 21:06:24,620 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:24,620 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, 1, 1, 1, 1] [2018-02-02 21:06:24,620 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_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-02 21:06:24,621 INFO L82 PathProgramCache]: Analyzing trace with hash 222221704, now seen corresponding path program 1 times [2018-02-02 21:06:24,621 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:24,621 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:24,622 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:24,622 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:24,622 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:24,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:24,636 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:24,851 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-02 21:06:24,851 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:06:24,851 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-02-02 21:06:24,852 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 21:06:24,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 21:06:24,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2018-02-02 21:06:24,852 INFO L87 Difference]: Start difference. First operand 117 states and 121 transitions. Second operand 23 states. [2018-02-02 21:06:25,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:25,236 INFO L93 Difference]: Finished difference Result 144 states and 153 transitions. [2018-02-02 21:06:25,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 21:06:25,236 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 67 [2018-02-02 21:06:25,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:25,237 INFO L225 Difference]: With dead ends: 144 [2018-02-02 21:06:25,237 INFO L226 Difference]: Without dead ends: 144 [2018-02-02 21:06:25,237 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=853, Unknown=0, NotChecked=0, Total=930 [2018-02-02 21:06:25,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-02-02 21:06:25,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 139. [2018-02-02 21:06:25,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-02-02 21:06:25,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 149 transitions. [2018-02-02 21:06:25,240 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 149 transitions. Word has length 67 [2018-02-02 21:06:25,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:25,250 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 149 transitions. [2018-02-02 21:06:25,250 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 21:06:25,250 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 149 transitions. [2018-02-02 21:06:25,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 21:06:25,251 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:25,251 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, 1, 1, 1, 1] [2018-02-02 21:06:25,251 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_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-02 21:06:25,251 INFO L82 PathProgramCache]: Analyzing trace with hash 222221705, now seen corresponding path program 1 times [2018-02-02 21:06:25,252 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:25,252 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:25,252 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:25,252 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:25,252 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:25,265 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:25,318 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-02 21:06:25,318 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:06:25,318 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:06:25,319 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:25,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:25,342 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:06:25,364 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-02 21:06:25,364 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:06:25,364 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-02-02 21:06:25,365 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 21:06:25,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 21:06:25,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-02-02 21:06:25,365 INFO L87 Difference]: Start difference. First operand 139 states and 149 transitions. Second operand 10 states. [2018-02-02 21:06:25,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:25,387 INFO L93 Difference]: Finished difference Result 142 states and 152 transitions. [2018-02-02 21:06:25,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 21:06:25,387 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2018-02-02 21:06:25,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:25,388 INFO L225 Difference]: With dead ends: 142 [2018-02-02 21:06:25,388 INFO L226 Difference]: Without dead ends: 140 [2018-02-02 21:06:25,388 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 67 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-02 21:06:25,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-02-02 21:06:25,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-02-02 21:06:25,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-02 21:06:25,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 150 transitions. [2018-02-02 21:06:25,392 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 150 transitions. Word has length 67 [2018-02-02 21:06:25,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:25,392 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 150 transitions. [2018-02-02 21:06:25,392 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 21:06:25,392 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 150 transitions. [2018-02-02 21:06:25,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 21:06:25,393 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:25,393 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, 1, 1, 1, 1] [2018-02-02 21:06:25,393 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_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-02 21:06:25,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1652723263, now seen corresponding path program 2 times [2018-02-02 21:06:25,393 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:25,393 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:25,394 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:25,394 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:25,394 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:25,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:25,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:25,456 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-02 21:06:25,456 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:06:25,456 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:06:25,457 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:06:25,478 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-02 21:06:25,478 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:06:25,483 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:06:25,500 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-02 21:06:25,500 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:06:25,514 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-02 21:06:25,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 21:06:25,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 21:06:25,527 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-02 21:06:25,947 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-02 21:06:25,948 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 21:06:25,948 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [10] total 31 [2018-02-02 21:06:25,948 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 21:06:25,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 21:06:25,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=832, Unknown=0, NotChecked=0, Total=930 [2018-02-02 21:06:25,949 INFO L87 Difference]: Start difference. First operand 140 states and 150 transitions. Second operand 31 states. [2018-02-02 21:06:26,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:26,738 INFO L93 Difference]: Finished difference Result 141 states and 149 transitions. [2018-02-02 21:06:26,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 21:06:26,739 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 68 [2018-02-02 21:06:26,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:26,740 INFO L225 Difference]: With dead ends: 141 [2018-02-02 21:06:26,740 INFO L226 Difference]: Without dead ends: 139 [2018-02-02 21:06:26,740 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=223, Invalid=1939, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 21:06:26,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-02 21:06:26,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-02-02 21:06:26,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-02-02 21:06:26,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 147 transitions. [2018-02-02 21:06:26,744 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 147 transitions. Word has length 68 [2018-02-02 21:06:26,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:26,744 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 147 transitions. [2018-02-02 21:06:26,744 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 21:06:26,744 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 147 transitions. [2018-02-02 21:06:26,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-02 21:06:26,745 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:26,745 INFO L351 BasicCegarLoop]: trace histogram [7, 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] [2018-02-02 21:06:26,745 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_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-02 21:06:26,745 INFO L82 PathProgramCache]: Analyzing trace with hash 973434245, now seen corresponding path program 1 times [2018-02-02 21:06:26,745 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:26,746 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:26,746 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:26,746 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:06:26,746 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:26,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:26,758 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:26,838 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-02-02 21:06:26,838 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:06:26,838 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 21:06:26,838 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 21:06:26,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 21:06:26,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-02-02 21:06:26,840 INFO L87 Difference]: Start difference. First operand 139 states and 147 transitions. Second operand 13 states. [2018-02-02 21:06:26,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:26,925 INFO L93 Difference]: Finished difference Result 143 states and 149 transitions. [2018-02-02 21:06:26,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 21:06:26,925 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 76 [2018-02-02 21:06:26,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:26,926 INFO L225 Difference]: With dead ends: 143 [2018-02-02 21:06:26,926 INFO L226 Difference]: Without dead ends: 137 [2018-02-02 21:06:26,926 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 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-02 21:06:26,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-02-02 21:06:26,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-02-02 21:06:26,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-02 21:06:26,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 143 transitions. [2018-02-02 21:06:26,930 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 143 transitions. Word has length 76 [2018-02-02 21:06:26,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:26,930 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 143 transitions. [2018-02-02 21:06:26,930 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 21:06:26,930 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 143 transitions. [2018-02-02 21:06:26,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-02 21:06:26,931 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:26,931 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] [2018-02-02 21:06:26,931 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_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-02 21:06:26,931 INFO L82 PathProgramCache]: Analyzing trace with hash -323701284, now seen corresponding path program 1 times [2018-02-02 21:06:26,932 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:26,932 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:26,932 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:26,933 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:26,933 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:26,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:26,948 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:27,274 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-02 21:06:27,274 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:06:27,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2018-02-02 21:06:27,274 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 21:06:27,274 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 21:06:27,274 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2018-02-02 21:06:27,275 INFO L87 Difference]: Start difference. First operand 137 states and 143 transitions. Second operand 27 states. [2018-02-02 21:06:27,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:27,773 INFO L93 Difference]: Finished difference Result 147 states and 156 transitions. [2018-02-02 21:06:27,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 21:06:27,773 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 83 [2018-02-02 21:06:27,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:27,774 INFO L225 Difference]: With dead ends: 147 [2018-02-02 21:06:27,774 INFO L226 Difference]: Without dead ends: 147 [2018-02-02 21:06:27,774 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=1239, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 21:06:27,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-02-02 21:06:27,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2018-02-02 21:06:27,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-02 21:06:27,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 153 transitions. [2018-02-02 21:06:27,776 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 153 transitions. Word has length 83 [2018-02-02 21:06:27,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:27,777 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 153 transitions. [2018-02-02 21:06:27,777 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 21:06:27,777 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 153 transitions. [2018-02-02 21:06:27,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-02 21:06:27,777 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:27,777 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] [2018-02-02 21:06:27,777 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_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-02 21:06:27,777 INFO L82 PathProgramCache]: Analyzing trace with hash -323701283, now seen corresponding path program 1 times [2018-02-02 21:06:27,777 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:27,777 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:27,778 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:27,778 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:27,778 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:27,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:27,787 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:27,848 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-02 21:06:27,848 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:06:27,848 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:06:27,849 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:27,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:27,873 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:06:27,895 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-02 21:06:27,895 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:06:27,895 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-02-02 21:06:27,896 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 21:06:27,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 21:06:27,896 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-02-02 21:06:27,896 INFO L87 Difference]: Start difference. First operand 143 states and 153 transitions. Second operand 12 states. [2018-02-02 21:06:27,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:27,921 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2018-02-02 21:06:27,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 21:06:27,922 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 83 [2018-02-02 21:06:27,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:27,922 INFO L225 Difference]: With dead ends: 146 [2018-02-02 21:06:27,923 INFO L226 Difference]: Without dead ends: 144 [2018-02-02 21:06:27,923 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 83 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-02 21:06:27,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-02-02 21:06:27,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-02-02 21:06:27,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-02 21:06:27,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 154 transitions. [2018-02-02 21:06:27,927 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 154 transitions. Word has length 83 [2018-02-02 21:06:27,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:27,927 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 154 transitions. [2018-02-02 21:06:27,927 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 21:06:27,927 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 154 transitions. [2018-02-02 21:06:27,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-02 21:06:27,928 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:27,928 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] [2018-02-02 21:06:27,928 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_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-02 21:06:27,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1768153621, now seen corresponding path program 2 times [2018-02-02 21:06:27,929 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:27,929 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:27,929 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:27,930 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:27,930 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:27,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:27,945 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:28,035 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-02 21:06:28,035 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:06:28,035 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:06:28,036 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:06:28,063 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-02 21:06:28,063 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:06:28,069 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:06:28,082 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-02 21:06:28,083 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:06:28,095 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-02 21:06:28,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 21:06:28,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 21:06:28,107 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-02 21:06:28,609 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-02 21:06:28,610 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 21:06:28,610 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [12] total 37 [2018-02-02 21:06:28,610 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-02 21:06:28,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-02 21:06:28,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1203, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 21:06:28,611 INFO L87 Difference]: Start difference. First operand 144 states and 154 transitions. Second operand 37 states. [2018-02-02 21:06:29,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:29,786 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2018-02-02 21:06:29,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 21:06:29,791 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 84 [2018-02-02 21:06:29,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:29,792 INFO L225 Difference]: With dead ends: 145 [2018-02-02 21:06:29,792 INFO L226 Difference]: Without dead ends: 143 [2018-02-02 21:06:29,793 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=304, Invalid=2888, Unknown=0, NotChecked=0, Total=3192 [2018-02-02 21:06:29,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-02 21:06:29,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-02-02 21:06:29,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-02 21:06:29,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 152 transitions. [2018-02-02 21:06:29,796 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 152 transitions. Word has length 84 [2018-02-02 21:06:29,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:29,797 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 152 transitions. [2018-02-02 21:06:29,797 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-02 21:06:29,797 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 152 transitions. [2018-02-02 21:06:29,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-02 21:06:29,797 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:29,797 INFO L351 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 21:06:29,798 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_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-02 21:06:29,798 INFO L82 PathProgramCache]: Analyzing trace with hash -11138274, now seen corresponding path program 1 times [2018-02-02 21:06:29,798 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:29,798 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:29,799 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:29,799 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:06:29,799 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:29,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:29,904 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:06:29,905 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:06:29,905 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:06:29,906 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:29,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:29,932 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:06:29,946 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:06:29,947 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:06:29,947 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-02-02 21:06:29,947 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 21:06:29,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 21:06:29,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2018-02-02 21:06:29,948 INFO L87 Difference]: Start difference. First operand 143 states and 152 transitions. Second operand 14 states. [2018-02-02 21:06:29,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:29,982 INFO L93 Difference]: Finished difference Result 146 states and 155 transitions. [2018-02-02 21:06:29,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 21:06:29,982 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2018-02-02 21:06:29,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:29,983 INFO L225 Difference]: With dead ends: 146 [2018-02-02 21:06:29,983 INFO L226 Difference]: Without dead ends: 144 [2018-02-02 21:06:29,983 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2018-02-02 21:06:29,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-02-02 21:06:29,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-02-02 21:06:29,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-02 21:06:29,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 153 transitions. [2018-02-02 21:06:29,987 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 153 transitions. Word has length 89 [2018-02-02 21:06:29,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:29,987 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 153 transitions. [2018-02-02 21:06:29,987 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 21:06:29,987 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2018-02-02 21:06:29,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-02-02 21:06:29,988 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:29,988 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] [2018-02-02 21:06:29,988 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_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-02 21:06:29,989 INFO L82 PathProgramCache]: Analyzing trace with hash 558968150, now seen corresponding path program 2 times [2018-02-02 21:06:29,989 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:29,989 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:29,989 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:29,990 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:29,990 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:30,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:30,005 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:30,104 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-02 21:06:30,105 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:06:30,105 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:06:30,105 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:06:30,141 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:06:30,141 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:06:30,145 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:06:30,159 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-02 21:06:30,159 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:06:30,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-02-02 21:06:30,159 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 21:06:30,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 21:06:30,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-02-02 21:06:30,160 INFO L87 Difference]: Start difference. First operand 144 states and 153 transitions. Second operand 15 states. [2018-02-02 21:06:30,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:30,194 INFO L93 Difference]: Finished difference Result 147 states and 156 transitions. [2018-02-02 21:06:30,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 21:06:30,194 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 90 [2018-02-02 21:06:30,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:30,195 INFO L225 Difference]: With dead ends: 147 [2018-02-02 21:06:30,195 INFO L226 Difference]: Without dead ends: 145 [2018-02-02 21:06:30,195 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 90 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-02 21:06:30,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-02 21:06:30,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-02-02 21:06:30,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-02 21:06:30,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 154 transitions. [2018-02-02 21:06:30,199 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 154 transitions. Word has length 90 [2018-02-02 21:06:30,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:30,199 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 154 transitions. [2018-02-02 21:06:30,199 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 21:06:30,199 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 154 transitions. [2018-02-02 21:06:30,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-02-02 21:06:30,200 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:30,200 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] [2018-02-02 21:06:30,200 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_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-02 21:06:30,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1052398110, now seen corresponding path program 3 times [2018-02-02 21:06:30,200 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:30,200 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:30,201 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:30,201 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:06:30,201 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:30,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:30,218 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:30,327 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-02 21:06:30,327 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:06:30,327 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:06:30,328 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 21:06:30,353 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-02-02 21:06:30,353 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:06:30,356 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:06:30,376 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-02 21:06:30,376 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:06:30,376 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-02-02 21:06:30,376 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 21:06:30,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 21:06:30,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2018-02-02 21:06:30,377 INFO L87 Difference]: Start difference. First operand 145 states and 154 transitions. Second operand 16 states. [2018-02-02 21:06:30,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:30,411 INFO L93 Difference]: Finished difference Result 148 states and 157 transitions. [2018-02-02 21:06:30,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 21:06:30,412 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 91 [2018-02-02 21:06:30,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:30,412 INFO L225 Difference]: With dead ends: 148 [2018-02-02 21:06:30,413 INFO L226 Difference]: Without dead ends: 146 [2018-02-02 21:06:30,413 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=111, Invalid=161, Unknown=0, NotChecked=0, Total=272 [2018-02-02 21:06:30,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-02 21:06:30,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-02-02 21:06:30,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-02 21:06:30,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 155 transitions. [2018-02-02 21:06:30,416 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 155 transitions. Word has length 91 [2018-02-02 21:06:30,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:30,417 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 155 transitions. [2018-02-02 21:06:30,417 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 21:06:30,417 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 155 transitions. [2018-02-02 21:06:30,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-02 21:06:30,417 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:30,418 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] [2018-02-02 21:06:30,418 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_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-02 21:06:30,418 INFO L82 PathProgramCache]: Analyzing trace with hash -831142314, now seen corresponding path program 4 times [2018-02-02 21:06:30,418 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:30,418 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:30,419 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:30,419 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:06:30,419 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:30,434 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:30,539 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-02 21:06:30,539 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:06:30,539 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:06:30,540 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 21:06:30,560 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 21:06:30,560 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:06:30,563 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:06:30,572 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-02 21:06:30,573 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:06:30,573 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-02-02 21:06:30,573 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 21:06:30,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 21:06:30,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-02-02 21:06:30,573 INFO L87 Difference]: Start difference. First operand 146 states and 155 transitions. Second operand 17 states. [2018-02-02 21:06:30,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:30,597 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2018-02-02 21:06:30,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 21:06:30,598 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 92 [2018-02-02 21:06:30,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:30,598 INFO L225 Difference]: With dead ends: 149 [2018-02-02 21:06:30,598 INFO L226 Difference]: Without dead ends: 147 [2018-02-02 21:06:30,598 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 92 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-02 21:06:30,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-02-02 21:06:30,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-02-02 21:06:30,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-02 21:06:30,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 156 transitions. [2018-02-02 21:06:30,600 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 156 transitions. Word has length 92 [2018-02-02 21:06:30,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:30,600 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 156 transitions. [2018-02-02 21:06:30,601 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 21:06:30,601 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 156 transitions. [2018-02-02 21:06:30,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-02 21:06:30,601 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:30,601 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] [2018-02-02 21:06:30,601 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_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-02 21:06:30,601 INFO L82 PathProgramCache]: Analyzing trace with hash 908646686, now seen corresponding path program 5 times [2018-02-02 21:06:30,601 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:30,601 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:30,602 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:30,602 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:06:30,602 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:30,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:30,613 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:30,749 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-02 21:06:30,749 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:06:30,749 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:06:30,750 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 21:06:30,782 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-02-02 21:06:30,782 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:06:30,785 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:06:30,794 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-02 21:06:30,795 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:06:30,795 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-02-02 21:06:30,795 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 21:06:30,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 21:06:30,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-02-02 21:06:30,796 INFO L87 Difference]: Start difference. First operand 147 states and 156 transitions. Second operand 18 states. [2018-02-02 21:06:30,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:30,821 INFO L93 Difference]: Finished difference Result 150 states and 159 transitions. [2018-02-02 21:06:30,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 21:06:30,823 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 93 [2018-02-02 21:06:30,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:30,824 INFO L225 Difference]: With dead ends: 150 [2018-02-02 21:06:30,824 INFO L226 Difference]: Without dead ends: 148 [2018-02-02 21:06:30,824 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=200, Unknown=0, NotChecked=0, Total=342 [2018-02-02 21:06:30,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-02-02 21:06:30,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-02-02 21:06:30,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-02 21:06:30,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 157 transitions. [2018-02-02 21:06:30,828 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 157 transitions. Word has length 93 [2018-02-02 21:06:30,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:30,828 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 157 transitions. [2018-02-02 21:06:30,828 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 21:06:30,828 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 157 transitions. [2018-02-02 21:06:30,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 21:06:30,829 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:30,829 INFO L351 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 21:06:30,829 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_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-02 21:06:30,829 INFO L82 PathProgramCache]: Analyzing trace with hash -992469162, now seen corresponding path program 6 times [2018-02-02 21:06:30,829 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:30,829 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:30,830 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:30,830 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:06:30,830 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:30,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:30,849 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:30,996 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:06:30,996 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:06:30,996 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:06:30,997 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 21:06:31,042 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-02-02 21:06:31,043 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:06:31,048 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:06:31,061 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:06:31,062 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:06:31,062 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-02-02 21:06:31,062 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 21:06:31,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 21:06:31,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-02-02 21:06:31,063 INFO L87 Difference]: Start difference. First operand 148 states and 157 transitions. Second operand 19 states. [2018-02-02 21:06:31,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:31,101 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2018-02-02 21:06:31,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 21:06:31,101 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 94 [2018-02-02 21:06:31,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:31,102 INFO L225 Difference]: With dead ends: 151 [2018-02-02 21:06:31,102 INFO L226 Difference]: Without dead ends: 149 [2018-02-02 21:06:31,102 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=159, Invalid=221, Unknown=0, NotChecked=0, Total=380 [2018-02-02 21:06:31,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-02-02 21:06:31,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-02-02 21:06:31,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-02-02 21:06:31,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 158 transitions. [2018-02-02 21:06:31,106 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 158 transitions. Word has length 94 [2018-02-02 21:06:31,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:31,106 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 158 transitions. [2018-02-02 21:06:31,106 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 21:06:31,106 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 158 transitions. [2018-02-02 21:06:31,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-02-02 21:06:31,107 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:31,107 INFO L351 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 21:06:31,107 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_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-02 21:06:31,107 INFO L82 PathProgramCache]: Analyzing trace with hash 202481694, now seen corresponding path program 7 times [2018-02-02 21:06:31,107 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:31,107 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:31,108 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:31,108 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:06:31,108 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:31,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:31,124 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:31,273 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:06:31,273 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:06:31,273 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:06:31,274 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:31,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:31,299 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:06:31,314 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:06:31,314 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:06:31,314 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-02-02 21:06:31,315 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 21:06:31,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 21:06:31,315 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2018-02-02 21:06:31,315 INFO L87 Difference]: Start difference. First operand 149 states and 158 transitions. Second operand 20 states. [2018-02-02 21:06:31,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:31,357 INFO L93 Difference]: Finished difference Result 152 states and 161 transitions. [2018-02-02 21:06:31,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 21:06:31,357 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 95 [2018-02-02 21:06:31,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:31,358 INFO L225 Difference]: With dead ends: 152 [2018-02-02 21:06:31,358 INFO L226 Difference]: Without dead ends: 150 [2018-02-02 21:06:31,358 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=177, Invalid=243, Unknown=0, NotChecked=0, Total=420 [2018-02-02 21:06:31,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-02 21:06:31,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-02-02 21:06:31,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-02 21:06:31,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 159 transitions. [2018-02-02 21:06:31,361 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 159 transitions. Word has length 95 [2018-02-02 21:06:31,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:31,362 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 159 transitions. [2018-02-02 21:06:31,362 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 21:06:31,362 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 159 transitions. [2018-02-02 21:06:31,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-02-02 21:06:31,362 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:31,362 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 21:06:31,363 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_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-02 21:06:31,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1408747434, now seen corresponding path program 8 times [2018-02-02 21:06:31,363 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:31,363 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:31,364 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:31,364 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:31,364 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:31,413 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:31,428 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-02 21:06:31,432 INFO L168 Benchmark]: Toolchain (without parser) took 11649.23 ms. Allocated memory was 406.8 MB in the beginning and 825.8 MB in the end (delta: 418.9 MB). Free memory was 363.5 MB in the beginning and 579.2 MB in the end (delta: -215.7 MB). Peak memory consumption was 203.2 MB. Max. memory is 5.3 GB. [2018-02-02 21:06:31,433 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 406.8 MB. Free memory is still 370.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 21:06:31,433 INFO L168 Benchmark]: CACSL2BoogieTranslator took 179.90 ms. Allocated memory is still 406.8 MB. Free memory was 363.5 MB in the beginning and 349.0 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. [2018-02-02 21:06:31,433 INFO L168 Benchmark]: Boogie Preprocessor took 34.03 ms. Allocated memory is still 406.8 MB. Free memory was 349.0 MB in the beginning and 347.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 21:06:31,433 INFO L168 Benchmark]: RCFGBuilder took 302.67 ms. Allocated memory is still 406.8 MB. Free memory was 347.7 MB in the beginning and 314.5 MB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 5.3 GB. [2018-02-02 21:06:31,434 INFO L168 Benchmark]: TraceAbstraction took 11129.84 ms. Allocated memory was 406.8 MB in the beginning and 825.8 MB in the end (delta: 418.9 MB). Free memory was 313.2 MB in the beginning and 579.2 MB in the end (delta: -266.0 MB). Peak memory consumption was 152.9 MB. Max. memory is 5.3 GB. [2018-02-02 21:06:31,435 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 406.8 MB. Free memory is still 370.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 179.90 ms. Allocated memory is still 406.8 MB. Free memory was 363.5 MB in the beginning and 349.0 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.03 ms. Allocated memory is still 406.8 MB. Free memory was 349.0 MB in the beginning and 347.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 302.67 ms. Allocated memory is still 406.8 MB. Free memory was 347.7 MB in the beginning and 314.5 MB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 11129.84 ms. Allocated memory was 406.8 MB in the beginning and 825.8 MB in the end (delta: 418.9 MB). Free memory was 313.2 MB in the beginning and 579.2 MB in the end (delta: -266.0 MB). Peak memory consumption was 152.9 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_5_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_21-06-31-441.csv Received shutdown request...