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-a74eeac-m [2018-02-02 21:09:05,963 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 21:09:05,965 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 21:09:05,977 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 21:09:05,977 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 21:09:05,977 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 21:09:05,978 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 21:09:05,980 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 21:09:05,981 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 21:09:05,982 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 21:09:05,982 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 21:09:05,982 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 21:09:05,983 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 21:09:05,984 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 21:09:05,985 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 21:09:05,986 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 21:09:05,988 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 21:09:05,989 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 21:09:05,990 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 21:09:05,991 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 21:09:05,993 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 21:09:05,993 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 21:09:05,993 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 21:09:05,994 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 21:09:05,994 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 21:09:05,995 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 21:09:05,995 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 21:09:05,996 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 21:09:05,996 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 21:09:05,996 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 21:09:05,996 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 21:09:05,997 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-02 21:09:06,005 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 21:09:06,005 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 21:09:06,006 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 21:09:06,007 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 21:09:06,007 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 21:09:06,007 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 21:09:06,007 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 21:09:06,007 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 21:09:06,007 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 21:09:06,007 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 21:09:06,007 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 21:09:06,007 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 21:09:06,008 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 21:09:06,008 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 21:09:06,008 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 21:09:06,008 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 21:09:06,008 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 21:09:06,008 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 21:09:06,008 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 21:09:06,008 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 21:09:06,008 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 21:09:06,009 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 21:09:06,009 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 21:09:06,009 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 21:09:06,009 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-02 21:09:06,036 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 21:09:06,043 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 21:09:06,045 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 21:09:06,046 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 21:09:06,047 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 21:09:06,047 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-02 21:09:06,178 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 21:09:06,179 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 21:09:06,179 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 21:09:06,179 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 21:09:06,184 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 21:09:06,185 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:09:06" (1/1) ... [2018-02-02 21:09:06,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4398c585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:09:06, skipping insertion in model container [2018-02-02 21:09:06,187 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:09:06" (1/1) ... [2018-02-02 21:09:06,196 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 21:09:06,229 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 21:09:06,315 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 21:09:06,332 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 21:09:06,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:09:06 WrapperNode [2018-02-02 21:09:06,339 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 21:09:06,340 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 21:09:06,340 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 21:09:06,340 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 21:09:06,349 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:09:06" (1/1) ... [2018-02-02 21:09:06,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:09:06" (1/1) ... [2018-02-02 21:09:06,358 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:09:06" (1/1) ... [2018-02-02 21:09:06,358 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:09:06" (1/1) ... [2018-02-02 21:09:06,363 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:09:06" (1/1) ... [2018-02-02 21:09:06,366 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:09:06" (1/1) ... [2018-02-02 21:09:06,367 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:09:06" (1/1) ... [2018-02-02 21:09:06,369 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 21:09:06,370 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 21:09:06,370 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 21:09:06,370 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 21:09:06,370 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:09:06" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 21:09:06,402 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 21:09:06,402 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 21:09:06,402 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-02-02 21:09:06,402 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 21:09:06,403 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-02-02 21:09:06,403 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-02-02 21:09:06,403 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-02-02 21:09:06,403 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-02-02 21:09:06,403 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-02-02 21:09:06,403 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-02-02 21:09:06,403 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-02-02 21:09:06,403 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-02-02 21:09:06,403 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-02-02 21:09:06,403 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-02-02 21:09:06,403 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-02-02 21:09:06,404 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 21:09:06,404 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 21:09:06,404 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 21:09:06,404 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 21:09:06,404 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 21:09:06,404 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 21:09:06,404 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 21:09:06,404 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 21:09:06,404 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 21:09:06,404 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-02 21:09:06,404 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-02 21:09:06,404 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 21:09:06,404 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 21:09:06,404 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 21:09:06,404 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-02 21:09:06,405 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 21:09:06,405 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-02-02 21:09:06,405 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-02-02 21:09:06,405 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-02-02 21:09:06,405 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-02-02 21:09:06,405 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-02-02 21:09:06,405 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-02-02 21:09:06,405 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-02-02 21:09:06,406 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-02-02 21:09:06,406 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-02-02 21:09:06,406 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-02-02 21:09:06,406 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-02-02 21:09:06,406 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-02-02 21:09:06,406 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 21:09:06,406 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 21:09:06,406 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 21:09:06,407 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 21:09:06,591 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-02 21:09:06,704 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 21:09:06,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:09:06 BoogieIcfgContainer [2018-02-02 21:09:06,705 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 21:09:06,705 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 21:09:06,705 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 21:09:06,707 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 21:09:06,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:09:06" (1/3) ... [2018-02-02 21:09:06,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e4d363c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:09:06, skipping insertion in model container [2018-02-02 21:09:06,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:09:06" (2/3) ... [2018-02-02 21:09:06,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e4d363c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:09:06, skipping insertion in model container [2018-02-02 21:09:06,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:09:06" (3/3) ... [2018-02-02 21:09:06,709 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test22_1_true-valid-memsafety_true-termination.i [2018-02-02 21:09:06,714 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 21:09:06,720 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-02-02 21:09:06,746 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 21:09:06,746 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 21:09:06,746 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 21:09:06,746 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 21:09:06,746 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 21:09:06,747 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 21:09:06,747 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 21:09:06,747 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 21:09:06,747 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 21:09:06,757 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states. [2018-02-02 21:09:06,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 21:09:06,763 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:09:06,763 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:09:06,763 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 21:09:06,766 INFO L82 PathProgramCache]: Analyzing trace with hash -401333144, now seen corresponding path program 1 times [2018-02-02 21:09:06,767 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:09:06,767 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:09:06,800 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:06,801 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:09:06,801 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:06,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:09:06,842 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:09:06,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:09:06,981 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:09:06,982 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 21:09:06,983 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 21:09:06,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 21:09:06,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 21:09:06,992 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 5 states. [2018-02-02 21:09:07,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:09:07,044 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2018-02-02 21:09:07,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 21:09:07,045 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 21:09:07,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:09:07,055 INFO L225 Difference]: With dead ends: 124 [2018-02-02 21:09:07,056 INFO L226 Difference]: Without dead ends: 121 [2018-02-02 21:09:07,057 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 21:09:07,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-02 21:09:07,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-02-02 21:09:07,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-02 21:09:07,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 126 transitions. [2018-02-02 21:09:07,087 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 126 transitions. Word has length 17 [2018-02-02 21:09:07,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:09:07,087 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 126 transitions. [2018-02-02 21:09:07,088 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 21:09:07,088 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2018-02-02 21:09:07,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 21:09:07,088 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:09:07,088 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:09:07,088 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 21:09:07,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1306365930, now seen corresponding path program 1 times [2018-02-02 21:09:07,089 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:09:07,089 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:09:07,090 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:07,090 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:09:07,091 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:07,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:09:07,107 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:09:07,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:09:07,149 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:09:07,149 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 21:09:07,150 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 21:09:07,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 21:09:07,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 21:09:07,150 INFO L87 Difference]: Start difference. First operand 119 states and 126 transitions. Second operand 6 states. [2018-02-02 21:09:07,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:09:07,255 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2018-02-02 21:09:07,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 21:09:07,256 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 21:09:07,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:09:07,257 INFO L225 Difference]: With dead ends: 120 [2018-02-02 21:09:07,257 INFO L226 Difference]: Without dead ends: 120 [2018-02-02 21:09:07,258 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 21:09:07,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-02 21:09:07,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-02-02 21:09:07,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-02 21:09:07,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2018-02-02 21:09:07,266 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 19 [2018-02-02 21:09:07,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:09:07,267 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2018-02-02 21:09:07,267 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 21:09:07,267 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2018-02-02 21:09:07,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 21:09:07,267 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:09:07,267 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:09:07,267 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 21:09:07,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1306365931, now seen corresponding path program 1 times [2018-02-02 21:09:07,268 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:09:07,268 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:09:07,269 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:07,269 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:09:07,269 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:07,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:09:07,285 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:09:07,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:09:07,422 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:09:07,422 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 21:09:07,422 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 21:09:07,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 21:09:07,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 21:09:07,422 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand 7 states. [2018-02-02 21:09:07,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:09:07,559 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2018-02-02 21:09:07,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 21:09:07,559 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-02-02 21:09:07,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:09:07,560 INFO L225 Difference]: With dead ends: 119 [2018-02-02 21:09:07,560 INFO L226 Difference]: Without dead ends: 119 [2018-02-02 21:09:07,560 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-02 21:09:07,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-02 21:09:07,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-02-02 21:09:07,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-02 21:09:07,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 124 transitions. [2018-02-02 21:09:07,573 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 124 transitions. Word has length 19 [2018-02-02 21:09:07,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:09:07,573 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 124 transitions. [2018-02-02 21:09:07,573 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 21:09:07,573 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2018-02-02 21:09:07,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 21:09:07,574 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:09:07,574 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-02 21:09:07,574 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 21:09:07,574 INFO L82 PathProgramCache]: Analyzing trace with hash -860603530, now seen corresponding path program 1 times [2018-02-02 21:09:07,577 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:09:07,577 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:09:07,578 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:07,578 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:09:07,579 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:07,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:09:07,594 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:09:07,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:09:07,646 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:09:07,646 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 21:09:07,646 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 21:09:07,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 21:09:07,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 21:09:07,647 INFO L87 Difference]: Start difference. First operand 117 states and 124 transitions. Second operand 7 states. [2018-02-02 21:09:07,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:09:07,677 INFO L93 Difference]: Finished difference Result 129 states and 136 transitions. [2018-02-02 21:09:07,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 21:09:07,683 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-02-02 21:09:07,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:09:07,684 INFO L225 Difference]: With dead ends: 129 [2018-02-02 21:09:07,684 INFO L226 Difference]: Without dead ends: 129 [2018-02-02 21:09:07,685 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-02 21:09:07,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-02 21:09:07,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2018-02-02 21:09:07,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-02 21:09:07,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2018-02-02 21:09:07,692 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 29 [2018-02-02 21:09:07,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:09:07,693 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2018-02-02 21:09:07,693 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 21:09:07,693 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2018-02-02 21:09:07,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 21:09:07,693 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:09:07,694 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-02 21:09:07,694 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 21:09:07,694 INFO L82 PathProgramCache]: Analyzing trace with hash 23284980, now seen corresponding path program 1 times [2018-02-02 21:09:07,694 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:09:07,694 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:09:07,695 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:07,696 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:09:07,696 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:07,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:09:07,704 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:09:07,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:09:07,728 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:09:07,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 21:09:07,728 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 21:09:07,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 21:09:07,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 21:09:07,729 INFO L87 Difference]: Start difference. First operand 125 states and 132 transitions. Second operand 3 states. [2018-02-02 21:09:07,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:09:07,797 INFO L93 Difference]: Finished difference Result 140 states and 147 transitions. [2018-02-02 21:09:07,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 21:09:07,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-02-02 21:09:07,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:09:07,799 INFO L225 Difference]: With dead ends: 140 [2018-02-02 21:09:07,799 INFO L226 Difference]: Without dead ends: 129 [2018-02-02 21:09:07,799 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-02 21:09:07,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-02 21:09:07,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 121. [2018-02-02 21:09:07,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-02 21:09:07,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 127 transitions. [2018-02-02 21:09:07,805 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 127 transitions. Word has length 27 [2018-02-02 21:09:07,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:09:07,805 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 127 transitions. [2018-02-02 21:09:07,805 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 21:09:07,806 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 127 transitions. [2018-02-02 21:09:07,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 21:09:07,806 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:09:07,806 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-02 21:09:07,806 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 21:09:07,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1295663626, now seen corresponding path program 1 times [2018-02-02 21:09:07,806 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:09:07,806 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:09:07,807 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:07,808 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:09:07,808 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:09:07,816 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:09:07,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:09:07,847 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:09:07,847 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 21:09:07,847 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 21:09:07,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 21:09:07,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 21:09:07,848 INFO L87 Difference]: Start difference. First operand 121 states and 127 transitions. Second operand 6 states. [2018-02-02 21:09:07,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:09:07,869 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2018-02-02 21:09:07,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 21:09:07,870 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-02-02 21:09:07,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:09:07,870 INFO L225 Difference]: With dead ends: 113 [2018-02-02 21:09:07,870 INFO L226 Difference]: Without dead ends: 113 [2018-02-02 21:09:07,870 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 21:09:07,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-02 21:09:07,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-02-02 21:09:07,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-02 21:09:07,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 118 transitions. [2018-02-02 21:09:07,875 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 118 transitions. Word has length 29 [2018-02-02 21:09:07,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:09:07,875 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 118 transitions. [2018-02-02 21:09:07,875 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 21:09:07,876 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2018-02-02 21:09:07,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 21:09:07,876 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:09:07,876 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:09:07,876 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 21:09:07,877 INFO L82 PathProgramCache]: Analyzing trace with hash 522747174, now seen corresponding path program 1 times [2018-02-02 21:09:07,877 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:09:07,877 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:09:07,878 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:07,878 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:09:07,878 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:07,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:09:07,890 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:09:07,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:09:07,915 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:09:07,916 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 21:09:07,916 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 21:09:07,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 21:09:07,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 21:09:07,916 INFO L87 Difference]: Start difference. First operand 113 states and 118 transitions. Second operand 4 states. [2018-02-02 21:09:07,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:09:07,932 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2018-02-02 21:09:07,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 21:09:07,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-02-02 21:09:07,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:09:07,935 INFO L225 Difference]: With dead ends: 116 [2018-02-02 21:09:07,935 INFO L226 Difference]: Without dead ends: 114 [2018-02-02 21:09:07,935 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 21:09:07,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-02 21:09:07,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-02-02 21:09:07,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 21:09:07,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2018-02-02 21:09:07,939 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 34 [2018-02-02 21:09:07,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:09:07,939 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2018-02-02 21:09:07,940 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 21:09:07,940 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2018-02-02 21:09:07,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 21:09:07,940 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:09:07,941 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:09:07,941 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 21:09:07,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1305776369, now seen corresponding path program 1 times [2018-02-02 21:09:07,941 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:09:07,941 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:09:07,942 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:07,942 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:09:07,942 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:07,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:09:07,953 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:09:07,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:09:07,976 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:09:07,976 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:09:07,977 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:09:07,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:09:08,002 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:09:08,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:09:08,022 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:09:08,022 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-02-02 21:09:08,022 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 21:09:08,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 21:09:08,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-02 21:09:08,023 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 6 states. [2018-02-02 21:09:08,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:09:08,038 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2018-02-02 21:09:08,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 21:09:08,038 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-02-02 21:09:08,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:09:08,039 INFO L225 Difference]: With dead ends: 117 [2018-02-02 21:09:08,039 INFO L226 Difference]: Without dead ends: 115 [2018-02-02 21:09:08,039 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-02-02 21:09:08,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-02 21:09:08,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-02-02 21:09:08,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-02 21:09:08,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 120 transitions. [2018-02-02 21:09:08,044 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 120 transitions. Word has length 35 [2018-02-02 21:09:08,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:09:08,044 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 120 transitions. [2018-02-02 21:09:08,044 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 21:09:08,044 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 120 transitions. [2018-02-02 21:09:08,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 21:09:08,045 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:09:08,045 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:09:08,045 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 21:09:08,045 INFO L82 PathProgramCache]: Analyzing trace with hash 2139535942, now seen corresponding path program 2 times [2018-02-02 21:09:08,045 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:09:08,046 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:09:08,047 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:08,047 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:09:08,047 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:08,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:09:08,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:09:08,086 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:09:08,086 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:09:08,086 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:09:08,087 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:09:08,120 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-02 21:09:08,120 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:09:08,130 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:09:08,163 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-02 21:09:08,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:09:08,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-02-02 21:09:08,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 21:09:08,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 21:09:08,181 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:30 [2018-02-02 21:09:08,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 21:09:08,409 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 21:09:08,409 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [6] total 20 [2018-02-02 21:09:08,409 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 21:09:08,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 21:09:08,410 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2018-02-02 21:09:08,411 INFO L87 Difference]: Start difference. First operand 115 states and 120 transitions. Second operand 20 states. [2018-02-02 21:09:08,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:09:08,918 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2018-02-02 21:09:08,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 21:09:08,919 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-02-02 21:09:08,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:09:08,919 INFO L225 Difference]: With dead ends: 117 [2018-02-02 21:09:08,919 INFO L226 Difference]: Without dead ends: 115 [2018-02-02 21:09:08,920 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=708, Unknown=0, NotChecked=0, Total=812 [2018-02-02 21:09:08,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-02 21:09:08,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-02-02 21:09:08,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-02 21:09:08,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 120 transitions. [2018-02-02 21:09:08,924 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 120 transitions. Word has length 36 [2018-02-02 21:09:08,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:09:08,924 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 120 transitions. [2018-02-02 21:09:08,924 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 21:09:08,925 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 120 transitions. [2018-02-02 21:09:08,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 21:09:08,925 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:09:08,926 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-02 21:09:08,926 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 21:09:08,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1570035182, now seen corresponding path program 1 times [2018-02-02 21:09:08,926 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:09:08,926 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:09:08,927 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:08,928 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:09:08,928 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:09:08,937 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:09:08,991 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 21:09:08,992 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:09:08,992 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 21:09:08,992 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 21:09:08,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 21:09:08,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 21:09:08,992 INFO L87 Difference]: Start difference. First operand 115 states and 120 transitions. Second operand 10 states. [2018-02-02 21:09:09,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:09:09,101 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2018-02-02 21:09:09,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 21:09:09,101 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2018-02-02 21:09:09,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:09:09,102 INFO L225 Difference]: With dead ends: 114 [2018-02-02 21:09:09,102 INFO L226 Difference]: Without dead ends: 114 [2018-02-02 21:09:09,103 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-02 21:09:09,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-02 21:09:09,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-02-02 21:09:09,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 21:09:09,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2018-02-02 21:09:09,106 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 37 [2018-02-02 21:09:09,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:09:09,106 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2018-02-02 21:09:09,106 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 21:09:09,106 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2018-02-02 21:09:09,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 21:09:09,107 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:09:09,107 INFO L351 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:09:09,107 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 21:09:09,108 INFO L82 PathProgramCache]: Analyzing trace with hash 258949559, now seen corresponding path program 1 times [2018-02-02 21:09:09,108 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:09:09,108 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:09:09,109 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:09,109 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:09:09,109 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:09:09,121 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:09:09,186 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 21:09:09,187 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:09:09,187 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 21:09:09,187 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 21:09:09,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 21:09:09,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 21:09:09,187 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 10 states. [2018-02-02 21:09:09,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:09:09,316 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2018-02-02 21:09:09,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 21:09:09,316 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-02-02 21:09:09,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:09:09,317 INFO L225 Difference]: With dead ends: 112 [2018-02-02 21:09:09,317 INFO L226 Difference]: Without dead ends: 112 [2018-02-02 21:09:09,317 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-02 21:09:09,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-02 21:09:09,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-02-02 21:09:09,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-02 21:09:09,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2018-02-02 21:09:09,320 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 42 [2018-02-02 21:09:09,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:09:09,320 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2018-02-02 21:09:09,320 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 21:09:09,320 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2018-02-02 21:09:09,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 21:09:09,321 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:09:09,321 INFO L351 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:09:09,321 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 21:09:09,321 INFO L82 PathProgramCache]: Analyzing trace with hash 258949560, now seen corresponding path program 1 times [2018-02-02 21:09:09,321 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:09:09,322 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:09:09,322 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:09,322 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:09:09,323 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:09,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:09:09,332 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:09:09,357 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:09:09,357 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:09:09,357 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:09:09,358 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:09:09,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:09:09,376 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:09:09,390 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:09:09,391 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:09:09,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-02-02 21:09:09,392 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 21:09:09,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 21:09:09,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-02-02 21:09:09,392 INFO L87 Difference]: Start difference. First operand 112 states and 117 transitions. Second operand 8 states. [2018-02-02 21:09:09,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:09:09,410 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2018-02-02 21:09:09,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 21:09:09,411 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-02-02 21:09:09,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:09:09,412 INFO L225 Difference]: With dead ends: 115 [2018-02-02 21:09:09,412 INFO L226 Difference]: Without dead ends: 113 [2018-02-02 21:09:09,413 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-02 21:09:09,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-02 21:09:09,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-02-02 21:09:09,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-02 21:09:09,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 118 transitions. [2018-02-02 21:09:09,417 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 118 transitions. Word has length 42 [2018-02-02 21:09:09,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:09:09,417 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 118 transitions. [2018-02-02 21:09:09,417 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 21:09:09,418 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2018-02-02 21:09:09,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 21:09:09,418 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:09:09,418 INFO L351 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:09:09,418 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 21:09:09,419 INFO L82 PathProgramCache]: Analyzing trace with hash -549832031, now seen corresponding path program 2 times [2018-02-02 21:09:09,419 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:09:09,419 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:09:09,420 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:09,420 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:09:09,420 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:09,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:09:09,432 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:09:09,479 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:09:09,480 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:09:09,480 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:09:09,481 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:09:09,496 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-02 21:09:09,497 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:09:09,500 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:09:09,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-02-02 21:09:09,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:09:09,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-02-02 21:09:09,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 21:09:09,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 21:09:09,542 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-02 21:09:09,794 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 21:09:09,795 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 21:09:09,795 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 22 [2018-02-02 21:09:09,795 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 21:09:09,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 21:09:09,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2018-02-02 21:09:09,796 INFO L87 Difference]: Start difference. First operand 113 states and 118 transitions. Second operand 22 states. [2018-02-02 21:09:10,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:09:10,244 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2018-02-02 21:09:10,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 21:09:10,244 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 43 [2018-02-02 21:09:10,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:09:10,245 INFO L225 Difference]: With dead ends: 114 [2018-02-02 21:09:10,245 INFO L226 Difference]: Without dead ends: 112 [2018-02-02 21:09:10,245 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=917, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 21:09:10,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-02 21:09:10,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-02-02 21:09:10,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-02 21:09:10,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2018-02-02 21:09:10,247 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 43 [2018-02-02 21:09:10,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:09:10,247 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2018-02-02 21:09:10,247 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 21:09:10,247 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2018-02-02 21:09:10,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 21:09:10,248 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:09:10,248 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-02 21:09:10,248 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 21:09:10,248 INFO L82 PathProgramCache]: Analyzing trace with hash -2038388811, now seen corresponding path program 1 times [2018-02-02 21:09:10,248 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:09:10,249 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:09:10,249 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:10,249 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:09:10,250 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:10,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:09:10,256 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:09:10,286 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-02 21:09:10,286 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:09:10,286 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 21:09:10,287 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 21:09:10,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 21:09:10,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 21:09:10,287 INFO L87 Difference]: Start difference. First operand 112 states and 117 transitions. Second operand 8 states. [2018-02-02 21:09:10,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:09:10,311 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2018-02-02 21:09:10,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 21:09:10,312 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-02-02 21:09:10,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:09:10,312 INFO L225 Difference]: With dead ends: 114 [2018-02-02 21:09:10,312 INFO L226 Difference]: Without dead ends: 112 [2018-02-02 21:09:10,312 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-02 21:09:10,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-02 21:09:10,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-02-02 21:09:10,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-02 21:09:10,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 116 transitions. [2018-02-02 21:09:10,314 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 116 transitions. Word has length 49 [2018-02-02 21:09:10,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:09:10,314 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 116 transitions. [2018-02-02 21:09:10,314 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 21:09:10,314 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 116 transitions. [2018-02-02 21:09:10,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 21:09:10,315 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:09:10,315 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-02 21:09:10,315 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 21:09:10,315 INFO L82 PathProgramCache]: Analyzing trace with hash 2077653417, now seen corresponding path program 1 times [2018-02-02 21:09:10,315 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:09:10,315 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:09:10,316 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:10,316 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:09:10,316 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:10,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:09:10,322 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:09:10,392 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-02 21:09:10,392 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:09:10,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 21:09:10,393 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 21:09:10,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 21:09:10,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 21:09:10,393 INFO L87 Difference]: Start difference. First operand 112 states and 116 transitions. Second operand 10 states. [2018-02-02 21:09:10,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:09:10,436 INFO L93 Difference]: Finished difference Result 116 states and 119 transitions. [2018-02-02 21:09:10,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 21:09:10,436 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-02-02 21:09:10,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:09:10,437 INFO L225 Difference]: With dead ends: 116 [2018-02-02 21:09:10,437 INFO L226 Difference]: Without dead ends: 112 [2018-02-02 21:09:10,437 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-02 21:09:10,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-02 21:09:10,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-02-02 21:09:10,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-02 21:09:10,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 115 transitions. [2018-02-02 21:09:10,439 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 115 transitions. Word has length 54 [2018-02-02 21:09:10,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:09:10,439 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 115 transitions. [2018-02-02 21:09:10,439 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 21:09:10,439 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 115 transitions. [2018-02-02 21:09:10,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 21:09:10,440 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:09:10,440 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-02 21:09:10,440 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 21:09:10,440 INFO L82 PathProgramCache]: Analyzing trace with hash -154764032, now seen corresponding path program 1 times [2018-02-02 21:09:10,440 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:09:10,440 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:09:10,441 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:10,441 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:09:10,441 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:10,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:09:10,450 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:09:10,654 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-02 21:09:10,654 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:09:10,655 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-02-02 21:09:10,655 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 21:09:10,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 21:09:10,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-02-02 21:09:10,655 INFO L87 Difference]: Start difference. First operand 112 states and 115 transitions. Second operand 21 states. [2018-02-02 21:09:10,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:09:10,923 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2018-02-02 21:09:10,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 21:09:10,947 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 65 [2018-02-02 21:09:10,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:09:10,948 INFO L225 Difference]: With dead ends: 119 [2018-02-02 21:09:10,948 INFO L226 Difference]: Without dead ends: 119 [2018-02-02 21:09:10,948 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2018-02-02 21:09:10,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-02 21:09:10,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 110. [2018-02-02 21:09:10,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-02-02 21:09:10,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 113 transitions. [2018-02-02 21:09:10,951 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 113 transitions. Word has length 65 [2018-02-02 21:09:10,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:09:10,951 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 113 transitions. [2018-02-02 21:09:10,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 21:09:10,951 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2018-02-02 21:09:10,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 21:09:10,952 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:09:10,952 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-02 21:09:10,952 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 21:09:10,952 INFO L82 PathProgramCache]: Analyzing trace with hash -154764031, now seen corresponding path program 1 times [2018-02-02 21:09:10,952 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:09:10,952 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:09:10,953 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:10,953 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:09:10,953 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:10,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:09:10,966 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:09:11,009 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:09:11,009 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:09:11,009 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:09:11,010 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:09:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:09:11,035 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:09:11,056 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:09:11,056 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:09:11,056 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-02-02 21:09:11,057 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 21:09:11,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 21:09:11,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-02-02 21:09:11,057 INFO L87 Difference]: Start difference. First operand 110 states and 113 transitions. Second operand 10 states. [2018-02-02 21:09:11,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:09:11,075 INFO L93 Difference]: Finished difference Result 113 states and 116 transitions. [2018-02-02 21:09:11,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 21:09:11,075 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2018-02-02 21:09:11,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:09:11,076 INFO L225 Difference]: With dead ends: 113 [2018-02-02 21:09:11,076 INFO L226 Difference]: Without dead ends: 111 [2018-02-02 21:09:11,076 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-02 21:09:11,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-02 21:09:11,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-02-02 21:09:11,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-02 21:09:11,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 114 transitions. [2018-02-02 21:09:11,078 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 114 transitions. Word has length 65 [2018-02-02 21:09:11,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:09:11,078 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 114 transitions. [2018-02-02 21:09:11,078 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 21:09:11,078 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 114 transitions. [2018-02-02 21:09:11,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 21:09:11,078 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:09:11,079 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-02 21:09:11,079 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 21:09:11,079 INFO L82 PathProgramCache]: Analyzing trace with hash -477131272, now seen corresponding path program 2 times [2018-02-02 21:09:11,079 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:09:11,079 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:09:11,079 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:11,079 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:09:11,079 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:09:11,092 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:09:11,154 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:09:11,154 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:09:11,155 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:09:11,155 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:09:11,196 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-02 21:09:11,196 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:09:11,200 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:09:11,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-02-02 21:09:11,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:09:11,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-02-02 21:09:11,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 21:09:11,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 21:09:11,240 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-02 21:09:11,635 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-02-02 21:09:11,636 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 21:09:11,636 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [10] total 29 [2018-02-02 21:09:11,636 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 21:09:11,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 21:09:11,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=720, Unknown=0, NotChecked=0, Total=812 [2018-02-02 21:09:11,637 INFO L87 Difference]: Start difference. First operand 111 states and 114 transitions. Second operand 29 states. [2018-02-02 21:09:12,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:09:12,289 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2018-02-02 21:09:12,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 21:09:12,289 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 66 [2018-02-02 21:09:12,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:09:12,289 INFO L225 Difference]: With dead ends: 112 [2018-02-02 21:09:12,289 INFO L226 Difference]: Without dead ends: 110 [2018-02-02 21:09:12,290 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=212, Invalid=1680, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 21:09:12,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-02-02 21:09:12,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-02-02 21:09:12,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-02-02 21:09:12,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 113 transitions. [2018-02-02 21:09:12,292 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 113 transitions. Word has length 66 [2018-02-02 21:09:12,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:09:12,293 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 113 transitions. [2018-02-02 21:09:12,293 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 21:09:12,293 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2018-02-02 21:09:12,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 21:09:12,293 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:09:12,294 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-02 21:09:12,294 INFO L371 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 21:09:12,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1613283294, now seen corresponding path program 1 times [2018-02-02 21:09:12,294 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:09:12,294 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:09:12,295 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:12,295 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:09:12,295 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:12,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:09:12,305 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:09:12,370 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-02-02 21:09:12,370 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:09:12,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 21:09:12,371 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 21:09:12,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 21:09:12,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-02 21:09:12,371 INFO L87 Difference]: Start difference. First operand 110 states and 113 transitions. Second operand 11 states. [2018-02-02 21:09:12,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:09:12,420 INFO L93 Difference]: Finished difference Result 112 states and 114 transitions. [2018-02-02 21:09:12,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 21:09:12,420 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2018-02-02 21:09:12,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:09:12,420 INFO L225 Difference]: With dead ends: 112 [2018-02-02 21:09:12,421 INFO L226 Difference]: Without dead ends: 110 [2018-02-02 21:09:12,421 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-02 21:09:12,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-02-02 21:09:12,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-02-02 21:09:12,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-02-02 21:09:12,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2018-02-02 21:09:12,423 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 65 [2018-02-02 21:09:12,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:09:12,423 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2018-02-02 21:09:12,424 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 21:09:12,424 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2018-02-02 21:09:12,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 21:09:12,424 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:09:12,424 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-02 21:09:12,425 INFO L371 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 21:09:12,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1474253813, now seen corresponding path program 1 times [2018-02-02 21:09:12,425 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:09:12,425 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:09:12,426 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:12,426 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:09:12,426 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:12,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:09:12,438 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:09:12,636 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-02-02 21:09:12,636 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:09:12,636 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-02-02 21:09:12,636 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 21:09:12,637 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 21:09:12,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-02-02 21:09:12,637 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 24 states. [2018-02-02 21:09:12,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:09:12,949 INFO L93 Difference]: Finished difference Result 113 states and 115 transitions. [2018-02-02 21:09:12,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 21:09:12,949 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 81 [2018-02-02 21:09:12,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:09:12,950 INFO L225 Difference]: With dead ends: 113 [2018-02-02 21:09:12,950 INFO L226 Difference]: Without dead ends: 113 [2018-02-02 21:09:12,950 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-02 21:09:12,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-02 21:09:12,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2018-02-02 21:09:12,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-02 21:09:12,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2018-02-02 21:09:12,952 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 81 [2018-02-02 21:09:12,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:09:12,952 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2018-02-02 21:09:12,952 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 21:09:12,952 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2018-02-02 21:09:12,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 21:09:12,952 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:09:12,952 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-02 21:09:12,952 INFO L371 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 21:09:12,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1474253812, now seen corresponding path program 1 times [2018-02-02 21:09:12,953 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:09:12,953 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:09:12,953 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:12,953 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:09:12,953 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:12,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:09:12,967 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:09:13,033 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:09:13,033 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:09:13,033 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:09:13,034 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:09:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:09:13,049 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:09:13,059 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:09:13,059 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:09:13,059 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-02-02 21:09:13,059 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 21:09:13,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 21:09:13,060 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-02-02 21:09:13,060 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 12 states. [2018-02-02 21:09:13,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:09:13,078 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2018-02-02 21:09:13,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 21:09:13,078 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 81 [2018-02-02 21:09:13,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:09:13,079 INFO L225 Difference]: With dead ends: 111 [2018-02-02 21:09:13,079 INFO L226 Difference]: Without dead ends: 109 [2018-02-02 21:09:13,079 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-02 21:09:13,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-02 21:09:13,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-02-02 21:09:13,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-02 21:09:13,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 111 transitions. [2018-02-02 21:09:13,081 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 111 transitions. Word has length 81 [2018-02-02 21:09:13,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:09:13,081 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 111 transitions. [2018-02-02 21:09:13,081 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 21:09:13,081 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 111 transitions. [2018-02-02 21:09:13,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 21:09:13,081 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:09:13,082 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-02 21:09:13,082 INFO L371 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 21:09:13,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1420750595, now seen corresponding path program 2 times [2018-02-02 21:09:13,082 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:09:13,082 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:09:13,083 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:13,083 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:09:13,083 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:13,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:09:13,092 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:09:13,182 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:09:13,182 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:09:13,182 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:09:13,183 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:09:13,204 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-02 21:09:13,204 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:09:13,209 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:09:13,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-02-02 21:09:13,221 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:09:13,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-02-02 21:09:13,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 21:09:13,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 21:09:13,241 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-02 21:09:13,705 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 21:09:13,705 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 21:09:13,706 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [12] total 35 [2018-02-02 21:09:13,706 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 21:09:13,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 21:09:13,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1067, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 21:09:13,706 INFO L87 Difference]: Start difference. First operand 109 states and 111 transitions. Second operand 35 states. [2018-02-02 21:09:14,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:09:14,543 INFO L93 Difference]: Finished difference Result 110 states and 112 transitions. [2018-02-02 21:09:14,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 21:09:14,544 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 82 [2018-02-02 21:09:14,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:09:14,544 INFO L225 Difference]: With dead ends: 110 [2018-02-02 21:09:14,544 INFO L226 Difference]: Without dead ends: 108 [2018-02-02 21:09:14,545 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-02 21:09:14,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-02-02 21:09:14,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-02-02 21:09:14,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-02 21:09:14,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2018-02-02 21:09:14,546 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 82 [2018-02-02 21:09:14,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:09:14,546 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2018-02-02 21:09:14,546 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 21:09:14,546 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2018-02-02 21:09:14,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 21:09:14,547 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:09:14,547 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-02 21:09:14,547 INFO L371 AbstractCegarLoop]: === Iteration 23 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 21:09:14,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1218395795, now seen corresponding path program 1 times [2018-02-02 21:09:14,547 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:09:14,547 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:09:14,548 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:14,548 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:09:14,548 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:09:14,561 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:09:14,638 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:09:14,638 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:09:14,638 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:09:14,639 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:09:14,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:09:14,666 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:09:14,679 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:09:14,680 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:09:14,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-02-02 21:09:14,680 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 21:09:14,680 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 21:09:14,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2018-02-02 21:09:14,681 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 14 states. [2018-02-02 21:09:14,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:09:14,709 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2018-02-02 21:09:14,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 21:09:14,709 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 87 [2018-02-02 21:09:14,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:09:14,710 INFO L225 Difference]: With dead ends: 111 [2018-02-02 21:09:14,710 INFO L226 Difference]: Without dead ends: 109 [2018-02-02 21:09:14,710 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-02 21:09:14,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-02 21:09:14,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-02-02 21:09:14,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-02 21:09:14,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 111 transitions. [2018-02-02 21:09:14,713 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 111 transitions. Word has length 87 [2018-02-02 21:09:14,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:09:14,713 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 111 transitions. [2018-02-02 21:09:14,713 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 21:09:14,714 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 111 transitions. [2018-02-02 21:09:14,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-02 21:09:14,714 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:09:14,714 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-02 21:09:14,714 INFO L371 AbstractCegarLoop]: === Iteration 24 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 21:09:14,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1495748828, now seen corresponding path program 2 times [2018-02-02 21:09:14,715 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:09:14,715 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:09:14,715 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:14,716 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:09:14,716 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:14,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:09:14,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:09:14,816 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:09:14,817 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:09:14,817 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:09:14,818 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:09:14,867 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:09:14,867 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:09:14,872 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:09:14,892 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:09:14,892 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:09:14,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-02-02 21:09:14,892 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 21:09:14,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 21:09:14,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-02-02 21:09:14,893 INFO L87 Difference]: Start difference. First operand 109 states and 111 transitions. Second operand 15 states. [2018-02-02 21:09:14,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:09:14,921 INFO L93 Difference]: Finished difference Result 112 states and 114 transitions. [2018-02-02 21:09:14,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 21:09:14,922 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 88 [2018-02-02 21:09:14,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:09:14,923 INFO L225 Difference]: With dead ends: 112 [2018-02-02 21:09:14,923 INFO L226 Difference]: Without dead ends: 110 [2018-02-02 21:09:14,923 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-02 21:09:14,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-02-02 21:09:14,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-02-02 21:09:14,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-02-02 21:09:14,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2018-02-02 21:09:14,926 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 88 [2018-02-02 21:09:14,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:09:14,927 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2018-02-02 21:09:14,927 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 21:09:14,927 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2018-02-02 21:09:14,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-02 21:09:14,927 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:09:14,927 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-02 21:09:14,928 INFO L371 AbstractCegarLoop]: === Iteration 25 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 21:09:14,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1503758259, now seen corresponding path program 3 times [2018-02-02 21:09:14,928 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:09:14,928 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:09:14,929 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:14,929 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:09:14,929 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:14,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:09:14,972 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:09:15,078 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:09:15,078 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:09:15,078 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:09:15,079 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 21:09:15,129 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-02-02 21:09:15,130 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:09:15,134 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:09:15,152 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:09:15,152 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:09:15,153 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-02-02 21:09:15,153 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 21:09:15,153 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 21:09:15,153 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2018-02-02 21:09:15,154 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 16 states. [2018-02-02 21:09:15,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:09:15,187 INFO L93 Difference]: Finished difference Result 113 states and 115 transitions. [2018-02-02 21:09:15,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 21:09:15,187 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 89 [2018-02-02 21:09:15,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:09:15,188 INFO L225 Difference]: With dead ends: 113 [2018-02-02 21:09:15,188 INFO L226 Difference]: Without dead ends: 111 [2018-02-02 21:09:15,188 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-02 21:09:15,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-02 21:09:15,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-02-02 21:09:15,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-02 21:09:15,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 113 transitions. [2018-02-02 21:09:15,191 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 113 transitions. Word has length 89 [2018-02-02 21:09:15,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:09:15,191 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 113 transitions. [2018-02-02 21:09:15,191 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 21:09:15,191 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 113 transitions. [2018-02-02 21:09:15,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-02-02 21:09:15,192 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:09:15,192 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-02 21:09:15,192 INFO L371 AbstractCegarLoop]: === Iteration 26 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 21:09:15,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1752050620, now seen corresponding path program 4 times [2018-02-02 21:09:15,192 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:09:15,192 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:09:15,193 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:15,193 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:09:15,193 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:15,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:09:15,206 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:09:15,323 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:09:15,323 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:09:15,323 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:09:15,324 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 21:09:15,347 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 21:09:15,347 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:09:15,349 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:09:15,374 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:09:15,374 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:09:15,374 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-02-02 21:09:15,375 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 21:09:15,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 21:09:15,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-02-02 21:09:15,375 INFO L87 Difference]: Start difference. First operand 111 states and 113 transitions. Second operand 17 states. [2018-02-02 21:09:15,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:09:15,419 INFO L93 Difference]: Finished difference Result 114 states and 116 transitions. [2018-02-02 21:09:15,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 21:09:15,419 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 90 [2018-02-02 21:09:15,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:09:15,420 INFO L225 Difference]: With dead ends: 114 [2018-02-02 21:09:15,420 INFO L226 Difference]: Without dead ends: 112 [2018-02-02 21:09:15,420 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=180, Unknown=0, NotChecked=0, Total=306 [2018-02-02 21:09:15,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-02 21:09:15,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-02-02 21:09:15,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-02 21:09:15,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2018-02-02 21:09:15,423 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 90 [2018-02-02 21:09:15,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:09:15,423 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2018-02-02 21:09:15,423 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 21:09:15,423 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2018-02-02 21:09:15,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-02-02 21:09:15,423 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:09:15,424 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-02 21:09:15,424 INFO L371 AbstractCegarLoop]: === Iteration 27 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 21:09:15,424 INFO L82 PathProgramCache]: Analyzing trace with hash -859179219, now seen corresponding path program 5 times [2018-02-02 21:09:15,424 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:09:15,424 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:09:15,425 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:15,425 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:09:15,425 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:15,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:09:15,439 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:09:15,546 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:09:15,546 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:09:15,546 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:09:15,547 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 21:09:15,565 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-02-02 21:09:15,565 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:09:15,568 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:09:15,577 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:09:15,577 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:09:15,577 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-02-02 21:09:15,577 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 21:09:15,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 21:09:15,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-02-02 21:09:15,578 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 18 states. [2018-02-02 21:09:15,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:09:15,604 INFO L93 Difference]: Finished difference Result 115 states and 117 transitions. [2018-02-02 21:09:15,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 21:09:15,615 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 91 [2018-02-02 21:09:15,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:09:15,616 INFO L225 Difference]: With dead ends: 115 [2018-02-02 21:09:15,616 INFO L226 Difference]: Without dead ends: 113 [2018-02-02 21:09:15,616 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-02 21:09:15,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-02 21:09:15,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-02-02 21:09:15,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-02 21:09:15,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 115 transitions. [2018-02-02 21:09:15,618 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 115 transitions. Word has length 91 [2018-02-02 21:09:15,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:09:15,618 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 115 transitions. [2018-02-02 21:09:15,619 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 21:09:15,619 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 115 transitions. [2018-02-02 21:09:15,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-02 21:09:15,619 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:09:15,619 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-02 21:09:15,619 INFO L371 AbstractCegarLoop]: === Iteration 28 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 21:09:15,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1050030436, now seen corresponding path program 6 times [2018-02-02 21:09:15,620 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:09:15,620 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:09:15,620 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:15,620 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:09:15,621 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:15,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:09:15,637 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:09:15,782 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:09:15,783 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:09:15,783 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:09:15,783 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 21:09:15,807 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-02-02 21:09:15,807 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:09:15,809 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:09:15,818 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:09:15,818 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:09:15,818 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-02-02 21:09:15,818 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 21:09:15,819 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 21:09:15,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-02-02 21:09:15,819 INFO L87 Difference]: Start difference. First operand 113 states and 115 transitions. Second operand 19 states. [2018-02-02 21:09:15,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:09:15,846 INFO L93 Difference]: Finished difference Result 116 states and 118 transitions. [2018-02-02 21:09:15,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 21:09:15,846 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2018-02-02 21:09:15,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:09:15,847 INFO L225 Difference]: With dead ends: 116 [2018-02-02 21:09:15,847 INFO L226 Difference]: Without dead ends: 114 [2018-02-02 21:09:15,847 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-02 21:09:15,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-02 21:09:15,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-02-02 21:09:15,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 21:09:15,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 116 transitions. [2018-02-02 21:09:15,849 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 116 transitions. Word has length 92 [2018-02-02 21:09:15,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:09:15,850 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 116 transitions. [2018-02-02 21:09:15,850 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 21:09:15,850 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 116 transitions. [2018-02-02 21:09:15,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-02 21:09:15,850 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:09:15,850 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-02 21:09:15,851 INFO L371 AbstractCegarLoop]: === Iteration 29 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 21:09:15,851 INFO L82 PathProgramCache]: Analyzing trace with hash 105987597, now seen corresponding path program 7 times [2018-02-02 21:09:15,851 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:09:15,851 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:09:15,852 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:15,852 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:09:15,852 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:09:15,867 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:09:16,023 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:09:16,024 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:09:16,044 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:09:16,045 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:09:16,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:09:16,068 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:09:16,092 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:09:16,093 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:09:16,093 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-02-02 21:09:16,093 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 21:09:16,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 21:09:16,094 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2018-02-02 21:09:16,094 INFO L87 Difference]: Start difference. First operand 114 states and 116 transitions. Second operand 20 states. [2018-02-02 21:09:16,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:09:16,126 INFO L93 Difference]: Finished difference Result 117 states and 119 transitions. [2018-02-02 21:09:16,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 21:09:16,127 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 93 [2018-02-02 21:09:16,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:09:16,127 INFO L225 Difference]: With dead ends: 117 [2018-02-02 21:09:16,128 INFO L226 Difference]: Without dead ends: 115 [2018-02-02 21:09:16,128 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-02 21:09:16,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-02 21:09:16,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-02-02 21:09:16,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-02 21:09:16,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2018-02-02 21:09:16,130 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 93 [2018-02-02 21:09:16,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:09:16,131 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2018-02-02 21:09:16,131 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 21:09:16,131 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2018-02-02 21:09:16,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 21:09:16,131 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:09:16,132 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-02 21:09:16,132 INFO L371 AbstractCegarLoop]: === Iteration 30 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 21:09:16,132 INFO L82 PathProgramCache]: Analyzing trace with hash 905430660, now seen corresponding path program 8 times [2018-02-02 21:09:16,132 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:09:16,132 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:09:16,133 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:16,133 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:09:16,133 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:09:16,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:09:16,175 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:09:16,190 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: Unknown lemma type! at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-02 21:09:16,193 INFO L168 Benchmark]: Toolchain (without parser) took 10015.22 ms. Allocated memory was 403.7 MB in the beginning and 851.4 MB in the end (delta: 447.7 MB). Free memory was 360.2 MB in the beginning and 592.5 MB in the end (delta: -232.3 MB). Peak memory consumption was 215.4 MB. Max. memory is 5.3 GB. [2018-02-02 21:09:16,194 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 403.7 MB. Free memory is still 366.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 21:09:16,195 INFO L168 Benchmark]: CACSL2BoogieTranslator took 160.51 ms. Allocated memory is still 403.7 MB. Free memory was 360.2 MB in the beginning and 345.6 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. [2018-02-02 21:09:16,195 INFO L168 Benchmark]: Boogie Preprocessor took 29.60 ms. Allocated memory is still 403.7 MB. Free memory was 345.6 MB in the beginning and 344.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 21:09:16,195 INFO L168 Benchmark]: RCFGBuilder took 335.16 ms. Allocated memory is still 403.7 MB. Free memory was 344.3 MB in the beginning and 311.2 MB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 5.3 GB. [2018-02-02 21:09:16,195 INFO L168 Benchmark]: TraceAbstraction took 9487.47 ms. Allocated memory was 403.7 MB in the beginning and 851.4 MB in the end (delta: 447.7 MB). Free memory was 311.2 MB in the beginning and 592.5 MB in the end (delta: -281.3 MB). Peak memory consumption was 166.4 MB. Max. memory is 5.3 GB. [2018-02-02 21:09:16,197 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.09 ms. Allocated memory is still 403.7 MB. Free memory is still 366.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 160.51 ms. Allocated memory is still 403.7 MB. Free memory was 360.2 MB in the beginning and 345.6 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.60 ms. Allocated memory is still 403.7 MB. Free memory was 345.6 MB in the beginning and 344.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 335.16 ms. Allocated memory is still 403.7 MB. Free memory was 344.3 MB in the beginning and 311.2 MB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 9487.47 ms. Allocated memory was 403.7 MB in the beginning and 851.4 MB in the end (delta: 447.7 MB). Free memory was 311.2 MB in the beginning and 592.5 MB in the end (delta: -281.3 MB). Peak memory consumption was 166.4 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-02_21-09-16-202.csv Received shutdown request...