java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_2_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 08:56:30,540 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 08:56:30,542 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 08:56:30,558 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 08:56:30,558 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 08:56:30,559 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 08:56:30,562 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 08:56:30,565 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 08:56:30,567 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 08:56:30,568 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 08:56:30,577 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 08:56:30,577 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 08:56:30,578 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 08:56:30,579 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 08:56:30,580 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 08:56:30,582 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 08:56:30,584 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 08:56:30,586 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 08:56:30,587 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 08:56:30,588 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 08:56:30,590 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 08:56:30,591 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 08:56:30,591 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 08:56:30,592 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 08:56:30,593 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 08:56:30,594 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 08:56:30,594 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 08:56:30,595 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 08:56:30,595 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 08:56:30,595 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 08:56:30,596 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 08:56:30,596 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-31 08:56:30,608 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 08:56:30,608 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 08:56:30,609 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 08:56:30,609 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 08:56:30,610 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 08:56:30,610 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 08:56:30,610 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 08:56:30,610 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 08:56:30,611 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 08:56:30,611 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 08:56:30,617 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 08:56:30,617 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 08:56:30,618 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 08:56:30,618 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 08:56:30,618 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 08:56:30,618 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 08:56:30,618 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 08:56:30,618 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 08:56:30,619 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 08:56:30,619 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 08:56:30,619 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 08:56:30,619 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 08:56:30,619 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 08:56:30,619 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:56:30,620 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 08:56:30,620 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 08:56:30,620 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 08:56:30,620 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 08:56:30,620 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 08:56:30,621 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 08:56:30,621 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 08:56:30,621 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 08:56:30,622 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 08:56:30,622 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 08:56:30,676 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 08:56:30,689 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 08:56:30,692 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 08:56:30,693 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 08:56:30,693 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 08:56:30,693 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_2_true-valid-memsafety_true-termination.i [2018-01-31 08:56:30,977 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 08:56:30,988 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 08:56:30,991 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 08:56:30,991 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 08:56:30,997 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 08:56:30,999 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:56:30" (1/1) ... [2018-01-31 08:56:31,003 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@159fe893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:56:31, skipping insertion in model container [2018-01-31 08:56:31,003 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:56:30" (1/1) ... [2018-01-31 08:56:31,022 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:56:31,100 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:56:31,239 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:56:31,278 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:56:31,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:56:31 WrapperNode [2018-01-31 08:56:31,308 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 08:56:31,308 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 08:56:31,309 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 08:56:31,309 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 08:56:31,325 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:56:31" (1/1) ... [2018-01-31 08:56:31,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:56:31" (1/1) ... [2018-01-31 08:56:31,339 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:56:31" (1/1) ... [2018-01-31 08:56:31,340 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:56:31" (1/1) ... [2018-01-31 08:56:31,359 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:56:31" (1/1) ... [2018-01-31 08:56:31,371 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:56:31" (1/1) ... [2018-01-31 08:56:31,375 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:56:31" (1/1) ... [2018-01-31 08:56:31,385 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 08:56:31,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 08:56:31,386 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 08:56:31,386 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 08:56:31,387 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:56:31" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:56:31,444 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 08:56:31,444 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 08:56:31,444 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-01-31 08:56:31,445 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-31 08:56:31,445 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-01-31 08:56:31,445 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2018-01-31 08:56:31,445 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-01-31 08:56:31,445 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-01-31 08:56:31,445 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-01-31 08:56:31,446 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2018-01-31 08:56:31,446 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-01-31 08:56:31,446 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-01-31 08:56:31,446 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-01-31 08:56:31,446 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-01-31 08:56:31,446 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2018-01-31 08:56:31,446 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-01-31 08:56:31,447 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-01-31 08:56:31,447 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-01-31 08:56:31,447 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-31 08:56:31,447 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 08:56:31,447 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-31 08:56:31,447 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-31 08:56:31,448 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 08:56:31,449 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 08:56:31,449 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 08:56:31,450 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 08:56:31,450 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 08:56:31,450 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-31 08:56:31,450 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-31 08:56:31,450 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-31 08:56:31,450 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-31 08:56:31,451 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 08:56:31,451 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-31 08:56:31,451 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-31 08:56:31,451 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-01-31 08:56:31,451 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2018-01-31 08:56:31,451 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-01-31 08:56:31,451 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-01-31 08:56:31,452 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-01-31 08:56:31,452 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-01-31 08:56:31,452 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2018-01-31 08:56:31,452 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-01-31 08:56:31,452 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-01-31 08:56:31,452 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-01-31 08:56:31,452 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-01-31 08:56:31,452 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2018-01-31 08:56:31,453 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-01-31 08:56:31,453 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-01-31 08:56:31,453 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-01-31 08:56:31,453 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-31 08:56:31,453 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 08:56:31,453 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 08:56:31,453 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 08:56:32,003 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-31 08:56:32,303 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 08:56:32,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:56:32 BoogieIcfgContainer [2018-01-31 08:56:32,303 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 08:56:32,305 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 08:56:32,305 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 08:56:32,309 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 08:56:32,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:56:30" (1/3) ... [2018-01-31 08:56:32,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b3507c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:56:32, skipping insertion in model container [2018-01-31 08:56:32,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:56:31" (2/3) ... [2018-01-31 08:56:32,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b3507c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:56:32, skipping insertion in model container [2018-01-31 08:56:32,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:56:32" (3/3) ... [2018-01-31 08:56:32,313 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test22_2_true-valid-memsafety_true-termination.i [2018-01-31 08:56:32,320 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 08:56:32,328 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-01-31 08:56:32,381 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 08:56:32,381 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 08:56:32,411 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 08:56:32,411 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 08:56:32,411 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 08:56:32,411 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 08:56:32,412 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 08:56:32,412 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 08:56:32,412 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 08:56:32,433 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states. [2018-01-31 08:56:32,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-31 08:56:32,438 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:56:32,439 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:56:32,440 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:56:32,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1152760657, now seen corresponding path program 1 times [2018-01-31 08:56:32,445 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:56:32,445 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:56:32,509 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:32,510 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:56:32,510 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:32,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:56:32,578 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:56:32,821 WARN L143 SmtUtils]: Spent 119ms on a formula simplification that was a NOOP. DAG size: 6 [2018-01-31 08:56:32,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:56:32,979 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:56:32,979 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:56:32,981 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:56:32,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:56:32,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:56:32,993 INFO L87 Difference]: Start difference. First operand 176 states. Second operand 5 states. [2018-01-31 08:56:33,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:56:33,150 INFO L93 Difference]: Finished difference Result 334 states and 351 transitions. [2018-01-31 08:56:33,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:56:33,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-31 08:56:33,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:56:33,168 INFO L225 Difference]: With dead ends: 334 [2018-01-31 08:56:33,168 INFO L226 Difference]: Without dead ends: 180 [2018-01-31 08:56:33,175 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:56:33,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-01-31 08:56:33,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2018-01-31 08:56:33,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-01-31 08:56:33,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 187 transitions. [2018-01-31 08:56:33,227 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 187 transitions. Word has length 22 [2018-01-31 08:56:33,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:56:33,227 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 187 transitions. [2018-01-31 08:56:33,228 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:56:33,228 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 187 transitions. [2018-01-31 08:56:33,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-31 08:56:33,229 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:56:33,229 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:56:33,229 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:56:33,229 INFO L82 PathProgramCache]: Analyzing trace with hash -126553328, now seen corresponding path program 1 times [2018-01-31 08:56:33,230 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:56:33,230 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:56:33,231 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:33,232 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:56:33,232 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:56:33,257 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:56:33,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:56:33,471 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:56:33,471 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:56:33,473 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:56:33,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:56:33,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:56:33,474 INFO L87 Difference]: Start difference. First operand 178 states and 187 transitions. Second operand 6 states. [2018-01-31 08:56:34,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:56:34,103 INFO L93 Difference]: Finished difference Result 181 states and 190 transitions. [2018-01-31 08:56:34,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:56:34,104 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-31 08:56:34,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:56:34,106 INFO L225 Difference]: With dead ends: 181 [2018-01-31 08:56:34,106 INFO L226 Difference]: Without dead ends: 180 [2018-01-31 08:56:34,107 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:56:34,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-01-31 08:56:34,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 177. [2018-01-31 08:56:34,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-01-31 08:56:34,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 186 transitions. [2018-01-31 08:56:34,122 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 186 transitions. Word has length 23 [2018-01-31 08:56:34,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:56:34,123 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 186 transitions. [2018-01-31 08:56:34,123 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:56:34,123 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 186 transitions. [2018-01-31 08:56:34,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-31 08:56:34,124 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:56:34,124 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:56:34,125 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:56:34,125 INFO L82 PathProgramCache]: Analyzing trace with hash -126553327, now seen corresponding path program 1 times [2018-01-31 08:56:34,125 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:56:34,125 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:56:34,127 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:34,127 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:56:34,127 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:34,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:56:34,146 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:56:34,502 WARN L146 SmtUtils]: Spent 223ms on a formula simplification. DAG size of input: 19 DAG size of output 17 [2018-01-31 08:56:34,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:56:34,599 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:56:34,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:56:34,600 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 08:56:34,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 08:56:34,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:56:34,601 INFO L87 Difference]: Start difference. First operand 177 states and 186 transitions. Second operand 7 states. [2018-01-31 08:56:35,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:56:35,159 INFO L93 Difference]: Finished difference Result 180 states and 189 transitions. [2018-01-31 08:56:35,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:56:35,162 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-01-31 08:56:35,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:56:35,164 INFO L225 Difference]: With dead ends: 180 [2018-01-31 08:56:35,165 INFO L226 Difference]: Without dead ends: 179 [2018-01-31 08:56:35,165 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:56:35,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-01-31 08:56:35,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2018-01-31 08:56:35,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-01-31 08:56:35,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 185 transitions. [2018-01-31 08:56:35,183 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 185 transitions. Word has length 23 [2018-01-31 08:56:35,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:56:35,183 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 185 transitions. [2018-01-31 08:56:35,184 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 08:56:35,184 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 185 transitions. [2018-01-31 08:56:35,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-31 08:56:35,185 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:56:35,185 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:56:35,186 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:56:35,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1417222794, now seen corresponding path program 1 times [2018-01-31 08:56:35,186 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:56:35,186 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:56:35,188 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:35,188 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:56:35,188 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:35,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:56:35,208 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:56:35,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:56:35,413 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:56:35,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 08:56:35,413 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 08:56:35,414 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 08:56:35,414 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:56:35,414 INFO L87 Difference]: Start difference. First operand 176 states and 185 transitions. Second operand 7 states. [2018-01-31 08:56:35,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:56:35,614 INFO L93 Difference]: Finished difference Result 294 states and 309 transitions. [2018-01-31 08:56:35,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:56:35,615 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-01-31 08:56:35,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:56:35,617 INFO L225 Difference]: With dead ends: 294 [2018-01-31 08:56:35,617 INFO L226 Difference]: Without dead ends: 194 [2018-01-31 08:56:35,618 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:56:35,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-01-31 08:56:35,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 186. [2018-01-31 08:56:35,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-01-31 08:56:35,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 195 transitions. [2018-01-31 08:56:35,634 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 195 transitions. Word has length 36 [2018-01-31 08:56:35,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:56:35,634 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 195 transitions. [2018-01-31 08:56:35,634 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 08:56:35,634 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 195 transitions. [2018-01-31 08:56:35,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-31 08:56:35,636 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:56:35,636 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:56:35,636 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:56:35,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1985119748, now seen corresponding path program 1 times [2018-01-31 08:56:35,636 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:56:35,636 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:56:35,638 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:35,638 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:56:35,638 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:35,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:56:35,661 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:56:35,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:56:35,724 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:56:35,724 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:56:35,724 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:56:35,724 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:56:35,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:56:35,725 INFO L87 Difference]: Start difference. First operand 186 states and 195 transitions. Second operand 4 states. [2018-01-31 08:56:35,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:56:35,799 INFO L93 Difference]: Finished difference Result 328 states and 344 transitions. [2018-01-31 08:56:35,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 08:56:35,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-01-31 08:56:35,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:56:35,803 INFO L225 Difference]: With dead ends: 328 [2018-01-31 08:56:35,803 INFO L226 Difference]: Without dead ends: 190 [2018-01-31 08:56:35,805 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-01-31 08:56:35,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-01-31 08:56:35,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2018-01-31 08:56:35,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-01-31 08:56:35,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 196 transitions. [2018-01-31 08:56:35,816 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 196 transitions. Word has length 39 [2018-01-31 08:56:35,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:56:35,817 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 196 transitions. [2018-01-31 08:56:35,817 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:56:35,817 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 196 transitions. [2018-01-31 08:56:35,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-31 08:56:35,818 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:56:35,819 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:56:35,819 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:56:35,819 INFO L82 PathProgramCache]: Analyzing trace with hash 557553978, now seen corresponding path program 1 times [2018-01-31 08:56:35,819 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:56:35,819 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:56:35,820 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:35,821 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:56:35,821 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:35,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:56:35,843 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:56:35,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:56:35,906 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:56:35,906 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:56:35,921 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:56:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:56:35,982 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:56:36,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:56:36,065 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:56:36,065 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-01-31 08:56:36,066 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:56:36,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:56:36,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:56:36,066 INFO L87 Difference]: Start difference. First operand 187 states and 196 transitions. Second operand 6 states. [2018-01-31 08:56:36,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:56:36,140 INFO L93 Difference]: Finished difference Result 332 states and 348 transitions. [2018-01-31 08:56:36,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 08:56:36,143 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2018-01-31 08:56:36,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:56:36,145 INFO L225 Difference]: With dead ends: 332 [2018-01-31 08:56:36,145 INFO L226 Difference]: Without dead ends: 194 [2018-01-31 08:56:36,146 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:56:36,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-01-31 08:56:36,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2018-01-31 08:56:36,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-01-31 08:56:36,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 200 transitions. [2018-01-31 08:56:36,158 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 200 transitions. Word has length 43 [2018-01-31 08:56:36,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:56:36,159 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 200 transitions. [2018-01-31 08:56:36,159 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:56:36,159 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 200 transitions. [2018-01-31 08:56:36,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-31 08:56:36,161 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:56:36,161 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:56:36,161 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:56:36,161 INFO L82 PathProgramCache]: Analyzing trace with hash -99882632, now seen corresponding path program 2 times [2018-01-31 08:56:36,161 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:56:36,161 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:56:36,164 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:36,165 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:56:36,165 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:36,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:56:36,196 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:56:36,344 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:56:36,344 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:56:36,345 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:56:36,359 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:56:36,396 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:56:36,409 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:56:36,415 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:56:36,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-31 08:56:36,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:56:36,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-31 08:56:36,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:56:36,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-31 08:56:36,549 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-31 08:56:37,432 WARN L146 SmtUtils]: Spent 184ms on a formula simplification. DAG size of input: 45 DAG size of output 17 [2018-01-31 08:56:38,035 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-31 08:56:38,062 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:56:38,062 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 19 [2018-01-31 08:56:38,063 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-31 08:56:38,063 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-31 08:56:38,063 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-01-31 08:56:38,063 INFO L87 Difference]: Start difference. First operand 191 states and 200 transitions. Second operand 19 states. [2018-01-31 08:56:40,474 WARN L143 SmtUtils]: Spent 2162ms on a formula simplification that was a NOOP. DAG size: 39 [2018-01-31 08:56:42,084 WARN L143 SmtUtils]: Spent 1253ms on a formula simplification that was a NOOP. DAG size: 31 [2018-01-31 08:56:45,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:56:45,429 INFO L93 Difference]: Finished difference Result 418 states and 439 transitions. [2018-01-31 08:56:45,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-31 08:56:45,429 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2018-01-31 08:56:45,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:56:45,432 INFO L225 Difference]: With dead ends: 418 [2018-01-31 08:56:45,432 INFO L226 Difference]: Without dead ends: 280 [2018-01-31 08:56:45,433 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2018-01-31 08:56:45,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-01-31 08:56:45,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 194. [2018-01-31 08:56:45,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-01-31 08:56:45,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 203 transitions. [2018-01-31 08:56:45,449 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 203 transitions. Word has length 47 [2018-01-31 08:56:45,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:56:45,452 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 203 transitions. [2018-01-31 08:56:45,452 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-31 08:56:45,452 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 203 transitions. [2018-01-31 08:56:45,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-31 08:56:45,454 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:56:45,454 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, 1, 1, 1, 1, 1] [2018-01-31 08:56:45,454 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:56:45,454 INFO L82 PathProgramCache]: Analyzing trace with hash -266816363, now seen corresponding path program 1 times [2018-01-31 08:56:45,454 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:56:45,455 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:56:45,456 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:45,456 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:56:45,456 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:45,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:56:45,481 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:56:45,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-31 08:56:45,577 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:56:45,577 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 08:56:45,578 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 08:56:45,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 08:56:45,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:56:45,578 INFO L87 Difference]: Start difference. First operand 194 states and 203 transitions. Second operand 3 states. [2018-01-31 08:56:45,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:56:45,763 INFO L93 Difference]: Finished difference Result 218 states and 232 transitions. [2018-01-31 08:56:45,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 08:56:45,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-01-31 08:56:45,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:56:45,765 INFO L225 Difference]: With dead ends: 218 [2018-01-31 08:56:45,765 INFO L226 Difference]: Without dead ends: 214 [2018-01-31 08:56:45,766 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-01-31 08:56:45,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-01-31 08:56:45,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2018-01-31 08:56:45,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-01-31 08:56:45,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 228 transitions. [2018-01-31 08:56:45,787 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 228 transitions. Word has length 46 [2018-01-31 08:56:45,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:56:45,787 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 228 transitions. [2018-01-31 08:56:45,787 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 08:56:45,787 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 228 transitions. [2018-01-31 08:56:45,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-31 08:56:45,789 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:56:45,789 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:56:45,789 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:56:45,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1158135947, now seen corresponding path program 1 times [2018-01-31 08:56:45,790 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:56:45,790 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:56:45,791 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:45,791 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:56:45,791 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:45,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:56:45,805 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:56:46,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:56:46,031 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:56:46,031 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 08:56:46,031 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 08:56:46,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 08:56:46,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:56:46,031 INFO L87 Difference]: Start difference. First operand 214 states and 228 transitions. Second operand 7 states. [2018-01-31 08:56:46,251 WARN L143 SmtUtils]: Spent 110ms on a formula simplification that was a NOOP. DAG size: 10 [2018-01-31 08:56:46,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:56:46,412 INFO L93 Difference]: Finished difference Result 310 states and 335 transitions. [2018-01-31 08:56:46,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:56:46,412 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-01-31 08:56:46,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:56:46,414 INFO L225 Difference]: With dead ends: 310 [2018-01-31 08:56:46,414 INFO L226 Difference]: Without dead ends: 209 [2018-01-31 08:56:46,415 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:56:46,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-01-31 08:56:46,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 194. [2018-01-31 08:56:46,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-01-31 08:56:46,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 203 transitions. [2018-01-31 08:56:46,432 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 203 transitions. Word has length 48 [2018-01-31 08:56:46,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:56:46,432 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 203 transitions. [2018-01-31 08:56:46,432 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 08:56:46,432 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 203 transitions. [2018-01-31 08:56:46,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-31 08:56:46,434 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:56:46,434 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, 1, 1, 1, 1, 1, 1] [2018-01-31 08:56:46,434 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:56:46,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1176072202, now seen corresponding path program 1 times [2018-01-31 08:56:46,434 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:56:46,434 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:56:46,435 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:46,436 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:56:46,436 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:56:46,448 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:56:46,538 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-31 08:56:46,538 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:56:46,538 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:56:46,538 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:56:46,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:56:46,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:56:46,539 INFO L87 Difference]: Start difference. First operand 194 states and 203 transitions. Second operand 6 states. [2018-01-31 08:56:46,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:56:46,573 INFO L93 Difference]: Finished difference Result 198 states and 206 transitions. [2018-01-31 08:56:46,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:56:46,574 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-01-31 08:56:46,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:56:46,575 INFO L225 Difference]: With dead ends: 198 [2018-01-31 08:56:46,575 INFO L226 Difference]: Without dead ends: 176 [2018-01-31 08:56:46,575 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:56:46,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-01-31 08:56:46,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-01-31 08:56:46,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-01-31 08:56:46,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 183 transitions. [2018-01-31 08:56:46,589 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 183 transitions. Word has length 47 [2018-01-31 08:56:46,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:56:46,590 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 183 transitions. [2018-01-31 08:56:46,590 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:56:46,590 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 183 transitions. [2018-01-31 08:56:46,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-31 08:56:46,591 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:56:46,591 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:56:46,591 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:56:46,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1436412597, now seen corresponding path program 1 times [2018-01-31 08:56:46,592 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:56:46,592 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:56:46,593 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:46,593 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:56:46,593 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:46,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:56:46,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:56:46,876 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-31 08:56:46,877 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:56:46,877 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-31 08:56:46,877 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-31 08:56:46,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-31 08:56:46,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-01-31 08:56:46,878 INFO L87 Difference]: Start difference. First operand 176 states and 183 transitions. Second operand 12 states. [2018-01-31 08:56:47,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:56:47,314 INFO L93 Difference]: Finished difference Result 176 states and 183 transitions. [2018-01-31 08:56:47,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-31 08:56:47,314 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2018-01-31 08:56:47,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:56:47,315 INFO L225 Difference]: With dead ends: 176 [2018-01-31 08:56:47,315 INFO L226 Difference]: Without dead ends: 175 [2018-01-31 08:56:47,315 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-01-31 08:56:47,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-01-31 08:56:47,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-01-31 08:56:47,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-01-31 08:56:47,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 182 transitions. [2018-01-31 08:56:47,330 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 182 transitions. Word has length 51 [2018-01-31 08:56:47,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:56:47,330 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 182 transitions. [2018-01-31 08:56:47,331 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-31 08:56:47,331 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 182 transitions. [2018-01-31 08:56:47,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-31 08:56:47,331 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:56:47,332 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:56:47,332 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:56:47,332 INFO L82 PathProgramCache]: Analyzing trace with hash 713524960, now seen corresponding path program 1 times [2018-01-31 08:56:47,332 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:56:47,332 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:56:47,333 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:47,333 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:56:47,334 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:47,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:56:47,349 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:56:47,915 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-31 08:56:47,915 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:56:47,915 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-31 08:56:47,916 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-31 08:56:47,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-31 08:56:47,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-01-31 08:56:47,916 INFO L87 Difference]: Start difference. First operand 175 states and 182 transitions. Second operand 12 states. [2018-01-31 08:56:48,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:56:48,448 INFO L93 Difference]: Finished difference Result 175 states and 182 transitions. [2018-01-31 08:56:48,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-31 08:56:48,478 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-01-31 08:56:48,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:56:48,480 INFO L225 Difference]: With dead ends: 175 [2018-01-31 08:56:48,480 INFO L226 Difference]: Without dead ends: 173 [2018-01-31 08:56:48,480 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-01-31 08:56:48,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-01-31 08:56:48,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-01-31 08:56:48,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-01-31 08:56:48,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 180 transitions. [2018-01-31 08:56:48,494 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 180 transitions. Word has length 56 [2018-01-31 08:56:48,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:56:48,495 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 180 transitions. [2018-01-31 08:56:48,495 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-31 08:56:48,495 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 180 transitions. [2018-01-31 08:56:48,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-31 08:56:48,496 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:56:48,496 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:56:48,496 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:56:48,496 INFO L82 PathProgramCache]: Analyzing trace with hash 713524961, now seen corresponding path program 1 times [2018-01-31 08:56:48,496 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:56:48,496 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:56:48,498 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:48,498 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:56:48,498 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:48,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:56:48,515 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:56:48,591 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:56:48,592 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:56:48,592 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:56:48,599 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:56:48,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:56:48,627 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:56:48,677 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:56:48,699 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:56:48,699 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-01-31 08:56:48,699 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:56:48,700 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:56:48,700 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:56:48,700 INFO L87 Difference]: Start difference. First operand 173 states and 180 transitions. Second operand 8 states. [2018-01-31 08:56:48,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:56:48,741 INFO L93 Difference]: Finished difference Result 314 states and 328 transitions. [2018-01-31 08:56:48,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:56:48,744 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2018-01-31 08:56:48,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:56:48,746 INFO L225 Difference]: With dead ends: 314 [2018-01-31 08:56:48,746 INFO L226 Difference]: Without dead ends: 180 [2018-01-31 08:56:48,747 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:56:48,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-01-31 08:56:48,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 177. [2018-01-31 08:56:48,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-01-31 08:56:48,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 184 transitions. [2018-01-31 08:56:48,761 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 184 transitions. Word has length 56 [2018-01-31 08:56:48,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:56:48,762 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 184 transitions. [2018-01-31 08:56:48,762 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:56:48,762 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 184 transitions. [2018-01-31 08:56:48,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-31 08:56:48,762 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:56:48,763 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:56:48,763 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:56:48,763 INFO L82 PathProgramCache]: Analyzing trace with hash 644877155, now seen corresponding path program 2 times [2018-01-31 08:56:48,763 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:56:48,763 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:56:48,764 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:48,764 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:56:48,765 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:48,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:56:48,782 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:56:49,055 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:56:49,056 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:56:49,056 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:56:49,064 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:56:49,088 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:56:49,092 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:56:49,099 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:56:49,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-31 08:56:49,112 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:56:49,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-31 08:56:49,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:56:49,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-31 08:56:49,228 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-31 08:56:49,959 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-01-31 08:56:49,979 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:56:49,979 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 22 [2018-01-31 08:56:49,980 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-31 08:56:49,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-31 08:56:49,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2018-01-31 08:56:49,980 INFO L87 Difference]: Start difference. First operand 177 states and 184 transitions. Second operand 22 states. [2018-01-31 08:56:50,116 WARN L143 SmtUtils]: Spent 100ms on a formula simplification that was a NOOP. DAG size: 39 [2018-01-31 08:56:51,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:56:51,575 INFO L93 Difference]: Finished difference Result 316 states and 332 transitions. [2018-01-31 08:56:51,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-31 08:56:51,575 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 60 [2018-01-31 08:56:51,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:56:51,576 INFO L225 Difference]: With dead ends: 316 [2018-01-31 08:56:51,576 INFO L226 Difference]: Without dead ends: 182 [2018-01-31 08:56:51,577 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=152, Invalid=904, Unknown=0, NotChecked=0, Total=1056 [2018-01-31 08:56:51,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-01-31 08:56:51,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 179. [2018-01-31 08:56:51,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-01-31 08:56:51,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 186 transitions. [2018-01-31 08:56:51,596 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 186 transitions. Word has length 60 [2018-01-31 08:56:51,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:56:51,597 INFO L432 AbstractCegarLoop]: Abstraction has 179 states and 186 transitions. [2018-01-31 08:56:51,597 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-31 08:56:51,597 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 186 transitions. [2018-01-31 08:56:51,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-01-31 08:56:51,598 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:56:51,599 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:56:51,599 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:56:51,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1076592855, now seen corresponding path program 1 times [2018-01-31 08:56:51,599 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:56:51,600 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:56:51,601 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:51,601 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:56:51,601 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:51,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:56:51,620 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:56:51,709 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-01-31 08:56:51,709 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:56:51,709 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 08:56:51,709 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:56:51,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:56:51,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:56:51,710 INFO L87 Difference]: Start difference. First operand 179 states and 186 transitions. Second operand 8 states. [2018-01-31 08:56:51,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:56:51,758 INFO L93 Difference]: Finished difference Result 289 states and 300 transitions. [2018-01-31 08:56:51,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:56:51,759 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2018-01-31 08:56:51,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:56:51,759 INFO L225 Difference]: With dead ends: 289 [2018-01-31 08:56:51,759 INFO L226 Difference]: Without dead ends: 179 [2018-01-31 08:56:51,760 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:56:51,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-01-31 08:56:51,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-01-31 08:56:51,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-01-31 08:56:51,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 185 transitions. [2018-01-31 08:56:51,782 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 185 transitions. Word has length 70 [2018-01-31 08:56:51,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:56:51,782 INFO L432 AbstractCegarLoop]: Abstraction has 179 states and 185 transitions. [2018-01-31 08:56:51,782 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:56:51,783 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 185 transitions. [2018-01-31 08:56:51,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-31 08:56:51,783 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:56:51,784 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:56:51,784 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:56:51,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1113543445, now seen corresponding path program 1 times [2018-01-31 08:56:51,784 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:56:51,784 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:56:51,786 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:51,786 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:56:51,786 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:51,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:56:51,802 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:56:52,226 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-01-31 08:56:52,226 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:56:52,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-31 08:56:52,227 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-31 08:56:52,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-31 08:56:52,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:56:52,227 INFO L87 Difference]: Start difference. First operand 179 states and 185 transitions. Second operand 10 states. [2018-01-31 08:56:52,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:56:52,305 INFO L93 Difference]: Finished difference Result 291 states and 301 transitions. [2018-01-31 08:56:52,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-31 08:56:52,305 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 75 [2018-01-31 08:56:52,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:56:52,306 INFO L225 Difference]: With dead ends: 291 [2018-01-31 08:56:52,306 INFO L226 Difference]: Without dead ends: 179 [2018-01-31 08:56:52,307 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-01-31 08:56:52,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-01-31 08:56:52,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-01-31 08:56:52,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-01-31 08:56:52,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 184 transitions. [2018-01-31 08:56:52,325 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 184 transitions. Word has length 75 [2018-01-31 08:56:52,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:56:52,325 INFO L432 AbstractCegarLoop]: Abstraction has 179 states and 184 transitions. [2018-01-31 08:56:52,325 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-31 08:56:52,326 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 184 transitions. [2018-01-31 08:56:52,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-01-31 08:56:52,326 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:56:52,327 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:56:52,327 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:56:52,327 INFO L82 PathProgramCache]: Analyzing trace with hash 603467016, now seen corresponding path program 1 times [2018-01-31 08:56:52,327 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:56:52,327 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:56:52,332 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:52,332 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:56:52,333 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:52,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:56:52,357 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:56:52,537 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-01-31 08:56:52,537 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:56:52,537 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-31 08:56:52,537 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-31 08:56:52,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-31 08:56:52,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-01-31 08:56:52,538 INFO L87 Difference]: Start difference. First operand 179 states and 184 transitions. Second operand 15 states. [2018-01-31 08:56:54,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:56:54,313 INFO L93 Difference]: Finished difference Result 179 states and 184 transitions. [2018-01-31 08:56:54,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-31 08:56:54,313 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 86 [2018-01-31 08:56:54,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:56:54,314 INFO L225 Difference]: With dead ends: 179 [2018-01-31 08:56:54,314 INFO L226 Difference]: Without dead ends: 177 [2018-01-31 08:56:54,315 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2018-01-31 08:56:54,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-01-31 08:56:54,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-01-31 08:56:54,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-01-31 08:56:54,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 182 transitions. [2018-01-31 08:56:54,332 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 182 transitions. Word has length 86 [2018-01-31 08:56:54,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:56:54,332 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 182 transitions. [2018-01-31 08:56:54,333 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-31 08:56:54,333 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 182 transitions. [2018-01-31 08:56:54,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-01-31 08:56:54,333 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:56:54,334 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:56:54,334 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:56:54,334 INFO L82 PathProgramCache]: Analyzing trace with hash 603467017, now seen corresponding path program 1 times [2018-01-31 08:56:54,334 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:56:54,334 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:56:54,335 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:54,335 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:56:54,335 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:56:54,360 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:56:54,450 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:56:54,450 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:56:54,450 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:56:54,456 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:56:54,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:56:54,501 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:56:54,530 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:56:54,563 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:56:54,564 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-01-31 08:56:54,564 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-31 08:56:54,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-31 08:56:54,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:56:54,565 INFO L87 Difference]: Start difference. First operand 177 states and 182 transitions. Second operand 10 states. [2018-01-31 08:56:55,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:56:55,172 INFO L93 Difference]: Finished difference Result 314 states and 324 transitions. [2018-01-31 08:56:55,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:56:55,172 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 86 [2018-01-31 08:56:55,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:56:55,174 INFO L225 Difference]: With dead ends: 314 [2018-01-31 08:56:55,174 INFO L226 Difference]: Without dead ends: 184 [2018-01-31 08:56:55,174 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:56:55,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-01-31 08:56:55,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2018-01-31 08:56:55,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-01-31 08:56:55,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 186 transitions. [2018-01-31 08:56:55,194 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 186 transitions. Word has length 86 [2018-01-31 08:56:55,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:56:55,194 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 186 transitions. [2018-01-31 08:56:55,194 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-31 08:56:55,194 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 186 transitions. [2018-01-31 08:56:55,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-01-31 08:56:55,195 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:56:55,195 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:56:55,195 INFO L371 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:56:55,196 INFO L82 PathProgramCache]: Analyzing trace with hash -11050485, now seen corresponding path program 2 times [2018-01-31 08:56:55,196 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:56:55,196 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:56:55,197 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:55,199 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:56:55,199 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:55,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:56:55,218 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:56:55,776 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:56:55,776 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:56:55,776 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:56:55,782 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:56:55,814 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:56:55,817 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:56:55,826 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:56:55,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-31 08:56:55,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:56:55,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-31 08:56:55,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:56:55,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-31 08:56:55,857 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-31 08:56:56,845 WARN L146 SmtUtils]: Spent 475ms on a formula simplification. DAG size of input: 45 DAG size of output 17 [2018-01-31 08:56:57,912 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-01-31 08:56:57,932 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:56:57,932 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [10] total 27 [2018-01-31 08:56:57,932 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-31 08:56:57,933 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-31 08:56:57,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2018-01-31 08:56:57,933 INFO L87 Difference]: Start difference. First operand 181 states and 186 transitions. Second operand 27 states. [2018-01-31 08:57:00,050 WARN L143 SmtUtils]: Spent 2077ms on a formula simplification that was a NOOP. DAG size: 39 [2018-01-31 08:57:01,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:57:01,593 INFO L93 Difference]: Finished difference Result 316 states and 328 transitions. [2018-01-31 08:57:01,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-31 08:57:01,593 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 90 [2018-01-31 08:57:01,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:57:01,594 INFO L225 Difference]: With dead ends: 316 [2018-01-31 08:57:01,594 INFO L226 Difference]: Without dead ends: 186 [2018-01-31 08:57:01,595 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=224, Invalid=1498, Unknown=0, NotChecked=0, Total=1722 [2018-01-31 08:57:01,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-01-31 08:57:01,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 183. [2018-01-31 08:57:01,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-01-31 08:57:01,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 188 transitions. [2018-01-31 08:57:01,615 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 188 transitions. Word has length 90 [2018-01-31 08:57:01,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:57:01,615 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 188 transitions. [2018-01-31 08:57:01,615 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-31 08:57:01,615 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 188 transitions. [2018-01-31 08:57:01,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-01-31 08:57:01,617 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:57:01,617 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 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] [2018-01-31 08:57:01,617 INFO L371 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:57:01,617 INFO L82 PathProgramCache]: Analyzing trace with hash -997535317, now seen corresponding path program 1 times [2018-01-31 08:57:01,617 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:57:01,618 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:57:01,618 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:57:01,619 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:57:01,619 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:57:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:57:01,642 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:57:01,938 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-01-31 08:57:01,938 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:57:01,938 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-31 08:57:01,938 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-31 08:57:01,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-31 08:57:01,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:57:01,939 INFO L87 Difference]: Start difference. First operand 183 states and 188 transitions. Second operand 11 states. [2018-01-31 08:57:02,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:57:02,028 INFO L93 Difference]: Finished difference Result 261 states and 269 transitions. [2018-01-31 08:57:02,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-31 08:57:02,028 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 104 [2018-01-31 08:57:02,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:57:02,030 INFO L225 Difference]: With dead ends: 261 [2018-01-31 08:57:02,030 INFO L226 Difference]: Without dead ends: 183 [2018-01-31 08:57:02,030 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-01-31 08:57:02,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-01-31 08:57:02,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-01-31 08:57:02,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-01-31 08:57:02,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 187 transitions. [2018-01-31 08:57:02,043 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 187 transitions. Word has length 104 [2018-01-31 08:57:02,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:57:02,043 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 187 transitions. [2018-01-31 08:57:02,043 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-31 08:57:02,043 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 187 transitions. [2018-01-31 08:57:02,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-01-31 08:57:02,044 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:57:02,044 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 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] [2018-01-31 08:57:02,044 INFO L371 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:57:02,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1728656908, now seen corresponding path program 1 times [2018-01-31 08:57:02,045 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:57:02,045 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:57:02,046 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:57:02,046 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:57:02,046 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:57:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:57:02,072 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:57:02,768 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-01-31 08:57:02,768 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:57:02,768 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:57:02,788 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:57:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:57:02,834 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:57:02,938 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-31 08:57:02,957 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:57:02,957 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-01-31 08:57:02,958 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-31 08:57:02,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-31 08:57:02,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2018-01-31 08:57:02,958 INFO L87 Difference]: Start difference. First operand 183 states and 187 transitions. Second operand 20 states. [2018-01-31 08:57:03,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:57:03,363 INFO L93 Difference]: Finished difference Result 320 states and 329 transitions. [2018-01-31 08:57:03,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-31 08:57:03,363 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 122 [2018-01-31 08:57:03,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:57:03,364 INFO L225 Difference]: With dead ends: 320 [2018-01-31 08:57:03,364 INFO L226 Difference]: Without dead ends: 190 [2018-01-31 08:57:03,365 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2018-01-31 08:57:03,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-01-31 08:57:03,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2018-01-31 08:57:03,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-01-31 08:57:03,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 190 transitions. [2018-01-31 08:57:03,379 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 190 transitions. Word has length 122 [2018-01-31 08:57:03,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:57:03,379 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 190 transitions. [2018-01-31 08:57:03,379 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-31 08:57:03,379 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 190 transitions. [2018-01-31 08:57:03,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-01-31 08:57:03,380 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:57:03,380 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:57:03,380 INFO L371 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:57:03,380 INFO L82 PathProgramCache]: Analyzing trace with hash -973611882, now seen corresponding path program 1 times [2018-01-31 08:57:03,380 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:57:03,380 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:57:03,381 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:57:03,381 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:57:03,381 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:57:03,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:57:03,407 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:57:04,392 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:57:04,392 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:57:04,392 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:57:04,398 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:57:04,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:57:04,457 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:57:04,480 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:57:04,500 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:57:04,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-01-31 08:57:04,500 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-31 08:57:04,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-31 08:57:04,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-01-31 08:57:04,501 INFO L87 Difference]: Start difference. First operand 187 states and 190 transitions. Second operand 13 states. [2018-01-31 08:57:04,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:57:04,560 INFO L93 Difference]: Finished difference Result 322 states and 328 transitions. [2018-01-31 08:57:04,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-31 08:57:04,564 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 128 [2018-01-31 08:57:04,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:57:04,566 INFO L225 Difference]: With dead ends: 322 [2018-01-31 08:57:04,566 INFO L226 Difference]: Without dead ends: 194 [2018-01-31 08:57:04,566 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2018-01-31 08:57:04,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-01-31 08:57:04,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2018-01-31 08:57:04,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-01-31 08:57:04,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 194 transitions. [2018-01-31 08:57:04,585 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 194 transitions. Word has length 128 [2018-01-31 08:57:04,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:57:04,585 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 194 transitions. [2018-01-31 08:57:04,585 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-31 08:57:04,586 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 194 transitions. [2018-01-31 08:57:04,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-01-31 08:57:04,586 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:57:04,587 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:57:04,587 INFO L371 AbstractCegarLoop]: === Iteration 23 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:57:04,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1359458072, now seen corresponding path program 2 times [2018-01-31 08:57:04,587 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:57:04,587 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:57:04,588 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:57:04,588 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:57:04,588 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:57:04,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:57:04,614 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:57:04,820 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:57:04,820 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:57:04,820 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:57:04,825 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:57:04,881 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:57:04,894 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:57:04,900 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:57:04,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-31 08:57:04,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:57:04,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-31 08:57:04,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:57:04,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-31 08:57:04,986 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-31 08:57:06,116 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-01-31 08:57:06,136 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:57:06,136 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [13] total 32 [2018-01-31 08:57:06,137 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-31 08:57:06,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-31 08:57:06,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=855, Unknown=0, NotChecked=0, Total=992 [2018-01-31 08:57:06,137 INFO L87 Difference]: Start difference. First operand 191 states and 194 transitions. Second operand 32 states. [2018-01-31 08:57:07,397 WARN L143 SmtUtils]: Spent 451ms on a formula simplification that was a NOOP. DAG size: 36 [2018-01-31 08:57:08,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:57:08,467 INFO L93 Difference]: Finished difference Result 324 states and 332 transitions. [2018-01-31 08:57:08,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-31 08:57:08,468 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 132 [2018-01-31 08:57:08,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:57:08,469 INFO L225 Difference]: With dead ends: 324 [2018-01-31 08:57:08,469 INFO L226 Difference]: Without dead ends: 196 [2018-01-31 08:57:08,470 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 111 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=331, Invalid=2219, Unknown=0, NotChecked=0, Total=2550 [2018-01-31 08:57:08,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-01-31 08:57:08,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 193. [2018-01-31 08:57:08,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-01-31 08:57:08,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 196 transitions. [2018-01-31 08:57:08,496 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 196 transitions. Word has length 132 [2018-01-31 08:57:08,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:57:08,497 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 196 transitions. [2018-01-31 08:57:08,497 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-31 08:57:08,497 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 196 transitions. [2018-01-31 08:57:08,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-01-31 08:57:08,499 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:57:08,499 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:57:08,499 INFO L371 AbstractCegarLoop]: === Iteration 24 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:57:08,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1392930969, now seen corresponding path program 1 times [2018-01-31 08:57:08,499 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:57:08,499 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:57:08,500 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:57:08,501 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:57:08,501 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:57:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:57:08,525 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:57:08,818 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-01-31 08:57:08,819 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:57:08,819 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-01-31 08:57:08,819 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-31 08:57:08,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-31 08:57:08,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-01-31 08:57:08,820 INFO L87 Difference]: Start difference. First operand 193 states and 196 transitions. Second operand 18 states. [2018-01-31 08:57:09,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:57:09,237 INFO L93 Difference]: Finished difference Result 228 states and 236 transitions. [2018-01-31 08:57:09,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-31 08:57:09,275 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 136 [2018-01-31 08:57:09,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:57:09,276 INFO L225 Difference]: With dead ends: 228 [2018-01-31 08:57:09,276 INFO L226 Difference]: Without dead ends: 226 [2018-01-31 08:57:09,277 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2018-01-31 08:57:09,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-01-31 08:57:09,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 224. [2018-01-31 08:57:09,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-01-31 08:57:09,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 230 transitions. [2018-01-31 08:57:09,307 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 230 transitions. Word has length 136 [2018-01-31 08:57:09,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:57:09,308 INFO L432 AbstractCegarLoop]: Abstraction has 224 states and 230 transitions. [2018-01-31 08:57:09,308 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-31 08:57:09,308 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 230 transitions. [2018-01-31 08:57:09,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-01-31 08:57:09,310 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:57:09,310 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:57:09,310 INFO L371 AbstractCegarLoop]: === Iteration 25 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:57:09,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1805222194, now seen corresponding path program 1 times [2018-01-31 08:57:09,310 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:57:09,311 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:57:09,311 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:57:09,311 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:57:09,311 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:57:09,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:57:09,339 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:57:09,853 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-01-31 08:57:09,853 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:57:09,853 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-01-31 08:57:09,853 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-31 08:57:09,854 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-31 08:57:09,854 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-01-31 08:57:09,854 INFO L87 Difference]: Start difference. First operand 224 states and 230 transitions. Second operand 23 states. [2018-01-31 08:57:10,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:57:10,457 INFO L93 Difference]: Finished difference Result 240 states and 250 transitions. [2018-01-31 08:57:10,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-31 08:57:10,458 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 155 [2018-01-31 08:57:10,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:57:10,459 INFO L225 Difference]: With dead ends: 240 [2018-01-31 08:57:10,459 INFO L226 Difference]: Without dead ends: 238 [2018-01-31 08:57:10,460 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=1029, Unknown=0, NotChecked=0, Total=1122 [2018-01-31 08:57:10,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-01-31 08:57:10,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 233. [2018-01-31 08:57:10,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-01-31 08:57:10,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 243 transitions. [2018-01-31 08:57:10,481 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 243 transitions. Word has length 155 [2018-01-31 08:57:10,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:57:10,481 INFO L432 AbstractCegarLoop]: Abstraction has 233 states and 243 transitions. [2018-01-31 08:57:10,481 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-31 08:57:10,481 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 243 transitions. [2018-01-31 08:57:10,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-01-31 08:57:10,482 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:57:10,482 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:57:10,482 INFO L371 AbstractCegarLoop]: === Iteration 26 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:57:10,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1805222195, now seen corresponding path program 1 times [2018-01-31 08:57:10,483 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:57:10,483 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:57:10,484 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:57:10,484 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:57:10,484 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:57:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:57:10,512 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:57:11,220 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:57:11,220 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:57:11,220 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:57:11,225 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:57:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:57:11,311 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:57:11,461 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:57:11,493 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:57:11,493 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-01-31 08:57:11,494 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-31 08:57:11,494 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-31 08:57:11,494 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-01-31 08:57:11,494 INFO L87 Difference]: Start difference. First operand 233 states and 243 transitions. Second operand 15 states. [2018-01-31 08:57:11,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:57:11,733 INFO L93 Difference]: Finished difference Result 406 states and 426 transitions. [2018-01-31 08:57:11,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-31 08:57:11,733 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 155 [2018-01-31 08:57:11,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:57:11,734 INFO L225 Difference]: With dead ends: 406 [2018-01-31 08:57:11,734 INFO L226 Difference]: Without dead ends: 240 [2018-01-31 08:57:11,735 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=97, Invalid=143, Unknown=0, NotChecked=0, Total=240 [2018-01-31 08:57:11,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-01-31 08:57:11,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 237. [2018-01-31 08:57:11,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-01-31 08:57:11,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 247 transitions. [2018-01-31 08:57:11,765 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 247 transitions. Word has length 155 [2018-01-31 08:57:11,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:57:11,766 INFO L432 AbstractCegarLoop]: Abstraction has 237 states and 247 transitions. [2018-01-31 08:57:11,766 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-31 08:57:11,766 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 247 transitions. [2018-01-31 08:57:11,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-01-31 08:57:11,767 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:57:11,767 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:57:11,767 INFO L371 AbstractCegarLoop]: === Iteration 27 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:57:11,768 INFO L82 PathProgramCache]: Analyzing trace with hash 828124529, now seen corresponding path program 2 times [2018-01-31 08:57:11,768 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:57:11,768 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:57:11,769 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:57:11,769 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:57:11,770 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:57:11,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:57:11,795 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:57:12,048 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:57:12,049 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:57:12,049 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:57:12,055 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:57:12,103 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:57:12,109 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:57:12,114 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:57:12,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-31 08:57:12,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:57:12,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-31 08:57:12,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:57:12,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-31 08:57:12,148 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-31 08:57:13,749 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-01-31 08:57:13,768 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:57:13,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [15] total 40 [2018-01-31 08:57:13,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-31 08:57:13,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-31 08:57:13,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1374, Unknown=0, NotChecked=0, Total=1560 [2018-01-31 08:57:13,770 INFO L87 Difference]: Start difference. First operand 237 states and 247 transitions. Second operand 40 states. [2018-01-31 08:57:15,963 WARN L143 SmtUtils]: Spent 2022ms on a formula simplification that was a NOOP. DAG size: 34 [2018-01-31 08:57:18,216 WARN L143 SmtUtils]: Spent 2029ms on a formula simplification that was a NOOP. DAG size: 35 [2018-01-31 08:57:20,405 WARN L143 SmtUtils]: Spent 2023ms on a formula simplification that was a NOOP. DAG size: 35 [2018-01-31 08:57:22,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:57:22,441 INFO L93 Difference]: Finished difference Result 408 states and 430 transitions. [2018-01-31 08:57:22,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-01-31 08:57:22,441 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 159 [2018-01-31 08:57:22,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:57:22,442 INFO L225 Difference]: With dead ends: 408 [2018-01-31 08:57:22,442 INFO L226 Difference]: Without dead ends: 242 [2018-01-31 08:57:22,444 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 130 SyntacticMatches, 5 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 996 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=462, Invalid=3698, Unknown=0, NotChecked=0, Total=4160 [2018-01-31 08:57:22,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-01-31 08:57:22,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 239. [2018-01-31 08:57:22,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-01-31 08:57:22,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 248 transitions. [2018-01-31 08:57:22,487 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 248 transitions. Word has length 159 [2018-01-31 08:57:22,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:57:22,487 INFO L432 AbstractCegarLoop]: Abstraction has 239 states and 248 transitions. [2018-01-31 08:57:22,487 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-01-31 08:57:22,488 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 248 transitions. [2018-01-31 08:57:22,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-01-31 08:57:22,489 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:57:22,489 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:57:22,489 INFO L371 AbstractCegarLoop]: === Iteration 28 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:57:22,489 INFO L82 PathProgramCache]: Analyzing trace with hash -310688389, now seen corresponding path program 1 times [2018-01-31 08:57:22,489 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:57:22,490 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:57:22,490 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:57:22,490 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:57:22,491 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:57:22,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:57:22,517 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:57:23,056 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:57:23,057 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:57:23,057 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:57:23,062 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:57:23,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:57:23,129 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:57:23,153 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:57:23,173 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:57:23,173 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-01-31 08:57:23,174 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-31 08:57:23,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-31 08:57:23,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-01-31 08:57:23,174 INFO L87 Difference]: Start difference. First operand 239 states and 248 transitions. Second operand 17 states. [2018-01-31 08:57:23,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:57:23,272 INFO L93 Difference]: Finished difference Result 410 states and 428 transitions. [2018-01-31 08:57:23,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-31 08:57:23,273 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 168 [2018-01-31 08:57:23,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:57:23,274 INFO L225 Difference]: With dead ends: 410 [2018-01-31 08:57:23,274 INFO L226 Difference]: Without dead ends: 246 [2018-01-31 08:57:23,275 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=180, Unknown=0, NotChecked=0, Total=306 [2018-01-31 08:57:23,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-01-31 08:57:23,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 243. [2018-01-31 08:57:23,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-01-31 08:57:23,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 252 transitions. [2018-01-31 08:57:23,317 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 252 transitions. Word has length 168 [2018-01-31 08:57:23,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:57:23,317 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 252 transitions. [2018-01-31 08:57:23,317 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-31 08:57:23,318 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 252 transitions. [2018-01-31 08:57:23,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-01-31 08:57:23,319 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:57:23,319 INFO L351 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:57:23,319 INFO L371 AbstractCegarLoop]: === Iteration 29 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:57:23,320 INFO L82 PathProgramCache]: Analyzing trace with hash -903418371, now seen corresponding path program 2 times [2018-01-31 08:57:23,320 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:57:23,320 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:57:23,321 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:57:23,321 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:57:23,321 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:57:23,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:57:23,351 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:57:24,428 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:57:24,429 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:57:24,429 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:57:24,434 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:57:24,482 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:57:24,489 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:57:24,496 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:57:24,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-31 08:57:24,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-31 08:57:24,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:57:24,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:57:24,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:57:24,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-01-31 08:57:24,696 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:57:24,698 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:57:24,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-31 08:57:24,702 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:26 [2018-01-31 08:57:24,705 WARN L1033 $PredicateComparison]: unable to prove that (exists ((LDV_INIT_LIST_HEAD_~list.offset Int) (v_DerPreprocessor_2 Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (let ((.cse0 (+ LDV_INIT_LIST_HEAD_~list.offset 4))) (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) LDV_INIT_LIST_HEAD_~list.offset v_DerPreprocessor_2) .cse0 (select (select |c_#memory_int| |c_LDV_INIT_LIST_HEAD_#in~list.base|) .cse0))))) (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) is different from true [2018-01-31 08:57:24,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2018-01-31 08:57:24,714 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:24,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-01-31 08:57:24,726 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:24,726 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:24,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-01-31 08:57:24,730 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:57:24,736 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:57:24,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:57:24,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:57:24,743 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:37, output treesize:9 [2018-01-31 08:57:25,527 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:25,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 36 [2018-01-31 08:57:25,596 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 08:57:25,618 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:25,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2018-01-31 08:57:25,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:57:25,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:57:25,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:57:25,701 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:13 [2018-01-31 08:57:26,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-01-31 08:57:26,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-01-31 08:57:26,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:57:26,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:57:26,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:57:26,269 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-01-31 08:57:26,338 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-01-31 08:57:26,358 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:57:26,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [46] imperfect sequences [17] total 61 [2018-01-31 08:57:26,359 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-01-31 08:57:26,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-01-31 08:57:26,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=3313, Unknown=1, NotChecked=116, Total=3660 [2018-01-31 08:57:26,360 INFO L87 Difference]: Start difference. First operand 243 states and 252 transitions. Second operand 61 states. [2018-01-31 08:57:30,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:57:30,523 INFO L93 Difference]: Finished difference Result 404 states and 420 transitions. [2018-01-31 08:57:30,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-01-31 08:57:30,523 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 172 [2018-01-31 08:57:30,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:57:30,524 INFO L225 Difference]: With dead ends: 404 [2018-01-31 08:57:30,524 INFO L226 Difference]: Without dead ends: 240 [2018-01-31 08:57:30,526 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1409 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=387, Invalid=7272, Unknown=1, NotChecked=172, Total=7832 [2018-01-31 08:57:30,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-01-31 08:57:30,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 237. [2018-01-31 08:57:30,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-01-31 08:57:30,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 240 transitions. [2018-01-31 08:57:30,603 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 240 transitions. Word has length 172 [2018-01-31 08:57:30,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:57:30,604 INFO L432 AbstractCegarLoop]: Abstraction has 237 states and 240 transitions. [2018-01-31 08:57:30,604 INFO L433 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-01-31 08:57:30,604 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 240 transitions. [2018-01-31 08:57:30,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-01-31 08:57:30,604 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:57:30,605 INFO L351 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:57:30,605 INFO L371 AbstractCegarLoop]: === Iteration 30 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:57:30,605 INFO L82 PathProgramCache]: Analyzing trace with hash 306840936, now seen corresponding path program 1 times [2018-01-31 08:57:30,605 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:57:30,605 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:57:30,606 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:57:30,606 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:57:30,607 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:57:30,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:57:30,635 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:57:31,515 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-01-31 08:57:31,515 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:57:31,515 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:57:31,522 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:57:31,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:57:31,619 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:57:32,098 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-01-31 08:57:32,121 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:57:32,122 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2018-01-31 08:57:32,122 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-31 08:57:32,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-31 08:57:32,123 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1016, Unknown=0, NotChecked=0, Total=1190 [2018-01-31 08:57:32,123 INFO L87 Difference]: Start difference. First operand 237 states and 240 transitions. Second operand 35 states. [2018-01-31 08:57:33,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:57:33,468 INFO L93 Difference]: Finished difference Result 410 states and 417 transitions. [2018-01-31 08:57:33,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-31 08:57:33,468 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 189 [2018-01-31 08:57:33,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:57:33,469 INFO L225 Difference]: With dead ends: 410 [2018-01-31 08:57:33,469 INFO L226 Difference]: Without dead ends: 256 [2018-01-31 08:57:33,471 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=521, Invalid=3639, Unknown=0, NotChecked=0, Total=4160 [2018-01-31 08:57:33,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-01-31 08:57:33,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 251. [2018-01-31 08:57:33,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-01-31 08:57:33,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 254 transitions. [2018-01-31 08:57:33,514 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 254 transitions. Word has length 189 [2018-01-31 08:57:33,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:57:33,514 INFO L432 AbstractCegarLoop]: Abstraction has 251 states and 254 transitions. [2018-01-31 08:57:33,515 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-31 08:57:33,515 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 254 transitions. [2018-01-31 08:57:33,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-01-31 08:57:33,516 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:57:33,516 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:57:33,516 INFO L371 AbstractCegarLoop]: === Iteration 31 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:57:33,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1585136261, now seen corresponding path program 1 times [2018-01-31 08:57:33,517 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:57:33,517 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:57:33,518 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:57:33,518 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:57:33,518 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:57:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:57:33,548 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:57:34,691 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 446 trivial. 0 not checked. [2018-01-31 08:57:34,691 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:57:34,691 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:57:34,696 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:57:34,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:57:34,780 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:57:35,961 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-01-31 08:57:35,982 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:57:35,982 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19] total 41 [2018-01-31 08:57:35,982 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-31 08:57:35,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-31 08:57:35,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1441, Unknown=0, NotChecked=0, Total=1640 [2018-01-31 08:57:35,983 INFO L87 Difference]: Start difference. First operand 251 states and 254 transitions. Second operand 41 states. [2018-01-31 08:57:38,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:57:38,486 INFO L93 Difference]: Finished difference Result 423 states and 430 transitions. [2018-01-31 08:57:38,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-01-31 08:57:38,486 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 212 [2018-01-31 08:57:38,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:57:38,487 INFO L225 Difference]: With dead ends: 423 [2018-01-31 08:57:38,487 INFO L226 Difference]: Without dead ends: 259 [2018-01-31 08:57:38,489 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=617, Invalid=5389, Unknown=0, NotChecked=0, Total=6006 [2018-01-31 08:57:38,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-01-31 08:57:38,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 254. [2018-01-31 08:57:38,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-01-31 08:57:38,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 257 transitions. [2018-01-31 08:57:38,534 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 257 transitions. Word has length 212 [2018-01-31 08:57:38,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:57:38,534 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 257 transitions. [2018-01-31 08:57:38,534 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-31 08:57:38,535 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 257 transitions. [2018-01-31 08:57:38,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-01-31 08:57:38,536 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:57:38,539 INFO L351 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:57:38,539 INFO L371 AbstractCegarLoop]: === Iteration 32 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:57:38,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1494315070, now seen corresponding path program 1 times [2018-01-31 08:57:38,539 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:57:38,539 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:57:38,540 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:57:38,540 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:57:38,540 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:57:38,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:57:38,694 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:57:42,843 WARN L146 SmtUtils]: Spent 337ms on a formula simplification. DAG size of input: 46 DAG size of output 18 [2018-01-31 08:57:44,824 WARN L146 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 39 DAG size of output 31 [2018-01-31 08:57:47,492 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 31 proven. 483 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 08:57:47,492 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:57:47,492 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:57:47,497 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:57:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:57:47,622 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:57:47,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-31 08:57:47,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-31 08:57:47,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:57:47,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:57:47,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:57:47,884 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-01-31 08:57:48,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-01-31 08:57:48,036 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:48,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-01-31 08:57:48,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:57:48,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:57:48,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:57:48,047 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-01-31 08:57:48,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-01-31 08:57:48,241 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:48,242 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:48,242 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:48,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 52 [2018-01-31 08:57:48,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:57:48,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:57:48,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:57:48,261 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:43 [2018-01-31 08:57:48,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2018-01-31 08:57:48,505 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:48,506 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:48,507 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:48,508 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:48,509 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:48,510 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:48,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 85 [2018-01-31 08:57:48,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:57:48,525 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:57:48,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-31 08:57:48,537 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:59 [2018-01-31 08:57:48,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 58 treesize of output 47 [2018-01-31 08:57:48,838 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:48,860 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:48,882 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:48,907 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:48,933 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:48,957 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:48,976 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:48,978 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:48,978 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:48,979 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:48,980 INFO L303 Elim1Store]: Index analysis took 179 ms [2018-01-31 08:57:48,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 126 [2018-01-31 08:57:48,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:57:49,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:57:49,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-31 08:57:49,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:79, output treesize:75 [2018-01-31 08:57:49,942 WARN L143 SmtUtils]: Spent 786ms on a formula simplification that was a NOOP. DAG size: 38 [2018-01-31 08:57:50,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2018-01-31 08:57:50,103 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:50,104 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:50,105 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:50,106 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:50,107 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:50,108 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:50,109 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:50,109 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:50,110 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:50,111 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:50,112 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:50,113 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:50,114 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:50,115 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:50,116 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:50,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 175 [2018-01-31 08:57:50,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:57:50,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:57:50,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-31 08:57:50,171 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:95, output treesize:91 [2018-01-31 08:57:50,480 WARN L143 SmtUtils]: Spent 154ms on a formula simplification that was a NOOP. DAG size: 44 [2018-01-31 08:57:50,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 65 [2018-01-31 08:57:50,751 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:50,752 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:50,753 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:50,754 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:50,755 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:50,756 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:50,757 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:50,758 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:50,759 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:50,760 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:50,761 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:50,762 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:50,763 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:50,764 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:50,765 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:50,766 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:50,767 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:50,768 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:50,769 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:50,770 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:50,771 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:50,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 232 [2018-01-31 08:57:50,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:57:50,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:57:50,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-01-31 08:57:50,846 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:111, output treesize:107 [2018-01-31 08:57:51,527 WARN L143 SmtUtils]: Spent 439ms on a formula simplification that was a NOOP. DAG size: 50 [2018-01-31 08:57:52,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 74 [2018-01-31 08:57:52,995 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:53,025 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:53,046 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:53,071 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:53,096 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:53,120 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:53,146 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:53,171 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:53,196 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:53,221 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:53,242 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:53,263 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:53,265 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:53,267 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:53,268 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:53,269 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:53,271 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:53,272 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:53,273 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:53,274 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:53,275 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:53,275 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:53,276 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:53,277 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:53,278 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:53,279 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:53,279 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:53,280 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:57:53,280 INFO L303 Elim1Store]: Index analysis took 333 ms [2018-01-31 08:57:53,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 297 [2018-01-31 08:57:53,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:57:53,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:57:53,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-01-31 08:57:53,414 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:127, output treesize:123 [2018-01-31 08:57:54,988 WARN L143 SmtUtils]: Spent 145ms on a formula simplification that was a NOOP. DAG size: 56 [2018-01-31 08:58:05,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 83 [2018-01-31 08:58:05,936 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:05,937 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:05,938 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:05,939 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:05,941 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:05,942 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:05,942 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:05,943 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:05,944 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:05,945 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:05,946 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:05,947 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:05,947 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:05,948 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:05,949 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:05,950 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:05,951 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:05,952 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:05,952 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:05,953 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:05,954 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:05,955 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:05,956 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:05,956 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:05,957 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:05,958 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:05,959 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:05,960 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:05,961 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:05,961 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:05,962 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:05,963 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:05,964 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:05,965 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:05,966 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:05,966 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:05,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 370 [2018-01-31 08:58:05,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:58:06,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:58:06,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-01-31 08:58:06,379 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:143, output treesize:139 [2018-01-31 08:58:18,082 WARN L143 SmtUtils]: Spent 769ms on a formula simplification that was a NOOP. DAG size: 62 [2018-01-31 08:58:42,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 92 [2018-01-31 08:58:42,660 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:42,661 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:42,662 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:42,663 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:42,664 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:42,665 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:42,667 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:42,668 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:42,669 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:42,670 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:42,671 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:42,672 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:42,673 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:42,674 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:42,676 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:42,677 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:42,678 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:42,679 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:42,680 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:42,682 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:42,683 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:42,684 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:42,685 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:42,686 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:42,687 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:42,688 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:42,689 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:42,690 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:42,691 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:42,693 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:42,694 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:42,695 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:42,696 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:42,697 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:42,698 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:42,699 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:42,700 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:42,702 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:42,703 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:42,704 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:42,705 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:42,706 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:42,707 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:42,708 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:42,709 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:58:42,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 451 [2018-01-31 08:58:42,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:58:42,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:58:42,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-01-31 08:58:42,888 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:159, output treesize:155 Received shutdown request... [2018-01-31 08:58:50,111 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-31 08:58:50,111 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-31 08:58:50,116 WARN L185 ceAbstractionStarter]: Timeout [2018-01-31 08:58:50,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 08:58:50 BoogieIcfgContainer [2018-01-31 08:58:50,116 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 08:58:50,117 INFO L168 Benchmark]: Toolchain (without parser) took 139139.10 ms. Allocated memory was 302.5 MB in the beginning and 1.1 GB in the end (delta: 844.6 MB). Free memory was 259.4 MB in the beginning and 1.1 GB in the end (delta: -815.9 MB). Peak memory consumption was 811.9 MB. Max. memory is 5.3 GB. [2018-01-31 08:58:50,118 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 302.5 MB. Free memory is still 266.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 08:58:50,118 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.59 ms. Allocated memory is still 302.5 MB. Free memory was 259.4 MB in the beginning and 245.3 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 5.3 GB. [2018-01-31 08:58:50,119 INFO L168 Benchmark]: Boogie Preprocessor took 76.74 ms. Allocated memory is still 302.5 MB. Free memory was 245.3 MB in the beginning and 243.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:58:50,119 INFO L168 Benchmark]: RCFGBuilder took 918.05 ms. Allocated memory is still 302.5 MB. Free memory was 243.3 MB in the beginning and 204.4 MB in the end (delta: 39.0 MB). Peak memory consumption was 39.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:58:50,119 INFO L168 Benchmark]: TraceAbstraction took 137811.60 ms. Allocated memory was 302.5 MB in the beginning and 1.1 GB in the end (delta: 844.6 MB). Free memory was 204.4 MB in the beginning and 1.1 GB in the end (delta: -870.9 MB). Peak memory consumption was 756.9 MB. Max. memory is 5.3 GB. [2018-01-31 08:58:50,121 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.11 ms. Allocated memory is still 302.5 MB. Free memory is still 266.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 317.59 ms. Allocated memory is still 302.5 MB. Free memory was 259.4 MB in the beginning and 245.3 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 76.74 ms. Allocated memory is still 302.5 MB. Free memory was 245.3 MB in the beginning and 243.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 918.05 ms. Allocated memory is still 302.5 MB. Free memory was 243.3 MB in the beginning and 204.4 MB in the end (delta: 39.0 MB). Peak memory consumption was 39.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 137811.60 ms. Allocated memory was 302.5 MB in the beginning and 1.1 GB in the end (delta: 844.6 MB). Free memory was 204.4 MB in the beginning and 1.1 GB in the end (delta: -870.9 MB). Peak memory consumption was 756.9 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 222 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 97 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 222 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 97 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 222 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 97 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 222 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 97 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 222 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 97 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 222 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 97 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 222 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 97 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 222 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 97 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 222 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 97 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 222 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 97 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 222 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 97 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 222 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 97 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was analyzing trace of length 222 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 97 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was analyzing trace of length 222 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 97 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was analyzing trace of length 222 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 97 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was analyzing trace of length 222 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 97 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 222 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 97 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 222 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 97 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 222 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 97 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 222 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 97 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 222 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 97 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 222 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 97 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 222 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 97 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 176 locations, 23 error locations. TIMEOUT Result, 137.7s OverallTime, 32 OverallIterations, 16 TraceHistogramMax, 39.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4763 SDtfs, 2386 SDslu, 41693 SDs, 0 SdLazy, 18429 SolverSat, 419 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 17.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2400 GetRequests, 1686 SyntacticMatches, 11 SemanticMatches, 703 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5086 ImplicationChecksByTransitivity, 38.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=254occurred in iteration=31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 31 MinimizatonAttempts, 173 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 23.3s InterpolantComputationTime, 4655 NumberOfCodeBlocks, 4475 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 4609 ConstructedInterpolants, 410 QuantifiedInterpolants, 2646401 SizeOfPredicates, 134 NumberOfNonLiveVariables, 5857 ConjunctsInSsa, 565 ConjunctsInUnsatCore, 46 InterpolantComputations, 22 PerfectInterpolantSequences, 2418/5450 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_08-58-50-130.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_08-58-50-130.csv Completed graceful shutdown