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_1_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 04:17:24,762 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 04:17:24,763 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 04:17:24,775 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 04:17:24,776 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 04:17:24,776 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 04:17:24,777 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 04:17:24,778 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 04:17:24,780 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 04:17:24,780 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 04:17:24,781 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 04:17:24,781 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 04:17:24,782 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 04:17:24,783 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 04:17:24,784 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 04:17:24,785 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 04:17:24,787 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 04:17:24,788 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 04:17:24,789 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 04:17:24,790 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 04:17:24,791 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 04:17:24,792 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 04:17:24,792 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 04:17:24,793 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 04:17:24,793 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 04:17:24,794 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 04:17:24,794 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 04:17:24,795 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 04:17:24,795 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 04:17:24,795 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 04:17:24,795 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 04:17:24,796 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 04:17:24,804 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 04:17:24,804 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 04:17:24,805 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 04:17:24,806 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 04:17:24,806 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 04:17:24,806 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 04:17:24,806 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 04:17:24,806 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 04:17:24,806 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 04:17:24,808 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 04:17:24,808 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 04:17:24,808 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 04:17:24,808 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 04:17:24,809 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 04:17:24,809 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 04:17:24,809 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 04:17:24,809 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 04:17:24,809 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 04:17:24,809 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 04:17:24,809 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 04:17:24,809 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 04:17:24,809 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 04:17:24,809 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 04:17:24,810 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 04:17:24,810 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 04:17:24,836 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 04:17:24,843 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 04:17:24,846 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 04:17:24,847 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 04:17:24,847 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 04:17:24,848 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_1_true-valid-memsafety_true-termination.i [2018-02-04 04:17:24,970 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 04:17:24,971 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 04:17:24,971 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 04:17:24,971 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 04:17:24,975 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 04:17:24,976 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:17:24" (1/1) ... [2018-02-04 04:17:24,978 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b275d44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:24, skipping insertion in model container [2018-02-04 04:17:24,978 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:17:24" (1/1) ... [2018-02-04 04:17:24,987 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:17:25,019 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:17:25,112 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:17:25,131 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:17:25,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:25 WrapperNode [2018-02-04 04:17:25,140 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 04:17:25,141 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 04:17:25,141 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 04:17:25,141 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 04:17:25,150 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:25" (1/1) ... [2018-02-04 04:17:25,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:25" (1/1) ... [2018-02-04 04:17:25,159 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:25" (1/1) ... [2018-02-04 04:17:25,159 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:25" (1/1) ... [2018-02-04 04:17:25,165 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:25" (1/1) ... [2018-02-04 04:17:25,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:25" (1/1) ... [2018-02-04 04:17:25,170 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:25" (1/1) ... [2018-02-04 04:17:25,173 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 04:17:25,173 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 04:17:25,173 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 04:17:25,173 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 04:17:25,174 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:25" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 04:17:25,213 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 04:17:25,213 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 04:17:25,213 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-02-04 04:17:25,213 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 04:17:25,213 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-02-04 04:17:25,214 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-02-04 04:17:25,214 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-02-04 04:17:25,214 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-02-04 04:17:25,214 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-02-04 04:17:25,214 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-02-04 04:17:25,214 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-02-04 04:17:25,214 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-02-04 04:17:25,214 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-02-04 04:17:25,215 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-02-04 04:17:25,215 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-02-04 04:17:25,215 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 04:17:25,215 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 04:17:25,215 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 04:17:25,215 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 04:17:25,215 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 04:17:25,215 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 04:17:25,216 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 04:17:25,216 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 04:17:25,216 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 04:17:25,216 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-04 04:17:25,216 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-04 04:17:25,216 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 04:17:25,216 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 04:17:25,216 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 04:17:25,216 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-04 04:17:25,217 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 04:17:25,217 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-02-04 04:17:25,217 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-02-04 04:17:25,217 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-02-04 04:17:25,217 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-02-04 04:17:25,217 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-02-04 04:17:25,217 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-02-04 04:17:25,218 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-02-04 04:17:25,218 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-02-04 04:17:25,218 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-02-04 04:17:25,218 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-02-04 04:17:25,218 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-02-04 04:17:25,218 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-02-04 04:17:25,218 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 04:17:25,218 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 04:17:25,219 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 04:17:25,219 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 04:17:25,403 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-04 04:17:25,490 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 04:17:25,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:17:25 BoogieIcfgContainer [2018-02-04 04:17:25,491 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 04:17:25,491 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 04:17:25,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 04:17:25,493 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 04:17:25,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 04:17:24" (1/3) ... [2018-02-04 04:17:25,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4df5be11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:17:25, skipping insertion in model container [2018-02-04 04:17:25,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:25" (2/3) ... [2018-02-04 04:17:25,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4df5be11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:17:25, skipping insertion in model container [2018-02-04 04:17:25,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:17:25" (3/3) ... [2018-02-04 04:17:25,495 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test22_1_true-valid-memsafety_true-termination.i [2018-02-04 04:17:25,501 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 04:17:25,506 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-02-04 04:17:25,529 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 04:17:25,529 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 04:17:25,530 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 04:17:25,530 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 04:17:25,530 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 04:17:25,530 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 04:17:25,530 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 04:17:25,530 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 04:17:25,531 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 04:17:25,540 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states. [2018-02-04 04:17:25,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 04:17:25,547 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:25,548 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:17:25,548 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-04 04:17:25,551 INFO L82 PathProgramCache]: Analyzing trace with hash -401333144, now seen corresponding path program 1 times [2018-02-04 04:17:25,552 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:25,552 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:25,586 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:25,586 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:25,587 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:25,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:25,626 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:25,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:17:25,789 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:25,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 04:17:25,790 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:17:25,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:17:25,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:17:25,799 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 5 states. [2018-02-04 04:17:25,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:25,849 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2018-02-04 04:17:25,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:17:25,851 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 04:17:25,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:25,860 INFO L225 Difference]: With dead ends: 124 [2018-02-04 04:17:25,861 INFO L226 Difference]: Without dead ends: 121 [2018-02-04 04:17:25,862 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:17:25,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-04 04:17:25,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-02-04 04:17:25,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-04 04:17:25,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 126 transitions. [2018-02-04 04:17:25,896 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 126 transitions. Word has length 17 [2018-02-04 04:17:25,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:25,896 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 126 transitions. [2018-02-04 04:17:25,896 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:17:25,897 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2018-02-04 04:17:25,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 04:17:25,897 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:25,897 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:17:25,898 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-04 04:17:25,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1306365930, now seen corresponding path program 1 times [2018-02-04 04:17:25,898 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:25,898 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:25,900 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:25,900 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:25,900 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:25,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:25,918 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:25,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:17:25,959 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:25,959 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 04:17:25,960 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:17:25,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:17:25,960 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:17:25,961 INFO L87 Difference]: Start difference. First operand 119 states and 126 transitions. Second operand 6 states. [2018-02-04 04:17:26,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:26,076 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2018-02-04 04:17:26,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:17:26,076 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 04:17:26,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:26,077 INFO L225 Difference]: With dead ends: 120 [2018-02-04 04:17:26,078 INFO L226 Difference]: Without dead ends: 120 [2018-02-04 04:17:26,078 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:17:26,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-04 04:17:26,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-02-04 04:17:26,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-04 04:17:26,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2018-02-04 04:17:26,086 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 19 [2018-02-04 04:17:26,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:26,087 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2018-02-04 04:17:26,087 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:17:26,087 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2018-02-04 04:17:26,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 04:17:26,087 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:26,087 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:17:26,088 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-04 04:17:26,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1306365931, now seen corresponding path program 1 times [2018-02-04 04:17:26,088 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:26,088 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:26,089 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:26,089 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:26,089 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:26,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:26,104 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:26,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:17:26,230 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:26,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 04:17:26,230 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 04:17:26,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 04:17:26,231 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:17:26,231 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand 7 states. [2018-02-04 04:17:26,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:26,396 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2018-02-04 04:17:26,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 04:17:26,399 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-02-04 04:17:26,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:26,400 INFO L225 Difference]: With dead ends: 119 [2018-02-04 04:17:26,400 INFO L226 Difference]: Without dead ends: 119 [2018-02-04 04:17:26,400 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-04 04:17:26,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-04 04:17:26,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-02-04 04:17:26,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-04 04:17:26,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 124 transitions. [2018-02-04 04:17:26,407 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 124 transitions. Word has length 19 [2018-02-04 04:17:26,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:26,408 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 124 transitions. [2018-02-04 04:17:26,408 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 04:17:26,408 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2018-02-04 04:17:26,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 04:17:26,409 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:26,409 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] [2018-02-04 04:17:26,409 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-04 04:17:26,409 INFO L82 PathProgramCache]: Analyzing trace with hash -860603530, now seen corresponding path program 1 times [2018-02-04 04:17:26,409 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:26,409 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:26,410 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:26,410 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:26,411 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:26,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:26,427 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:26,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:17:26,476 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:26,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 04:17:26,476 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 04:17:26,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 04:17:26,476 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:17:26,476 INFO L87 Difference]: Start difference. First operand 117 states and 124 transitions. Second operand 7 states. [2018-02-04 04:17:26,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:26,510 INFO L93 Difference]: Finished difference Result 129 states and 136 transitions. [2018-02-04 04:17:26,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 04:17:26,510 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-02-04 04:17:26,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:26,511 INFO L225 Difference]: With dead ends: 129 [2018-02-04 04:17:26,511 INFO L226 Difference]: Without dead ends: 129 [2018-02-04 04:17:26,511 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 04:17:26,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-04 04:17:26,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2018-02-04 04:17:26,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-04 04:17:26,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2018-02-04 04:17:26,515 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 29 [2018-02-04 04:17:26,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:26,515 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2018-02-04 04:17:26,515 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 04:17:26,515 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2018-02-04 04:17:26,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 04:17:26,516 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:26,516 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:17:26,516 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-04 04:17:26,516 INFO L82 PathProgramCache]: Analyzing trace with hash 23284980, now seen corresponding path program 1 times [2018-02-04 04:17:26,516 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:26,516 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:26,517 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:26,517 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:26,517 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:26,522 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:26,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:17:26,554 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:26,554 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 04:17:26,555 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 04:17:26,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 04:17:26,555 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:17:26,555 INFO L87 Difference]: Start difference. First operand 125 states and 132 transitions. Second operand 3 states. [2018-02-04 04:17:26,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:26,628 INFO L93 Difference]: Finished difference Result 140 states and 147 transitions. [2018-02-04 04:17:26,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 04:17:26,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-02-04 04:17:26,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:26,629 INFO L225 Difference]: With dead ends: 140 [2018-02-04 04:17:26,629 INFO L226 Difference]: Without dead ends: 129 [2018-02-04 04:17:26,630 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:17:26,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-04 04:17:26,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 121. [2018-02-04 04:17:26,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-04 04:17:26,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 127 transitions. [2018-02-04 04:17:26,638 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 127 transitions. Word has length 27 [2018-02-04 04:17:26,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:26,639 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 127 transitions. [2018-02-04 04:17:26,639 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 04:17:26,639 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 127 transitions. [2018-02-04 04:17:26,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 04:17:26,639 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:26,639 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] [2018-02-04 04:17:26,639 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-04 04:17:26,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1295663626, now seen corresponding path program 1 times [2018-02-04 04:17:26,640 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:26,640 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:26,641 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:26,641 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:26,641 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:26,648 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:26,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:17:26,675 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:26,675 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 04:17:26,676 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:17:26,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:17:26,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:17:26,676 INFO L87 Difference]: Start difference. First operand 121 states and 127 transitions. Second operand 6 states. [2018-02-04 04:17:26,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:26,704 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2018-02-04 04:17:26,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:17:26,704 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-02-04 04:17:26,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:26,705 INFO L225 Difference]: With dead ends: 113 [2018-02-04 04:17:26,705 INFO L226 Difference]: Without dead ends: 113 [2018-02-04 04:17:26,705 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:17:26,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-04 04:17:26,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-02-04 04:17:26,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 04:17:26,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 118 transitions. [2018-02-04 04:17:26,710 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 118 transitions. Word has length 29 [2018-02-04 04:17:26,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:26,710 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 118 transitions. [2018-02-04 04:17:26,710 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:17:26,710 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2018-02-04 04:17:26,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 04:17:26,711 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:26,711 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:17:26,711 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-04 04:17:26,712 INFO L82 PathProgramCache]: Analyzing trace with hash 522747174, now seen corresponding path program 1 times [2018-02-04 04:17:26,712 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:26,712 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:26,713 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:26,713 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:26,713 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:26,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:26,724 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:26,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:17:26,763 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:26,763 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 04:17:26,763 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 04:17:26,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 04:17:26,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 04:17:26,764 INFO L87 Difference]: Start difference. First operand 113 states and 118 transitions. Second operand 4 states. [2018-02-04 04:17:26,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:26,779 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2018-02-04 04:17:26,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 04:17:26,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-02-04 04:17:26,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:26,780 INFO L225 Difference]: With dead ends: 116 [2018-02-04 04:17:26,780 INFO L226 Difference]: Without dead ends: 114 [2018-02-04 04:17:26,780 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:17:26,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-04 04:17:26,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-02-04 04:17:26,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-04 04:17:26,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2018-02-04 04:17:26,785 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 34 [2018-02-04 04:17:26,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:26,785 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2018-02-04 04:17:26,785 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 04:17:26,785 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2018-02-04 04:17:26,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 04:17:26,786 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:26,786 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:17:26,786 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-04 04:17:26,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1305776369, now seen corresponding path program 1 times [2018-02-04 04:17:26,786 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:26,786 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:26,787 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:26,787 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:26,788 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:26,798 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:26,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:17:26,823 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:17:26,823 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:17:26,824 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:26,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:26,856 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:17:26,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:17:26,882 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:17:26,882 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-02-04 04:17:26,882 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:17:26,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:17:26,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:17:26,883 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 6 states. [2018-02-04 04:17:26,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:26,900 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2018-02-04 04:17:26,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:17:26,900 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-02-04 04:17:26,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:26,901 INFO L225 Difference]: With dead ends: 117 [2018-02-04 04:17:26,901 INFO L226 Difference]: Without dead ends: 115 [2018-02-04 04:17:26,901 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:17:26,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-04 04:17:26,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-02-04 04:17:26,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-04 04:17:26,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 120 transitions. [2018-02-04 04:17:26,905 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 120 transitions. Word has length 35 [2018-02-04 04:17:26,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:26,905 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 120 transitions. [2018-02-04 04:17:26,905 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:17:26,905 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 120 transitions. [2018-02-04 04:17:26,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 04:17:26,906 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:26,906 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:17:26,906 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-04 04:17:26,907 INFO L82 PathProgramCache]: Analyzing trace with hash 2139535942, now seen corresponding path program 2 times [2018-02-04 04:17:26,907 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:26,907 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:26,908 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:26,908 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:26,908 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:26,920 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:26,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:17:26,950 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:17:26,950 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:17:26,951 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:17:26,973 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 04:17:26,973 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:17:26,977 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:17:27,005 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 14 treesize of output 13 [2018-02-04 04:17:27,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:17:27,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-02-04 04:17:27,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 04:17:27,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 04:17:27,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:30 [2018-02-04 04:17:27,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 04:17:27,295 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:17:27,295 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [6] total 20 [2018-02-04 04:17:27,296 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 04:17:27,296 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 04:17:27,296 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2018-02-04 04:17:27,296 INFO L87 Difference]: Start difference. First operand 115 states and 120 transitions. Second operand 20 states. [2018-02-04 04:17:27,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:27,846 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2018-02-04 04:17:27,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 04:17:27,847 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-02-04 04:17:27,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:27,847 INFO L225 Difference]: With dead ends: 117 [2018-02-04 04:17:27,847 INFO L226 Difference]: Without dead ends: 115 [2018-02-04 04:17:27,848 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=708, Unknown=0, NotChecked=0, Total=812 [2018-02-04 04:17:27,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-04 04:17:27,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-02-04 04:17:27,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-04 04:17:27,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 120 transitions. [2018-02-04 04:17:27,850 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 120 transitions. Word has length 36 [2018-02-04 04:17:27,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:27,851 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 120 transitions. [2018-02-04 04:17:27,851 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 04:17:27,851 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 120 transitions. [2018-02-04 04:17:27,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 04:17:27,852 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:27,852 INFO L351 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:17:27,855 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-04 04:17:27,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1570035182, now seen corresponding path program 1 times [2018-02-04 04:17:27,855 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:27,855 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:27,856 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:27,856 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:17:27,856 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:27,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:27,866 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:27,918 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 04:17:27,918 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:27,918 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 04:17:27,919 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 04:17:27,919 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 04:17:27,919 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 04:17:27,919 INFO L87 Difference]: Start difference. First operand 115 states and 120 transitions. Second operand 10 states. [2018-02-04 04:17:28,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:28,029 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2018-02-04 04:17:28,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 04:17:28,030 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2018-02-04 04:17:28,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:28,031 INFO L225 Difference]: With dead ends: 114 [2018-02-04 04:17:28,031 INFO L226 Difference]: Without dead ends: 114 [2018-02-04 04:17:28,031 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-04 04:17:28,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-04 04:17:28,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-02-04 04:17:28,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-04 04:17:28,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2018-02-04 04:17:28,033 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 37 [2018-02-04 04:17:28,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:28,033 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2018-02-04 04:17:28,033 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 04:17:28,033 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2018-02-04 04:17:28,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 04:17:28,034 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:28,035 INFO L351 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:17:28,035 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-04 04:17:28,035 INFO L82 PathProgramCache]: Analyzing trace with hash 258949559, now seen corresponding path program 1 times [2018-02-04 04:17:28,035 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:28,035 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:28,036 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:28,036 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:28,036 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:28,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:28,046 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:28,104 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 04:17:28,104 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:28,104 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 04:17:28,105 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 04:17:28,105 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 04:17:28,105 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 04:17:28,105 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 10 states. [2018-02-04 04:17:28,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:28,283 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2018-02-04 04:17:28,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 04:17:28,283 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-02-04 04:17:28,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:28,284 INFO L225 Difference]: With dead ends: 112 [2018-02-04 04:17:28,284 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 04:17:28,284 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-04 04:17:28,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 04:17:28,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-02-04 04:17:28,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-04 04:17:28,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2018-02-04 04:17:28,286 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 42 [2018-02-04 04:17:28,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:28,286 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2018-02-04 04:17:28,286 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 04:17:28,286 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2018-02-04 04:17:28,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 04:17:28,287 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:28,287 INFO L351 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:17:28,287 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-04 04:17:28,287 INFO L82 PathProgramCache]: Analyzing trace with hash 258949560, now seen corresponding path program 1 times [2018-02-04 04:17:28,287 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:28,288 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:28,289 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:28,289 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:28,289 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:28,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:28,298 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:28,350 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:17:28,350 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:17:28,350 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:17:28,351 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:28,371 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:17:28,385 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:17:28,385 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:17:28,386 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-02-04 04:17:28,386 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 04:17:28,386 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 04:17:28,386 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-02-04 04:17:28,386 INFO L87 Difference]: Start difference. First operand 112 states and 117 transitions. Second operand 8 states. [2018-02-04 04:17:28,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:28,406 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2018-02-04 04:17:28,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 04:17:28,407 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-02-04 04:17:28,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:28,408 INFO L225 Difference]: With dead ends: 115 [2018-02-04 04:17:28,408 INFO L226 Difference]: Without dead ends: 113 [2018-02-04 04:17:28,408 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-04 04:17:28,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-04 04:17:28,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-02-04 04:17:28,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 04:17:28,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 118 transitions. [2018-02-04 04:17:28,412 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 118 transitions. Word has length 42 [2018-02-04 04:17:28,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:28,412 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 118 transitions. [2018-02-04 04:17:28,413 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 04:17:28,413 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2018-02-04 04:17:28,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 04:17:28,413 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:28,413 INFO L351 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:17:28,413 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-04 04:17:28,414 INFO L82 PathProgramCache]: Analyzing trace with hash -549832031, now seen corresponding path program 2 times [2018-02-04 04:17:28,414 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:28,414 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:28,414 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:28,415 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:28,415 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:28,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:28,433 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:28,473 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:17:28,473 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:17:28,473 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:17:28,474 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:17:28,494 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 04:17:28,494 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:17:28,498 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:17:28,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-02-04 04:17:28,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:17:28,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-02-04 04:17:28,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 04:17:28,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 04:17:28,544 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 04:17:28,834 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 04:17:28,834 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:17:28,834 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 22 [2018-02-04 04:17:28,834 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 04:17:28,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 04:17:28,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2018-02-04 04:17:28,835 INFO L87 Difference]: Start difference. First operand 113 states and 118 transitions. Second operand 22 states. [2018-02-04 04:17:29,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:29,268 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2018-02-04 04:17:29,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 04:17:29,269 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 43 [2018-02-04 04:17:29,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:29,269 INFO L225 Difference]: With dead ends: 114 [2018-02-04 04:17:29,269 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 04:17:29,270 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-04 04:17:29,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 04:17:29,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-02-04 04:17:29,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-04 04:17:29,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2018-02-04 04:17:29,272 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 43 [2018-02-04 04:17:29,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:29,272 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2018-02-04 04:17:29,272 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 04:17:29,272 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2018-02-04 04:17:29,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 04:17:29,273 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:29,273 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] [2018-02-04 04:17:29,273 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-04 04:17:29,273 INFO L82 PathProgramCache]: Analyzing trace with hash -2038388811, now seen corresponding path program 1 times [2018-02-04 04:17:29,273 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:29,274 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:29,275 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:29,275 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:17:29,275 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:29,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:29,281 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:29,323 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-04 04:17:29,323 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:29,323 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 04:17:29,323 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 04:17:29,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 04:17:29,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 04:17:29,324 INFO L87 Difference]: Start difference. First operand 112 states and 117 transitions. Second operand 8 states. [2018-02-04 04:17:29,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:29,350 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2018-02-04 04:17:29,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 04:17:29,351 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-02-04 04:17:29,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:29,351 INFO L225 Difference]: With dead ends: 114 [2018-02-04 04:17:29,351 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 04:17:29,351 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-04 04:17:29,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 04:17:29,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-02-04 04:17:29,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-04 04:17:29,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 116 transitions. [2018-02-04 04:17:29,353 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 116 transitions. Word has length 49 [2018-02-04 04:17:29,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:29,354 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 116 transitions. [2018-02-04 04:17:29,354 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 04:17:29,354 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 116 transitions. [2018-02-04 04:17:29,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 04:17:29,354 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:29,354 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] [2018-02-04 04:17:29,354 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-04 04:17:29,355 INFO L82 PathProgramCache]: Analyzing trace with hash 2077653417, now seen corresponding path program 1 times [2018-02-04 04:17:29,355 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:29,355 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:29,355 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:29,355 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:29,355 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:29,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:29,364 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:29,431 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-04 04:17:29,431 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:29,431 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 04:17:29,432 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 04:17:29,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 04:17:29,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 04:17:29,432 INFO L87 Difference]: Start difference. First operand 112 states and 116 transitions. Second operand 10 states. [2018-02-04 04:17:29,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:29,486 INFO L93 Difference]: Finished difference Result 116 states and 119 transitions. [2018-02-04 04:17:29,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 04:17:29,486 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-02-04 04:17:29,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:29,487 INFO L225 Difference]: With dead ends: 116 [2018-02-04 04:17:29,487 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 04:17:29,487 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-04 04:17:29,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 04:17:29,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-02-04 04:17:29,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-04 04:17:29,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 115 transitions. [2018-02-04 04:17:29,490 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 115 transitions. Word has length 54 [2018-02-04 04:17:29,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:29,490 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 115 transitions. [2018-02-04 04:17:29,490 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 04:17:29,490 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 115 transitions. [2018-02-04 04:17:29,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-04 04:17:29,491 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:29,491 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] [2018-02-04 04:17:29,491 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-04 04:17:29,491 INFO L82 PathProgramCache]: Analyzing trace with hash -154764032, now seen corresponding path program 1 times [2018-02-04 04:17:29,491 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:29,491 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:29,492 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:29,492 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:29,492 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:29,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:29,500 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:29,670 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-04 04:17:29,670 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:29,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-02-04 04:17:29,671 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 04:17:29,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 04:17:29,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-02-04 04:17:29,671 INFO L87 Difference]: Start difference. First operand 112 states and 115 transitions. Second operand 21 states. [2018-02-04 04:17:29,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:29,932 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2018-02-04 04:17:29,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 04:17:29,932 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 65 [2018-02-04 04:17:29,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:29,933 INFO L225 Difference]: With dead ends: 119 [2018-02-04 04:17:29,933 INFO L226 Difference]: Without dead ends: 119 [2018-02-04 04:17:29,933 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2018-02-04 04:17:29,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-04 04:17:29,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 110. [2018-02-04 04:17:29,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-02-04 04:17:29,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 113 transitions. [2018-02-04 04:17:29,935 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 113 transitions. Word has length 65 [2018-02-04 04:17:29,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:29,935 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 113 transitions. [2018-02-04 04:17:29,935 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 04:17:29,935 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2018-02-04 04:17:29,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-04 04:17:29,936 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:29,936 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] [2018-02-04 04:17:29,936 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-04 04:17:29,936 INFO L82 PathProgramCache]: Analyzing trace with hash -154764031, now seen corresponding path program 1 times [2018-02-04 04:17:29,936 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:29,936 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:29,937 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:29,937 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:29,937 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:29,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:29,945 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:29,986 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:17:29,986 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:17:29,986 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:17:29,987 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:30,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:30,011 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:17:30,030 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:17:30,031 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:17:30,031 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-02-04 04:17:30,031 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 04:17:30,032 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 04:17:30,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-02-04 04:17:30,032 INFO L87 Difference]: Start difference. First operand 110 states and 113 transitions. Second operand 10 states. [2018-02-04 04:17:30,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:30,052 INFO L93 Difference]: Finished difference Result 113 states and 116 transitions. [2018-02-04 04:17:30,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 04:17:30,053 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2018-02-04 04:17:30,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:30,053 INFO L225 Difference]: With dead ends: 113 [2018-02-04 04:17:30,053 INFO L226 Difference]: Without dead ends: 111 [2018-02-04 04:17:30,054 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-02-04 04:17:30,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-04 04:17:30,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-02-04 04:17:30,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-04 04:17:30,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 114 transitions. [2018-02-04 04:17:30,056 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 114 transitions. Word has length 65 [2018-02-04 04:17:30,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:30,057 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 114 transitions. [2018-02-04 04:17:30,057 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 04:17:30,057 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 114 transitions. [2018-02-04 04:17:30,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-04 04:17:30,057 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:30,058 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] [2018-02-04 04:17:30,058 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-04 04:17:30,058 INFO L82 PathProgramCache]: Analyzing trace with hash -477131272, now seen corresponding path program 2 times [2018-02-04 04:17:30,058 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:30,058 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:30,059 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:30,059 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:30,059 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:30,072 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:30,130 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:17:30,130 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:17:30,130 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:17:30,131 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:17:30,171 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 04:17:30,171 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:17:30,176 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:17:30,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-02-04 04:17:30,192 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:17:30,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-02-04 04:17:30,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 04:17:30,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 04:17:30,215 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 04:17:30,532 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-02-04 04:17:30,533 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:17:30,533 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [10] total 29 [2018-02-04 04:17:30,533 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 04:17:30,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 04:17:30,533 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=720, Unknown=0, NotChecked=0, Total=812 [2018-02-04 04:17:30,533 INFO L87 Difference]: Start difference. First operand 111 states and 114 transitions. Second operand 29 states. [2018-02-04 04:17:31,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:31,154 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2018-02-04 04:17:31,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 04:17:31,216 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 66 [2018-02-04 04:17:31,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:31,217 INFO L225 Difference]: With dead ends: 112 [2018-02-04 04:17:31,217 INFO L226 Difference]: Without dead ends: 110 [2018-02-04 04:17:31,217 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=212, Invalid=1680, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 04:17:31,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-02-04 04:17:31,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-02-04 04:17:31,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-02-04 04:17:31,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 113 transitions. [2018-02-04 04:17:31,219 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 113 transitions. Word has length 66 [2018-02-04 04:17:31,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:31,219 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 113 transitions. [2018-02-04 04:17:31,219 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 04:17:31,219 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2018-02-04 04:17:31,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-04 04:17:31,220 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:31,220 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] [2018-02-04 04:17:31,220 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-04 04:17:31,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1613283294, now seen corresponding path program 1 times [2018-02-04 04:17:31,220 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:31,221 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:31,221 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:31,221 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:17:31,222 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:31,229 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:31,284 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-02-04 04:17:31,284 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:31,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 04:17:31,285 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 04:17:31,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 04:17:31,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-04 04:17:31,285 INFO L87 Difference]: Start difference. First operand 110 states and 113 transitions. Second operand 11 states. [2018-02-04 04:17:31,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:31,342 INFO L93 Difference]: Finished difference Result 112 states and 114 transitions. [2018-02-04 04:17:31,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 04:17:31,342 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2018-02-04 04:17:31,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:31,343 INFO L225 Difference]: With dead ends: 112 [2018-02-04 04:17:31,343 INFO L226 Difference]: Without dead ends: 110 [2018-02-04 04:17:31,343 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-02-04 04:17:31,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-02-04 04:17:31,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-02-04 04:17:31,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-02-04 04:17:31,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2018-02-04 04:17:31,346 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 65 [2018-02-04 04:17:31,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:31,346 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2018-02-04 04:17:31,346 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 04:17:31,346 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2018-02-04 04:17:31,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-04 04:17:31,347 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:31,347 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] [2018-02-04 04:17:31,347 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-04 04:17:31,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1474253813, now seen corresponding path program 1 times [2018-02-04 04:17:31,348 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:31,348 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:31,349 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:31,349 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:31,349 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:31,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:31,363 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:31,625 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-02-04 04:17:31,625 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:31,626 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-02-04 04:17:31,626 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 04:17:31,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 04:17:31,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-02-04 04:17:31,627 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 24 states. [2018-02-04 04:17:32,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:32,025 INFO L93 Difference]: Finished difference Result 113 states and 115 transitions. [2018-02-04 04:17:32,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 04:17:32,025 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 81 [2018-02-04 04:17:32,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:32,026 INFO L225 Difference]: With dead ends: 113 [2018-02-04 04:17:32,026 INFO L226 Difference]: Without dead ends: 113 [2018-02-04 04:17:32,027 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 04:17:32,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-04 04:17:32,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2018-02-04 04:17:32,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 04:17:32,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2018-02-04 04:17:32,029 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 81 [2018-02-04 04:17:32,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:32,030 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2018-02-04 04:17:32,030 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 04:17:32,030 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2018-02-04 04:17:32,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-04 04:17:32,030 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:32,031 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] [2018-02-04 04:17:32,031 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-04 04:17:32,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1474253812, now seen corresponding path program 1 times [2018-02-04 04:17:32,031 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:32,031 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:32,032 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:32,032 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:32,032 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:32,046 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:32,125 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:17:32,125 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:17:32,125 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:17:32,126 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:32,148 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:17:32,160 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:17:32,160 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:17:32,161 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-02-04 04:17:32,161 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 04:17:32,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 04:17:32,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-02-04 04:17:32,161 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 12 states. [2018-02-04 04:17:32,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:32,183 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2018-02-04 04:17:32,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 04:17:32,183 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 81 [2018-02-04 04:17:32,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:32,183 INFO L225 Difference]: With dead ends: 111 [2018-02-04 04:17:32,184 INFO L226 Difference]: Without dead ends: 109 [2018-02-04 04:17:32,184 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2018-02-04 04:17:32,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-04 04:17:32,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-02-04 04:17:32,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-04 04:17:32,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 111 transitions. [2018-02-04 04:17:32,186 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 111 transitions. Word has length 81 [2018-02-04 04:17:32,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:32,186 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 111 transitions. [2018-02-04 04:17:32,186 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 04:17:32,186 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 111 transitions. [2018-02-04 04:17:32,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-04 04:17:32,187 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:32,187 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] [2018-02-04 04:17:32,187 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-04 04:17:32,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1420750595, now seen corresponding path program 2 times [2018-02-04 04:17:32,188 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:32,188 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:32,188 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:32,188 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:32,189 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:32,203 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:32,273 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:17:32,273 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:17:32,273 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:17:32,274 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:17:32,301 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 04:17:32,301 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:17:32,306 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:17:32,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-02-04 04:17:32,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:17:32,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-02-04 04:17:32,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 04:17:32,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 04:17:32,345 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 04:17:32,808 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-04 04:17:32,808 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:17:32,808 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [12] total 35 [2018-02-04 04:17:32,809 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 04:17:32,809 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 04:17:32,809 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1067, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 04:17:32,810 INFO L87 Difference]: Start difference. First operand 109 states and 111 transitions. Second operand 35 states. [2018-02-04 04:17:33,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:33,589 INFO L93 Difference]: Finished difference Result 110 states and 112 transitions. [2018-02-04 04:17:33,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 04:17:33,589 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 82 [2018-02-04 04:17:33,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:33,590 INFO L225 Difference]: With dead ends: 110 [2018-02-04 04:17:33,590 INFO L226 Difference]: Without dead ends: 108 [2018-02-04 04:17:33,591 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=293, Invalid=2569, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 04:17:33,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-02-04 04:17:33,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-02-04 04:17:33,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 04:17:33,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2018-02-04 04:17:33,593 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 82 [2018-02-04 04:17:33,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:33,593 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2018-02-04 04:17:33,593 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 04:17:33,593 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2018-02-04 04:17:33,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-04 04:17:33,594 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:33,594 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] [2018-02-04 04:17:33,594 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-04 04:17:33,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1218395795, now seen corresponding path program 1 times [2018-02-04 04:17:33,594 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:33,594 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:33,595 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:33,595 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:17:33,595 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:33,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:33,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:33,696 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:17:33,696 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:17:33,696 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:17:33,697 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:33,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:33,713 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:17:33,722 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:17:33,723 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:17:33,723 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-02-04 04:17:33,723 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 04:17:33,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 04:17:33,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2018-02-04 04:17:33,724 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 14 states. [2018-02-04 04:17:33,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:33,767 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2018-02-04 04:17:33,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 04:17:33,768 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 87 [2018-02-04 04:17:33,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:33,769 INFO L225 Difference]: With dead ends: 111 [2018-02-04 04:17:33,769 INFO L226 Difference]: Without dead ends: 109 [2018-02-04 04:17:33,769 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 87 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-04 04:17:33,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-04 04:17:33,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-02-04 04:17:33,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-04 04:17:33,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 111 transitions. [2018-02-04 04:17:33,771 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 111 transitions. Word has length 87 [2018-02-04 04:17:33,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:33,772 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 111 transitions. [2018-02-04 04:17:33,772 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 04:17:33,772 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 111 transitions. [2018-02-04 04:17:33,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-04 04:17:33,772 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:33,772 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] [2018-02-04 04:17:33,773 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-04 04:17:33,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1495748828, now seen corresponding path program 2 times [2018-02-04 04:17:33,773 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:33,773 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:33,774 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:33,774 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:33,774 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:33,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:33,788 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:33,862 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:17:33,863 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:17:33,863 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:17:33,863 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:17:33,902 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:17:33,902 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:17:33,907 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:17:33,920 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:17:33,921 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:17:33,921 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-02-04 04:17:33,921 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 04:17:33,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 04:17:33,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-02-04 04:17:33,922 INFO L87 Difference]: Start difference. First operand 109 states and 111 transitions. Second operand 15 states. [2018-02-04 04:17:33,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:33,953 INFO L93 Difference]: Finished difference Result 112 states and 114 transitions. [2018-02-04 04:17:33,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 04:17:33,953 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 88 [2018-02-04 04:17:33,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:33,976 INFO L225 Difference]: With dead ends: 112 [2018-02-04 04:17:33,976 INFO L226 Difference]: Without dead ends: 110 [2018-02-04 04:17:33,977 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=97, Invalid=143, Unknown=0, NotChecked=0, Total=240 [2018-02-04 04:17:33,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-02-04 04:17:33,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-02-04 04:17:33,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-02-04 04:17:33,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2018-02-04 04:17:33,979 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 88 [2018-02-04 04:17:33,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:33,979 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2018-02-04 04:17:33,979 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 04:17:33,980 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2018-02-04 04:17:33,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-04 04:17:33,980 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:33,980 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] [2018-02-04 04:17:33,980 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-04 04:17:33,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1503758259, now seen corresponding path program 3 times [2018-02-04 04:17:33,981 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:33,981 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:33,982 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:33,982 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:17:33,982 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:33,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:33,996 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:34,113 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:17:34,113 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:17:34,113 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:17:34,114 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:17:34,154 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-02-04 04:17:34,155 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:17:34,160 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:17:34,174 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:17:34,174 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:17:34,174 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-02-04 04:17:34,175 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 04:17:34,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 04:17:34,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2018-02-04 04:17:34,175 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 16 states. [2018-02-04 04:17:34,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:34,200 INFO L93 Difference]: Finished difference Result 113 states and 115 transitions. [2018-02-04 04:17:34,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 04:17:34,200 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 89 [2018-02-04 04:17:34,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:34,200 INFO L225 Difference]: With dead ends: 113 [2018-02-04 04:17:34,200 INFO L226 Difference]: Without dead ends: 111 [2018-02-04 04:17:34,200 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 89 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-04 04:17:34,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-04 04:17:34,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-02-04 04:17:34,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-04 04:17:34,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 113 transitions. [2018-02-04 04:17:34,202 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 113 transitions. Word has length 89 [2018-02-04 04:17:34,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:34,202 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 113 transitions. [2018-02-04 04:17:34,202 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 04:17:34,202 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 113 transitions. [2018-02-04 04:17:34,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-02-04 04:17:34,202 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:34,203 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] [2018-02-04 04:17:34,203 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-04 04:17:34,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1752050620, now seen corresponding path program 4 times [2018-02-04 04:17:34,203 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:34,203 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:34,203 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:34,203 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:17:34,203 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:34,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:34,212 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:34,304 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:17:34,305 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:17:34,305 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:17:34,306 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:17:34,344 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:17:34,344 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:17:34,349 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:17:34,362 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:17:34,363 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:17:34,363 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-02-04 04:17:34,363 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 04:17:34,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 04:17:34,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-02-04 04:17:34,364 INFO L87 Difference]: Start difference. First operand 111 states and 113 transitions. Second operand 17 states. [2018-02-04 04:17:34,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:34,402 INFO L93 Difference]: Finished difference Result 114 states and 116 transitions. [2018-02-04 04:17:34,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 04:17:34,402 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 90 [2018-02-04 04:17:34,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:34,403 INFO L225 Difference]: With dead ends: 114 [2018-02-04 04:17:34,403 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 04:17:34,403 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=126, Invalid=180, Unknown=0, NotChecked=0, Total=306 [2018-02-04 04:17:34,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 04:17:34,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-02-04 04:17:34,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-04 04:17:34,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2018-02-04 04:17:34,405 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 90 [2018-02-04 04:17:34,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:34,406 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2018-02-04 04:17:34,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 04:17:34,406 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2018-02-04 04:17:34,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-02-04 04:17:34,406 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:34,406 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] [2018-02-04 04:17:34,407 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-04 04:17:34,407 INFO L82 PathProgramCache]: Analyzing trace with hash -859179219, now seen corresponding path program 5 times [2018-02-04 04:17:34,407 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:34,407 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:34,408 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:34,408 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:17:34,408 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:34,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:34,424 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:34,545 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:17:34,545 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:17:34,545 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:17:34,546 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:17:34,575 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-02-04 04:17:34,575 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:17:34,579 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:17:34,593 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:17:34,593 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:17:34,594 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-02-04 04:17:34,594 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 04:17:34,594 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 04:17:34,594 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-02-04 04:17:34,594 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 18 states. [2018-02-04 04:17:34,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:34,629 INFO L93 Difference]: Finished difference Result 115 states and 117 transitions. [2018-02-04 04:17:34,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 04:17:34,630 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 91 [2018-02-04 04:17:34,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:34,631 INFO L225 Difference]: With dead ends: 115 [2018-02-04 04:17:34,631 INFO L226 Difference]: Without dead ends: 113 [2018-02-04 04:17:34,631 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=142, Invalid=200, Unknown=0, NotChecked=0, Total=342 [2018-02-04 04:17:34,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-04 04:17:34,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-02-04 04:17:34,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 04:17:34,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 115 transitions. [2018-02-04 04:17:34,634 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 115 transitions. Word has length 91 [2018-02-04 04:17:34,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:34,634 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 115 transitions. [2018-02-04 04:17:34,634 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 04:17:34,634 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 115 transitions. [2018-02-04 04:17:34,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-04 04:17:34,635 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:34,635 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] [2018-02-04 04:17:34,635 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-04 04:17:34,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1050030436, now seen corresponding path program 6 times [2018-02-04 04:17:34,635 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:34,635 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:34,636 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:34,636 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:17:34,636 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:34,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:34,651 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:34,799 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:17:34,800 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:17:34,800 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:17:34,800 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:17:34,839 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-02-04 04:17:34,840 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:17:34,844 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:17:34,858 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:17:34,858 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:17:34,858 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-02-04 04:17:34,859 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 04:17:34,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 04:17:34,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-02-04 04:17:34,859 INFO L87 Difference]: Start difference. First operand 113 states and 115 transitions. Second operand 19 states. [2018-02-04 04:17:34,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:34,899 INFO L93 Difference]: Finished difference Result 116 states and 118 transitions. [2018-02-04 04:17:34,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 04:17:34,900 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2018-02-04 04:17:34,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:34,900 INFO L225 Difference]: With dead ends: 116 [2018-02-04 04:17:34,900 INFO L226 Difference]: Without dead ends: 114 [2018-02-04 04:17:34,900 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=159, Invalid=221, Unknown=0, NotChecked=0, Total=380 [2018-02-04 04:17:34,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-04 04:17:34,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-02-04 04:17:34,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-04 04:17:34,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 116 transitions. [2018-02-04 04:17:34,902 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 116 transitions. Word has length 92 [2018-02-04 04:17:34,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:34,902 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 116 transitions. [2018-02-04 04:17:34,902 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 04:17:34,902 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 116 transitions. [2018-02-04 04:17:34,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-04 04:17:34,903 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:34,903 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] [2018-02-04 04:17:34,903 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-04 04:17:34,903 INFO L82 PathProgramCache]: Analyzing trace with hash 105987597, now seen corresponding path program 7 times [2018-02-04 04:17:34,903 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:34,903 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:34,903 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:34,904 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:17:34,904 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:34,914 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:35,049 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:17:35,049 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:17:35,049 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:17:35,050 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:35,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:35,073 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:17:35,087 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:17:35,087 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:17:35,087 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-02-04 04:17:35,087 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 04:17:35,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 04:17:35,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2018-02-04 04:17:35,088 INFO L87 Difference]: Start difference. First operand 114 states and 116 transitions. Second operand 20 states. [2018-02-04 04:17:35,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:35,122 INFO L93 Difference]: Finished difference Result 117 states and 119 transitions. [2018-02-04 04:17:35,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 04:17:35,122 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 93 [2018-02-04 04:17:35,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:35,123 INFO L225 Difference]: With dead ends: 117 [2018-02-04 04:17:35,123 INFO L226 Difference]: Without dead ends: 115 [2018-02-04 04:17:35,124 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 93 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-04 04:17:35,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-04 04:17:35,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-02-04 04:17:35,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-04 04:17:35,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2018-02-04 04:17:35,126 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 93 [2018-02-04 04:17:35,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:35,126 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2018-02-04 04:17:35,126 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 04:17:35,128 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2018-02-04 04:17:35,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-04 04:17:35,128 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:35,129 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] [2018-02-04 04:17:35,129 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-04 04:17:35,129 INFO L82 PathProgramCache]: Analyzing trace with hash 905430660, now seen corresponding path program 8 times [2018-02-04 04:17:35,129 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:35,129 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:35,130 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:35,130 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:35,130 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:35,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:35,176 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:35,191 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: Unknown lemma type! at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-04 04:17:35,194 INFO L168 Benchmark]: Toolchain (without parser) took 10224.18 ms. Allocated memory was 404.2 MB in the beginning and 850.9 MB in the end (delta: 446.7 MB). Free memory was 360.9 MB in the beginning and 580.9 MB in the end (delta: -220.0 MB). Peak memory consumption was 226.7 MB. Max. memory is 5.3 GB. [2018-02-04 04:17:35,195 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 404.2 MB. Free memory is still 367.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 04:17:35,196 INFO L168 Benchmark]: CACSL2BoogieTranslator took 169.48 ms. Allocated memory is still 404.2 MB. Free memory was 360.9 MB in the beginning and 346.4 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. [2018-02-04 04:17:35,196 INFO L168 Benchmark]: Boogie Preprocessor took 31.87 ms. Allocated memory is still 404.2 MB. Free memory was 346.4 MB in the beginning and 345.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 04:17:35,196 INFO L168 Benchmark]: RCFGBuilder took 317.74 ms. Allocated memory is still 404.2 MB. Free memory was 345.0 MB in the beginning and 311.9 MB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 5.3 GB. [2018-02-04 04:17:35,196 INFO L168 Benchmark]: TraceAbstraction took 9702.59 ms. Allocated memory was 404.2 MB in the beginning and 850.9 MB in the end (delta: 446.7 MB). Free memory was 311.9 MB in the beginning and 580.9 MB in the end (delta: -269.0 MB). Peak memory consumption was 177.7 MB. Max. memory is 5.3 GB. [2018-02-04 04:17:35,198 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.10 ms. Allocated memory is still 404.2 MB. Free memory is still 367.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 169.48 ms. Allocated memory is still 404.2 MB. Free memory was 360.9 MB in the beginning and 346.4 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.87 ms. Allocated memory is still 404.2 MB. Free memory was 346.4 MB in the beginning and 345.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 317.74 ms. Allocated memory is still 404.2 MB. Free memory was 345.0 MB in the beginning and 311.9 MB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 9702.59 ms. Allocated memory was 404.2 MB in the beginning and 850.9 MB in the end (delta: 446.7 MB). Free memory was 311.9 MB in the beginning and 580.9 MB in the end (delta: -269.0 MB). Peak memory consumption was 177.7 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_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_04-17-35-203.csv Received shutdown request...