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_1_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 08:54:16,224 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 08:54:16,226 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 08:54:16,251 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 08:54:16,251 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 08:54:16,252 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 08:54:16,253 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 08:54:16,256 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 08:54:16,259 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 08:54:16,259 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 08:54:16,262 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 08:54:16,262 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 08:54:16,263 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 08:54:16,264 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 08:54:16,276 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 08:54:16,279 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 08:54:16,281 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 08:54:16,283 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 08:54:16,284 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 08:54:16,285 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 08:54:16,287 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 08:54:16,287 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 08:54:16,288 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 08:54:16,289 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 08:54:16,289 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 08:54:16,290 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 08:54:16,291 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 08:54:16,291 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 08:54:16,291 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 08:54:16,292 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 08:54:16,292 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 08:54:16,293 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-31 08:54:16,303 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 08:54:16,303 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 08:54:16,304 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 08:54:16,304 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 08:54:16,304 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 08:54:16,304 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 08:54:16,305 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 08:54:16,305 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 08:54:16,305 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 08:54:16,306 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 08:54:16,306 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 08:54:16,306 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 08:54:16,306 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 08:54:16,306 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 08:54:16,306 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 08:54:16,307 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 08:54:16,307 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 08:54:16,312 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 08:54:16,312 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 08:54:16,312 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 08:54:16,312 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 08:54:16,313 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 08:54:16,313 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 08:54:16,313 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:54:16,313 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 08:54:16,313 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 08:54:16,313 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 08:54:16,314 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 08:54:16,314 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 08:54:16,314 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 08:54:16,314 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 08:54:16,314 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 08:54:16,315 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 08:54:16,315 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 08:54:16,366 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 08:54:16,381 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 08:54:16,385 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 08:54:16,387 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 08:54:16,388 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 08:54:16,389 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_1_false-valid-memtrack_true-termination.i [2018-01-31 08:54:16,635 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 08:54:16,647 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 08:54:16,648 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 08:54:16,649 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 08:54:16,655 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 08:54:16,657 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:54:16" (1/1) ... [2018-01-31 08:54:16,660 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2888d76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:54:16, skipping insertion in model container [2018-01-31 08:54:16,661 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:54:16" (1/1) ... [2018-01-31 08:54:16,682 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:54:16,760 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:54:16,951 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:54:16,977 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:54:17,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:54:17 WrapperNode [2018-01-31 08:54:17,009 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 08:54:17,009 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 08:54:17,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 08:54:17,010 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 08:54:17,033 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:54:17" (1/1) ... [2018-01-31 08:54:17,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:54:17" (1/1) ... [2018-01-31 08:54:17,046 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:54:17" (1/1) ... [2018-01-31 08:54:17,047 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:54:17" (1/1) ... [2018-01-31 08:54:17,058 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:54:17" (1/1) ... [2018-01-31 08:54:17,062 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:54:17" (1/1) ... [2018-01-31 08:54:17,064 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:54:17" (1/1) ... [2018-01-31 08:54:17,068 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 08:54:17,068 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 08:54:17,069 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 08:54:17,069 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 08:54:17,070 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:54:17" (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-31 08:54:17,133 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 08:54:17,133 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 08:54:17,133 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-01-31 08:54:17,133 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-31 08:54:17,133 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-01-31 08:54:17,134 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2018-01-31 08:54:17,134 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-01-31 08:54:17,134 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-01-31 08:54:17,134 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-01-31 08:54:17,134 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2018-01-31 08:54:17,134 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-01-31 08:54:17,134 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-01-31 08:54:17,134 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-01-31 08:54:17,135 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-01-31 08:54:17,135 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2018-01-31 08:54:17,135 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-01-31 08:54:17,135 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-01-31 08:54:17,135 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-01-31 08:54:17,135 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-31 08:54:17,136 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 08:54:17,136 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-31 08:54:17,136 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-31 08:54:17,136 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 08:54:17,136 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 08:54:17,136 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 08:54:17,137 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 08:54:17,137 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 08:54:17,137 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-31 08:54:17,137 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-31 08:54:17,137 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-31 08:54:17,137 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-31 08:54:17,137 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 08:54:17,138 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-31 08:54:17,138 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-31 08:54:17,138 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-01-31 08:54:17,140 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2018-01-31 08:54:17,140 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-01-31 08:54:17,140 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-01-31 08:54:17,140 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-01-31 08:54:17,140 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-01-31 08:54:17,140 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2018-01-31 08:54:17,141 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-01-31 08:54:17,141 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-01-31 08:54:17,141 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-01-31 08:54:17,141 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-01-31 08:54:17,141 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2018-01-31 08:54:17,141 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-01-31 08:54:17,141 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-01-31 08:54:17,142 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-01-31 08:54:17,142 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-31 08:54:17,142 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 08:54:17,142 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 08:54:17,142 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 08:54:17,665 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-31 08:54:18,002 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 08:54:18,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:54:18 BoogieIcfgContainer [2018-01-31 08:54:18,003 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 08:54:18,004 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 08:54:18,004 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 08:54:18,007 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 08:54:18,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:54:16" (1/3) ... [2018-01-31 08:54:18,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eaac217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:54:18, skipping insertion in model container [2018-01-31 08:54:18,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:54:17" (2/3) ... [2018-01-31 08:54:18,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eaac217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:54:18, skipping insertion in model container [2018-01-31 08:54:18,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:54:18" (3/3) ... [2018-01-31 08:54:18,013 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test22_1_false-valid-memtrack_true-termination.i [2018-01-31 08:54:18,022 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 08:54:18,032 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-01-31 08:54:18,072 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 08:54:18,073 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 08:54:18,073 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 08:54:18,073 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 08:54:18,073 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 08:54:18,073 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 08:54:18,073 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 08:54:18,074 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 08:54:18,074 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 08:54:18,102 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states. [2018-01-31 08:54:18,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-31 08:54:18,111 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:18,115 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:54:18,115 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-31 08:54:18,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1627230509, now seen corresponding path program 1 times [2018-01-31 08:54:18,122 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:18,124 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:18,192 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:18,193 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:18,193 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:18,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:18,275 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:18,712 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-31 08:54:18,715 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:54:18,715 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:54:18,717 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:54:18,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:54:18,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:54:18,734 INFO L87 Difference]: Start difference. First operand 175 states. Second operand 5 states. [2018-01-31 08:54:18,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:18,869 INFO L93 Difference]: Finished difference Result 332 states and 347 transitions. [2018-01-31 08:54:18,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:54:18,871 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-31 08:54:18,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:18,887 INFO L225 Difference]: With dead ends: 332 [2018-01-31 08:54:18,887 INFO L226 Difference]: Without dead ends: 179 [2018-01-31 08:54:18,892 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:54:18,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-01-31 08:54:18,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2018-01-31 08:54:18,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-01-31 08:54:18,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 185 transitions. [2018-01-31 08:54:18,940 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 185 transitions. Word has length 22 [2018-01-31 08:54:18,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:18,941 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 185 transitions. [2018-01-31 08:54:18,941 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:54:18,941 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 185 transitions. [2018-01-31 08:54:18,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-31 08:54:18,942 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:18,942 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:54:18,942 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-31 08:54:18,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1951140373, now seen corresponding path program 1 times [2018-01-31 08:54:18,943 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:18,943 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:18,945 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:18,945 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:18,945 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:18,988 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:19,113 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-31 08:54:19,113 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:54:19,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:54:19,115 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:54:19,116 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:54:19,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:54:19,116 INFO L87 Difference]: Start difference. First operand 177 states and 185 transitions. Second operand 6 states. [2018-01-31 08:54:19,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:19,492 INFO L93 Difference]: Finished difference Result 180 states and 188 transitions. [2018-01-31 08:54:19,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:54:19,493 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-31 08:54:19,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:19,496 INFO L225 Difference]: With dead ends: 180 [2018-01-31 08:54:19,496 INFO L226 Difference]: Without dead ends: 179 [2018-01-31 08:54:19,497 INFO L554 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-31 08:54:19,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-01-31 08:54:19,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2018-01-31 08:54:19,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-01-31 08:54:19,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 184 transitions. [2018-01-31 08:54:19,517 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 184 transitions. Word has length 23 [2018-01-31 08:54:19,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:19,518 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 184 transitions. [2018-01-31 08:54:19,518 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:54:19,518 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 184 transitions. [2018-01-31 08:54:19,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-31 08:54:19,520 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:19,520 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:54:19,520 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-31 08:54:19,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1951140372, now seen corresponding path program 1 times [2018-01-31 08:54:19,521 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:19,521 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:19,523 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:19,523 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:19,523 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:19,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:19,547 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:20,032 WARN L146 SmtUtils]: Spent 350ms on a formula simplification. DAG size of input: 19 DAG size of output 17 [2018-01-31 08:54:20,293 WARN L146 SmtUtils]: Spent 209ms on a formula simplification. DAG size of input: 17 DAG size of output 15 [2018-01-31 08:54:20,406 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 17 DAG size of output 15 [2018-01-31 08:54:20,450 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-31 08:54:20,450 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:54:20,451 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:54:20,451 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 08:54:20,451 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 08:54:20,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:54:20,452 INFO L87 Difference]: Start difference. First operand 176 states and 184 transitions. Second operand 7 states. [2018-01-31 08:54:21,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:21,039 INFO L93 Difference]: Finished difference Result 179 states and 187 transitions. [2018-01-31 08:54:21,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:54:21,072 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-01-31 08:54:21,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:21,075 INFO L225 Difference]: With dead ends: 179 [2018-01-31 08:54:21,075 INFO L226 Difference]: Without dead ends: 178 [2018-01-31 08:54:21,075 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:54:21,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-01-31 08:54:21,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 175. [2018-01-31 08:54:21,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-01-31 08:54:21,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 183 transitions. [2018-01-31 08:54:21,094 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 183 transitions. Word has length 23 [2018-01-31 08:54:21,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:21,094 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 183 transitions. [2018-01-31 08:54:21,094 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 08:54:21,094 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 183 transitions. [2018-01-31 08:54:21,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-31 08:54:21,097 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:21,097 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:54:21,097 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-31 08:54:21,097 INFO L82 PathProgramCache]: Analyzing trace with hash -774558826, now seen corresponding path program 1 times [2018-01-31 08:54:21,097 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:21,097 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:21,099 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:21,099 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:21,099 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:21,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:21,118 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:21,346 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-31 08:54:21,346 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:54:21,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 08:54:21,347 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 08:54:21,347 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 08:54:21,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:54:21,347 INFO L87 Difference]: Start difference. First operand 175 states and 183 transitions. Second operand 7 states. [2018-01-31 08:54:21,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:21,538 INFO L93 Difference]: Finished difference Result 291 states and 303 transitions. [2018-01-31 08:54:21,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:54:21,541 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-01-31 08:54:21,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:21,545 INFO L225 Difference]: With dead ends: 291 [2018-01-31 08:54:21,545 INFO L226 Difference]: Without dead ends: 192 [2018-01-31 08:54:21,546 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:54:21,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-01-31 08:54:21,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 185. [2018-01-31 08:54:21,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-31 08:54:21,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 193 transitions. [2018-01-31 08:54:21,578 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 193 transitions. Word has length 36 [2018-01-31 08:54:21,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:21,578 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 193 transitions. [2018-01-31 08:54:21,579 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 08:54:21,579 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 193 transitions. [2018-01-31 08:54:21,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-31 08:54:21,580 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:21,580 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:54:21,580 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-31 08:54:21,581 INFO L82 PathProgramCache]: Analyzing trace with hash -2065483374, now seen corresponding path program 1 times [2018-01-31 08:54:21,581 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:21,581 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:21,583 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:21,583 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:21,583 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:21,605 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:21,764 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-31 08:54:21,764 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:54:21,764 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-31 08:54:21,765 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-31 08:54:21,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-31 08:54:21,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:54:21,765 INFO L87 Difference]: Start difference. First operand 185 states and 193 transitions. Second operand 10 states. [2018-01-31 08:54:22,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:22,220 INFO L93 Difference]: Finished difference Result 185 states and 193 transitions. [2018-01-31 08:54:22,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 08:54:22,225 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-01-31 08:54:22,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:22,227 INFO L225 Difference]: With dead ends: 185 [2018-01-31 08:54:22,228 INFO L226 Difference]: Without dead ends: 184 [2018-01-31 08:54:22,228 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-01-31 08:54:22,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-01-31 08:54:22,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-01-31 08:54:22,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-01-31 08:54:22,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 192 transitions. [2018-01-31 08:54:22,247 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 192 transitions. Word has length 39 [2018-01-31 08:54:22,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:22,247 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 192 transitions. [2018-01-31 08:54:22,248 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-31 08:54:22,248 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 192 transitions. [2018-01-31 08:54:22,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-31 08:54:22,249 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:22,249 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:54:22,249 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-31 08:54:22,250 INFO L82 PathProgramCache]: Analyzing trace with hash -2065483373, now seen corresponding path program 1 times [2018-01-31 08:54:22,250 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:22,250 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:22,252 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:22,253 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:22,253 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:22,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:22,298 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:22,470 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-31 08:54:22,471 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:54:22,471 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:54:22,471 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:54:22,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:54:22,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:54:22,472 INFO L87 Difference]: Start difference. First operand 184 states and 192 transitions. Second operand 4 states. [2018-01-31 08:54:22,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:22,799 INFO L93 Difference]: Finished difference Result 324 states and 338 transitions. [2018-01-31 08:54:22,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 08:54:22,799 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-01-31 08:54:22,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:22,801 INFO L225 Difference]: With dead ends: 324 [2018-01-31 08:54:22,801 INFO L226 Difference]: Without dead ends: 188 [2018-01-31 08:54:22,803 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:54:22,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-01-31 08:54:22,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 185. [2018-01-31 08:54:22,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-31 08:54:22,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 193 transitions. [2018-01-31 08:54:22,816 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 193 transitions. Word has length 39 [2018-01-31 08:54:22,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:22,817 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 193 transitions. [2018-01-31 08:54:22,817 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:54:22,817 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 193 transitions. [2018-01-31 08:54:22,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-31 08:54:22,818 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:22,819 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:54:22,819 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-31 08:54:22,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1097981657, now seen corresponding path program 1 times [2018-01-31 08:54:22,819 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:22,819 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:22,820 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:22,821 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:22,821 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:22,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:22,832 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:22,901 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-31 08:54:22,902 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:54:22,902 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 08:54:22,902 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 08:54:22,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 08:54:22,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:54:22,903 INFO L87 Difference]: Start difference. First operand 185 states and 193 transitions. Second operand 3 states. [2018-01-31 08:54:23,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:23,113 INFO L93 Difference]: Finished difference Result 208 states and 218 transitions. [2018-01-31 08:54:23,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 08:54:23,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-01-31 08:54:23,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:23,115 INFO L225 Difference]: With dead ends: 208 [2018-01-31 08:54:23,116 INFO L226 Difference]: Without dead ends: 204 [2018-01-31 08:54:23,116 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:54:23,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-01-31 08:54:23,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2018-01-31 08:54:23,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-01-31 08:54:23,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 214 transitions. [2018-01-31 08:54:23,133 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 214 transitions. Word has length 41 [2018-01-31 08:54:23,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:23,134 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 214 transitions. [2018-01-31 08:54:23,134 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 08:54:23,134 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 214 transitions. [2018-01-31 08:54:23,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-31 08:54:23,136 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:23,136 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:54:23,136 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-31 08:54:23,137 INFO L82 PathProgramCache]: Analyzing trace with hash -2110626927, now seen corresponding path program 1 times [2018-01-31 08:54:23,137 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:23,137 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:23,138 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:23,138 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:23,138 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:23,156 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:23,310 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-31 08:54:23,310 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:54:23,310 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-31 08:54:23,316 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:23,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:23,371 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:54:23,410 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-31 08:54:23,431 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:54:23,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-01-31 08:54:23,432 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:54:23,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:54:23,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:54:23,433 INFO L87 Difference]: Start difference. First operand 204 states and 214 transitions. Second operand 6 states. [2018-01-31 08:54:23,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:23,557 INFO L93 Difference]: Finished difference Result 358 states and 374 transitions. [2018-01-31 08:54:23,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 08:54:23,559 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2018-01-31 08:54:23,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:23,561 INFO L225 Difference]: With dead ends: 358 [2018-01-31 08:54:23,561 INFO L226 Difference]: Without dead ends: 211 [2018-01-31 08:54:23,562 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:54:23,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-01-31 08:54:23,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 208. [2018-01-31 08:54:23,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-01-31 08:54:23,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 218 transitions. [2018-01-31 08:54:23,591 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 218 transitions. Word has length 43 [2018-01-31 08:54:23,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:23,591 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 218 transitions. [2018-01-31 08:54:23,591 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:54:23,592 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 218 transitions. [2018-01-31 08:54:23,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-31 08:54:23,595 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:23,595 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:54:23,596 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-31 08:54:23,596 INFO L82 PathProgramCache]: Analyzing trace with hash 475599041, now seen corresponding path program 1 times [2018-01-31 08:54:23,596 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:23,596 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:23,597 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:23,597 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:23,597 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:23,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:23,625 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:23,682 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-31 08:54:23,683 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:54:23,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:54:23,683 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:54:23,683 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:54:23,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:54:23,684 INFO L87 Difference]: Start difference. First operand 208 states and 218 transitions. Second operand 6 states. [2018-01-31 08:54:23,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:23,781 INFO L93 Difference]: Finished difference Result 298 states and 309 transitions. [2018-01-31 08:54:23,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:54:23,782 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-01-31 08:54:23,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:23,783 INFO L225 Difference]: With dead ends: 298 [2018-01-31 08:54:23,784 INFO L226 Difference]: Without dead ends: 202 [2018-01-31 08:54:23,784 INFO L554 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-31 08:54:23,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-01-31 08:54:23,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2018-01-31 08:54:23,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-01-31 08:54:23,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 210 transitions. [2018-01-31 08:54:23,798 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 210 transitions. Word has length 42 [2018-01-31 08:54:23,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:23,798 INFO L432 AbstractCegarLoop]: Abstraction has 202 states and 210 transitions. [2018-01-31 08:54:23,798 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:54:23,798 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 210 transitions. [2018-01-31 08:54:23,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-31 08:54:23,800 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:23,800 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:54:23,800 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-31 08:54:23,800 INFO L82 PathProgramCache]: Analyzing trace with hash 483411827, now seen corresponding path program 1 times [2018-01-31 08:54:23,800 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:23,800 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:23,802 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:23,802 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:23,802 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:23,816 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:24,169 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-31 08:54:24,169 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:54:24,169 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 08:54:24,169 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 08:54:24,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 08:54:24,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:54:24,170 INFO L87 Difference]: Start difference. First operand 202 states and 210 transitions. Second operand 7 states. [2018-01-31 08:54:24,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:24,405 INFO L93 Difference]: Finished difference Result 289 states and 296 transitions. [2018-01-31 08:54:24,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:54:24,405 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-01-31 08:54:24,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:24,406 INFO L225 Difference]: With dead ends: 289 [2018-01-31 08:54:24,407 INFO L226 Difference]: Without dead ends: 184 [2018-01-31 08:54:24,407 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:54:24,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-01-31 08:54:24,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 171. [2018-01-31 08:54:24,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-01-31 08:54:24,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 177 transitions. [2018-01-31 08:54:24,418 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 177 transitions. Word has length 48 [2018-01-31 08:54:24,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:24,418 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 177 transitions. [2018-01-31 08:54:24,418 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 08:54:24,418 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 177 transitions. [2018-01-31 08:54:24,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-31 08:54:24,419 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:24,419 INFO L351 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-31 08:54:24,420 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-31 08:54:24,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1883218289, now seen corresponding path program 2 times [2018-01-31 08:54:24,420 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:24,420 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:24,421 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:24,421 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:24,421 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:24,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:24,437 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:24,562 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-31 08:54:24,562 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:54:24,562 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-31 08:54:24,568 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:54:24,591 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:54:24,596 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:54:24,600 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:54:24,630 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-31 08:54:24,631 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:54:24,662 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-31 08:54:24,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:54:24,677 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-31 08:54:24,677 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-31 08:54:25,000 WARN L143 SmtUtils]: Spent 109ms on a formula simplification that was a NOOP. DAG size: 24 [2018-01-31 08:54:25,679 WARN L146 SmtUtils]: Spent 190ms on a formula simplification. DAG size of input: 45 DAG size of output 17 [2018-01-31 08:54:25,969 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-31 08:54:26,001 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:54:26,001 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 19 [2018-01-31 08:54:26,001 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-31 08:54:26,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-31 08:54:26,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-01-31 08:54:26,002 INFO L87 Difference]: Start difference. First operand 171 states and 177 transitions. Second operand 19 states. [2018-01-31 08:54:30,578 WARN L143 SmtUtils]: Spent 4030ms on a formula simplification that was a NOOP. DAG size: 32 [2018-01-31 08:54:31,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:31,680 INFO L93 Difference]: Finished difference Result 313 states and 326 transitions. [2018-01-31 08:54:31,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-31 08:54:31,680 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2018-01-31 08:54:31,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:31,681 INFO L225 Difference]: With dead ends: 313 [2018-01-31 08:54:31,682 INFO L226 Difference]: Without dead ends: 177 [2018-01-31 08:54:31,682 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2018-01-31 08:54:31,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-01-31 08:54:31,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 174. [2018-01-31 08:54:31,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-01-31 08:54:31,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 180 transitions. [2018-01-31 08:54:31,704 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 180 transitions. Word has length 47 [2018-01-31 08:54:31,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:31,704 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 180 transitions. [2018-01-31 08:54:31,704 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-31 08:54:31,705 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 180 transitions. [2018-01-31 08:54:31,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-31 08:54:31,705 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:31,706 INFO L351 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-31 08:54:31,706 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-31 08:54:31,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1617259160, now seen corresponding path program 1 times [2018-01-31 08:54:31,706 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:31,706 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:31,708 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:31,708 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:54:31,708 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:31,731 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:31,850 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-31 08:54:31,850 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:54:31,850 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-31 08:54:31,850 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-31 08:54:31,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-31 08:54:31,850 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-01-31 08:54:31,851 INFO L87 Difference]: Start difference. First operand 174 states and 180 transitions. Second operand 12 states. [2018-01-31 08:54:32,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:32,343 INFO L93 Difference]: Finished difference Result 174 states and 180 transitions. [2018-01-31 08:54:32,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-31 08:54:32,344 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-01-31 08:54:32,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:32,346 INFO L225 Difference]: With dead ends: 174 [2018-01-31 08:54:32,346 INFO L226 Difference]: Without dead ends: 172 [2018-01-31 08:54:32,346 INFO L554 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-31 08:54:32,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-01-31 08:54:32,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-01-31 08:54:32,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-01-31 08:54:32,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 178 transitions. [2018-01-31 08:54:32,366 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 178 transitions. Word has length 56 [2018-01-31 08:54:32,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:32,366 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 178 transitions. [2018-01-31 08:54:32,367 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-31 08:54:32,367 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 178 transitions. [2018-01-31 08:54:32,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-31 08:54:32,367 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:32,368 INFO L351 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-31 08:54:32,368 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-31 08:54:32,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1617259159, now seen corresponding path program 1 times [2018-01-31 08:54:32,368 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:32,368 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:32,369 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:32,369 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:32,370 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:32,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:32,397 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:32,601 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-31 08:54:32,601 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:54:32,601 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-31 08:54:32,606 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:32,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:32,634 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:54:32,650 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-31 08:54:32,671 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:54:32,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-01-31 08:54:32,671 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:54:32,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:54:32,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:54:32,672 INFO L87 Difference]: Start difference. First operand 172 states and 178 transitions. Second operand 8 states. [2018-01-31 08:54:32,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:32,731 INFO L93 Difference]: Finished difference Result 312 states and 324 transitions. [2018-01-31 08:54:32,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:54:32,738 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2018-01-31 08:54:32,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:32,740 INFO L225 Difference]: With dead ends: 312 [2018-01-31 08:54:32,740 INFO L226 Difference]: Without dead ends: 179 [2018-01-31 08:54:32,740 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:54:32,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-01-31 08:54:32,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2018-01-31 08:54:32,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-01-31 08:54:32,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 182 transitions. [2018-01-31 08:54:32,760 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 182 transitions. Word has length 56 [2018-01-31 08:54:32,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:32,760 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 182 transitions. [2018-01-31 08:54:32,760 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:54:32,761 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 182 transitions. [2018-01-31 08:54:32,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-31 08:54:32,761 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:32,762 INFO L351 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-31 08:54:32,762 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-31 08:54:32,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1881204523, now seen corresponding path program 2 times [2018-01-31 08:54:32,762 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:32,762 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:32,763 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:32,763 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:32,763 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:32,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:32,787 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:33,217 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-31 08:54:33,217 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:54:33,217 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-31 08:54:33,225 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:54:33,252 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:54:33,258 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:54:33,263 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:54:33,289 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-31 08:54:33,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:54:33,383 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-31 08:54:33,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:54:33,395 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-31 08:54:33,395 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-31 08:54:33,988 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-31 08:54:34,008 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:54:34,008 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 22 [2018-01-31 08:54:34,008 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-31 08:54:34,008 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-31 08:54:34,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2018-01-31 08:54:34,009 INFO L87 Difference]: Start difference. First operand 176 states and 182 transitions. Second operand 22 states. [2018-01-31 08:54:35,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:35,796 INFO L93 Difference]: Finished difference Result 314 states and 328 transitions. [2018-01-31 08:54:35,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-31 08:54:35,796 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 60 [2018-01-31 08:54:35,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:35,797 INFO L225 Difference]: With dead ends: 314 [2018-01-31 08:54:35,797 INFO L226 Difference]: Without dead ends: 181 [2018-01-31 08:54:35,798 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=152, Invalid=904, Unknown=0, NotChecked=0, Total=1056 [2018-01-31 08:54:35,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-01-31 08:54:35,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 178. [2018-01-31 08:54:35,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-01-31 08:54:35,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 184 transitions. [2018-01-31 08:54:35,817 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 184 transitions. Word has length 60 [2018-01-31 08:54:35,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:35,817 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 184 transitions. [2018-01-31 08:54:35,817 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-31 08:54:35,817 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 184 transitions. [2018-01-31 08:54:35,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-01-31 08:54:35,818 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:35,818 INFO L351 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] [2018-01-31 08:54:35,818 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-31 08:54:35,819 INFO L82 PathProgramCache]: Analyzing trace with hash 856578843, now seen corresponding path program 1 times [2018-01-31 08:54:35,819 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:35,819 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:35,821 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:35,822 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:54:35,822 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:35,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:35,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:36,278 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-31 08:54:36,278 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:54:36,278 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 08:54:36,279 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:54:36,279 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:54:36,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:54:36,280 INFO L87 Difference]: Start difference. First operand 178 states and 184 transitions. Second operand 8 states. [2018-01-31 08:54:36,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:36,411 INFO L93 Difference]: Finished difference Result 287 states and 296 transitions. [2018-01-31 08:54:36,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:54:36,411 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2018-01-31 08:54:36,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:36,412 INFO L225 Difference]: With dead ends: 287 [2018-01-31 08:54:36,412 INFO L226 Difference]: Without dead ends: 178 [2018-01-31 08:54:36,413 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:54:36,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-01-31 08:54:36,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-01-31 08:54:36,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-01-31 08:54:36,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 183 transitions. [2018-01-31 08:54:36,433 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 183 transitions. Word has length 70 [2018-01-31 08:54:36,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:36,433 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 183 transitions. [2018-01-31 08:54:36,433 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:54:36,433 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 183 transitions. [2018-01-31 08:54:36,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-31 08:54:36,434 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:36,435 INFO L351 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] [2018-01-31 08:54:36,435 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-31 08:54:36,435 INFO L82 PathProgramCache]: Analyzing trace with hash 243427596, now seen corresponding path program 1 times [2018-01-31 08:54:36,435 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:36,435 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:36,437 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:36,437 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:36,437 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:36,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:36,457 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:36,542 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-31 08:54:36,542 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:54:36,542 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-31 08:54:36,542 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-31 08:54:36,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-31 08:54:36,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:54:36,543 INFO L87 Difference]: Start difference. First operand 178 states and 183 transitions. Second operand 10 states. [2018-01-31 08:54:36,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:36,615 INFO L93 Difference]: Finished difference Result 289 states and 297 transitions. [2018-01-31 08:54:36,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-31 08:54:36,615 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 75 [2018-01-31 08:54:36,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:36,616 INFO L225 Difference]: With dead ends: 289 [2018-01-31 08:54:36,616 INFO L226 Difference]: Without dead ends: 178 [2018-01-31 08:54:36,617 INFO L554 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-31 08:54:36,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-01-31 08:54:36,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-01-31 08:54:36,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-01-31 08:54:36,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 182 transitions. [2018-01-31 08:54:36,637 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 182 transitions. Word has length 75 [2018-01-31 08:54:36,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:36,638 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 182 transitions. [2018-01-31 08:54:36,638 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-31 08:54:36,638 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 182 transitions. [2018-01-31 08:54:36,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-01-31 08:54:36,639 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:36,639 INFO L351 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] [2018-01-31 08:54:36,639 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-31 08:54:36,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1945594352, now seen corresponding path program 1 times [2018-01-31 08:54:36,640 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:36,640 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:36,641 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:36,641 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:36,641 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:36,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:36,660 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:36,864 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-31 08:54:36,864 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:54:36,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-31 08:54:36,864 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-31 08:54:36,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-31 08:54:36,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-01-31 08:54:36,865 INFO L87 Difference]: Start difference. First operand 178 states and 182 transitions. Second operand 15 states. [2018-01-31 08:54:38,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:38,029 INFO L93 Difference]: Finished difference Result 178 states and 182 transitions. [2018-01-31 08:54:38,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-31 08:54:38,031 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 86 [2018-01-31 08:54:38,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:38,033 INFO L225 Difference]: With dead ends: 178 [2018-01-31 08:54:38,033 INFO L226 Difference]: Without dead ends: 176 [2018-01-31 08:54:38,033 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2018-01-31 08:54:38,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-01-31 08:54:38,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-01-31 08:54:38,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-01-31 08:54:38,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 180 transitions. [2018-01-31 08:54:38,059 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 180 transitions. Word has length 86 [2018-01-31 08:54:38,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:38,059 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 180 transitions. [2018-01-31 08:54:38,060 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-31 08:54:38,060 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 180 transitions. [2018-01-31 08:54:38,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-01-31 08:54:38,061 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:38,061 INFO L351 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] [2018-01-31 08:54:38,061 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-31 08:54:38,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1945594351, now seen corresponding path program 1 times [2018-01-31 08:54:38,061 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:38,061 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:38,063 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:38,063 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:38,063 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:38,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:38,086 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:38,342 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-31 08:54:38,343 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:54:38,343 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-31 08:54:38,348 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:38,386 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:54:38,434 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-31 08:54:38,467 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:54:38,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-01-31 08:54:38,468 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-31 08:54:38,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-31 08:54:38,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:54:38,468 INFO L87 Difference]: Start difference. First operand 176 states and 180 transitions. Second operand 10 states. [2018-01-31 08:54:38,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:38,940 INFO L93 Difference]: Finished difference Result 312 states and 320 transitions. [2018-01-31 08:54:38,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:54:38,940 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 86 [2018-01-31 08:54:38,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:38,942 INFO L225 Difference]: With dead ends: 312 [2018-01-31 08:54:38,942 INFO L226 Difference]: Without dead ends: 183 [2018-01-31 08:54:38,942 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 86 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-31 08:54:38,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-01-31 08:54:38,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 180. [2018-01-31 08:54:38,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-01-31 08:54:38,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 184 transitions. [2018-01-31 08:54:38,962 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 184 transitions. Word has length 86 [2018-01-31 08:54:38,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:38,962 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 184 transitions. [2018-01-31 08:54:38,962 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-31 08:54:38,962 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 184 transitions. [2018-01-31 08:54:38,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-01-31 08:54:38,964 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:38,964 INFO L351 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] [2018-01-31 08:54:38,965 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-31 08:54:38,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1378686893, now seen corresponding path program 2 times [2018-01-31 08:54:38,965 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:38,965 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:38,966 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:38,966 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:38,966 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:38,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:38,987 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:39,528 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-31 08:54:39,529 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:54:39,529 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-31 08:54:39,534 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:54:39,566 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:54:39,570 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:54:39,575 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:54:39,582 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-31 08:54:39,583 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:54:39,618 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-31 08:54:39,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:54:39,629 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-31 08:54:39,630 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-31 08:54:40,266 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 45 DAG size of output 17 [2018-01-31 08:54:42,033 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-31 08:54:42,052 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:54:42,053 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [10] total 27 [2018-01-31 08:54:42,053 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-31 08:54:42,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-31 08:54:42,054 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2018-01-31 08:54:42,054 INFO L87 Difference]: Start difference. First operand 180 states and 184 transitions. Second operand 27 states. [2018-01-31 08:54:44,205 WARN L143 SmtUtils]: Spent 2045ms on a formula simplification that was a NOOP. DAG size: 39 [2018-01-31 08:54:48,453 WARN L143 SmtUtils]: Spent 4027ms on a formula simplification that was a NOOP. DAG size: 31 [2018-01-31 08:54:49,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:49,642 INFO L93 Difference]: Finished difference Result 314 states and 324 transitions. [2018-01-31 08:54:49,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-31 08:54:49,683 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 90 [2018-01-31 08:54:49,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:49,683 INFO L225 Difference]: With dead ends: 314 [2018-01-31 08:54:49,684 INFO L226 Difference]: Without dead ends: 185 [2018-01-31 08:54:49,684 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=224, Invalid=1498, Unknown=0, NotChecked=0, Total=1722 [2018-01-31 08:54:49,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-01-31 08:54:49,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2018-01-31 08:54:49,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-01-31 08:54:49,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 186 transitions. [2018-01-31 08:54:49,709 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 186 transitions. Word has length 90 [2018-01-31 08:54:49,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:49,709 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 186 transitions. [2018-01-31 08:54:49,709 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-31 08:54:49,710 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 186 transitions. [2018-01-31 08:54:49,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-01-31 08:54:49,711 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:49,711 INFO L351 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] [2018-01-31 08:54:49,711 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-31 08:54:49,711 INFO L82 PathProgramCache]: Analyzing trace with hash 773443483, now seen corresponding path program 1 times [2018-01-31 08:54:49,712 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:49,712 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:49,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:49,713 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:54:49,713 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:49,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:49,735 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:50,008 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-31 08:54:50,008 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:54:50,008 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-31 08:54:50,009 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-31 08:54:50,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-31 08:54:50,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:54:50,009 INFO L87 Difference]: Start difference. First operand 182 states and 186 transitions. Second operand 11 states. [2018-01-31 08:54:50,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:50,249 INFO L93 Difference]: Finished difference Result 259 states and 265 transitions. [2018-01-31 08:54:50,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-31 08:54:50,249 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2018-01-31 08:54:50,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:50,250 INFO L225 Difference]: With dead ends: 259 [2018-01-31 08:54:50,251 INFO L226 Difference]: Without dead ends: 182 [2018-01-31 08:54:50,251 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-01-31 08:54:50,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-01-31 08:54:50,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-01-31 08:54:50,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-01-31 08:54:50,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 185 transitions. [2018-01-31 08:54:50,272 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 185 transitions. Word has length 99 [2018-01-31 08:54:50,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:50,273 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 185 transitions. [2018-01-31 08:54:50,273 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-31 08:54:50,273 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 185 transitions. [2018-01-31 08:54:50,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-01-31 08:54:50,274 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:50,274 INFO L351 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] [2018-01-31 08:54:50,274 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-31 08:54:50,275 INFO L82 PathProgramCache]: Analyzing trace with hash -360236654, now seen corresponding path program 1 times [2018-01-31 08:54:50,275 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:50,275 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:50,276 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:50,276 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:50,276 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:50,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:50,301 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:50,855 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-31 08:54:50,856 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:54:50,856 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-31 08:54:50,856 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-31 08:54:50,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-31 08:54:50,856 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:54:50,857 INFO L87 Difference]: Start difference. First operand 182 states and 185 transitions. Second operand 11 states. [2018-01-31 08:54:51,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:51,036 INFO L93 Difference]: Finished difference Result 188 states and 190 transitions. [2018-01-31 08:54:51,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-31 08:54:51,037 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 117 [2018-01-31 08:54:51,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:51,038 INFO L225 Difference]: With dead ends: 188 [2018-01-31 08:54:51,038 INFO L226 Difference]: Without dead ends: 182 [2018-01-31 08:54:51,038 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-01-31 08:54:51,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-01-31 08:54:51,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-01-31 08:54:51,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-01-31 08:54:51,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 184 transitions. [2018-01-31 08:54:51,060 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 184 transitions. Word has length 117 [2018-01-31 08:54:51,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:51,061 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 184 transitions. [2018-01-31 08:54:51,061 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-31 08:54:51,061 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 184 transitions. [2018-01-31 08:54:51,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-01-31 08:54:51,062 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:51,062 INFO L351 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] [2018-01-31 08:54:51,062 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-31 08:54:51,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1033575066, now seen corresponding path program 1 times [2018-01-31 08:54:51,063 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:51,063 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:51,064 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:51,064 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:51,064 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:51,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:51,089 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:51,836 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-31 08:54:51,837 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:54:51,837 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-31 08:54:51,849 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:51,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:51,906 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:54:51,934 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-31 08:54:51,954 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:54:51,954 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-01-31 08:54:51,955 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-31 08:54:51,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-31 08:54:51,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-01-31 08:54:51,955 INFO L87 Difference]: Start difference. First operand 182 states and 184 transitions. Second operand 12 states. [2018-01-31 08:54:52,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:54:52,015 INFO L93 Difference]: Finished difference Result 316 states and 320 transitions. [2018-01-31 08:54:52,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-31 08:54:52,015 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 124 [2018-01-31 08:54:52,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:54:52,017 INFO L225 Difference]: With dead ends: 316 [2018-01-31 08:54:52,017 INFO L226 Difference]: Without dead ends: 189 [2018-01-31 08:54:52,017 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2018-01-31 08:54:52,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-01-31 08:54:52,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2018-01-31 08:54:52,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-01-31 08:54:52,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 188 transitions. [2018-01-31 08:54:52,032 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 188 transitions. Word has length 124 [2018-01-31 08:54:52,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:54:52,032 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 188 transitions. [2018-01-31 08:54:52,032 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-31 08:54:52,032 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 188 transitions. [2018-01-31 08:54:52,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-01-31 08:54:52,034 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:54:52,034 INFO L351 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] [2018-01-31 08:54:52,034 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-31 08:54:52,034 INFO L82 PathProgramCache]: Analyzing trace with hash -648565924, now seen corresponding path program 2 times [2018-01-31 08:54:52,034 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:54:52,034 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:54:52,035 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:52,035 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:54:52,035 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:54:52,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:54:52,066 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:54:52,241 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-31 08:54:52,242 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:54:52,242 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-31 08:54:52,247 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:54:52,289 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:54:52,294 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:54:52,299 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:54:52,305 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-31 08:54:52,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:54:52,322 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-31 08:54:52,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:54:52,334 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-31 08:54:52,334 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-31 08:54:53,482 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-31 08:54:53,502 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:54:53,502 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [12] total 31 [2018-01-31 08:54:53,503 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-31 08:54:53,503 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-31 08:54:53,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=804, Unknown=0, NotChecked=0, Total=930 [2018-01-31 08:54:53,503 INFO L87 Difference]: Start difference. First operand 186 states and 188 transitions. Second operand 31 states. [2018-01-31 08:54:55,571 WARN L143 SmtUtils]: Spent 2030ms on a formula simplification that was a NOOP. DAG size: 39 [2018-01-31 08:54:57,894 WARN L143 SmtUtils]: Spent 2028ms on a formula simplification that was a NOOP. DAG size: 35 [2018-01-31 08:54:59,940 WARN L143 SmtUtils]: Spent 2024ms on a formula simplification that was a NOOP. DAG size: 35 [2018-01-31 08:55:02,084 WARN L143 SmtUtils]: Spent 2021ms on a formula simplification that was a NOOP. DAG size: 35 [2018-01-31 08:55:03,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:55:03,555 INFO L93 Difference]: Finished difference Result 318 states and 324 transitions. [2018-01-31 08:55:03,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-31 08:55:03,555 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 128 [2018-01-31 08:55:03,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:55:03,556 INFO L225 Difference]: With dead ends: 318 [2018-01-31 08:55:03,557 INFO L226 Difference]: Without dead ends: 191 [2018-01-31 08:55:03,557 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 107 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=297, Invalid=2055, Unknown=0, NotChecked=0, Total=2352 [2018-01-31 08:55:03,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-01-31 08:55:03,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 188. [2018-01-31 08:55:03,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-01-31 08:55:03,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 190 transitions. [2018-01-31 08:55:03,574 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 190 transitions. Word has length 128 [2018-01-31 08:55:03,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:55:03,574 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 190 transitions. [2018-01-31 08:55:03,574 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-31 08:55:03,574 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 190 transitions. [2018-01-31 08:55:03,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-01-31 08:55:03,575 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:55:03,575 INFO L351 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] [2018-01-31 08:55:03,575 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-31 08:55:03,575 INFO L82 PathProgramCache]: Analyzing trace with hash 788138781, now seen corresponding path program 1 times [2018-01-31 08:55:03,575 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:55:03,575 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:55:03,576 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:55:03,576 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:55:03,577 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:55:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:55:03,621 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:55:04,202 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-31 08:55:04,202 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:55:04,202 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-01-31 08:55:04,202 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-31 08:55:04,202 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-31 08:55:04,203 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-01-31 08:55:04,203 INFO L87 Difference]: Start difference. First operand 188 states and 190 transitions. Second operand 18 states. [2018-01-31 08:55:04,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:55:04,518 INFO L93 Difference]: Finished difference Result 195 states and 197 transitions. [2018-01-31 08:55:04,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-31 08:55:04,519 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 132 [2018-01-31 08:55:04,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:55:04,520 INFO L225 Difference]: With dead ends: 195 [2018-01-31 08:55:04,520 INFO L226 Difference]: Without dead ends: 193 [2018-01-31 08:55:04,520 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2018-01-31 08:55:04,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-01-31 08:55:04,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 186. [2018-01-31 08:55:04,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-01-31 08:55:04,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 188 transitions. [2018-01-31 08:55:04,537 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 188 transitions. Word has length 132 [2018-01-31 08:55:04,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:55:04,537 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 188 transitions. [2018-01-31 08:55:04,538 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-31 08:55:04,538 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 188 transitions. [2018-01-31 08:55:04,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-01-31 08:55:04,538 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:55:04,538 INFO L351 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:55:04,538 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-31 08:55:04,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1488037050, now seen corresponding path program 1 times [2018-01-31 08:55:04,539 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:55:04,539 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:55:04,539 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:55:04,539 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:55:04,539 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:55:04,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:55:04,573 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:55:05,301 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-31 08:55:05,301 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:55:05,301 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-01-31 08:55:05,302 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-31 08:55:05,302 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-31 08:55:05,302 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2018-01-31 08:55:05,302 INFO L87 Difference]: Start difference. First operand 186 states and 188 transitions. Second operand 24 states. [2018-01-31 08:55:05,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:55:05,797 INFO L93 Difference]: Finished difference Result 193 states and 195 transitions. [2018-01-31 08:55:05,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-31 08:55:05,798 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 151 [2018-01-31 08:55:05,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:55:05,799 INFO L225 Difference]: With dead ends: 193 [2018-01-31 08:55:05,799 INFO L226 Difference]: Without dead ends: 191 [2018-01-31 08:55:05,800 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=1029, Unknown=0, NotChecked=0, Total=1122 [2018-01-31 08:55:05,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-01-31 08:55:05,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 184. [2018-01-31 08:55:05,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-01-31 08:55:05,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 186 transitions. [2018-01-31 08:55:05,826 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 186 transitions. Word has length 151 [2018-01-31 08:55:05,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:55:05,826 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 186 transitions. [2018-01-31 08:55:05,826 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-31 08:55:05,827 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 186 transitions. [2018-01-31 08:55:05,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-01-31 08:55:05,827 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:55:05,828 INFO L351 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:55:05,828 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-31 08:55:05,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1488037049, now seen corresponding path program 1 times [2018-01-31 08:55:05,828 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:55:05,828 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:55:05,829 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:55:05,829 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:55:05,830 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:55:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:55:05,870 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:55:06,761 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:55:06,761 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:55:06,761 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-31 08:55:06,766 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:55:06,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:55:06,828 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:55:06,849 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:55:06,870 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:55:06,870 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-01-31 08:55:06,870 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-31 08:55:06,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-31 08:55:06,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2018-01-31 08:55:06,871 INFO L87 Difference]: Start difference. First operand 184 states and 186 transitions. Second operand 14 states. [2018-01-31 08:55:07,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:55:07,052 INFO L93 Difference]: Finished difference Result 312 states and 316 transitions. [2018-01-31 08:55:07,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-31 08:55:07,053 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 151 [2018-01-31 08:55:07,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:55:07,055 INFO L225 Difference]: With dead ends: 312 [2018-01-31 08:55:07,055 INFO L226 Difference]: Without dead ends: 191 [2018-01-31 08:55:07,056 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2018-01-31 08:55:07,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-01-31 08:55:07,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 188. [2018-01-31 08:55:07,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-01-31 08:55:07,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 190 transitions. [2018-01-31 08:55:07,085 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 190 transitions. Word has length 151 [2018-01-31 08:55:07,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:55:07,086 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 190 transitions. [2018-01-31 08:55:07,086 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-31 08:55:07,086 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 190 transitions. [2018-01-31 08:55:07,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-01-31 08:55:07,087 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:55:07,087 INFO L351 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] [2018-01-31 08:55:07,087 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-31 08:55:07,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1465949883, now seen corresponding path program 2 times [2018-01-31 08:55:07,088 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:55:07,088 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:55:07,089 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:55:07,091 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:55:07,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:55:07,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:55:07,130 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:55:07,433 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-31 08:55:07,433 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:55:07,433 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-31 08:55:07,440 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:55:07,491 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:55:07,497 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:55:07,502 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:55:07,505 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-31 08:55:07,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:55:07,518 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-31 08:55:07,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:55:07,530 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-31 08:55:07,530 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-31 08:55:11,240 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-31 08:55:11,261 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:55:11,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [14] total 39 [2018-01-31 08:55:11,261 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-31 08:55:11,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-31 08:55:11,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1308, Unknown=1, NotChecked=0, Total=1482 [2018-01-31 08:55:11,262 INFO L87 Difference]: Start difference. First operand 188 states and 190 transitions. Second operand 39 states. [2018-01-31 08:55:13,440 WARN L143 SmtUtils]: Spent 2032ms on a formula simplification that was a NOOP. DAG size: 39 [2018-01-31 08:55:15,694 WARN L143 SmtUtils]: Spent 2044ms on a formula simplification that was a NOOP. DAG size: 35 [2018-01-31 08:55:17,781 WARN L143 SmtUtils]: Spent 2024ms on a formula simplification that was a NOOP. DAG size: 35 [2018-01-31 08:55:18,378 WARN L143 SmtUtils]: Spent 529ms on a formula simplification that was a NOOP. DAG size: 35 [2018-01-31 08:55:20,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:55:20,228 INFO L93 Difference]: Finished difference Result 314 states and 320 transitions. [2018-01-31 08:55:20,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-01-31 08:55:20,228 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 155 [2018-01-31 08:55:20,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:55:20,229 INFO L225 Difference]: With dead ends: 314 [2018-01-31 08:55:20,229 INFO L226 Difference]: Without dead ends: 193 [2018-01-31 08:55:20,231 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 126 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 923 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=422, Invalid=3483, Unknown=1, NotChecked=0, Total=3906 [2018-01-31 08:55:20,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-01-31 08:55:20,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 190. [2018-01-31 08:55:20,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-01-31 08:55:20,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 192 transitions. [2018-01-31 08:55:20,275 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 192 transitions. Word has length 155 [2018-01-31 08:55:20,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:55:20,276 INFO L432 AbstractCegarLoop]: Abstraction has 190 states and 192 transitions. [2018-01-31 08:55:20,276 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-31 08:55:20,276 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 192 transitions. [2018-01-31 08:55:20,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-01-31 08:55:20,277 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:55:20,277 INFO L351 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] [2018-01-31 08:55:20,277 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-31 08:55:20,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1668324186, now seen corresponding path program 1 times [2018-01-31 08:55:20,277 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:55:20,277 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:55:20,278 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:55:20,278 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:55:20,278 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:55:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:55:20,306 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:55:20,901 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-31 08:55:20,901 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:55:20,901 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-31 08:55:20,906 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:55:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:55:20,969 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:55:20,996 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-31 08:55:21,016 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:55:21,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-01-31 08:55:21,017 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-31 08:55:21,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-31 08:55:21,017 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2018-01-31 08:55:21,017 INFO L87 Difference]: Start difference. First operand 190 states and 192 transitions. Second operand 16 states. [2018-01-31 08:55:21,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:55:21,120 INFO L93 Difference]: Finished difference Result 316 states and 320 transitions. [2018-01-31 08:55:21,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-31 08:55:21,123 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 164 [2018-01-31 08:55:21,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:55:21,125 INFO L225 Difference]: With dead ends: 316 [2018-01-31 08:55:21,125 INFO L226 Difference]: Without dead ends: 197 [2018-01-31 08:55:21,125 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=161, Unknown=0, NotChecked=0, Total=272 [2018-01-31 08:55:21,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-01-31 08:55:21,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2018-01-31 08:55:21,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-01-31 08:55:21,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 196 transitions. [2018-01-31 08:55:21,156 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 196 transitions. Word has length 164 [2018-01-31 08:55:21,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:55:21,157 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 196 transitions. [2018-01-31 08:55:21,157 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-31 08:55:21,157 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 196 transitions. [2018-01-31 08:55:21,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-01-31 08:55:21,158 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:55:21,158 INFO L351 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] [2018-01-31 08:55:21,158 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-31 08:55:21,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1977387880, now seen corresponding path program 2 times [2018-01-31 08:55:21,159 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:55:21,159 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:55:21,160 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:55:21,160 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:55:21,160 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:55:21,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:55:21,189 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:55:21,466 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-31 08:55:21,467 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:55:21,467 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-31 08:55:21,472 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:55:21,522 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:55:21,529 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:55:21,536 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:55:21,651 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-31 08:55:21,652 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-31 08:55:21,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:55:21,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:55:21,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:55:21,655 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-01-31 08:55:21,744 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-31 08:55:21,746 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-31 08:55:21,750 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-31 08:55:21,751 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:26 [2018-01-31 08:55:21,761 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-31 08:55:21,770 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-31 08:55:21,773 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:55:21,776 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-31 08:55:21,793 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:55:21,794 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:55:21,798 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-31 08:55:21,798 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:55:21,804 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:55:21,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:55:21,811 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-31 08:55:21,811 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:37, output treesize:9 [2018-01-31 08:55:22,435 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:55:22,436 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-31 08:55:22,438 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 08:55:22,438 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:55:22,439 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-31 08:55:22,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:55:22,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:55:22,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:55:22,445 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:13 [2018-01-31 08:55:23,292 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-31 08:55:23,302 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-31 08:55:23,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:55:23,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:55:23,321 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-31 08:55:23,321 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-01-31 08:55:23,406 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-01-31 08:55:23,425 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:55:23,426 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [46] imperfect sequences [16] total 60 [2018-01-31 08:55:23,426 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-01-31 08:55:23,426 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-01-31 08:55:23,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=3210, Unknown=1, NotChecked=114, Total=3540 [2018-01-31 08:55:23,427 INFO L87 Difference]: Start difference. First operand 194 states and 196 transitions. Second operand 60 states. [2018-01-31 08:55:26,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:55:26,067 INFO L93 Difference]: Finished difference Result 296 states and 302 transitions. [2018-01-31 08:55:26,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-01-31 08:55:26,067 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 168 [2018-01-31 08:55:26,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:55:26,068 INFO L225 Difference]: With dead ends: 296 [2018-01-31 08:55:26,068 INFO L226 Difference]: Without dead ends: 177 [2018-01-31 08:55:26,071 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1365 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=371, Invalid=7114, Unknown=1, NotChecked=170, Total=7656 [2018-01-31 08:55:26,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-01-31 08:55:26,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 174. [2018-01-31 08:55:26,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-01-31 08:55:26,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2018-01-31 08:55:26,100 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 168 [2018-01-31 08:55:26,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:55:26,101 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2018-01-31 08:55:26,101 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-01-31 08:55:26,101 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2018-01-31 08:55:26,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-01-31 08:55:26,102 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:55:26,102 INFO L351 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] [2018-01-31 08:55:26,102 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-31 08:55:26,103 INFO L82 PathProgramCache]: Analyzing trace with hash -280388892, now seen corresponding path program 1 times [2018-01-31 08:55:26,103 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:55:26,103 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:55:26,104 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:55:26,104 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:55:26,104 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:55:26,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:55:26,131 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:55:26,445 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-31 08:55:26,445 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:55:26,445 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-31 08:55:26,450 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:55:26,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:55:26,531 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:55:26,578 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-31 08:55:26,597 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:55:26,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-01-31 08:55:26,598 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-31 08:55:26,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-31 08:55:26,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-01-31 08:55:26,598 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 18 states. [2018-01-31 08:55:26,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:55:26,817 INFO L93 Difference]: Finished difference Result 276 states and 276 transitions. [2018-01-31 08:55:26,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-31 08:55:26,817 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 173 [2018-01-31 08:55:26,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:55:26,818 INFO L225 Difference]: With dead ends: 276 [2018-01-31 08:55:26,818 INFO L226 Difference]: Without dead ends: 181 [2018-01-31 08:55:26,819 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=200, Unknown=0, NotChecked=0, Total=342 [2018-01-31 08:55:26,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-01-31 08:55:26,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 178. [2018-01-31 08:55:26,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-01-31 08:55:26,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2018-01-31 08:55:26,852 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 173 [2018-01-31 08:55:26,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:55:26,852 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2018-01-31 08:55:26,852 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-31 08:55:26,852 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2018-01-31 08:55:26,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-01-31 08:55:26,853 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:55:26,854 INFO L351 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 08:55:26,854 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-31 08:55:26,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1125052002, now seen corresponding path program 2 times [2018-01-31 08:55:26,854 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:55:26,854 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:55:26,857 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:55:26,858 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:55:26,858 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:55:26,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:55:26,884 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:55:27,287 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:55:27,287 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:55:27,287 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-31 08:55:27,293 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:55:27,351 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:55:27,385 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:55:27,388 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:55:27,392 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:55:27,453 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:55:27,475 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:55:27,475 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-01-31 08:55:27,476 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-31 08:55:27,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-31 08:55:27,476 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-01-31 08:55:27,476 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 19 states. [2018-01-31 08:55:27,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:55:27,568 INFO L93 Difference]: Finished difference Result 280 states and 280 transitions. [2018-01-31 08:55:27,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-31 08:55:27,568 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 177 [2018-01-31 08:55:27,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:55:27,569 INFO L225 Difference]: With dead ends: 280 [2018-01-31 08:55:27,569 INFO L226 Difference]: Without dead ends: 185 [2018-01-31 08:55:27,569 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=221, Unknown=0, NotChecked=0, Total=380 [2018-01-31 08:55:27,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-01-31 08:55:27,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2018-01-31 08:55:27,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-01-31 08:55:27,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2018-01-31 08:55:27,603 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 177 [2018-01-31 08:55:27,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:55:27,603 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2018-01-31 08:55:27,603 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-31 08:55:27,604 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2018-01-31 08:55:27,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-01-31 08:55:27,605 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:55:27,605 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 08:55:27,605 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-31 08:55:27,605 INFO L82 PathProgramCache]: Analyzing trace with hash -991800608, now seen corresponding path program 3 times [2018-01-31 08:55:27,605 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:55:27,605 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:55:27,606 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:55:27,606 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:55:27,607 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:55:27,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:55:27,631 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:55:28,273 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:55:28,274 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:55:28,274 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-31 08:55:28,279 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 08:55:28,326 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:55:28,348 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:55:28,398 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:55:28,446 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:55:28,710 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:55:29,006 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:55:29,408 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:55:30,132 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:55:30,913 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:55:31,320 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:55:31,675 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:55:35,168 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:55:37,423 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:55:38,400 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:55:43,502 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:55:46,523 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:55:46,526 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:55:46,539 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:55:48,035 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:55:48,059 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:55:48,059 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 24] total 41 [2018-01-31 08:55:48,060 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-31 08:55:48,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-31 08:55:48,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=1168, Unknown=0, NotChecked=0, Total=1640 [2018-01-31 08:55:48,061 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 41 states. [2018-01-31 08:55:48,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:55:48,452 INFO L93 Difference]: Finished difference Result 284 states and 284 transitions. [2018-01-31 08:55:48,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-31 08:55:48,453 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 181 [2018-01-31 08:55:48,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:55:48,453 INFO L225 Difference]: With dead ends: 284 [2018-01-31 08:55:48,454 INFO L226 Difference]: Without dead ends: 189 [2018-01-31 08:55:48,454 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=522, Invalid=1458, Unknown=0, NotChecked=0, Total=1980 [2018-01-31 08:55:48,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-01-31 08:55:48,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2018-01-31 08:55:48,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-01-31 08:55:48,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-01-31 08:55:48,476 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 181 [2018-01-31 08:55:48,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:55:48,476 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-01-31 08:55:48,477 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-31 08:55:48,477 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-01-31 08:55:48,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-01-31 08:55:48,478 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:55:48,478 INFO L351 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 08:55:48,478 INFO L371 AbstractCegarLoop]: === Iteration 33 === [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-31 08:55:48,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1387050914, now seen corresponding path program 4 times [2018-01-31 08:55:48,479 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:55:48,479 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:55:48,479 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:55:48,479 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:55:48,480 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:55:48,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-31 08:55:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-31 08:55:48,716 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-01-31 08:55:48,768 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-01-31 08:55:48,781 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-31 08:55:48,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 08:55:48 BoogieIcfgContainer [2018-01-31 08:55:48,817 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 08:55:48,818 INFO L168 Benchmark]: Toolchain (without parser) took 92182.22 ms. Allocated memory was 304.6 MB in the beginning and 749.2 MB in the end (delta: 444.6 MB). Free memory was 263.3 MB in the beginning and 424.2 MB in the end (delta: -160.9 MB). Peak memory consumption was 283.7 MB. Max. memory is 5.3 GB. [2018-01-31 08:55:48,819 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 304.6 MB. Free memory is still 270.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 08:55:48,820 INFO L168 Benchmark]: CACSL2BoogieTranslator took 361.23 ms. Allocated memory is still 304.6 MB. Free memory was 263.3 MB in the beginning and 249.3 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 5.3 GB. [2018-01-31 08:55:48,820 INFO L168 Benchmark]: Boogie Preprocessor took 58.62 ms. Allocated memory is still 304.6 MB. Free memory was 249.3 MB in the beginning and 247.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:55:48,820 INFO L168 Benchmark]: RCFGBuilder took 934.36 ms. Allocated memory is still 304.6 MB. Free memory was 247.3 MB in the beginning and 208.3 MB in the end (delta: 39.0 MB). Peak memory consumption was 39.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:55:48,821 INFO L168 Benchmark]: TraceAbstraction took 90813.40 ms. Allocated memory was 304.6 MB in the beginning and 749.2 MB in the end (delta: 444.6 MB). Free memory was 208.3 MB in the beginning and 424.2 MB in the end (delta: -215.9 MB). Peak memory consumption was 228.7 MB. Max. memory is 5.3 GB. [2018-01-31 08:55:48,822 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 304.6 MB. Free memory is still 270.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 361.23 ms. Allocated memory is still 304.6 MB. Free memory was 263.3 MB in the beginning and 249.3 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 58.62 ms. Allocated memory is still 304.6 MB. Free memory was 249.3 MB in the beginning and 247.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 934.36 ms. Allocated memory is still 304.6 MB. Free memory was 247.3 MB in the beginning and 208.3 MB in the end (delta: 39.0 MB). Peak memory consumption was 39.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 90813.40 ms. Allocated memory was 304.6 MB in the beginning and 749.2 MB in the end (delta: 444.6 MB). Free memory was 208.3 MB in the beginning and 424.2 MB in the end (delta: -215.9 MB). Peak memory consumption was 228.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1443]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1443. Possible FailurePath: [L1444] CALL entry_point() [L1436] struct ldv_kobject *kobj; [L1437] CALL, EXPR ldv_kobject_create() [L1406] struct ldv_kobject *kobj; [L1408] CALL, EXPR ldv_malloc(sizeof(*kobj)) VAL [\old(size)=16] [L1073] COND TRUE __VERIFIER_nondet_int() VAL [\old(size)=16, __VERIFIER_nondet_int()=1, size=16] [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=16, malloc(size)={24:0}, size=16] [L1074] RET return malloc(size); VAL [\old(size)=16, \result={24:0}, malloc(size)={24:0}, size=16] [L1408] EXPR ldv_malloc(sizeof(*kobj)) VAL [ldv_malloc(sizeof(*kobj))={24:0}] [L1408] kobj = ldv_malloc(sizeof(*kobj)) VAL [kobj={24:0}, ldv_malloc(sizeof(*kobj))={24:0}] [L1409] COND FALSE !(!kobj) VAL [kobj={24:0}] [L1411] FCALL memset(kobj, 0, sizeof(*kobj)) VAL [kobj={24:0}, memset(kobj, 0, sizeof(*kobj))={24:0}] [L1413] CALL ldv_kobject_init(kobj) VAL [kobj={24:0}] [L1394] COND FALSE !(!kobj) VAL [kobj={24:0}, kobj={24:0}] [L1398] CALL ldv_kobject_init_internal(kobj) VAL [kobj={24:0}] [L1380] COND FALSE !(!kobj) VAL [kobj={24:0}, kobj={24:0}] [L1382] CALL ldv_kref_init(&kobj->kref) VAL [kref={24:12}] [L1294] RET, FCALL ((&kref->refcount)->counter) = (1) VAL [kref={24:12}, kref={24:12}] [L1382] ldv_kref_init(&kobj->kref) VAL [kobj={24:0}, kobj={24:0}] [L1383] CALL LDV_INIT_LIST_HEAD(&kobj->entry) VAL [list={24:4}] [L1099] FCALL list->next = list VAL [list={24:4}, list={24:4}] [L1100] FCALL list->prev = list VAL [list={24:4}, list={24:4}] [L1383] RET, FCALL LDV_INIT_LIST_HEAD(&kobj->entry) VAL [kobj={24:0}, kobj={24:0}] [L1413] ldv_kobject_init(kobj) VAL [kobj={24:0}] [L1414] RET return kobj; VAL [\result={24:0}, kobj={24:0}] [L1437] EXPR ldv_kobject_create() VAL [ldv_kobject_create()={24:0}] [L1437] kobj = ldv_kobject_create() VAL [kobj={24:0}, ldv_kobject_create()={24:0}] [L1438] CALL ldv_kobject_get(kobj) VAL [kobj={24:0}] [L1373] COND TRUE \read(*kobj) VAL [kobj={24:0}, kobj={24:0}] [L1374] CALL ldv_kref_get(&kobj->kref) VAL [kref={24:12}] [L1308] CALL ldv_atomic_add_return(1, (&kref->refcount)) VAL [\old(i)=1, v={24:12}] [L1255] int temp; VAL [\old(i)=1, i=1, v={24:12}, v={24:12}] [L1256] EXPR, FCALL v->counter VAL [\old(i)=1, i=1, v={24:12}, v={24:12}, v->counter=1] [L1256] temp = v->counter VAL [\old(i)=1, i=1, temp=1, v={24:12}, v={24:12}, v->counter=1] [L1257] temp += i VAL [\old(i)=1, i=1, temp=2, v={24:12}, v={24:12}] [L1258] FCALL v->counter = temp VAL [\old(i)=1, i=1, temp=2, v={24:12}, v={24:12}] [L1259] RET return temp; VAL [\old(i)=1, \result=2, i=1, temp=2, v={24:12}, v={24:12}] [L1308] RET ldv_atomic_add_return(1, (&kref->refcount)) VAL [kref={24:12}, kref={24:12}, ldv_atomic_add_return(1, (&kref->refcount))=2] [L1374] ldv_kref_get(&kobj->kref) VAL [kobj={24:0}, kobj={24:0}] [L1375] RET return kobj; VAL [\result={24:0}, kobj={24:0}, kobj={24:0}] [L1438] ldv_kobject_get(kobj) VAL [kobj={24:0}, ldv_kobject_get(kobj)={24:0}] [L1440] CALL ldv_kobject_put(kobj) VAL [kobj={24:0}] [L1361] COND TRUE \read(*kobj) VAL [kobj={24:0}, kobj={24:0}] [L1363] CALL ldv_kref_put(&kobj->kref, ldv_kobject_release) VAL [kref={24:12}, release={-1:0}] [L1313] CALL, EXPR ldv_kref_sub(kref, 1, release) VAL [\old(count)=1, kref={24:12}, release={-1:0}] [L1281] CALL, EXPR ldv_atomic_sub_return(((int) count), (&kref->refcount)) VAL [\old(i)=1, v={24:12}] [L1264] int temp; VAL [\old(i)=1, i=1, v={24:12}, v={24:12}] [L1265] EXPR, FCALL v->counter VAL [\old(i)=1, i=1, v={24:12}, v={24:12}, v->counter=2] [L1265] temp = v->counter VAL [\old(i)=1, i=1, temp=2, v={24:12}, v={24:12}, v->counter=2] [L1266] temp -= i VAL [\old(i)=1, i=1, temp=1, v={24:12}, v={24:12}] [L1267] FCALL v->counter = temp VAL [\old(i)=1, i=1, temp=1, v={24:12}, v={24:12}] [L1268] RET return temp; VAL [\old(i)=1, \result=1, i=1, temp=1, v={24:12}, v={24:12}] [L1281] EXPR ldv_atomic_sub_return(((int) count), (&kref->refcount)) VAL [\old(count)=1, count=1, kref={24:12}, kref={24:12}, ldv_atomic_sub_return(((int) count), (&kref->refcount))=1, release={-1:0}, release={-1:0}] [L1281] COND FALSE !((ldv_atomic_sub_return(((int) count), (&kref->refcount)) == 0)) VAL [\old(count)=1, count=1, kref={24:12}, kref={24:12}, ldv_atomic_sub_return(((int) count), (&kref->refcount))=1, release={-1:0}, release={-1:0}] [L1285] RET return 0; VAL [\old(count)=1, \result=0, count=1, kref={24:12}, kref={24:12}, release={-1:0}, release={-1:0}] [L1313] EXPR ldv_kref_sub(kref, 1, release) VAL [kref={24:12}, kref={24:12}, ldv_kref_sub(kref, 1, release)=0, release={-1:0}, release={-1:0}] [L1313] RET return ldv_kref_sub(kref, 1, release); VAL [\result=0, kref={24:12}, kref={24:12}, ldv_kref_sub(kref, 1, release)=0, release={-1:0}, release={-1:0}] [L1363] ldv_kref_put(&kobj->kref, ldv_kobject_release) VAL [kobj={24:0}, kobj={24:0}, ldv_kref_put(&kobj->kref, ldv_kobject_release)=0] [L1440] FCALL ldv_kobject_put(kobj) - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 175 locations, 23 error locations. UNSAFE Result, 90.7s OverallTime, 33 OverallIterations, 16 TraceHistogramMax, 44.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4739 SDtfs, 2072 SDslu, 45063 SDs, 0 SdLazy, 13255 SolverSat, 324 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2311 GetRequests, 1680 SyntacticMatches, 11 SemanticMatches, 620 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4480 ImplicationChecksByTransitivity, 50.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=208occurred in iteration=8, 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.7s AutomataMinimizationTime, 32 MinimizatonAttempts, 90 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 19.4s SatisfiabilityAnalysisTime, 24.4s InterpolantComputationTime, 4890 NumberOfCodeBlocks, 4722 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 4658 ConstructedInterpolants, 402 QuantifiedInterpolants, 2561178 SizeOfPredicates, 136 NumberOfNonLiveVariables, 5722 ConjunctsInSsa, 593 ConjunctsInUnsatCore, 47 InterpolantComputations, 23 PerfectInterpolantSequences, 1324/5358 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_08-55-48-837.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_08-55-48-837.csv Received shutdown request...