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/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_3_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-30 00:19:19,146 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 00:19:19,148 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 00:19:19,161 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 00:19:19,162 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 00:19:19,163 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 00:19:19,164 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 00:19:19,165 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 00:19:19,167 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 00:19:19,168 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 00:19:19,169 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 00:19:19,169 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 00:19:19,170 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 00:19:19,171 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 00:19:19,172 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 00:19:19,174 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 00:19:19,176 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 00:19:19,178 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 00:19:19,179 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 00:19:19,181 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 00:19:19,183 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 00:19:19,183 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 00:19:19,183 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 00:19:19,184 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 00:19:19,185 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 00:19:19,186 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 00:19:19,186 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 00:19:19,187 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 00:19:19,187 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 00:19:19,187 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 00:19:19,188 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 00:19:19,188 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-30 00:19:19,197 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 00:19:19,198 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 00:19:19,198 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 00:19:19,199 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 00:19:19,199 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 00:19:19,199 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 00:19:19,199 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 00:19:19,200 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 00:19:19,200 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 00:19:19,200 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-30 00:19:19,200 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 00:19:19,201 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 00:19:19,201 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 00:19:19,201 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-30 00:19:19,201 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-30 00:19:19,201 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-30 00:19:19,202 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 00:19:19,202 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 00:19:19,202 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 00:19:19,202 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 00:19:19,203 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 00:19:19,203 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 00:19:19,203 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 00:19:19,203 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:19:19,203 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 00:19:19,204 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 00:19:19,204 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 00:19:19,204 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 00:19:19,204 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 00:19:19,204 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 00:19:19,205 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 00:19:19,205 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 00:19:19,206 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 00:19:19,206 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 00:19:19,239 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 00:19:19,251 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 00:19:19,255 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 00:19:19,256 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 00:19:19,257 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 00:19:19,257 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_3_true-valid-memsafety_true-termination.i [2018-01-30 00:19:19,439 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 00:19:19,446 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 00:19:19,448 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 00:19:19,448 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 00:19:19,457 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 00:19:19,459 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:19:19" (1/1) ... [2018-01-30 00:19:19,462 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1485d5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:19:19, skipping insertion in model container [2018-01-30 00:19:19,463 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:19:19" (1/1) ... [2018-01-30 00:19:19,481 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:19:19,532 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:19:19,654 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:19:19,675 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:19:19,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:19:19 WrapperNode [2018-01-30 00:19:19,688 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 00:19:19,689 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 00:19:19,689 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 00:19:19,689 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 00:19:19,701 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:19:19" (1/1) ... [2018-01-30 00:19:19,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:19:19" (1/1) ... [2018-01-30 00:19:19,711 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:19:19" (1/1) ... [2018-01-30 00:19:19,711 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:19:19" (1/1) ... [2018-01-30 00:19:19,719 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:19:19" (1/1) ... [2018-01-30 00:19:19,722 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:19:19" (1/1) ... [2018-01-30 00:19:19,723 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:19:19" (1/1) ... [2018-01-30 00:19:19,726 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 00:19:19,726 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 00:19:19,726 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 00:19:19,726 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 00:19:19,727 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:19:19" (1/1) ... No working directory specified, using /storage/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-01-30 00:19:19,774 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 00:19:19,774 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 00:19:19,774 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-01-30 00:19:19,774 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-30 00:19:19,774 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-01-30 00:19:19,775 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2018-01-30 00:19:19,775 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-01-30 00:19:19,775 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-01-30 00:19:19,775 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-01-30 00:19:19,775 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2018-01-30 00:19:19,775 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-01-30 00:19:19,776 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-01-30 00:19:19,776 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-01-30 00:19:19,776 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-01-30 00:19:19,776 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2018-01-30 00:19:19,776 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-01-30 00:19:19,776 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-01-30 00:19:19,776 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-01-30 00:19:19,777 INFO L136 BoogieDeclarations]: Found implementation of procedure f_22_get [2018-01-30 00:19:19,777 INFO L136 BoogieDeclarations]: Found implementation of procedure f_22_put [2018-01-30 00:19:19,777 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-30 00:19:19,777 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 00:19:19,777 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-30 00:19:19,778 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-30 00:19:19,778 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-30 00:19:19,778 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-30 00:19:19,778 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 00:19:19,778 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 00:19:19,778 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 00:19:19,779 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-30 00:19:19,779 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-30 00:19:19,779 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-30 00:19:19,779 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-30 00:19:19,779 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 00:19:19,779 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-30 00:19:19,779 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-30 00:19:19,780 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-01-30 00:19:19,780 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2018-01-30 00:19:19,780 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-01-30 00:19:19,780 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-01-30 00:19:19,780 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-01-30 00:19:19,780 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-01-30 00:19:19,781 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2018-01-30 00:19:19,781 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-01-30 00:19:19,781 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-01-30 00:19:19,781 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-01-30 00:19:19,781 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-01-30 00:19:19,781 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2018-01-30 00:19:19,781 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-01-30 00:19:19,781 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-01-30 00:19:19,781 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-01-30 00:19:19,782 INFO L128 BoogieDeclarations]: Found specification of procedure f_22_get [2018-01-30 00:19:19,782 INFO L128 BoogieDeclarations]: Found specification of procedure f_22_put [2018-01-30 00:19:19,782 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-30 00:19:19,782 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 00:19:19,782 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 00:19:19,782 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 00:19:20,035 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-30 00:19:20,225 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 00:19:20,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:19:20 BoogieIcfgContainer [2018-01-30 00:19:20,226 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 00:19:20,227 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 00:19:20,228 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 00:19:20,231 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 00:19:20,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 12:19:19" (1/3) ... [2018-01-30 00:19:20,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66b6ca5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:19:20, skipping insertion in model container [2018-01-30 00:19:20,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:19:19" (2/3) ... [2018-01-30 00:19:20,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66b6ca5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:19:20, skipping insertion in model container [2018-01-30 00:19:20,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:19:20" (3/3) ... [2018-01-30 00:19:20,234 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test22_3_true-valid-memsafety_true-termination.i [2018-01-30 00:19:20,240 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 00:19:20,247 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-01-30 00:19:20,286 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 00:19:20,286 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 00:19:20,286 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 00:19:20,286 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 00:19:20,287 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 00:19:20,287 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 00:19:20,287 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 00:19:20,287 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 00:19:20,287 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 00:19:20,306 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states. [2018-01-30 00:19:20,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-30 00:19:20,312 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:19:20,313 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:19:20,313 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:19:20,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1885508389, now seen corresponding path program 1 times [2018-01-30 00:19:20,318 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:19:20,319 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:19:20,363 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:20,363 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:19:20,364 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:20,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:19:20,415 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:19:20,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:19:20,633 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:19:20,634 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:19:20,635 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:19:20,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:19:20,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:19:20,647 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 5 states. [2018-01-30 00:19:20,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:19:20,735 INFO L93 Difference]: Finished difference Result 350 states and 367 transitions. [2018-01-30 00:19:20,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:19:20,737 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-30 00:19:20,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:19:20,747 INFO L225 Difference]: With dead ends: 350 [2018-01-30 00:19:20,748 INFO L226 Difference]: Without dead ends: 188 [2018-01-30 00:19:20,752 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:19:20,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-01-30 00:19:20,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2018-01-30 00:19:20,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-01-30 00:19:20,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 195 transitions. [2018-01-30 00:19:20,790 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 195 transitions. Word has length 22 [2018-01-30 00:19:20,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:19:20,790 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 195 transitions. [2018-01-30 00:19:20,791 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:19:20,791 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 195 transitions. [2018-01-30 00:19:20,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-30 00:19:20,791 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:19:20,791 INFO L350 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] [2018-01-30 00:19:20,792 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:19:20,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1475872018, now seen corresponding path program 1 times [2018-01-30 00:19:20,792 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:19:20,792 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:19:20,793 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:20,793 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:19:20,793 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:20,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:19:20,816 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:19:20,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:19:20,889 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:19:20,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:19:20,890 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:19:20,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:19:20,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:19:20,890 INFO L87 Difference]: Start difference. First operand 186 states and 195 transitions. Second operand 6 states. [2018-01-30 00:19:21,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:19:21,157 INFO L93 Difference]: Finished difference Result 189 states and 198 transitions. [2018-01-30 00:19:21,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:19:21,157 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-30 00:19:21,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:19:21,160 INFO L225 Difference]: With dead ends: 189 [2018-01-30 00:19:21,160 INFO L226 Difference]: Without dead ends: 188 [2018-01-30 00:19:21,161 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:19:21,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-01-30 00:19:21,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 185. [2018-01-30 00:19:21,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-30 00:19:21,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 194 transitions. [2018-01-30 00:19:21,178 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 194 transitions. Word has length 23 [2018-01-30 00:19:21,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:19:21,178 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 194 transitions. [2018-01-30 00:19:21,178 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:19:21,178 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 194 transitions. [2018-01-30 00:19:21,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-30 00:19:21,179 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:19:21,179 INFO L350 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] [2018-01-30 00:19:21,179 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:19:21,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1475872017, now seen corresponding path program 1 times [2018-01-30 00:19:21,180 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:19:21,180 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:19:21,181 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:21,182 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:19:21,182 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:21,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:19:21,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:19:21,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:19:21,474 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:19:21,474 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:19:21,474 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 00:19:21,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 00:19:21,475 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:19:21,475 INFO L87 Difference]: Start difference. First operand 185 states and 194 transitions. Second operand 7 states. [2018-01-30 00:19:21,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:19:21,720 INFO L93 Difference]: Finished difference Result 188 states and 197 transitions. [2018-01-30 00:19:21,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:19:21,756 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-01-30 00:19:21,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:19:21,759 INFO L225 Difference]: With dead ends: 188 [2018-01-30 00:19:21,759 INFO L226 Difference]: Without dead ends: 187 [2018-01-30 00:19:21,760 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:19:21,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-01-30 00:19:21,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 184. [2018-01-30 00:19:21,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-01-30 00:19:21,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 193 transitions. [2018-01-30 00:19:21,777 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 193 transitions. Word has length 23 [2018-01-30 00:19:21,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:19:21,777 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 193 transitions. [2018-01-30 00:19:21,777 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 00:19:21,778 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 193 transitions. [2018-01-30 00:19:21,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-30 00:19:21,779 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:19:21,779 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:19:21,779 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:19:21,780 INFO L82 PathProgramCache]: Analyzing trace with hash -39640287, now seen corresponding path program 1 times [2018-01-30 00:19:21,780 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:19:21,780 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:19:21,781 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:21,781 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:19:21,781 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:21,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:19:21,804 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:19:21,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:19:21,960 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:19:21,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-30 00:19:21,960 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 00:19:21,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 00:19:21,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-30 00:19:21,961 INFO L87 Difference]: Start difference. First operand 184 states and 193 transitions. Second operand 9 states. [2018-01-30 00:19:22,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:19:22,093 INFO L93 Difference]: Finished difference Result 312 states and 327 transitions. [2018-01-30 00:19:22,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 00:19:22,093 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-01-30 00:19:22,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:19:22,095 INFO L225 Difference]: With dead ends: 312 [2018-01-30 00:19:22,096 INFO L226 Difference]: Without dead ends: 206 [2018-01-30 00:19:22,097 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-01-30 00:19:22,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-01-30 00:19:22,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 199. [2018-01-30 00:19:22,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-01-30 00:19:22,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 208 transitions. [2018-01-30 00:19:22,113 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 208 transitions. Word has length 38 [2018-01-30 00:19:22,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:19:22,114 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 208 transitions. [2018-01-30 00:19:22,114 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 00:19:22,114 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 208 transitions. [2018-01-30 00:19:22,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-30 00:19:22,115 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:19:22,115 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:19:22,116 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:19:22,116 INFO L82 PathProgramCache]: Analyzing trace with hash 490857740, now seen corresponding path program 1 times [2018-01-30 00:19:22,116 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:19:22,116 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:19:22,118 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:22,118 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:19:22,118 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:22,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:19:22,138 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:19:22,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:19:22,233 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:19:22,233 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-30 00:19:22,234 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-30 00:19:22,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-30 00:19:22,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:19:22,234 INFO L87 Difference]: Start difference. First operand 199 states and 208 transitions. Second operand 10 states. [2018-01-30 00:19:22,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:19:22,517 INFO L93 Difference]: Finished difference Result 199 states and 208 transitions. [2018-01-30 00:19:22,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 00:19:22,517 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-01-30 00:19:22,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:19:22,519 INFO L225 Difference]: With dead ends: 199 [2018-01-30 00:19:22,519 INFO L226 Difference]: Without dead ends: 198 [2018-01-30 00:19:22,520 INFO L553 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-01-30 00:19:22,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-01-30 00:19:22,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-01-30 00:19:22,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-01-30 00:19:22,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 207 transitions. [2018-01-30 00:19:22,533 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 207 transitions. Word has length 39 [2018-01-30 00:19:22,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:19:22,534 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 207 transitions. [2018-01-30 00:19:22,534 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-30 00:19:22,534 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 207 transitions. [2018-01-30 00:19:22,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-30 00:19:22,535 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:19:22,535 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:19:22,535 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:19:22,536 INFO L82 PathProgramCache]: Analyzing trace with hash 490857741, now seen corresponding path program 1 times [2018-01-30 00:19:22,536 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:19:22,536 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:19:22,537 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:22,537 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:19:22,538 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:22,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:19:22,555 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:19:22,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:19:22,594 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:19:22,594 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:19:22,594 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:19:22,594 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:19:22,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:19:22,595 INFO L87 Difference]: Start difference. First operand 198 states and 207 transitions. Second operand 4 states. [2018-01-30 00:19:22,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:19:22,636 INFO L93 Difference]: Finished difference Result 347 states and 363 transitions. [2018-01-30 00:19:22,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 00:19:22,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-01-30 00:19:22,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:19:22,639 INFO L225 Difference]: With dead ends: 347 [2018-01-30 00:19:22,639 INFO L226 Difference]: Without dead ends: 202 [2018-01-30 00:19:22,640 INFO L553 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-01-30 00:19:22,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-01-30 00:19:22,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 199. [2018-01-30 00:19:22,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-01-30 00:19:22,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 208 transitions. [2018-01-30 00:19:22,652 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 208 transitions. Word has length 39 [2018-01-30 00:19:22,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:19:22,652 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 208 transitions. [2018-01-30 00:19:22,652 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:19:22,652 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 208 transitions. [2018-01-30 00:19:22,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-30 00:19:22,654 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:19:22,654 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:19:22,654 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:19:22,654 INFO L82 PathProgramCache]: Analyzing trace with hash -748848629, now seen corresponding path program 1 times [2018-01-30 00:19:22,655 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:19:22,655 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:19:22,656 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:22,656 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:19:22,656 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:22,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:19:22,671 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:19:22,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:19:22,742 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:19:22,742 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:19:22,756 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:19:22,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:19:22,802 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:19:22,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:19:22,871 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:19:22,871 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-01-30 00:19:22,872 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:19:22,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:19:22,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:19:22,872 INFO L87 Difference]: Start difference. First operand 199 states and 208 transitions. Second operand 6 states. [2018-01-30 00:19:22,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:19:22,952 INFO L93 Difference]: Finished difference Result 351 states and 367 transitions. [2018-01-30 00:19:22,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:19:22,955 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2018-01-30 00:19:22,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:19:22,957 INFO L225 Difference]: With dead ends: 351 [2018-01-30 00:19:22,957 INFO L226 Difference]: Without dead ends: 206 [2018-01-30 00:19:22,958 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 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-01-30 00:19:22,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-01-30 00:19:22,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 203. [2018-01-30 00:19:22,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-01-30 00:19:22,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 212 transitions. [2018-01-30 00:19:22,971 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 212 transitions. Word has length 43 [2018-01-30 00:19:22,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:19:22,972 INFO L432 AbstractCegarLoop]: Abstraction has 203 states and 212 transitions. [2018-01-30 00:19:22,972 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:19:22,972 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 212 transitions. [2018-01-30 00:19:22,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-30 00:19:22,974 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:19:22,974 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:19:22,974 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:19:22,974 INFO L82 PathProgramCache]: Analyzing trace with hash 931815433, now seen corresponding path program 2 times [2018-01-30 00:19:22,975 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:19:22,975 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:19:22,976 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:22,976 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:19:22,976 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:22,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:19:22,994 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:19:23,075 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:19:23,075 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:19:23,076 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:19:23,090 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:19:23,113 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:19:23,124 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:19:23,129 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:19:23,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 20 treesize of output 19 [2018-01-30 00:19:23,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:19:23,208 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-01-30 00:19:23,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:19:23,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-30 00:19:23,243 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-30 00:19:23,974 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-30 00:19:23,995 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 00:19:23,995 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 19 [2018-01-30 00:19:23,996 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-30 00:19:23,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-30 00:19:23,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-01-30 00:19:23,997 INFO L87 Difference]: Start difference. First operand 203 states and 212 transitions. Second operand 19 states. [2018-01-30 00:19:29,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:19:29,407 INFO L93 Difference]: Finished difference Result 439 states and 460 transitions. [2018-01-30 00:19:29,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-30 00:19:29,408 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2018-01-30 00:19:29,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:19:29,410 INFO L225 Difference]: With dead ends: 439 [2018-01-30 00:19:29,410 INFO L226 Difference]: Without dead ends: 294 [2018-01-30 00:19:29,412 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2018-01-30 00:19:29,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-01-30 00:19:29,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 206. [2018-01-30 00:19:29,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-01-30 00:19:29,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 215 transitions. [2018-01-30 00:19:29,430 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 215 transitions. Word has length 47 [2018-01-30 00:19:29,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:19:29,430 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 215 transitions. [2018-01-30 00:19:29,430 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-30 00:19:29,431 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 215 transitions. [2018-01-30 00:19:29,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-30 00:19:29,432 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:19:29,432 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:19:29,433 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:19:29,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1281962573, now seen corresponding path program 1 times [2018-01-30 00:19:29,433 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:19:29,433 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:19:29,434 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:29,434 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:19:29,435 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:29,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:19:29,446 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:19:29,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:19:29,531 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:19:29,532 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-30 00:19:29,532 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 00:19:29,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 00:19:29,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-30 00:19:29,532 INFO L87 Difference]: Start difference. First operand 206 states and 215 transitions. Second operand 9 states. [2018-01-30 00:19:29,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:19:29,668 INFO L93 Difference]: Finished difference Result 295 states and 311 transitions. [2018-01-30 00:19:29,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 00:19:29,668 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-01-30 00:19:29,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:19:29,670 INFO L225 Difference]: With dead ends: 295 [2018-01-30 00:19:29,671 INFO L226 Difference]: Without dead ends: 220 [2018-01-30 00:19:29,671 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-01-30 00:19:29,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-01-30 00:19:29,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 216. [2018-01-30 00:19:29,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-01-30 00:19:29,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 226 transitions. [2018-01-30 00:19:29,701 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 226 transitions. Word has length 54 [2018-01-30 00:19:29,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:19:29,702 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 226 transitions. [2018-01-30 00:19:29,702 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 00:19:29,702 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 226 transitions. [2018-01-30 00:19:29,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-30 00:19:29,703 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:19:29,704 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:19:29,704 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:19:29,704 INFO L82 PathProgramCache]: Analyzing trace with hash 647693160, now seen corresponding path program 1 times [2018-01-30 00:19:29,704 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:19:29,704 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:19:29,705 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:29,706 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:19:29,706 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:29,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:19:29,716 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:19:29,771 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 00:19:29,771 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:19:29,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 00:19:29,772 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 00:19:29,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 00:19:29,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:19:29,772 INFO L87 Difference]: Start difference. First operand 216 states and 226 transitions. Second operand 3 states. [2018-01-30 00:19:29,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:19:29,903 INFO L93 Difference]: Finished difference Result 241 states and 254 transitions. [2018-01-30 00:19:29,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 00:19:29,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-01-30 00:19:29,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:19:29,904 INFO L225 Difference]: With dead ends: 241 [2018-01-30 00:19:29,904 INFO L226 Difference]: Without dead ends: 222 [2018-01-30 00:19:29,905 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:19:29,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-01-30 00:19:29,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 209. [2018-01-30 00:19:29,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-01-30 00:19:29,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 218 transitions. [2018-01-30 00:19:29,921 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 218 transitions. Word has length 54 [2018-01-30 00:19:29,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:19:29,921 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 218 transitions. [2018-01-30 00:19:29,921 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 00:19:29,921 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 218 transitions. [2018-01-30 00:19:29,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-30 00:19:29,922 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:19:29,922 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:19:29,922 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:19:29,922 INFO L82 PathProgramCache]: Analyzing trace with hash 407930235, now seen corresponding path program 1 times [2018-01-30 00:19:29,922 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:19:29,922 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:19:29,924 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:29,924 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:19:29,924 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:29,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:19:29,932 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:19:30,030 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 00:19:30,030 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:19:30,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:19:30,031 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:19:30,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:19:30,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:19:30,031 INFO L87 Difference]: Start difference. First operand 209 states and 218 transitions. Second operand 6 states. [2018-01-30 00:19:30,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:19:30,066 INFO L93 Difference]: Finished difference Result 213 states and 221 transitions. [2018-01-30 00:19:30,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:19:30,067 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-01-30 00:19:30,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:19:30,069 INFO L225 Difference]: With dead ends: 213 [2018-01-30 00:19:30,069 INFO L226 Difference]: Without dead ends: 183 [2018-01-30 00:19:30,069 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:19:30,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-01-30 00:19:30,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-01-30 00:19:30,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-01-30 00:19:30,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 190 transitions. [2018-01-30 00:19:30,085 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 190 transitions. Word has length 55 [2018-01-30 00:19:30,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:19:30,086 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 190 transitions. [2018-01-30 00:19:30,086 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:19:30,086 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 190 transitions. [2018-01-30 00:19:30,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-30 00:19:30,087 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:19:30,087 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1] [2018-01-30 00:19:30,087 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:19:30,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1897274958, now seen corresponding path program 1 times [2018-01-30 00:19:30,087 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:19:30,087 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:19:30,089 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:30,089 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:19:30,089 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:30,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:19:30,105 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:19:30,213 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-30 00:19:30,213 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:19:30,214 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-30 00:19:30,214 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-30 00:19:30,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-30 00:19:30,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-01-30 00:19:30,214 INFO L87 Difference]: Start difference. First operand 183 states and 190 transitions. Second operand 12 states. [2018-01-30 00:19:30,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:19:30,562 INFO L93 Difference]: Finished difference Result 183 states and 190 transitions. [2018-01-30 00:19:30,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-30 00:19:30,563 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-01-30 00:19:30,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:19:30,564 INFO L225 Difference]: With dead ends: 183 [2018-01-30 00:19:30,564 INFO L226 Difference]: Without dead ends: 181 [2018-01-30 00:19:30,564 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-01-30 00:19:30,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-01-30 00:19:30,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-01-30 00:19:30,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-01-30 00:19:30,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 188 transitions. [2018-01-30 00:19:30,576 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 188 transitions. Word has length 56 [2018-01-30 00:19:30,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:19:30,576 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 188 transitions. [2018-01-30 00:19:30,576 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-30 00:19:30,576 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 188 transitions. [2018-01-30 00:19:30,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-30 00:19:30,577 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:19:30,577 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1] [2018-01-30 00:19:30,577 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:19:30,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1897274959, now seen corresponding path program 1 times [2018-01-30 00:19:30,578 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:19:30,578 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:19:30,579 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:30,579 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:19:30,579 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:30,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:19:30,595 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:19:30,664 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:19:30,664 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:19:30,664 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:19:30,679 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:19:30,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:19:30,718 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:19:30,743 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:19:30,763 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:19:30,764 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-01-30 00:19:30,764 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 00:19:30,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 00:19:30,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:19:30,765 INFO L87 Difference]: Start difference. First operand 181 states and 188 transitions. Second operand 8 states. [2018-01-30 00:19:30,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:19:30,863 INFO L93 Difference]: Finished difference Result 330 states and 344 transitions. [2018-01-30 00:19:30,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:19:30,864 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2018-01-30 00:19:30,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:19:30,866 INFO L225 Difference]: With dead ends: 330 [2018-01-30 00:19:30,866 INFO L226 Difference]: Without dead ends: 188 [2018-01-30 00:19:30,867 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 56 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-01-30 00:19:30,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-01-30 00:19:30,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 185. [2018-01-30 00:19:30,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-30 00:19:30,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 192 transitions. [2018-01-30 00:19:30,884 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 192 transitions. Word has length 56 [2018-01-30 00:19:30,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:19:30,884 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 192 transitions. [2018-01-30 00:19:30,884 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 00:19:30,884 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 192 transitions. [2018-01-30 00:19:30,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-30 00:19:30,885 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:19:30,885 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1] [2018-01-30 00:19:30,885 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:19:30,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1277991663, now seen corresponding path program 2 times [2018-01-30 00:19:30,886 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:19:30,886 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:19:30,888 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:30,888 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:19:30,888 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:30,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:19:30,905 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:19:31,000 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:19:31,000 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:19:31,000 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:19:31,009 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:19:31,030 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:19:31,034 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:19:31,039 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:19:31,056 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-01-30 00:19:31,057 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:19:31,117 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-01-30 00:19:31,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:19:31,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-30 00:19:31,131 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-30 00:19:31,669 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-01-30 00:19:31,689 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 00:19:31,689 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 22 [2018-01-30 00:19:31,689 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-30 00:19:31,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-30 00:19:31,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2018-01-30 00:19:31,690 INFO L87 Difference]: Start difference. First operand 185 states and 192 transitions. Second operand 22 states. [2018-01-30 00:19:32,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:19:32,895 INFO L93 Difference]: Finished difference Result 332 states and 348 transitions. [2018-01-30 00:19:32,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-30 00:19:32,895 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 60 [2018-01-30 00:19:32,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:19:32,896 INFO L225 Difference]: With dead ends: 332 [2018-01-30 00:19:32,896 INFO L226 Difference]: Without dead ends: 190 [2018-01-30 00:19:32,897 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=152, Invalid=904, Unknown=0, NotChecked=0, Total=1056 [2018-01-30 00:19:32,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-01-30 00:19:32,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2018-01-30 00:19:32,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-01-30 00:19:32,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 194 transitions. [2018-01-30 00:19:32,913 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 194 transitions. Word has length 60 [2018-01-30 00:19:32,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:19:32,914 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 194 transitions. [2018-01-30 00:19:32,914 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-30 00:19:32,914 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 194 transitions. [2018-01-30 00:19:32,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-01-30 00:19:32,915 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:19:32,915 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 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] [2018-01-30 00:19:32,915 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:19:32,915 INFO L82 PathProgramCache]: Analyzing trace with hash 31187167, now seen corresponding path program 1 times [2018-01-30 00:19:32,916 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:19:32,916 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:19:32,917 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:32,917 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:19:32,917 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:32,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:19:32,932 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:19:33,009 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-01-30 00:19:33,009 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:19:33,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-30 00:19:33,010 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 00:19:33,010 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 00:19:33,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:19:33,010 INFO L87 Difference]: Start difference. First operand 187 states and 194 transitions. Second operand 8 states. [2018-01-30 00:19:33,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:19:33,090 INFO L93 Difference]: Finished difference Result 305 states and 316 transitions. [2018-01-30 00:19:33,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 00:19:33,091 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2018-01-30 00:19:33,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:19:33,092 INFO L225 Difference]: With dead ends: 305 [2018-01-30 00:19:33,092 INFO L226 Difference]: Without dead ends: 187 [2018-01-30 00:19:33,093 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-01-30 00:19:33,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-01-30 00:19:33,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-01-30 00:19:33,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-01-30 00:19:33,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 193 transitions. [2018-01-30 00:19:33,112 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 193 transitions. Word has length 72 [2018-01-30 00:19:33,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:19:33,112 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 193 transitions. [2018-01-30 00:19:33,112 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 00:19:33,112 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 193 transitions. [2018-01-30 00:19:33,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-01-30 00:19:33,113 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:19:33,113 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 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] [2018-01-30 00:19:33,113 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:19:33,114 INFO L82 PathProgramCache]: Analyzing trace with hash -605147406, now seen corresponding path program 1 times [2018-01-30 00:19:33,114 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:19:33,114 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:19:33,115 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:33,115 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:19:33,115 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:33,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:19:33,129 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:19:33,205 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-01-30 00:19:33,205 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:19:33,205 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-30 00:19:33,206 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-30 00:19:33,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-30 00:19:33,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:19:33,206 INFO L87 Difference]: Start difference. First operand 187 states and 193 transitions. Second operand 10 states. [2018-01-30 00:19:33,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:19:33,321 INFO L93 Difference]: Finished difference Result 307 states and 317 transitions. [2018-01-30 00:19:33,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 00:19:33,322 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2018-01-30 00:19:33,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:19:33,323 INFO L225 Difference]: With dead ends: 307 [2018-01-30 00:19:33,323 INFO L226 Difference]: Without dead ends: 187 [2018-01-30 00:19:33,324 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-01-30 00:19:33,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-01-30 00:19:33,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-01-30 00:19:33,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-01-30 00:19:33,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 192 transitions. [2018-01-30 00:19:33,346 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 192 transitions. Word has length 77 [2018-01-30 00:19:33,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:19:33,346 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 192 transitions. [2018-01-30 00:19:33,346 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-30 00:19:33,346 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 192 transitions. [2018-01-30 00:19:33,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-01-30 00:19:33,347 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:19:33,348 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:19:33,348 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:19:33,348 INFO L82 PathProgramCache]: Analyzing trace with hash 506176770, now seen corresponding path program 1 times [2018-01-30 00:19:33,348 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:19:33,348 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:19:33,349 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:33,349 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:19:33,350 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:19:33,370 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:19:33,648 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-01-30 00:19:33,648 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:19:33,648 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-01-30 00:19:33,649 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-30 00:19:33,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-30 00:19:33,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-01-30 00:19:33,649 INFO L87 Difference]: Start difference. First operand 187 states and 192 transitions. Second operand 17 states. [2018-01-30 00:19:34,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:19:34,644 INFO L93 Difference]: Finished difference Result 187 states and 192 transitions. [2018-01-30 00:19:34,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-30 00:19:34,644 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 88 [2018-01-30 00:19:34,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:19:34,645 INFO L225 Difference]: With dead ends: 187 [2018-01-30 00:19:34,645 INFO L226 Difference]: Without dead ends: 185 [2018-01-30 00:19:34,646 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=537, Unknown=0, NotChecked=0, Total=600 [2018-01-30 00:19:34,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-01-30 00:19:34,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-01-30 00:19:34,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-30 00:19:34,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 190 transitions. [2018-01-30 00:19:34,658 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 190 transitions. Word has length 88 [2018-01-30 00:19:34,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:19:34,658 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 190 transitions. [2018-01-30 00:19:34,658 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-30 00:19:34,658 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 190 transitions. [2018-01-30 00:19:34,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-01-30 00:19:34,659 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:19:34,659 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:19:34,659 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:19:34,660 INFO L82 PathProgramCache]: Analyzing trace with hash 506176771, now seen corresponding path program 1 times [2018-01-30 00:19:34,660 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:19:34,660 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:19:34,661 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:34,661 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:19:34,661 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:34,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:19:34,678 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:19:34,876 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:19:34,877 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:19:34,877 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:19:34,895 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:19:34,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:19:34,945 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:19:35,017 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:19:35,037 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:19:35,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-01-30 00:19:35,038 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-30 00:19:35,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-30 00:19:35,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:19:35,038 INFO L87 Difference]: Start difference. First operand 185 states and 190 transitions. Second operand 10 states. [2018-01-30 00:19:35,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:19:35,123 INFO L93 Difference]: Finished difference Result 330 states and 340 transitions. [2018-01-30 00:19:35,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 00:19:35,123 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2018-01-30 00:19:35,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:19:35,124 INFO L225 Difference]: With dead ends: 330 [2018-01-30 00:19:35,124 INFO L226 Difference]: Without dead ends: 192 [2018-01-30 00:19:35,125 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-01-30 00:19:35,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-01-30 00:19:35,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2018-01-30 00:19:35,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-01-30 00:19:35,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 194 transitions. [2018-01-30 00:19:35,137 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 194 transitions. Word has length 88 [2018-01-30 00:19:35,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:19:35,137 INFO L432 AbstractCegarLoop]: Abstraction has 189 states and 194 transitions. [2018-01-30 00:19:35,137 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-30 00:19:35,137 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 194 transitions. [2018-01-30 00:19:35,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-01-30 00:19:35,138 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:19:35,139 INFO L350 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:19:35,139 INFO L371 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:19:35,139 INFO L82 PathProgramCache]: Analyzing trace with hash -2016582715, now seen corresponding path program 2 times [2018-01-30 00:19:35,139 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:19:35,139 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:19:35,140 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:35,140 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:19:35,140 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:35,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:19:35,154 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:19:35,387 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:19:35,387 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:19:35,388 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:19:35,396 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:19:35,426 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:19:35,430 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:19:35,435 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:19:35,441 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-01-30 00:19:35,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:19:35,454 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-01-30 00:19:35,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:19:35,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-30 00:19:35,466 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-30 00:19:36,429 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-01-30 00:19:36,449 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 00:19:36,449 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [10] total 29 [2018-01-30 00:19:36,449 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-30 00:19:36,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-30 00:19:36,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=705, Unknown=0, NotChecked=0, Total=812 [2018-01-30 00:19:36,450 INFO L87 Difference]: Start difference. First operand 189 states and 194 transitions. Second operand 29 states. [2018-01-30 00:19:38,780 WARN L143 SmtUtils]: Spent 2021ms on a formula simplification that was a NOOP. DAG size: 31 [2018-01-30 00:19:40,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:19:40,144 INFO L93 Difference]: Finished difference Result 332 states and 344 transitions. [2018-01-30 00:19:40,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-30 00:19:40,189 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 92 [2018-01-30 00:19:40,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:19:40,190 INFO L225 Difference]: With dead ends: 332 [2018-01-30 00:19:40,190 INFO L226 Difference]: Without dead ends: 194 [2018-01-30 00:19:40,191 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=238, Invalid=1742, Unknown=0, NotChecked=0, Total=1980 [2018-01-30 00:19:40,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-01-30 00:19:40,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2018-01-30 00:19:40,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-01-30 00:19:40,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 196 transitions. [2018-01-30 00:19:40,204 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 196 transitions. Word has length 92 [2018-01-30 00:19:40,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:19:40,204 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 196 transitions. [2018-01-30 00:19:40,204 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-30 00:19:40,204 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 196 transitions. [2018-01-30 00:19:40,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-01-30 00:19:40,205 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:19:40,206 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:19:40,206 INFO L371 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:19:40,206 INFO L82 PathProgramCache]: Analyzing trace with hash -559271400, now seen corresponding path program 1 times [2018-01-30 00:19:40,206 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:19:40,206 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:19:40,207 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:40,207 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:19:40,207 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:19:40,221 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:19:40,379 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-01-30 00:19:40,380 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:19:40,380 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-30 00:19:40,380 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-30 00:19:40,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-30 00:19:40,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-01-30 00:19:40,380 INFO L87 Difference]: Start difference. First operand 191 states and 196 transitions. Second operand 13 states. [2018-01-30 00:19:40,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:19:40,470 INFO L93 Difference]: Finished difference Result 275 states and 283 transitions. [2018-01-30 00:19:40,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-30 00:19:40,470 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 112 [2018-01-30 00:19:40,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:19:40,472 INFO L225 Difference]: With dead ends: 275 [2018-01-30 00:19:40,472 INFO L226 Difference]: Without dead ends: 191 [2018-01-30 00:19:40,472 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-01-30 00:19:40,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-01-30 00:19:40,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-01-30 00:19:40,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-01-30 00:19:40,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 195 transitions. [2018-01-30 00:19:40,488 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 195 transitions. Word has length 112 [2018-01-30 00:19:40,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:19:40,488 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 195 transitions. [2018-01-30 00:19:40,488 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-30 00:19:40,488 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 195 transitions. [2018-01-30 00:19:40,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-01-30 00:19:40,489 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:19:40,489 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:19:40,490 INFO L371 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:19:40,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1320811839, now seen corresponding path program 1 times [2018-01-30 00:19:40,490 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:19:40,490 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:19:40,491 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:40,491 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:19:40,491 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:40,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:19:40,518 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:19:40,672 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:19:40,673 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:19:40,673 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:19:40,682 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:19:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:19:40,755 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:19:40,781 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:19:40,818 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:19:40,819 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-01-30 00:19:40,819 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-30 00:19:40,819 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-30 00:19:40,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-01-30 00:19:40,820 INFO L87 Difference]: Start difference. First operand 191 states and 195 transitions. Second operand 12 states. [2018-01-30 00:19:41,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:19:41,066 INFO L93 Difference]: Finished difference Result 334 states and 342 transitions. [2018-01-30 00:19:41,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 00:19:41,067 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 130 [2018-01-30 00:19:41,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:19:41,068 INFO L225 Difference]: With dead ends: 334 [2018-01-30 00:19:41,068 INFO L226 Difference]: Without dead ends: 198 [2018-01-30 00:19:41,068 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2018-01-30 00:19:41,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-01-30 00:19:41,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 195. [2018-01-30 00:19:41,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-01-30 00:19:41,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 199 transitions. [2018-01-30 00:19:41,083 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 199 transitions. Word has length 130 [2018-01-30 00:19:41,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:19:41,083 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 199 transitions. [2018-01-30 00:19:41,083 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-30 00:19:41,083 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 199 transitions. [2018-01-30 00:19:41,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-01-30 00:19:41,084 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:19:41,084 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:19:41,084 INFO L371 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:19:41,085 INFO L82 PathProgramCache]: Analyzing trace with hash -848285949, now seen corresponding path program 2 times [2018-01-30 00:19:41,085 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:19:41,085 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:19:41,086 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:41,086 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:19:41,086 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:19:41,105 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:19:41,258 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:19:41,258 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:19:41,258 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:19:41,279 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:19:41,325 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:19:41,331 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:19:41,338 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:19:41,343 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-01-30 00:19:41,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:19:41,357 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-01-30 00:19:41,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:19:41,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-30 00:19:41,402 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-30 00:19:42,478 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-01-30 00:19:42,498 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 00:19:42,498 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [12] total 33 [2018-01-30 00:19:42,499 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-30 00:19:42,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-30 00:19:42,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=922, Unknown=0, NotChecked=0, Total=1056 [2018-01-30 00:19:42,500 INFO L87 Difference]: Start difference. First operand 195 states and 199 transitions. Second operand 33 states. [2018-01-30 00:19:45,088 WARN L143 SmtUtils]: Spent 2023ms on a formula simplification that was a NOOP. DAG size: 35 [2018-01-30 00:19:46,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:19:46,438 INFO L93 Difference]: Finished difference Result 336 states and 346 transitions. [2018-01-30 00:19:46,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-01-30 00:19:46,439 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 134 [2018-01-30 00:19:46,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:19:46,440 INFO L225 Difference]: With dead ends: 336 [2018-01-30 00:19:46,441 INFO L226 Difference]: Without dead ends: 200 [2018-01-30 00:19:46,441 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 111 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=311, Invalid=2341, Unknown=0, NotChecked=0, Total=2652 [2018-01-30 00:19:46,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-01-30 00:19:46,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2018-01-30 00:19:46,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-01-30 00:19:46,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 201 transitions. [2018-01-30 00:19:46,482 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 201 transitions. Word has length 134 [2018-01-30 00:19:46,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:19:46,482 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 201 transitions. [2018-01-30 00:19:46,482 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-30 00:19:46,482 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 201 transitions. [2018-01-30 00:19:46,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-01-30 00:19:46,483 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:19:46,484 INFO L350 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:19:46,484 INFO L371 AbstractCegarLoop]: === Iteration 23 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:19:46,484 INFO L82 PathProgramCache]: Analyzing trace with hash 877029956, now seen corresponding path program 1 times [2018-01-30 00:19:46,484 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:19:46,484 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:19:46,485 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:46,485 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:19:46,485 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:46,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:19:46,511 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:19:46,956 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-01-30 00:19:46,956 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:19:46,956 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-01-30 00:19:46,956 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-30 00:19:46,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-30 00:19:46,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2018-01-30 00:19:46,957 INFO L87 Difference]: Start difference. First operand 197 states and 201 transitions. Second operand 22 states. [2018-01-30 00:19:47,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:19:47,393 INFO L93 Difference]: Finished difference Result 236 states and 246 transitions. [2018-01-30 00:19:47,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-30 00:19:47,393 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 138 [2018-01-30 00:19:47,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:19:47,395 INFO L225 Difference]: With dead ends: 236 [2018-01-30 00:19:47,395 INFO L226 Difference]: Without dead ends: 234 [2018-01-30 00:19:47,396 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2018-01-30 00:19:47,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-01-30 00:19:47,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 230. [2018-01-30 00:19:47,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-01-30 00:19:47,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 238 transitions. [2018-01-30 00:19:47,417 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 238 transitions. Word has length 138 [2018-01-30 00:19:47,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:19:47,417 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 238 transitions. [2018-01-30 00:19:47,417 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-30 00:19:47,417 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 238 transitions. [2018-01-30 00:19:47,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-01-30 00:19:47,418 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:19:47,418 INFO L350 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:19:47,418 INFO L371 AbstractCegarLoop]: === Iteration 24 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:19:47,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1488281606, now seen corresponding path program 1 times [2018-01-30 00:19:47,419 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:19:47,419 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:19:47,419 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:47,419 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:19:47,419 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:47,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:19:47,434 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:19:47,567 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-01-30 00:19:47,568 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:19:47,568 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:19:47,573 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:19:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:19:47,614 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:19:47,739 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 00:19:47,759 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:19:47,759 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-01-30 00:19:47,760 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-30 00:19:47,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-30 00:19:47,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2018-01-30 00:19:47,760 INFO L87 Difference]: Start difference. First operand 230 states and 238 transitions. Second operand 24 states. [2018-01-30 00:19:48,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:19:48,109 INFO L93 Difference]: Finished difference Result 408 states and 424 transitions. [2018-01-30 00:19:48,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-30 00:19:48,109 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 138 [2018-01-30 00:19:48,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:19:48,111 INFO L225 Difference]: With dead ends: 408 [2018-01-30 00:19:48,111 INFO L226 Difference]: Without dead ends: 235 [2018-01-30 00:19:48,111 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2018-01-30 00:19:48,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-01-30 00:19:48,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 232. [2018-01-30 00:19:48,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-01-30 00:19:48,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 238 transitions. [2018-01-30 00:19:48,132 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 238 transitions. Word has length 138 [2018-01-30 00:19:48,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:19:48,132 INFO L432 AbstractCegarLoop]: Abstraction has 232 states and 238 transitions. [2018-01-30 00:19:48,132 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-30 00:19:48,132 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 238 transitions. [2018-01-30 00:19:48,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-01-30 00:19:48,133 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:19:48,133 INFO L350 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-30 00:19:48,133 INFO L371 AbstractCegarLoop]: === Iteration 25 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:19:48,133 INFO L82 PathProgramCache]: Analyzing trace with hash 650404191, now seen corresponding path program 1 times [2018-01-30 00:19:48,133 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:19:48,133 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:19:48,134 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:48,134 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:19:48,134 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:48,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:19:48,152 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:19:48,664 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-01-30 00:19:48,665 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:19:48,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2018-01-30 00:19:48,665 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-30 00:19:48,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-30 00:19:48,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-01-30 00:19:48,666 INFO L87 Difference]: Start difference. First operand 232 states and 238 transitions. Second operand 27 states. [2018-01-30 00:19:49,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:19:49,238 INFO L93 Difference]: Finished difference Result 248 states and 258 transitions. [2018-01-30 00:19:49,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-30 00:19:49,239 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 161 [2018-01-30 00:19:49,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:19:49,240 INFO L225 Difference]: With dead ends: 248 [2018-01-30 00:19:49,240 INFO L226 Difference]: Without dead ends: 246 [2018-01-30 00:19:49,241 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=1451, Unknown=0, NotChecked=0, Total=1560 [2018-01-30 00:19:49,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-01-30 00:19:49,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 241. [2018-01-30 00:19:49,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-01-30 00:19:49,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 251 transitions. [2018-01-30 00:19:49,263 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 251 transitions. Word has length 161 [2018-01-30 00:19:49,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:19:49,264 INFO L432 AbstractCegarLoop]: Abstraction has 241 states and 251 transitions. [2018-01-30 00:19:49,264 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-30 00:19:49,264 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 251 transitions. [2018-01-30 00:19:49,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-01-30 00:19:49,265 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:19:49,265 INFO L350 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-30 00:19:49,265 INFO L371 AbstractCegarLoop]: === Iteration 26 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:19:49,265 INFO L82 PathProgramCache]: Analyzing trace with hash 650404192, now seen corresponding path program 1 times [2018-01-30 00:19:49,265 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:19:49,265 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:19:49,266 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:49,266 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:19:49,266 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:49,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:19:49,284 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:19:49,506 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:19:49,506 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:19:49,506 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:19:49,513 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:19:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:19:49,578 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:19:49,597 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:19:49,617 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:19:49,618 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-01-30 00:19:49,618 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-30 00:19:49,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-30 00:19:49,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-01-30 00:19:49,619 INFO L87 Difference]: Start difference. First operand 241 states and 251 transitions. Second operand 15 states. [2018-01-30 00:19:49,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:19:49,755 INFO L93 Difference]: Finished difference Result 422 states and 442 transitions. [2018-01-30 00:19:49,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-30 00:19:49,756 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 161 [2018-01-30 00:19:49,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:19:49,757 INFO L225 Difference]: With dead ends: 422 [2018-01-30 00:19:49,757 INFO L226 Difference]: Without dead ends: 248 [2018-01-30 00:19:49,757 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=143, Unknown=0, NotChecked=0, Total=240 [2018-01-30 00:19:49,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-01-30 00:19:49,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 245. [2018-01-30 00:19:49,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-01-30 00:19:49,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 255 transitions. [2018-01-30 00:19:49,779 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 255 transitions. Word has length 161 [2018-01-30 00:19:49,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:19:49,780 INFO L432 AbstractCegarLoop]: Abstraction has 245 states and 255 transitions. [2018-01-30 00:19:49,780 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-30 00:19:49,780 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 255 transitions. [2018-01-30 00:19:49,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-01-30 00:19:49,780 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:19:49,780 INFO L350 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-30 00:19:49,781 INFO L371 AbstractCegarLoop]: === Iteration 27 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:19:49,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1824861406, now seen corresponding path program 2 times [2018-01-30 00:19:49,781 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:19:49,781 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:19:49,781 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:49,782 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:19:49,782 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:19:49,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:19:49,801 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:19:50,024 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:19:50,024 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:19:50,024 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:19:50,030 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:19:50,070 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:19:50,076 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:19:50,081 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:19:50,085 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-01-30 00:19:50,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:19:50,097 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-01-30 00:19:50,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:19:50,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-30 00:19:50,108 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-30 00:19:52,218 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((v_ldv_kobject_create_~kobj~27.base_BEFORE_CALL_9 Int) (v_prenex_25 Int)) (let ((.cse0 (mod v_prenex_25 4294967296))) (and (< 2147483647 .cse0) (= .cse0 (+ (select |c_#length| v_ldv_kobject_create_~kobj~27.base_BEFORE_CALL_9) 4294967296))))) (exists ((v_prenex_27 Int) (ldv_malloc_~size Int)) (let ((.cse1 (mod ldv_malloc_~size 4294967296))) (and (= (select |c_#length| v_prenex_27) .cse1) (<= .cse1 2147483647))))) is different from true [2018-01-30 00:19:53,416 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-01-30 00:19:53,436 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 00:19:53,436 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [15] total 42 [2018-01-30 00:19:53,436 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-01-30 00:19:53,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-01-30 00:19:53,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1475, Unknown=1, NotChecked=78, Total=1722 [2018-01-30 00:19:53,437 INFO L87 Difference]: Start difference. First operand 245 states and 255 transitions. Second operand 42 states. [2018-01-30 00:19:55,789 WARN L143 SmtUtils]: Spent 2026ms on a formula simplification that was a NOOP. DAG size: 35 [2018-01-30 00:19:58,046 WARN L143 SmtUtils]: Spent 2030ms on a formula simplification that was a NOOP. DAG size: 35 [2018-01-30 00:20:00,213 WARN L143 SmtUtils]: Spent 2029ms on a formula simplification that was a NOOP. DAG size: 36 [2018-01-30 00:20:02,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:02,377 INFO L93 Difference]: Finished difference Result 424 states and 446 transitions. [2018-01-30 00:20:02,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-01-30 00:20:02,377 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 165 [2018-01-30 00:20:02,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:02,378 INFO L225 Difference]: With dead ends: 424 [2018-01-30 00:20:02,379 INFO L226 Difference]: Without dead ends: 250 [2018-01-30 00:20:02,380 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 134 SyntacticMatches, 5 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1042 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=424, Invalid=4001, Unknown=1, NotChecked=130, Total=4556 [2018-01-30 00:20:02,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-01-30 00:20:02,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 247. [2018-01-30 00:20:02,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-01-30 00:20:02,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 256 transitions. [2018-01-30 00:20:02,418 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 256 transitions. Word has length 165 [2018-01-30 00:20:02,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:02,418 INFO L432 AbstractCegarLoop]: Abstraction has 247 states and 256 transitions. [2018-01-30 00:20:02,418 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-01-30 00:20:02,418 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 256 transitions. [2018-01-30 00:20:02,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-01-30 00:20:02,419 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:02,419 INFO L350 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-30 00:20:02,420 INFO L371 AbstractCegarLoop]: === Iteration 28 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:20:02,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1297898285, now seen corresponding path program 1 times [2018-01-30 00:20:02,420 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:02,420 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:02,421 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:02,421 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:20:02,421 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:02,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:02,446 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:02,786 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:20:02,787 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:20:02,787 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:20:02,792 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:02,855 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:20:02,910 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:20:02,935 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:20:02,935 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-01-30 00:20:02,938 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-30 00:20:02,938 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-30 00:20:02,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-01-30 00:20:02,939 INFO L87 Difference]: Start difference. First operand 247 states and 256 transitions. Second operand 17 states. [2018-01-30 00:20:03,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:03,070 INFO L93 Difference]: Finished difference Result 426 states and 444 transitions. [2018-01-30 00:20:03,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-30 00:20:03,070 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 174 [2018-01-30 00:20:03,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:03,071 INFO L225 Difference]: With dead ends: 426 [2018-01-30 00:20:03,071 INFO L226 Difference]: Without dead ends: 254 [2018-01-30 00:20:03,072 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=180, Unknown=0, NotChecked=0, Total=306 [2018-01-30 00:20:03,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-01-30 00:20:03,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 251. [2018-01-30 00:20:03,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-01-30 00:20:03,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 260 transitions. [2018-01-30 00:20:03,113 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 260 transitions. Word has length 174 [2018-01-30 00:20:03,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:03,113 INFO L432 AbstractCegarLoop]: Abstraction has 251 states and 260 transitions. [2018-01-30 00:20:03,114 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-30 00:20:03,114 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 260 transitions. [2018-01-30 00:20:03,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-01-30 00:20:03,114 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:03,115 INFO L350 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-30 00:20:03,115 INFO L371 AbstractCegarLoop]: === Iteration 29 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:20:03,115 INFO L82 PathProgramCache]: Analyzing trace with hash -781800337, now seen corresponding path program 2 times [2018-01-30 00:20:03,115 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:03,115 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:03,116 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:03,116 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:03,116 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:03,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:03,142 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:03,560 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:20:03,560 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:20:03,560 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:20:03,572 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:20:03,664 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:20:03,679 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:20:03,691 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:20:03,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-30 00:20:03,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 00:20:03,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:20:03,809 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:20:03,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:20:03,810 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-01-30 00:20:03,898 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:20:03,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:20:03,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-30 00:20:03,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:26 [2018-01-30 00:20:03,907 WARN L1033 $PredicateComparison]: unable to prove that (exists ((LDV_INIT_LIST_HEAD_~list.offset Int) (v_DerPreprocessor_2 Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (let ((.cse0 (+ LDV_INIT_LIST_HEAD_~list.offset 4))) (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) LDV_INIT_LIST_HEAD_~list.offset v_DerPreprocessor_2) .cse0 (select (select |c_#memory_int| |c_LDV_INIT_LIST_HEAD_#in~list.base|) .cse0))))) (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) is different from true [2018-01-30 00:20:03,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2018-01-30 00:20:03,920 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:03,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-01-30 00:20:03,926 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:03,927 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:03,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-01-30 00:20:03,932 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:20:03,938 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:20:03,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:20:03,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:20:03,946 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:37, output treesize:9 [2018-01-30 00:20:04,638 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:04,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 36 [2018-01-30 00:20:04,641 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 00:20:04,641 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:04,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2018-01-30 00:20:04,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:20:04,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:20:04,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:20:04,647 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:13 [2018-01-30 00:20:05,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-01-30 00:20:05,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 13 treesize of output 5 [2018-01-30 00:20:05,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:20:05,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:20:05,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:20:05,246 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-01-30 00:20:05,330 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-01-30 00:20:05,350 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 00:20:05,350 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [50] imperfect sequences [17] total 65 [2018-01-30 00:20:05,351 INFO L409 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-01-30 00:20:05,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-01-30 00:20:05,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=3796, Unknown=1, NotChecked=124, Total=4160 [2018-01-30 00:20:05,352 INFO L87 Difference]: Start difference. First operand 251 states and 260 transitions. Second operand 65 states. [2018-01-30 00:20:08,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:08,781 INFO L93 Difference]: Finished difference Result 420 states and 437 transitions. [2018-01-30 00:20:08,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-01-30 00:20:08,782 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 178 [2018-01-30 00:20:08,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:08,783 INFO L225 Difference]: With dead ends: 420 [2018-01-30 00:20:08,783 INFO L226 Difference]: Without dead ends: 248 [2018-01-30 00:20:08,785 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1594 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=406, Invalid=8339, Unknown=1, NotChecked=184, Total=8930 [2018-01-30 00:20:08,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-01-30 00:20:08,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 245. [2018-01-30 00:20:08,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-01-30 00:20:08,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 248 transitions. [2018-01-30 00:20:08,830 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 248 transitions. Word has length 178 [2018-01-30 00:20:08,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:08,830 INFO L432 AbstractCegarLoop]: Abstraction has 245 states and 248 transitions. [2018-01-30 00:20:08,830 INFO L433 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-01-30 00:20:08,830 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 248 transitions. [2018-01-30 00:20:08,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-01-30 00:20:08,832 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:08,832 INFO L350 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:20:08,832 INFO L371 AbstractCegarLoop]: === Iteration 30 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:20:08,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1588564862, now seen corresponding path program 1 times [2018-01-30 00:20:08,833 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:08,833 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:08,834 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:08,834 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:20:08,834 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:08,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:08,862 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:09,399 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-01-30 00:20:09,399 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:20:09,399 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:20:09,405 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:09,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:09,498 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:20:09,797 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-01-30 00:20:09,817 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:20:09,818 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 37 [2018-01-30 00:20:09,818 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-30 00:20:09,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-30 00:20:09,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1154, Unknown=0, NotChecked=0, Total=1332 [2018-01-30 00:20:09,819 INFO L87 Difference]: Start difference. First operand 245 states and 248 transitions. Second operand 37 states. [2018-01-30 00:20:11,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:11,330 INFO L93 Difference]: Finished difference Result 430 states and 436 transitions. [2018-01-30 00:20:11,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-01-30 00:20:11,330 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 197 [2018-01-30 00:20:11,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:11,332 INFO L225 Difference]: With dead ends: 430 [2018-01-30 00:20:11,332 INFO L226 Difference]: Without dead ends: 268 [2018-01-30 00:20:11,334 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=540, Invalid=4290, Unknown=0, NotChecked=0, Total=4830 [2018-01-30 00:20:11,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-01-30 00:20:11,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 252. [2018-01-30 00:20:11,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-01-30 00:20:11,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 254 transitions. [2018-01-30 00:20:11,378 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 254 transitions. Word has length 197 [2018-01-30 00:20:11,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:11,378 INFO L432 AbstractCegarLoop]: Abstraction has 252 states and 254 transitions. [2018-01-30 00:20:11,378 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-30 00:20:11,379 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 254 transitions. [2018-01-30 00:20:11,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-01-30 00:20:11,380 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:11,380 INFO L350 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:20:11,380 INFO L371 AbstractCegarLoop]: === Iteration 31 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:20:11,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1611558565, now seen corresponding path program 1 times [2018-01-30 00:20:11,380 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:11,380 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:11,381 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:11,381 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:11,381 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:11,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:11,411 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:11,949 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 446 trivial. 0 not checked. [2018-01-30 00:20:11,949 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:20:11,949 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:20:11,957 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:12,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:12,045 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:20:12,854 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-01-30 00:20:12,876 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:20:12,876 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 19] total 43 [2018-01-30 00:20:12,877 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-01-30 00:20:12,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-01-30 00:20:12,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1603, Unknown=0, NotChecked=0, Total=1806 [2018-01-30 00:20:12,878 INFO L87 Difference]: Start difference. First operand 252 states and 254 transitions. Second operand 43 states. [2018-01-30 00:20:14,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:14,740 INFO L93 Difference]: Finished difference Result 436 states and 441 transitions. [2018-01-30 00:20:14,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-01-30 00:20:14,741 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 220 [2018-01-30 00:20:14,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:14,742 INFO L225 Difference]: With dead ends: 436 [2018-01-30 00:20:14,742 INFO L226 Difference]: Without dead ends: 271 [2018-01-30 00:20:14,743 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=631, Invalid=6011, Unknown=0, NotChecked=0, Total=6642 [2018-01-30 00:20:14,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-01-30 00:20:14,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 255. [2018-01-30 00:20:14,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-01-30 00:20:14,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 257 transitions. [2018-01-30 00:20:14,787 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 257 transitions. Word has length 220 [2018-01-30 00:20:14,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:14,787 INFO L432 AbstractCegarLoop]: Abstraction has 255 states and 257 transitions. [2018-01-30 00:20:14,787 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-01-30 00:20:14,787 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 257 transitions. [2018-01-30 00:20:14,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-01-30 00:20:14,789 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:14,789 INFO L350 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-30 00:20:14,789 INFO L371 AbstractCegarLoop]: === Iteration 32 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:20:14,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1417048159, now seen corresponding path program 1 times [2018-01-30 00:20:14,790 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:14,790 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:14,791 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:14,791 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:14,791 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:14,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:14,929 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:22,727 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 46 proven. 462 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-01-30 00:20:22,727 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:20:22,769 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:20:22,774 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:22,864 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:20:23,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-30 00:20:23,033 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 12 treesize of output 11 [2018-01-30 00:20:23,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:20:23,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:20:23,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:20:23,039 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-01-30 00:20:23,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-01-30 00:20:23,190 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:23,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-01-30 00:20:23,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:20:23,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:20:23,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:20:23,201 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-01-30 00:20:23,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-01-30 00:20:23,392 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:23,394 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:23,395 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:23,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 52 [2018-01-30 00:20:23,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:20:23,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:20:23,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:20:23,418 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:43 [2018-01-30 00:20:23,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2018-01-30 00:20:23,716 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:23,725 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:23,730 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:23,733 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:23,735 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:23,736 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:23,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 85 [2018-01-30 00:20:23,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:20:23,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:20:23,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-30 00:20:23,765 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:59 [2018-01-30 00:20:24,013 WARN L143 SmtUtils]: Spent 116ms on a formula simplification that was a NOOP. DAG size: 32 [2018-01-30 00:20:24,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 47 [2018-01-30 00:20:24,156 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:24,157 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:24,158 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:24,160 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:24,161 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:24,162 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:24,162 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:24,163 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:24,164 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:24,165 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:24,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 126 [2018-01-30 00:20:24,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:20:24,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:20:24,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-30 00:20:24,203 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:79, output treesize:75 [2018-01-30 00:20:24,904 WARN L143 SmtUtils]: Spent 558ms on a formula simplification that was a NOOP. DAG size: 38 [2018-01-30 00:20:25,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2018-01-30 00:20:25,073 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:25,074 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:25,075 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:25,076 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:25,076 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:25,077 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:25,078 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:25,079 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:25,080 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:25,081 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:25,082 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:25,083 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:25,084 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:25,084 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:25,085 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:25,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 175 [2018-01-30 00:20:25,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:20:25,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:20:25,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-30 00:20:25,137 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:95, output treesize:91 [2018-01-30 00:20:26,824 WARN L143 SmtUtils]: Spent 1491ms on a formula simplification that was a NOOP. DAG size: 44 [2018-01-30 00:20:27,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 65 [2018-01-30 00:20:27,045 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:27,046 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:27,047 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:27,048 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:27,049 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:27,050 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:27,051 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:27,052 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:27,053 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:27,054 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:27,055 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:27,056 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:27,057 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:27,058 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:27,059 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:27,060 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:27,061 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:27,062 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:27,063 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:27,064 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:27,065 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:27,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 232 [2018-01-30 00:20:27,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:20:27,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:20:27,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-01-30 00:20:27,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:111, output treesize:107 [2018-01-30 00:20:28,007 WARN L143 SmtUtils]: Spent 664ms on a formula simplification that was a NOOP. DAG size: 50 [2018-01-30 00:20:28,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 74 [2018-01-30 00:20:28,809 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:28,809 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:28,810 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:28,811 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:28,812 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:28,813 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:28,813 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:28,814 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:28,815 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:28,816 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:28,816 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:28,817 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:28,818 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:28,819 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:28,820 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:28,820 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:28,821 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:28,822 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:28,823 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:28,823 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:28,824 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:28,825 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:28,826 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:28,826 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:28,827 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:28,828 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:28,829 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:28,829 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:28,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 297 [2018-01-30 00:20:28,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:20:28,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:20:28,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-01-30 00:20:28,939 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:127, output treesize:123 [2018-01-30 00:20:30,866 WARN L143 SmtUtils]: Spent 1212ms on a formula simplification that was a NOOP. DAG size: 56 [2018-01-30 00:20:39,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 83 [2018-01-30 00:20:39,792 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:39,793 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:39,794 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:39,795 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:39,797 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:39,798 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:39,799 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:39,801 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:39,802 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:39,803 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:39,804 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:39,805 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:39,806 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:39,807 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:39,808 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:39,809 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:39,810 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:39,811 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:39,812 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:39,814 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:39,815 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:39,816 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:39,817 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:39,818 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:39,819 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:39,820 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:39,821 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:39,822 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:39,824 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:39,825 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:39,826 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:39,827 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:39,828 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:39,829 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:39,830 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:39,831 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:20:39,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 370 [2018-01-30 00:20:39,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:20:39,936 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:20:39,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-01-30 00:20:39,969 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:143, output treesize:139 [2018-01-30 00:20:49,233 WARN L143 SmtUtils]: Spent 2021ms on a formula simplification that was a NOOP. DAG size: 62 [2018-01-30 00:21:10,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 92 [2018-01-30 00:21:10,857 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:10,858 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:10,869 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:10,871 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:10,873 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:10,875 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:10,876 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:10,878 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:10,880 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:10,881 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:10,883 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:10,884 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:10,886 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:10,887 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:10,888 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:10,889 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:10,890 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:10,891 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:10,892 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:10,893 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:10,894 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:10,896 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:10,897 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:10,898 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:10,899 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:10,900 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:10,901 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:10,902 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:10,903 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:10,904 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:10,905 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:10,906 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:10,907 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:10,908 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:10,909 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:10,911 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:10,912 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:10,913 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:10,914 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:10,915 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:10,916 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:10,917 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:10,918 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:10,919 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:10,920 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:10,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 451 [2018-01-30 00:21:10,922 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:21:11,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:21:11,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-01-30 00:21:11,082 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:159, output treesize:155 Received shutdown request... [2018-01-30 00:21:29,615 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-30 00:21:29,615 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-30 00:21:29,619 WARN L185 ceAbstractionStarter]: Timeout [2018-01-30 00:21:29,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 12:21:29 BoogieIcfgContainer [2018-01-30 00:21:29,620 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 00:21:29,620 INFO L168 Benchmark]: Toolchain (without parser) took 130181.15 ms. Allocated memory was 305.7 MB in the beginning and 1.2 GB in the end (delta: 888.7 MB). Free memory was 264.7 MB in the beginning and 946.1 MB in the end (delta: -681.4 MB). Peak memory consumption was 207.3 MB. Max. memory is 5.3 GB. [2018-01-30 00:21:29,622 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 305.7 MB. Free memory is still 270.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 00:21:29,622 INFO L168 Benchmark]: CACSL2BoogieTranslator took 240.77 ms. Allocated memory is still 305.7 MB. Free memory was 264.7 MB in the beginning and 250.7 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:21:29,622 INFO L168 Benchmark]: Boogie Preprocessor took 37.01 ms. Allocated memory is still 305.7 MB. Free memory was 250.7 MB in the beginning and 246.7 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:21:29,623 INFO L168 Benchmark]: RCFGBuilder took 500.35 ms. Allocated memory is still 305.7 MB. Free memory was 246.7 MB in the beginning and 208.1 MB in the end (delta: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 5.3 GB. [2018-01-30 00:21:29,623 INFO L168 Benchmark]: TraceAbstraction took 129392.21 ms. Allocated memory was 305.7 MB in the beginning and 1.2 GB in the end (delta: 888.7 MB). Free memory was 208.1 MB in the beginning and 946.1 MB in the end (delta: -737.9 MB). Peak memory consumption was 150.7 MB. Max. memory is 5.3 GB. [2018-01-30 00:21:29,624 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 305.7 MB. Free memory is still 270.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 240.77 ms. Allocated memory is still 305.7 MB. Free memory was 264.7 MB in the beginning and 250.7 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.01 ms. Allocated memory is still 305.7 MB. Free memory was 250.7 MB in the beginning and 246.7 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 500.35 ms. Allocated memory is still 305.7 MB. Free memory was 246.7 MB in the beginning and 208.1 MB in the end (delta: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 129392.21 ms. Allocated memory was 305.7 MB in the beginning and 1.2 GB in the end (delta: 888.7 MB). Free memory was 208.1 MB in the beginning and 946.1 MB in the end (delta: -737.9 MB). Peak memory consumption was 150.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1294). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 100 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1294). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 100 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1411). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 100 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1411). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 100 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1265). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 100 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1265). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 100 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1267). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 100 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1267). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 100 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1256). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 100 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1256). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 100 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1258). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 100 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1258). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 100 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 100 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 100 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 100 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 100 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1339). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 100 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1339). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 100 known predicates. - TimeoutResultAtElement [Line: 1452]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1452). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 100 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1099). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 100 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1100). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 100 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1100). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 100 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1099). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 100 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 23 procedures, 184 locations, 23 error locations. TIMEOUT Result, 129.3s OverallTime, 32 OverallIterations, 16 TraceHistogramMax, 35.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5076 SDtfs, 2375 SDslu, 52416 SDs, 0 SdLazy, 22025 SolverSat, 418 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 15.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2504 GetRequests, 1744 SyntacticMatches, 11 SemanticMatches, 749 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 5611 ImplicationChecksByTransitivity, 29.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=255occurred in iteration=31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 31 MinimizatonAttempts, 200 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 16.2s InterpolantComputationTime, 4817 NumberOfCodeBlocks, 4641 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 4771 ConstructedInterpolants, 420 QuantifiedInterpolants, 2789395 SizeOfPredicates, 145 NumberOfNonLiveVariables, 6185 ConjunctsInSsa, 610 ConjunctsInUnsatCore, 46 InterpolantComputations, 22 PerfectInterpolantSequences, 2391/5394 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_00-21-29-631.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_00-21-29-631.csv Completed graceful shutdown