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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_2_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 09:31:48,454 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 09:31:48,455 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 09:31:48,465 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 09:31:48,465 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 09:31:48,466 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 09:31:48,466 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 09:31:48,467 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 09:31:48,469 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 09:31:48,470 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 09:31:48,470 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 09:31:48,471 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 09:31:48,471 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 09:31:48,472 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 09:31:48,473 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 09:31:48,475 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 09:31:48,476 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 09:31:48,477 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 09:31:48,478 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 09:31:48,479 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 09:31:48,481 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 09:31:48,481 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 09:31:48,481 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 09:31:48,482 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 09:31:48,483 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 09:31:48,484 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 09:31:48,484 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 09:31:48,485 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 09:31:48,485 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 09:31:48,485 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 09:31:48,485 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 09:31:48,486 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 09:31:48,495 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 09:31:48,495 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 09:31:48,496 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 09:31:48,496 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 09:31:48,496 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 09:31:48,497 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 09:31:48,497 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 09:31:48,497 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 09:31:48,497 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 09:31:48,497 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 09:31:48,497 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 09:31:48,498 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 09:31:48,498 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 09:31:48,498 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 09:31:48,498 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 09:31:48,498 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 09:31:48,498 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 09:31:48,498 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 09:31:48,499 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 09:31:48,499 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 09:31:48,499 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 09:31:48,499 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 09:31:48,499 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 09:31:48,499 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 09:31:48,499 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 09:31:48,530 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 09:31:48,539 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 09:31:48,543 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 09:31:48,544 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 09:31:48,545 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 09:31:48,545 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_2_true-valid-memsafety_true-termination.i [2018-02-02 09:31:48,701 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 09:31:48,702 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 09:31:48,702 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 09:31:48,703 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 09:31:48,706 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 09:31:48,707 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:31:48" (1/1) ... [2018-02-02 09:31:48,709 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fc89e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:31:48, skipping insertion in model container [2018-02-02 09:31:48,709 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:31:48" (1/1) ... [2018-02-02 09:31:48,719 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:31:48,752 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:31:48,853 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:31:48,872 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:31:48,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:31:48 WrapperNode [2018-02-02 09:31:48,883 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 09:31:48,883 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 09:31:48,883 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 09:31:48,883 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 09:31:48,891 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:31:48" (1/1) ... [2018-02-02 09:31:48,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:31:48" (1/1) ... [2018-02-02 09:31:48,900 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:31:48" (1/1) ... [2018-02-02 09:31:48,901 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:31:48" (1/1) ... [2018-02-02 09:31:48,908 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:31:48" (1/1) ... [2018-02-02 09:31:48,911 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:31:48" (1/1) ... [2018-02-02 09:31:48,913 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:31:48" (1/1) ... [2018-02-02 09:31:48,916 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 09:31:48,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 09:31:48,916 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 09:31:48,917 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 09:31:48,917 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:31:48" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 09:31:48,955 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 09:31:48,955 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 09:31:48,955 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-02-02 09:31:48,955 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 09:31:48,955 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-02-02 09:31:48,955 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2018-02-02 09:31:48,955 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-02-02 09:31:48,956 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-02-02 09:31:48,956 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-02-02 09:31:48,956 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2018-02-02 09:31:48,956 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-02-02 09:31:48,956 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-02-02 09:31:48,956 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-02-02 09:31:48,956 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-02-02 09:31:48,956 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2018-02-02 09:31:48,956 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-02-02 09:31:48,957 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-02-02 09:31:48,957 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-02-02 09:31:48,957 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 09:31:48,957 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 09:31:48,957 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 09:31:48,957 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 09:31:48,957 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 09:31:48,957 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 09:31:48,958 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 09:31:48,958 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 09:31:48,958 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 09:31:48,958 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-02 09:31:48,958 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-02 09:31:48,958 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 09:31:48,958 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 09:31:48,958 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 09:31:48,959 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-02 09:31:48,959 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 09:31:48,959 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-02-02 09:31:48,959 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2018-02-02 09:31:48,959 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-02-02 09:31:48,959 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-02-02 09:31:48,959 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-02-02 09:31:48,959 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-02-02 09:31:48,960 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2018-02-02 09:31:48,960 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-02-02 09:31:48,960 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-02-02 09:31:48,960 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-02-02 09:31:48,960 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-02-02 09:31:48,960 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2018-02-02 09:31:48,960 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-02-02 09:31:48,960 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-02-02 09:31:48,960 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-02-02 09:31:48,961 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 09:31:48,961 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 09:31:48,961 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 09:31:48,961 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 09:31:49,129 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-02 09:31:49,262 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 09:31:49,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:31:49 BoogieIcfgContainer [2018-02-02 09:31:49,263 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 09:31:49,263 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 09:31:49,263 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 09:31:49,265 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 09:31:49,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:31:48" (1/3) ... [2018-02-02 09:31:49,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5291325f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:31:49, skipping insertion in model container [2018-02-02 09:31:49,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:31:48" (2/3) ... [2018-02-02 09:31:49,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5291325f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:31:49, skipping insertion in model container [2018-02-02 09:31:49,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:31:49" (3/3) ... [2018-02-02 09:31:49,268 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test22_2_true-valid-memsafety_true-termination.i [2018-02-02 09:31:49,273 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 09:31:49,280 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-02-02 09:31:49,315 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 09:31:49,315 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 09:31:49,315 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 09:31:49,315 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 09:31:49,315 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 09:31:49,315 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 09:31:49,316 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 09:31:49,316 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 09:31:49,317 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 09:31:49,330 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2018-02-02 09:31:49,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 09:31:49,338 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:31:49,339 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:31:49,339 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-02-02 09:31:49,343 INFO L82 PathProgramCache]: Analyzing trace with hash -998986606, now seen corresponding path program 1 times [2018-02-02 09:31:49,344 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:31:49,345 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:31:49,394 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:49,394 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:31:49,394 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:49,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:31:49,441 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:31:49,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:31:49,597 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:31:49,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:31:49,599 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:31:49,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:31:49,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:31:49,612 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 5 states. [2018-02-02 09:31:49,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:31:49,653 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2018-02-02 09:31:49,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:31:49,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 09:31:49,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:31:49,664 INFO L225 Difference]: With dead ends: 149 [2018-02-02 09:31:49,664 INFO L226 Difference]: Without dead ends: 146 [2018-02-02 09:31:49,665 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:31:49,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-02 09:31:49,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2018-02-02 09:31:49,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-02 09:31:49,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 153 transitions. [2018-02-02 09:31:49,700 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 153 transitions. Word has length 17 [2018-02-02 09:31:49,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:31:49,701 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 153 transitions. [2018-02-02 09:31:49,701 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:31:49,701 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2018-02-02 09:31:49,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 09:31:49,701 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:31:49,702 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:31:49,702 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-02-02 09:31:49,702 INFO L82 PathProgramCache]: Analyzing trace with hash -2077747980, now seen corresponding path program 1 times [2018-02-02 09:31:49,702 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:31:49,702 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:31:49,703 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:49,703 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:31:49,704 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:49,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:31:49,720 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:31:49,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:31:49,762 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:31:49,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:31:49,763 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:31:49,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:31:49,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:31:49,763 INFO L87 Difference]: Start difference. First operand 144 states and 153 transitions. Second operand 6 states. [2018-02-02 09:31:49,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:31:49,898 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2018-02-02 09:31:49,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:31:49,898 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 09:31:49,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:31:49,900 INFO L225 Difference]: With dead ends: 145 [2018-02-02 09:31:49,900 INFO L226 Difference]: Without dead ends: 145 [2018-02-02 09:31:49,901 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:31:49,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-02 09:31:49,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2018-02-02 09:31:49,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-02 09:31:49,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 152 transitions. [2018-02-02 09:31:49,915 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 152 transitions. Word has length 19 [2018-02-02 09:31:49,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:31:49,916 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 152 transitions. [2018-02-02 09:31:49,916 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:31:49,916 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 152 transitions. [2018-02-02 09:31:49,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 09:31:49,916 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:31:49,917 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:31:49,917 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-02-02 09:31:49,917 INFO L82 PathProgramCache]: Analyzing trace with hash -2077747979, now seen corresponding path program 1 times [2018-02-02 09:31:49,917 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:31:49,917 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:31:49,918 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:49,918 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:31:49,919 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:31:49,935 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:31:50,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:31:50,063 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:31:50,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 09:31:50,063 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 09:31:50,063 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 09:31:50,063 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:31:50,064 INFO L87 Difference]: Start difference. First operand 143 states and 152 transitions. Second operand 7 states. [2018-02-02 09:31:50,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:31:50,249 INFO L93 Difference]: Finished difference Result 144 states and 153 transitions. [2018-02-02 09:31:50,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 09:31:50,250 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-02-02 09:31:50,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:31:50,251 INFO L225 Difference]: With dead ends: 144 [2018-02-02 09:31:50,251 INFO L226 Difference]: Without dead ends: 144 [2018-02-02 09:31:50,252 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:31:50,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-02-02 09:31:50,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2018-02-02 09:31:50,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-02 09:31:50,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 151 transitions. [2018-02-02 09:31:50,260 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 151 transitions. Word has length 19 [2018-02-02 09:31:50,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:31:50,260 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 151 transitions. [2018-02-02 09:31:50,260 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 09:31:50,260 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2018-02-02 09:31:50,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 09:31:50,261 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:31:50,261 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:31:50,261 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-02-02 09:31:50,261 INFO L82 PathProgramCache]: Analyzing trace with hash -471802203, now seen corresponding path program 1 times [2018-02-02 09:31:50,262 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:31:50,262 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:31:50,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:50,263 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:31:50,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:31:50,276 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:31:50,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:31:50,334 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:31:50,335 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 09:31:50,335 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 09:31:50,335 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 09:31:50,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:31:50,336 INFO L87 Difference]: Start difference. First operand 142 states and 151 transitions. Second operand 7 states. [2018-02-02 09:31:50,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:31:50,366 INFO L93 Difference]: Finished difference Result 159 states and 170 transitions. [2018-02-02 09:31:50,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:31:50,366 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-02-02 09:31:50,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:31:50,368 INFO L225 Difference]: With dead ends: 159 [2018-02-02 09:31:50,368 INFO L226 Difference]: Without dead ends: 159 [2018-02-02 09:31:50,368 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:31:50,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-02-02 09:31:50,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 151. [2018-02-02 09:31:50,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-02 09:31:50,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2018-02-02 09:31:50,378 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 27 [2018-02-02 09:31:50,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:31:50,379 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2018-02-02 09:31:50,379 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 09:31:50,379 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2018-02-02 09:31:50,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 09:31:50,379 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:31:50,379 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:31:50,380 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-02-02 09:31:50,380 INFO L82 PathProgramCache]: Analyzing trace with hash 131109242, now seen corresponding path program 1 times [2018-02-02 09:31:50,380 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:31:50,380 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:31:50,381 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:50,381 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:31:50,381 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:50,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:31:50,394 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:31:50,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:31:50,471 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:31:50,471 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 09:31:50,472 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 09:31:50,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 09:31:50,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:31:50,472 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand 10 states. [2018-02-02 09:31:50,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:31:50,650 INFO L93 Difference]: Finished difference Result 150 states and 159 transitions. [2018-02-02 09:31:50,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:31:50,650 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-02-02 09:31:50,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:31:50,651 INFO L225 Difference]: With dead ends: 150 [2018-02-02 09:31:50,651 INFO L226 Difference]: Without dead ends: 150 [2018-02-02 09:31:50,651 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:31:50,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-02 09:31:50,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-02-02 09:31:50,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-02 09:31:50,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 159 transitions. [2018-02-02 09:31:50,659 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 159 transitions. Word has length 34 [2018-02-02 09:31:50,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:31:50,659 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 159 transitions. [2018-02-02 09:31:50,659 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 09:31:50,659 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 159 transitions. [2018-02-02 09:31:50,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 09:31:50,660 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:31:50,660 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:31:50,660 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-02-02 09:31:50,660 INFO L82 PathProgramCache]: Analyzing trace with hash 131109243, now seen corresponding path program 1 times [2018-02-02 09:31:50,661 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:31:50,661 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:31:50,662 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:50,662 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:31:50,662 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:50,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:31:50,674 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:31:50,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:31:50,698 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:31:50,698 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:31:50,698 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:31:50,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:31:50,698 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:31:50,698 INFO L87 Difference]: Start difference. First operand 150 states and 159 transitions. Second operand 4 states. [2018-02-02 09:31:50,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:31:50,708 INFO L93 Difference]: Finished difference Result 153 states and 162 transitions. [2018-02-02 09:31:50,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:31:50,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-02-02 09:31:50,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:31:50,712 INFO L225 Difference]: With dead ends: 153 [2018-02-02 09:31:50,712 INFO L226 Difference]: Without dead ends: 151 [2018-02-02 09:31:50,712 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:31:50,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-02 09:31:50,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-02-02 09:31:50,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-02 09:31:50,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2018-02-02 09:31:50,718 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 34 [2018-02-02 09:31:50,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:31:50,719 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2018-02-02 09:31:50,719 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:31:50,719 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2018-02-02 09:31:50,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 09:31:50,720 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:31:50,720 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:31:50,720 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-02-02 09:31:50,720 INFO L82 PathProgramCache]: Analyzing trace with hash -2110897305, now seen corresponding path program 1 times [2018-02-02 09:31:50,720 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:31:50,720 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:31:50,721 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:50,721 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:31:50,722 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:50,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:31:50,734 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:31:50,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:31:50,758 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:31:50,758 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 09:31:50,765 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:31:50,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:31:50,790 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:31:50,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:31:50,824 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:31:50,824 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-02-02 09:31:50,824 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:31:50,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:31:50,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:31:50,825 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand 6 states. [2018-02-02 09:31:50,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:31:50,839 INFO L93 Difference]: Finished difference Result 154 states and 163 transitions. [2018-02-02 09:31:50,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:31:50,840 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-02-02 09:31:50,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:31:50,840 INFO L225 Difference]: With dead ends: 154 [2018-02-02 09:31:50,841 INFO L226 Difference]: Without dead ends: 152 [2018-02-02 09:31:50,841 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:31:50,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-02 09:31:50,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-02-02 09:31:50,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-02 09:31:50,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 161 transitions. [2018-02-02 09:31:50,846 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 161 transitions. Word has length 35 [2018-02-02 09:31:50,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:31:50,846 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 161 transitions. [2018-02-02 09:31:50,846 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:31:50,847 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 161 transitions. [2018-02-02 09:31:50,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 09:31:50,847 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:31:50,848 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-02-02 09:31:50,848 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-02-02 09:31:50,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1181841647, now seen corresponding path program 1 times [2018-02-02 09:31:50,848 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:31:50,848 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:31:50,850 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:50,850 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:31:50,850 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:50,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:31:50,862 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:31:50,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:31:50,916 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:31:50,916 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 09:31:50,916 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 09:31:50,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 09:31:50,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:31:50,917 INFO L87 Difference]: Start difference. First operand 152 states and 161 transitions. Second operand 7 states. [2018-02-02 09:31:50,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:31:50,954 INFO L93 Difference]: Finished difference Result 163 states and 174 transitions. [2018-02-02 09:31:50,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:31:50,957 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-02-02 09:31:50,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:31:50,958 INFO L225 Difference]: With dead ends: 163 [2018-02-02 09:31:50,958 INFO L226 Difference]: Without dead ends: 163 [2018-02-02 09:31:50,959 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:31:50,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-02 09:31:50,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2018-02-02 09:31:50,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-02 09:31:50,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 169 transitions. [2018-02-02 09:31:50,967 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 169 transitions. Word has length 36 [2018-02-02 09:31:50,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:31:50,967 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 169 transitions. [2018-02-02 09:31:50,967 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 09:31:50,967 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 169 transitions. [2018-02-02 09:31:50,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 09:31:50,968 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:31:50,968 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:31:50,968 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-02-02 09:31:50,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1401343739, now seen corresponding path program 2 times [2018-02-02 09:31:50,969 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:31:50,969 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:31:50,970 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:50,970 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:31:50,970 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:50,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:31:50,988 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:31:51,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:31:51,016 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:31:51,016 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 09:31:51,023 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 09:31:51,048 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:31:51,051 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:31:51,055 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:31:51,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-02-02 09:31:51,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:31:51,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-02-02 09:31:51,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:31:51,142 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-02-02 09:31:51,142 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-02-02 09:31:51,664 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 09:31:51,680 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:31:51,681 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 19 [2018-02-02 09:31:51,681 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 09:31:51,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 09:31:51,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-02-02 09:31:51,681 INFO L87 Difference]: Start difference. First operand 159 states and 169 transitions. Second operand 19 states. [2018-02-02 09:31:52,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:31:52,612 INFO L93 Difference]: Finished difference Result 181 states and 191 transitions. [2018-02-02 09:31:52,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 09:31:52,612 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-02-02 09:31:52,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:31:52,613 INFO L225 Difference]: With dead ends: 181 [2018-02-02 09:31:52,613 INFO L226 Difference]: Without dead ends: 179 [2018-02-02 09:31:52,613 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2018-02-02 09:31:52,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-02-02 09:31:52,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 159. [2018-02-02 09:31:52,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-02 09:31:52,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 169 transitions. [2018-02-02 09:31:52,618 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 169 transitions. Word has length 36 [2018-02-02 09:31:52,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:31:52,619 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 169 transitions. [2018-02-02 09:31:52,619 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 09:31:52,619 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 169 transitions. [2018-02-02 09:31:52,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 09:31:52,620 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:31:52,621 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:31:52,621 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-02-02 09:31:52,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1379512829, now seen corresponding path program 1 times [2018-02-02 09:31:52,621 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:31:52,621 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:31:52,622 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:52,623 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:31:52,623 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:31:52,629 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:31:52,649 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 09:31:52,649 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:31:52,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 09:31:52,649 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 09:31:52,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 09:31:52,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:31:52,650 INFO L87 Difference]: Start difference. First operand 159 states and 169 transitions. Second operand 3 states. [2018-02-02 09:31:52,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:31:52,709 INFO L93 Difference]: Finished difference Result 177 states and 190 transitions. [2018-02-02 09:31:52,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 09:31:52,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-02-02 09:31:52,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:31:52,710 INFO L225 Difference]: With dead ends: 177 [2018-02-02 09:31:52,710 INFO L226 Difference]: Without dead ends: 163 [2018-02-02 09:31:52,710 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:31:52,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-02 09:31:52,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 155. [2018-02-02 09:31:52,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-02 09:31:52,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 164 transitions. [2018-02-02 09:31:52,717 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 164 transitions. Word has length 39 [2018-02-02 09:31:52,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:31:52,717 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 164 transitions. [2018-02-02 09:31:52,717 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 09:31:52,717 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 164 transitions. [2018-02-02 09:31:52,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 09:31:52,718 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:31:52,718 INFO L351 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:31:52,718 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-02-02 09:31:52,718 INFO L82 PathProgramCache]: Analyzing trace with hash 710655878, now seen corresponding path program 1 times [2018-02-02 09:31:52,718 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:31:52,718 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:31:52,719 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:52,719 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:31:52,719 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:52,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:31:52,727 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:31:52,778 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 09:31:52,779 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:31:52,815 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 09:31:52,815 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 09:31:52,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 09:31:52,816 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:31:52,816 INFO L87 Difference]: Start difference. First operand 155 states and 164 transitions. Second operand 10 states. [2018-02-02 09:31:52,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:31:52,948 INFO L93 Difference]: Finished difference Result 153 states and 162 transitions. [2018-02-02 09:31:52,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:31:52,948 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-02-02 09:31:52,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:31:52,949 INFO L225 Difference]: With dead ends: 153 [2018-02-02 09:31:52,949 INFO L226 Difference]: Without dead ends: 153 [2018-02-02 09:31:52,950 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:31:52,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-02-02 09:31:52,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-02-02 09:31:52,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-02-02 09:31:52,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 162 transitions. [2018-02-02 09:31:52,956 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 162 transitions. Word has length 42 [2018-02-02 09:31:52,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:31:52,956 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 162 transitions. [2018-02-02 09:31:52,956 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 09:31:52,956 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 162 transitions. [2018-02-02 09:31:52,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 09:31:52,957 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:31:52,957 INFO L351 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:31:52,957 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-02-02 09:31:52,957 INFO L82 PathProgramCache]: Analyzing trace with hash 710655879, now seen corresponding path program 1 times [2018-02-02 09:31:52,957 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:31:52,957 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:31:52,958 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:52,958 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:31:52,958 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:31:52,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:31:53,009 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:31:53,010 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:31:53,010 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 09:31:53,028 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:31:53,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:31:53,051 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:31:53,061 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:31:53,091 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:31:53,091 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-02-02 09:31:53,091 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:31:53,092 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:31:53,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:31:53,092 INFO L87 Difference]: Start difference. First operand 153 states and 162 transitions. Second operand 8 states. [2018-02-02 09:31:53,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:31:53,116 INFO L93 Difference]: Finished difference Result 156 states and 165 transitions. [2018-02-02 09:31:53,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 09:31:53,118 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-02-02 09:31:53,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:31:53,119 INFO L225 Difference]: With dead ends: 156 [2018-02-02 09:31:53,119 INFO L226 Difference]: Without dead ends: 154 [2018-02-02 09:31:53,119 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:31:53,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-02-02 09:31:53,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-02-02 09:31:53,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-02-02 09:31:53,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 163 transitions. [2018-02-02 09:31:53,124 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 163 transitions. Word has length 42 [2018-02-02 09:31:53,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:31:53,125 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 163 transitions. [2018-02-02 09:31:53,125 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:31:53,125 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 163 transitions. [2018-02-02 09:31:53,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 09:31:53,126 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:31:53,126 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:31:53,126 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-02-02 09:31:53,126 INFO L82 PathProgramCache]: Analyzing trace with hash -495427355, now seen corresponding path program 1 times [2018-02-02 09:31:53,126 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:31:53,126 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:31:53,127 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:53,127 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:31:53,127 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:31:53,133 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:31:53,155 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 09:31:53,155 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:31:53,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 09:31:53,156 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:31:53,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:31:53,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:31:53,156 INFO L87 Difference]: Start difference. First operand 154 states and 163 transitions. Second operand 6 states. [2018-02-02 09:31:53,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:31:53,171 INFO L93 Difference]: Finished difference Result 138 states and 145 transitions. [2018-02-02 09:31:53,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:31:53,172 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-02-02 09:31:53,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:31:53,173 INFO L225 Difference]: With dead ends: 138 [2018-02-02 09:31:53,173 INFO L226 Difference]: Without dead ends: 138 [2018-02-02 09:31:53,173 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:31:53,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-02 09:31:53,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-02-02 09:31:53,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-02-02 09:31:53,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 145 transitions. [2018-02-02 09:31:53,176 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 145 transitions. Word has length 41 [2018-02-02 09:31:53,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:31:53,177 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 145 transitions. [2018-02-02 09:31:53,177 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:31:53,177 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 145 transitions. [2018-02-02 09:31:53,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 09:31:53,177 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:31:53,177 INFO L351 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:31:53,177 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-02-02 09:31:53,178 INFO L82 PathProgramCache]: Analyzing trace with hash -141638285, now seen corresponding path program 2 times [2018-02-02 09:31:53,178 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:31:53,178 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:31:53,179 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:53,179 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:31:53,179 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:53,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:31:53,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:31:53,228 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:31:53,229 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:31:53,229 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 09:31:53,240 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 09:31:53,264 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:31:53,267 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:31:53,270 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:31:53,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-02-02 09:31:53,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:31:53,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-02-02 09:31:53,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:31:53,303 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-02-02 09:31:53,303 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-02-02 09:31:53,708 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 09:31:53,725 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:31:53,725 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 22 [2018-02-02 09:31:53,725 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 09:31:53,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 09:31:53,726 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2018-02-02 09:31:53,726 INFO L87 Difference]: Start difference. First operand 138 states and 145 transitions. Second operand 22 states. [2018-02-02 09:31:55,956 WARN L143 SmtUtils]: Spent 2034ms on a formula simplification that was a NOOP. DAG size: 31 [2018-02-02 09:31:56,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:31:56,646 INFO L93 Difference]: Finished difference Result 139 states and 146 transitions. [2018-02-02 09:31:56,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 09:31:56,646 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 43 [2018-02-02 09:31:56,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:31:56,647 INFO L225 Difference]: With dead ends: 139 [2018-02-02 09:31:56,647 INFO L226 Difference]: Without dead ends: 137 [2018-02-02 09:31:56,647 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=147, Invalid=845, Unknown=0, NotChecked=0, Total=992 [2018-02-02 09:31:56,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-02-02 09:31:56,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-02-02 09:31:56,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-02 09:31:56,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 144 transitions. [2018-02-02 09:31:56,651 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 144 transitions. Word has length 43 [2018-02-02 09:31:56,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:31:56,651 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 144 transitions. [2018-02-02 09:31:56,651 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 09:31:56,652 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 144 transitions. [2018-02-02 09:31:56,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 09:31:56,652 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:31:56,652 INFO L351 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:31:56,652 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-02-02 09:31:56,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1517747909, now seen corresponding path program 1 times [2018-02-02 09:31:56,653 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:31:56,653 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:31:56,654 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:56,654 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:31:56,654 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:56,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:31:56,664 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:31:56,702 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-02 09:31:56,702 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:31:56,702 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 09:31:56,702 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:31:56,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:31:56,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:31:56,703 INFO L87 Difference]: Start difference. First operand 137 states and 144 transitions. Second operand 8 states. [2018-02-02 09:31:56,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:31:56,723 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2018-02-02 09:31:56,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:31:56,724 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-02-02 09:31:56,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:31:56,724 INFO L225 Difference]: With dead ends: 139 [2018-02-02 09:31:56,724 INFO L226 Difference]: Without dead ends: 137 [2018-02-02 09:31:56,724 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:31:56,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-02-02 09:31:56,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-02-02 09:31:56,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-02 09:31:56,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 143 transitions. [2018-02-02 09:31:56,730 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 143 transitions. Word has length 47 [2018-02-02 09:31:56,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:31:56,730 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 143 transitions. [2018-02-02 09:31:56,730 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:31:56,730 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 143 transitions. [2018-02-02 09:31:56,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 09:31:56,730 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:31:56,731 INFO L351 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:31:56,731 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-02-02 09:31:56,731 INFO L82 PathProgramCache]: Analyzing trace with hash 2035822852, now seen corresponding path program 1 times [2018-02-02 09:31:56,731 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:31:56,731 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:31:56,732 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:56,732 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:31:56,732 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:31:56,741 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:31:56,788 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-02 09:31:56,788 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:31:56,788 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 09:31:56,789 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 09:31:56,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 09:31:56,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:31:56,789 INFO L87 Difference]: Start difference. First operand 137 states and 143 transitions. Second operand 10 states. [2018-02-02 09:31:56,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:31:56,833 INFO L93 Difference]: Finished difference Result 141 states and 146 transitions. [2018-02-02 09:31:56,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:31:56,833 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2018-02-02 09:31:56,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:31:56,833 INFO L225 Difference]: With dead ends: 141 [2018-02-02 09:31:56,834 INFO L226 Difference]: Without dead ends: 137 [2018-02-02 09:31:56,834 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:31:56,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-02-02 09:31:56,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-02-02 09:31:56,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-02 09:31:56,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 142 transitions. [2018-02-02 09:31:56,836 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 142 transitions. Word has length 52 [2018-02-02 09:31:56,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:31:56,836 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 142 transitions. [2018-02-02 09:31:56,837 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 09:31:56,837 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 142 transitions. [2018-02-02 09:31:56,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 09:31:56,837 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:31:56,837 INFO L351 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:31:56,837 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-02-02 09:31:56,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1511828740, now seen corresponding path program 1 times [2018-02-02 09:31:56,838 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:31:56,838 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:31:56,839 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:56,839 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:31:56,839 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:31:56,850 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:31:56,962 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-02 09:31:56,963 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:31:56,963 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 09:31:56,963 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 09:31:56,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 09:31:56,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:31:56,964 INFO L87 Difference]: Start difference. First operand 137 states and 142 transitions. Second operand 13 states. [2018-02-02 09:31:57,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:31:57,217 INFO L93 Difference]: Finished difference Result 135 states and 140 transitions. [2018-02-02 09:31:57,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 09:31:57,217 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 63 [2018-02-02 09:31:57,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:31:57,218 INFO L225 Difference]: With dead ends: 135 [2018-02-02 09:31:57,218 INFO L226 Difference]: Without dead ends: 135 [2018-02-02 09:31:57,218 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-02-02 09:31:57,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-02 09:31:57,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-02-02 09:31:57,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-02 09:31:57,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 140 transitions. [2018-02-02 09:31:57,221 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 140 transitions. Word has length 63 [2018-02-02 09:31:57,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:31:57,221 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 140 transitions. [2018-02-02 09:31:57,221 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 09:31:57,222 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 140 transitions. [2018-02-02 09:31:57,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 09:31:57,222 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:31:57,222 INFO L351 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:31:57,222 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-02-02 09:31:57,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1511828741, now seen corresponding path program 1 times [2018-02-02 09:31:57,223 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:31:57,223 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:31:57,223 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:57,223 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:31:57,224 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:57,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:31:57,236 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:31:57,280 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:31:57,280 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:31:57,280 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 09:31:57,288 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:31:57,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:31:57,340 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:31:57,348 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:31:57,375 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:31:57,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-02-02 09:31:57,375 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 09:31:57,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 09:31:57,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:31:57,375 INFO L87 Difference]: Start difference. First operand 135 states and 140 transitions. Second operand 10 states. [2018-02-02 09:31:57,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:31:57,395 INFO L93 Difference]: Finished difference Result 138 states and 143 transitions. [2018-02-02 09:31:57,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 09:31:57,396 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2018-02-02 09:31:57,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:31:57,396 INFO L225 Difference]: With dead ends: 138 [2018-02-02 09:31:57,396 INFO L226 Difference]: Without dead ends: 136 [2018-02-02 09:31:57,397 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-02-02 09:31:57,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-02-02 09:31:57,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-02-02 09:31:57,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-02-02 09:31:57,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 141 transitions. [2018-02-02 09:31:57,399 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 141 transitions. Word has length 63 [2018-02-02 09:31:57,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:31:57,400 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 141 transitions. [2018-02-02 09:31:57,400 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 09:31:57,400 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 141 transitions. [2018-02-02 09:31:57,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 09:31:57,400 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:31:57,401 INFO L351 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:31:57,401 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-02-02 09:31:57,401 INFO L82 PathProgramCache]: Analyzing trace with hash 2058801817, now seen corresponding path program 2 times [2018-02-02 09:31:57,401 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:31:57,401 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:31:57,405 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:57,406 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:31:57,406 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:31:57,421 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:31:57,473 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:31:57,473 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:31:57,474 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 09:31:57,478 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 09:31:57,496 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:31:57,498 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:31:57,501 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:31:57,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-02-02 09:31:57,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:31:57,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-02-02 09:31:57,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:31:57,536 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-02-02 09:31:57,537 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-02-02 09:31:57,997 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-02-02 09:31:58,014 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:31:58,106 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [10] total 27 [2018-02-02 09:31:58,107 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 09:31:58,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 09:31:58,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2018-02-02 09:31:58,107 INFO L87 Difference]: Start difference. First operand 136 states and 141 transitions. Second operand 27 states. [2018-02-02 09:31:59,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:31:59,125 INFO L93 Difference]: Finished difference Result 137 states and 142 transitions. [2018-02-02 09:31:59,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 09:31:59,125 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 64 [2018-02-02 09:31:59,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:31:59,125 INFO L225 Difference]: With dead ends: 137 [2018-02-02 09:31:59,125 INFO L226 Difference]: Without dead ends: 135 [2018-02-02 09:31:59,126 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=213, Invalid=1347, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 09:31:59,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-02 09:31:59,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-02-02 09:31:59,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-02 09:31:59,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 140 transitions. [2018-02-02 09:31:59,128 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 140 transitions. Word has length 64 [2018-02-02 09:31:59,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:31:59,128 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 140 transitions. [2018-02-02 09:31:59,128 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 09:31:59,128 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 140 transitions. [2018-02-02 09:31:59,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 09:31:59,129 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:31:59,129 INFO L351 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:31:59,129 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-02-02 09:31:59,129 INFO L82 PathProgramCache]: Analyzing trace with hash -243629328, now seen corresponding path program 1 times [2018-02-02 09:31:59,129 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:31:59,129 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:31:59,130 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:59,130 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:31:59,130 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:59,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:31:59,145 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:31:59,227 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-02-02 09:31:59,227 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:31:59,227 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 09:31:59,228 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 09:31:59,228 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 09:31:59,228 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-02 09:31:59,228 INFO L87 Difference]: Start difference. First operand 135 states and 140 transitions. Second operand 11 states. [2018-02-02 09:31:59,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:31:59,292 INFO L93 Difference]: Finished difference Result 138 states and 142 transitions. [2018-02-02 09:31:59,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 09:31:59,292 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2018-02-02 09:31:59,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:31:59,293 INFO L225 Difference]: With dead ends: 138 [2018-02-02 09:31:59,293 INFO L226 Difference]: Without dead ends: 135 [2018-02-02 09:31:59,294 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:31:59,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-02 09:31:59,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-02-02 09:31:59,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-02 09:31:59,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2018-02-02 09:31:59,297 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 74 [2018-02-02 09:31:59,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:31:59,298 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2018-02-02 09:31:59,298 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 09:31:59,298 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2018-02-02 09:31:59,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 09:31:59,299 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:31:59,299 INFO L351 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:31:59,299 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-02-02 09:31:59,299 INFO L82 PathProgramCache]: Analyzing trace with hash 254396120, now seen corresponding path program 1 times [2018-02-02 09:31:59,299 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:31:59,299 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:31:59,300 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:59,300 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:31:59,300 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:31:59,316 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:31:59,452 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-02-02 09:31:59,452 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:31:59,452 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-02 09:31:59,452 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 09:31:59,452 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 09:31:59,452 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-02-02 09:31:59,453 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand 18 states. [2018-02-02 09:31:59,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:31:59,739 INFO L93 Difference]: Finished difference Result 163 states and 174 transitions. [2018-02-02 09:31:59,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 09:31:59,739 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2018-02-02 09:31:59,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:31:59,740 INFO L225 Difference]: With dead ends: 163 [2018-02-02 09:31:59,740 INFO L226 Difference]: Without dead ends: 163 [2018-02-02 09:31:59,740 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2018-02-02 09:31:59,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-02 09:31:59,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 158. [2018-02-02 09:31:59,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-02 09:31:59,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 170 transitions. [2018-02-02 09:31:59,744 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 170 transitions. Word has length 87 [2018-02-02 09:31:59,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:31:59,744 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 170 transitions. [2018-02-02 09:31:59,745 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 09:31:59,745 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 170 transitions. [2018-02-02 09:31:59,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 09:31:59,745 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:31:59,746 INFO L351 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:31:59,746 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-02-02 09:31:59,746 INFO L82 PathProgramCache]: Analyzing trace with hash 254396121, now seen corresponding path program 1 times [2018-02-02 09:31:59,746 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:31:59,746 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:31:59,747 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:59,747 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:31:59,747 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:59,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:31:59,763 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:31:59,858 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:31:59,858 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:31:59,858 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 09:31:59,867 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:31:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:31:59,910 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:31:59,918 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:31:59,934 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:31:59,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-02-02 09:31:59,935 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 09:31:59,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 09:31:59,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:31:59,935 INFO L87 Difference]: Start difference. First operand 158 states and 170 transitions. Second operand 12 states. [2018-02-02 09:31:59,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:31:59,957 INFO L93 Difference]: Finished difference Result 161 states and 173 transitions. [2018-02-02 09:31:59,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 09:31:59,959 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 87 [2018-02-02 09:31:59,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:31:59,959 INFO L225 Difference]: With dead ends: 161 [2018-02-02 09:31:59,959 INFO L226 Difference]: Without dead ends: 159 [2018-02-02 09:31:59,960 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:31:59,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-02-02 09:31:59,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-02-02 09:31:59,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-02 09:31:59,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 171 transitions. [2018-02-02 09:31:59,963 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 171 transitions. Word has length 87 [2018-02-02 09:31:59,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:31:59,963 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 171 transitions. [2018-02-02 09:31:59,963 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 09:31:59,963 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 171 transitions. [2018-02-02 09:31:59,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-02 09:31:59,964 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:31:59,964 INFO L351 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:31:59,964 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-02-02 09:31:59,964 INFO L82 PathProgramCache]: Analyzing trace with hash -388927379, now seen corresponding path program 2 times [2018-02-02 09:31:59,964 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:31:59,964 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:31:59,965 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:59,965 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:31:59,965 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:31:59,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:31:59,974 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:32:00,029 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:32:00,029 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:32:00,029 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 09:32:00,047 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 09:32:00,084 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:32:00,090 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:32:00,094 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:32:00,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-02-02 09:32:00,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:32:00,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-02-02 09:32:00,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:32:00,128 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-02-02 09:32:00,128 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-02-02 09:32:00,816 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 09:32:00,833 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:32:00,833 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [12] total 31 [2018-02-02 09:32:00,834 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 09:32:00,834 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 09:32:00,834 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=804, Unknown=0, NotChecked=0, Total=930 [2018-02-02 09:32:00,835 INFO L87 Difference]: Start difference. First operand 159 states and 171 transitions. Second operand 31 states. [2018-02-02 09:32:02,908 WARN L143 SmtUtils]: Spent 2036ms on a formula simplification that was a NOOP. DAG size: 39 [2018-02-02 09:32:04,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:32:04,483 INFO L93 Difference]: Finished difference Result 160 states and 170 transitions. [2018-02-02 09:32:04,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 09:32:04,483 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 88 [2018-02-02 09:32:04,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:32:04,484 INFO L225 Difference]: With dead ends: 160 [2018-02-02 09:32:04,484 INFO L226 Difference]: Without dead ends: 158 [2018-02-02 09:32:04,484 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=286, Invalid=1876, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 09:32:04,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-02 09:32:04,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-02-02 09:32:04,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-02 09:32:04,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 168 transitions. [2018-02-02 09:32:04,488 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 168 transitions. Word has length 88 [2018-02-02 09:32:04,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:32:04,488 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 168 transitions. [2018-02-02 09:32:04,488 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 09:32:04,489 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 168 transitions. [2018-02-02 09:32:04,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-02 09:32:04,489 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:32:04,490 INFO L351 BasicCegarLoop]: trace histogram [9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:32:04,490 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-02-02 09:32:04,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1868073210, now seen corresponding path program 1 times [2018-02-02 09:32:04,490 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:32:04,490 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:32:04,491 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:32:04,491 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:32:04,491 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:32:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:32:04,505 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:32:04,582 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-02-02 09:32:04,582 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:32:04,582 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 09:32:04,591 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:32:04,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:32:04,635 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:32:04,821 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 09:32:04,842 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:32:04,842 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 22 [2018-02-02 09:32:04,843 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 09:32:04,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 09:32:04,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-02-02 09:32:04,844 INFO L87 Difference]: Start difference. First operand 158 states and 168 transitions. Second operand 22 states. [2018-02-02 09:32:04,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:32:04,954 INFO L93 Difference]: Finished difference Result 162 states and 168 transitions. [2018-02-02 09:32:04,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 09:32:04,954 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 92 [2018-02-02 09:32:04,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:32:04,954 INFO L225 Difference]: With dead ends: 162 [2018-02-02 09:32:04,955 INFO L226 Difference]: Without dead ends: 156 [2018-02-02 09:32:04,955 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2018-02-02 09:32:04,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-02-02 09:32:04,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-02-02 09:32:04,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-02-02 09:32:04,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 162 transitions. [2018-02-02 09:32:04,957 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 162 transitions. Word has length 92 [2018-02-02 09:32:04,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:32:04,957 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 162 transitions. [2018-02-02 09:32:04,957 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 09:32:04,958 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 162 transitions. [2018-02-02 09:32:04,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-02-02 09:32:04,958 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:32:04,958 INFO L351 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:32:04,958 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-02-02 09:32:04,958 INFO L82 PathProgramCache]: Analyzing trace with hash -63866368, now seen corresponding path program 1 times [2018-02-02 09:32:04,958 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:32:04,959 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:32:04,959 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:32:04,959 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:32:04,959 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:32:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:32:04,970 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:32:05,229 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-02-02 09:32:05,229 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:32:05,229 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-02-02 09:32:05,229 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 09:32:05,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 09:32:05,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-02-02 09:32:05,230 INFO L87 Difference]: Start difference. First operand 156 states and 162 transitions. Second operand 21 states. [2018-02-02 09:32:05,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:32:05,626 INFO L93 Difference]: Finished difference Result 166 states and 175 transitions. [2018-02-02 09:32:05,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 09:32:05,626 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 104 [2018-02-02 09:32:05,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:32:05,626 INFO L225 Difference]: With dead ends: 166 [2018-02-02 09:32:05,627 INFO L226 Difference]: Without dead ends: 166 [2018-02-02 09:32:05,627 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2018-02-02 09:32:05,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-02-02 09:32:05,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2018-02-02 09:32:05,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-02-02 09:32:05,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 172 transitions. [2018-02-02 09:32:05,629 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 172 transitions. Word has length 104 [2018-02-02 09:32:05,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:32:05,630 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 172 transitions. [2018-02-02 09:32:05,630 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 09:32:05,630 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 172 transitions. [2018-02-02 09:32:05,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-02-02 09:32:05,630 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:32:05,631 INFO L351 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:32:05,631 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-02-02 09:32:05,631 INFO L82 PathProgramCache]: Analyzing trace with hash -63866367, now seen corresponding path program 1 times [2018-02-02 09:32:05,631 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:32:05,631 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:32:05,632 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:32:05,632 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:32:05,632 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:32:05,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:32:05,649 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:32:05,763 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:32:05,763 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:32:05,763 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 09:32:05,771 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:32:05,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:32:05,841 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:32:05,862 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:32:05,880 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:32:05,880 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-02-02 09:32:05,880 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 09:32:05,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 09:32:05,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-02-02 09:32:05,881 INFO L87 Difference]: Start difference. First operand 162 states and 172 transitions. Second operand 15 states. [2018-02-02 09:32:05,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:32:05,905 INFO L93 Difference]: Finished difference Result 165 states and 175 transitions. [2018-02-02 09:32:05,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 09:32:05,905 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 104 [2018-02-02 09:32:05,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:32:05,906 INFO L225 Difference]: With dead ends: 165 [2018-02-02 09:32:05,906 INFO L226 Difference]: Without dead ends: 163 [2018-02-02 09:32:05,906 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=97, Invalid=143, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:32:05,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-02 09:32:05,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-02-02 09:32:05,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-02-02 09:32:05,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 173 transitions. [2018-02-02 09:32:05,908 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 173 transitions. Word has length 104 [2018-02-02 09:32:05,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:32:05,909 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 173 transitions. [2018-02-02 09:32:05,909 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 09:32:05,909 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 173 transitions. [2018-02-02 09:32:05,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-02-02 09:32:05,909 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:32:05,909 INFO L351 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:32:05,909 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-02-02 09:32:05,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1207457043, now seen corresponding path program 2 times [2018-02-02 09:32:05,909 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:32:05,909 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:32:05,910 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:32:05,910 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:32:05,910 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:32:05,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:32:05,923 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:32:06,028 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:32:06,028 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:32:06,028 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 09:32:06,035 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 09:32:06,080 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:32:06,088 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:32:06,093 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:32:06,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-02-02 09:32:06,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:32:06,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-02-02 09:32:06,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:32:06,132 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-02-02 09:32:06,132 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-02-02 09:32:06,988 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-02-02 09:32:07,007 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:32:07,007 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [15] total 38 [2018-02-02 09:32:07,008 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-02 09:32:07,008 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-02 09:32:07,008 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1228, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 09:32:07,008 INFO L87 Difference]: Start difference. First operand 163 states and 173 transitions. Second operand 38 states. [2018-02-02 09:32:09,247 WARN L143 SmtUtils]: Spent 2018ms on a formula simplification that was a NOOP. DAG size: 35 [2018-02-02 09:32:10,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:32:10,649 INFO L93 Difference]: Finished difference Result 164 states and 173 transitions. [2018-02-02 09:32:10,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-02 09:32:10,649 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 105 [2018-02-02 09:32:10,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:32:10,650 INFO L225 Difference]: With dead ends: 164 [2018-02-02 09:32:10,650 INFO L226 Difference]: Without dead ends: 162 [2018-02-02 09:32:10,651 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 78 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=425, Invalid=2997, Unknown=0, NotChecked=0, Total=3422 [2018-02-02 09:32:10,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-02 09:32:10,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-02-02 09:32:10,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-02-02 09:32:10,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 171 transitions. [2018-02-02 09:32:10,654 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 171 transitions. Word has length 105 [2018-02-02 09:32:10,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:32:10,654 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 171 transitions. [2018-02-02 09:32:10,655 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-02 09:32:10,655 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 171 transitions. [2018-02-02 09:32:10,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-02-02 09:32:10,655 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:32:10,655 INFO L351 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:32:10,655 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-02-02 09:32:10,655 INFO L82 PathProgramCache]: Analyzing trace with hash 2055534530, now seen corresponding path program 1 times [2018-02-02 09:32:10,655 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:32:10,655 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:32:10,656 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:32:10,656 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:32:10,656 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:32:10,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:32:10,667 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:32:10,788 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:32:10,788 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:32:10,788 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 09:32:10,793 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:32:10,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:32:10,842 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:32:10,853 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:32:10,870 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:32:10,870 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-02-02 09:32:10,873 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 09:32:10,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 09:32:10,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-02-02 09:32:10,874 INFO L87 Difference]: Start difference. First operand 162 states and 171 transitions. Second operand 17 states. [2018-02-02 09:32:10,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:32:10,902 INFO L93 Difference]: Finished difference Result 165 states and 174 transitions. [2018-02-02 09:32:10,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 09:32:10,903 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 110 [2018-02-02 09:32:10,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:32:10,904 INFO L225 Difference]: With dead ends: 165 [2018-02-02 09:32:10,904 INFO L226 Difference]: Without dead ends: 163 [2018-02-02 09:32:10,904 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=126, Invalid=180, Unknown=0, NotChecked=0, Total=306 [2018-02-02 09:32:10,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-02 09:32:10,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-02-02 09:32:10,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-02-02 09:32:10,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 172 transitions. [2018-02-02 09:32:10,908 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 172 transitions. Word has length 110 [2018-02-02 09:32:10,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:32:10,908 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 172 transitions. [2018-02-02 09:32:10,908 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 09:32:10,908 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 172 transitions. [2018-02-02 09:32:10,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-02-02 09:32:10,908 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:32:10,909 INFO L351 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:32:10,909 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-02-02 09:32:10,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1832241070, now seen corresponding path program 2 times [2018-02-02 09:32:10,909 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:32:10,909 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:32:10,910 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:32:10,910 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:32:10,910 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:32:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:32:10,927 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:32:11,067 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:32:11,068 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:32:11,068 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 09:32:11,075 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 09:32:11,119 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:32:11,125 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:32:11,130 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:32:11,179 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-02-02 09:32:11,180 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-02-02 09:32:11,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:32:11,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:32:11,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:32:11,182 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-02-02 09:32:11,243 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:32:11,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:32:11,250 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-02-02 09:32:11,250 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:26 [2018-02-02 09:32:11,253 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-02-02 09:32:11,258 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-02-02 09:32:11,260 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:11,262 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-02-02 09:32:11,264 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:11,265 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:11,268 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-02-02 09:32:11,268 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 09:32:11,272 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:32:11,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:32:11,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:32:11,278 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:37, output treesize:9 [2018-02-02 09:32:11,597 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:11,597 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-02-02 09:32:11,599 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:32:11,599 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:11,600 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-02-02 09:32:11,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:32:11,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:32:11,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:32:11,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:13 [2018-02-02 09:32:12,002 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-02-02 09:32:12,003 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-02-02 09:32:12,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:32:12,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:32:12,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:32:12,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-02-02 09:32:12,040 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-02-02 09:32:12,063 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:32:12,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [41] imperfect sequences [17] total 56 [2018-02-02 09:32:12,063 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-02 09:32:12,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-02 09:32:12,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=2761, Unknown=1, NotChecked=106, Total=3080 [2018-02-02 09:32:12,064 INFO L87 Difference]: Start difference. First operand 163 states and 172 transitions. Second operand 56 states. [2018-02-02 09:32:14,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:32:14,125 INFO L93 Difference]: Finished difference Result 159 states and 162 transitions. [2018-02-02 09:32:14,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-02-02 09:32:14,126 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 111 [2018-02-02 09:32:14,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:32:14,126 INFO L225 Difference]: With dead ends: 159 [2018-02-02 09:32:14,126 INFO L226 Difference]: Without dead ends: 157 [2018-02-02 09:32:14,127 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1026 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=325, Invalid=5530, Unknown=1, NotChecked=150, Total=6006 [2018-02-02 09:32:14,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-02-02 09:32:14,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-02-02 09:32:14,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-02-02 09:32:14,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 160 transitions. [2018-02-02 09:32:14,129 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 160 transitions. Word has length 111 [2018-02-02 09:32:14,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:32:14,129 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 160 transitions. [2018-02-02 09:32:14,130 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-02 09:32:14,130 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 160 transitions. [2018-02-02 09:32:14,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-02-02 09:32:14,130 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:32:14,130 INFO L351 BasicCegarLoop]: trace histogram [14, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:32:14,130 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-02-02 09:32:14,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1142789455, now seen corresponding path program 1 times [2018-02-02 09:32:14,130 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:32:14,130 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:32:14,131 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:32:14,131 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:32:14,131 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:32:14,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:32:14,150 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:32:14,364 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-02-02 09:32:14,365 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:32:14,365 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 09:32:14,373 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:32:14,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:32:14,450 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:32:14,693 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 09:32:14,719 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:32:14,719 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2018-02-02 09:32:14,719 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 09:32:14,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 09:32:14,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1016, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 09:32:14,720 INFO L87 Difference]: Start difference. First operand 157 states and 160 transitions. Second operand 35 states. [2018-02-02 09:32:15,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:32:15,587 INFO L93 Difference]: Finished difference Result 169 states and 172 transitions. [2018-02-02 09:32:15,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 09:32:15,587 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 119 [2018-02-02 09:32:15,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:32:15,587 INFO L225 Difference]: With dead ends: 169 [2018-02-02 09:32:15,587 INFO L226 Difference]: Without dead ends: 167 [2018-02-02 09:32:15,589 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=521, Invalid=3639, Unknown=0, NotChecked=0, Total=4160 [2018-02-02 09:32:15,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-02-02 09:32:15,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-02-02 09:32:15,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-02 09:32:15,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 168 transitions. [2018-02-02 09:32:15,592 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 168 transitions. Word has length 119 [2018-02-02 09:32:15,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:32:15,592 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 168 transitions. [2018-02-02 09:32:15,592 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 09:32:15,592 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 168 transitions. [2018-02-02 09:32:15,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-02-02 09:32:15,593 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:32:15,593 INFO L351 BasicCegarLoop]: trace histogram [15, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:32:15,593 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-02-02 09:32:15,593 INFO L82 PathProgramCache]: Analyzing trace with hash -577478985, now seen corresponding path program 1 times [2018-02-02 09:32:15,593 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:32:15,593 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:32:15,594 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:32:15,594 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:32:15,594 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:32:15,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:32:15,611 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:32:15,891 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-02-02 09:32:15,891 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:32:15,891 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 09:32:15,901 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:32:15,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:32:15,966 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:32:16,220 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-02-02 09:32:16,237 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:32:16,237 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 39 [2018-02-02 09:32:16,237 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-02 09:32:16,237 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-02 09:32:16,238 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1287, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 09:32:16,238 INFO L87 Difference]: Start difference. First operand 165 states and 168 transitions. Second operand 39 states. [2018-02-02 09:32:17,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:32:17,389 INFO L93 Difference]: Finished difference Result 169 states and 172 transitions. [2018-02-02 09:32:17,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 09:32:17,389 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 134 [2018-02-02 09:32:17,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:32:17,390 INFO L225 Difference]: With dead ends: 169 [2018-02-02 09:32:17,390 INFO L226 Difference]: Without dead ends: 167 [2018-02-02 09:32:17,391 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=595, Invalid=4807, Unknown=0, NotChecked=0, Total=5402 [2018-02-02 09:32:17,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-02-02 09:32:17,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-02-02 09:32:17,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-02 09:32:17,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 168 transitions. [2018-02-02 09:32:17,393 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 168 transitions. Word has length 134 [2018-02-02 09:32:17,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:32:17,393 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 168 transitions. [2018-02-02 09:32:17,393 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-02 09:32:17,393 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 168 transitions. [2018-02-02 09:32:17,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-02-02 09:32:17,394 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:32:17,394 INFO L351 BasicCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:32:17,394 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-02-02 09:32:17,394 INFO L82 PathProgramCache]: Analyzing trace with hash -460832411, now seen corresponding path program 1 times [2018-02-02 09:32:17,394 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:32:17,394 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:32:17,395 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:32:17,395 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:32:17,395 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:32:17,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:32:17,503 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:32:22,179 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 22 proven. 129 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 09:32:22,180 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:32:22,180 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:32:22,184 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:32:22,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:32:22,239 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:32:22,336 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 13 treesize of output 10 [2018-02-02 09:32:22,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-02 09:32:22,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:32:22,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:32:22,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:32:22,347 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-02-02 09:32:22,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-02-02 09:32:22,411 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:22,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-02-02 09:32:22,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:32:22,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:32:22,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:32:22,433 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2018-02-02 09:32:22,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-02-02 09:32:22,520 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:22,521 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:22,521 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:22,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 52 [2018-02-02 09:32:22,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:32:22,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:32:22,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 09:32:22,561 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2018-02-02 09:32:22,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2018-02-02 09:32:22,657 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:22,658 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:22,659 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:22,659 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:22,660 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:22,660 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:22,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 85 [2018-02-02 09:32:22,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:32:22,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:32:22,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-02 09:32:22,683 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:68, output treesize:64 [2018-02-02 09:32:22,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 47 [2018-02-02 09:32:22,784 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:22,785 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:22,786 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:22,786 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:22,787 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:22,788 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:22,789 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:22,789 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:22,790 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:22,791 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:22,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 126 [2018-02-02 09:32:22,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:32:22,809 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:32:22,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-02 09:32:22,830 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:84, output treesize:80 [2018-02-02 09:32:22,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2018-02-02 09:32:22,944 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:22,945 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:22,945 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:22,946 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:22,946 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:22,947 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:22,948 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:22,948 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:22,949 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:22,949 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:22,950 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:22,950 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:22,951 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:22,952 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:22,952 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:22,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 175 [2018-02-02 09:32:22,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:32:22,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:32:22,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-02-02 09:32:22,993 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:100, output treesize:96 [2018-02-02 09:32:23,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 65 [2018-02-02 09:32:23,138 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,139 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,140 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,141 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,142 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,143 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,144 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,144 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,145 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,146 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,147 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,148 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,149 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,150 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,151 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,152 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,152 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,153 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,154 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,155 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,155 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 232 [2018-02-02 09:32:23,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:32:23,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:32:23,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-02-02 09:32:23,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:116, output treesize:112 [2018-02-02 09:32:23,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 74 [2018-02-02 09:32:23,663 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,664 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,665 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,665 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,666 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,667 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,668 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,669 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,669 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,670 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,671 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,672 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,672 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,673 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,674 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,675 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,676 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,677 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,677 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,678 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,679 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,680 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,680 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,681 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,682 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,682 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,683 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,684 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:23,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 297 [2018-02-02 09:32:23,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:32:23,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:32:23,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-02-02 09:32:23,764 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:132, output treesize:128 [2018-02-02 09:32:28,789 WARN L143 SmtUtils]: Spent 249ms on a formula simplification that was a NOOP. DAG size: 59 [2018-02-02 09:32:28,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 83 [2018-02-02 09:32:28,802 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:28,803 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:28,804 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:28,805 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:28,807 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:28,808 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:28,809 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:28,810 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:28,824 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:28,825 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:28,826 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:28,827 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:28,828 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:28,829 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:28,830 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:28,830 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:28,831 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:28,832 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:28,833 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:28,834 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:28,834 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:28,835 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:28,836 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:28,837 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:28,838 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:28,839 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:28,839 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:28,840 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:28,841 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:28,842 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:28,843 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:28,843 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:28,844 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:28,845 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:28,846 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:28,847 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:28,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 370 [2018-02-02 09:32:28,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:32:28,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:32:28,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-02-02 09:32:28,940 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:148, output treesize:144 [2018-02-02 09:32:42,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 92 [2018-02-02 09:32:42,320 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:42,321 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:42,322 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:42,323 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:42,324 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:42,325 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:42,326 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:42,327 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:42,328 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:42,329 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:42,330 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:42,331 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:42,332 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:42,333 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:42,334 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:42,335 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:42,336 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:42,336 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:42,338 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:42,339 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:42,340 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:42,341 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:42,342 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:42,343 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:42,344 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:42,345 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:42,346 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:42,348 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:42,349 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:42,349 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:42,350 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:42,351 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:42,352 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:42,353 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:42,355 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:42,356 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:42,358 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:42,359 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:42,360 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:42,361 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:42,363 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:42,363 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:42,364 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:42,365 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:42,366 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:42,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 451 [2018-02-02 09:32:42,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:32:42,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:32:42,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2018-02-02 09:32:42,489 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:164, output treesize:160 Received shutdown request... [2018-02-02 09:32:48,245 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-02 09:32:48,245 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 09:32:48,249 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 09:32:48,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:32:48 BoogieIcfgContainer [2018-02-02 09:32:48,249 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 09:32:48,249 INFO L168 Benchmark]: Toolchain (without parser) took 59548.17 ms. Allocated memory was 402.1 MB in the beginning and 1.2 GB in the end (delta: 764.4 MB). Free memory was 359.0 MB in the beginning and 638.3 MB in the end (delta: -279.2 MB). Peak memory consumption was 485.2 MB. Max. memory is 5.3 GB. [2018-02-02 09:32:48,250 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 402.1 MB. Free memory is still 365.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 09:32:48,250 INFO L168 Benchmark]: CACSL2BoogieTranslator took 180.47 ms. Allocated memory is still 402.1 MB. Free memory was 359.0 MB in the beginning and 344.5 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. [2018-02-02 09:32:48,251 INFO L168 Benchmark]: Boogie Preprocessor took 32.82 ms. Allocated memory is still 402.1 MB. Free memory was 344.5 MB in the beginning and 343.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 09:32:48,251 INFO L168 Benchmark]: RCFGBuilder took 346.39 ms. Allocated memory is still 402.1 MB. Free memory was 343.1 MB in the beginning and 306.6 MB in the end (delta: 36.6 MB). Peak memory consumption was 36.6 MB. Max. memory is 5.3 GB. [2018-02-02 09:32:48,251 INFO L168 Benchmark]: TraceAbstraction took 58985.94 ms. Allocated memory was 402.1 MB in the beginning and 1.2 GB in the end (delta: 764.4 MB). Free memory was 306.6 MB in the beginning and 638.3 MB in the end (delta: -331.7 MB). Peak memory consumption was 432.7 MB. Max. memory is 5.3 GB. [2018-02-02 09:32:48,252 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.16 ms. Allocated memory is still 402.1 MB. Free memory is still 365.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 180.47 ms. Allocated memory is still 402.1 MB. Free memory was 359.0 MB in the beginning and 344.5 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.82 ms. Allocated memory is still 402.1 MB. Free memory was 344.5 MB in the beginning and 343.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 346.39 ms. Allocated memory is still 402.1 MB. Free memory was 343.1 MB in the beginning and 306.6 MB in the end (delta: 36.6 MB). Peak memory consumption was 36.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 58985.94 ms. Allocated memory was 402.1 MB in the beginning and 1.2 GB in the end (delta: 764.4 MB). Free memory was 306.6 MB in the beginning and 638.3 MB in the end (delta: -331.7 MB). Peak memory consumption was 432.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1294). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 85 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1294). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 85 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1411). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 85 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1411). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 85 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1265). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 85 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1265). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 85 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1267). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 85 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1267). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 85 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1256). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 85 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1256). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 85 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1258). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 85 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1258). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 85 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 85 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 85 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 85 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 85 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1339). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 85 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1339). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 85 known predicates. - TimeoutResultAtElement [Line: 1443]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1443). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 85 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1099). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 85 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1100). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 85 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1100). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 85 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1099). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 85 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 143 locations, 23 error locations. TIMEOUT Result, 58.9s OverallTime, 32 OverallIterations, 16 TraceHistogramMax, 18.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3830 SDtfs, 1230 SDslu, 34678 SDs, 0 SdLazy, 16493 SolverSat, 387 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1762 GetRequests, 1106 SyntacticMatches, 10 SemanticMatches, 646 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4246 ImplicationChecksByTransitivity, 15.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=165occurred in iteration=30, 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.1s AutomataMinimizationTime, 31 MinimizatonAttempts, 59 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 3201 NumberOfCodeBlocks, 3157 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 3155 ConstructedInterpolants, 273 QuantifiedInterpolants, 1038937 SizeOfPredicates, 112 NumberOfNonLiveVariables, 5731 ConjunctsInSsa, 562 ConjunctsInUnsatCore, 46 InterpolantComputations, 22 PerfectInterpolantSequences, 706/1588 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_09-32-48-260.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_09-32-48-260.csv Completed graceful shutdown