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_5_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 09:01:12,054 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 09:01:12,057 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 09:01:12,082 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 09:01:12,082 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 09:01:12,084 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 09:01:12,085 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 09:01:12,088 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 09:01:12,091 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 09:01:12,091 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 09:01:12,103 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 09:01:12,103 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 09:01:12,104 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 09:01:12,105 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 09:01:12,106 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 09:01:12,109 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 09:01:12,114 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 09:01:12,116 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 09:01:12,117 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 09:01:12,121 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 09:01:12,126 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 09:01:12,126 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 09:01:12,127 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 09:01:12,128 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 09:01:12,128 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 09:01:12,133 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 09:01:12,134 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 09:01:12,134 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 09:01:12,134 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 09:01:12,135 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 09:01:12,135 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 09:01:12,135 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 09:01:12,148 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 09:01:12,148 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 09:01:12,149 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 09:01:12,149 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 09:01:12,149 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 09:01:12,149 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 09:01:12,150 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 09:01:12,152 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 09:01:12,152 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 09:01:12,152 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 09:01:12,152 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 09:01:12,152 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 09:01:12,152 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 09:01:12,153 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 09:01:12,153 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 09:01:12,153 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 09:01:12,153 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 09:01:12,153 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 09:01:12,153 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 09:01:12,154 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 09:01:12,154 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 09:01:12,154 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 09:01:12,154 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 09:01:12,154 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 09:01:12,155 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 09:01:12,155 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 09:01:12,156 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 09:01:12,156 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 09:01:12,156 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 09:01:12,156 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 09:01:12,157 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 09:01:12,157 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 09:01:12,158 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 09:01:12,158 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 09:01:12,205 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 09:01:12,219 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 09:01:12,223 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 09:01:12,225 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 09:01:12,225 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 09:01:12,226 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_5_false-valid-deref.i [2018-01-31 09:01:12,450 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 09:01:12,460 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 09:01:12,461 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 09:01:12,461 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 09:01:12,478 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 09:01:12,479 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:01:12" (1/1) ... [2018-01-31 09:01:12,482 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@224c875 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:01:12, skipping insertion in model container [2018-01-31 09:01:12,482 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:01:12" (1/1) ... [2018-01-31 09:01:12,502 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:01:12,582 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:01:12,762 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:01:12,804 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:01:12,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:01:12 WrapperNode [2018-01-31 09:01:12,825 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 09:01:12,826 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 09:01:12,826 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 09:01:12,826 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 09:01:12,842 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:01:12" (1/1) ... [2018-01-31 09:01:12,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:01:12" (1/1) ... [2018-01-31 09:01:12,858 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:01:12" (1/1) ... [2018-01-31 09:01:12,858 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:01:12" (1/1) ... [2018-01-31 09:01:12,870 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:01:12" (1/1) ... [2018-01-31 09:01:12,881 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:01:12" (1/1) ... [2018-01-31 09:01:12,883 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:01:12" (1/1) ... [2018-01-31 09:01:12,886 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 09:01:12,887 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 09:01:12,889 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 09:01:12,889 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 09:01:12,890 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:01:12" (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 09:01:12,946 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 09:01:12,946 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 09:01:12,946 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-01-31 09:01:12,946 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-31 09:01:12,947 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-01-31 09:01:12,947 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-01-31 09:01:12,947 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-01-31 09:01:12,947 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-01-31 09:01:12,947 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-01-31 09:01:12,947 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-01-31 09:01:12,947 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-01-31 09:01:12,947 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-01-31 09:01:12,948 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-01-31 09:01:12,948 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-01-31 09:01:12,948 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-01-31 09:01:12,948 INFO L136 BoogieDeclarations]: Found implementation of procedure f_22_put [2018-01-31 09:01:12,948 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-31 09:01:12,948 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 09:01:12,948 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-31 09:01:12,949 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-31 09:01:12,949 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 09:01:12,949 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 09:01:12,949 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 09:01:12,949 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 09:01:12,949 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 09:01:12,950 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-31 09:01:12,950 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-31 09:01:12,950 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-31 09:01:12,950 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-31 09:01:12,950 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 09:01:12,950 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-31 09:01:12,950 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-31 09:01:12,951 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-01-31 09:01:12,951 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-01-31 09:01:12,951 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-01-31 09:01:12,951 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-01-31 09:01:12,951 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-01-31 09:01:12,951 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-01-31 09:01:12,951 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-01-31 09:01:12,952 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-01-31 09:01:12,952 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-01-31 09:01:12,952 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-01-31 09:01:12,952 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-01-31 09:01:12,952 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-01-31 09:01:12,952 INFO L128 BoogieDeclarations]: Found specification of procedure f_22_put [2018-01-31 09:01:12,952 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-31 09:01:12,952 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 09:01:12,953 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 09:01:12,953 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 09:01:13,420 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-31 09:01:13,804 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 09:01:13,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:01:13 BoogieIcfgContainer [2018-01-31 09:01:13,805 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 09:01:13,806 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 09:01:13,806 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 09:01:13,809 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 09:01:13,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 09:01:12" (1/3) ... [2018-01-31 09:01:13,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f9ea77e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:01:13, skipping insertion in model container [2018-01-31 09:01:13,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:01:12" (2/3) ... [2018-01-31 09:01:13,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f9ea77e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:01:13, skipping insertion in model container [2018-01-31 09:01:13,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:01:13" (3/3) ... [2018-01-31 09:01:13,813 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test22_5_false-valid-deref.i [2018-01-31 09:01:13,823 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 09:01:13,831 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-01-31 09:01:13,879 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 09:01:13,879 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 09:01:13,879 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 09:01:13,879 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 09:01:13,879 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 09:01:13,879 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 09:01:13,880 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 09:01:13,880 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 09:01:13,880 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 09:01:13,904 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2018-01-31 09:01:13,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-31 09:01:13,915 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:01:13,916 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 09:01:13,916 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 09:01:13,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1409337998, now seen corresponding path program 1 times [2018-01-31 09:01:13,924 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:01:13,925 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:01:13,984 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:01:13,984 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:01:13,984 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:01:14,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:01:14,049 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:01:14,289 WARN L143 SmtUtils]: Spent 116ms on a formula simplification that was a NOOP. DAG size: 6 [2018-01-31 09:01:14,393 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 09:01:14,398 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:01:14,399 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:01:14,401 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:01:14,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:01:14,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:01:14,417 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 5 states. [2018-01-31 09:01:14,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:01:14,534 INFO L93 Difference]: Finished difference Result 284 states and 299 transitions. [2018-01-31 09:01:14,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:01:14,536 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-31 09:01:14,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:01:14,549 INFO L225 Difference]: With dead ends: 284 [2018-01-31 09:01:14,550 INFO L226 Difference]: Without dead ends: 155 [2018-01-31 09:01:14,554 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:01:14,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-01-31 09:01:14,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2018-01-31 09:01:14,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-01-31 09:01:14,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 161 transitions. [2018-01-31 09:01:14,605 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 161 transitions. Word has length 22 [2018-01-31 09:01:14,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:01:14,605 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 161 transitions. [2018-01-31 09:01:14,605 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:01:14,605 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 161 transitions. [2018-01-31 09:01:14,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-31 09:01:14,606 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:01:14,607 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 09:01:14,607 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 09:01:14,607 INFO L82 PathProgramCache]: Analyzing trace with hash 769916615, now seen corresponding path program 1 times [2018-01-31 09:01:14,607 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:01:14,607 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:01:14,609 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:01:14,609 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:01:14,609 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:01:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:01:14,647 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:01:14,751 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 09:01:14,751 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:01:14,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:01:14,780 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:01:14,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:01:14,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:01:14,781 INFO L87 Difference]: Start difference. First operand 153 states and 161 transitions. Second operand 6 states. [2018-01-31 09:01:15,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:01:15,122 INFO L93 Difference]: Finished difference Result 156 states and 164 transitions. [2018-01-31 09:01:15,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 09:01:15,122 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-31 09:01:15,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:01:15,125 INFO L225 Difference]: With dead ends: 156 [2018-01-31 09:01:15,125 INFO L226 Difference]: Without dead ends: 155 [2018-01-31 09:01:15,126 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 09:01:15,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-01-31 09:01:15,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2018-01-31 09:01:15,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-01-31 09:01:15,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 160 transitions. [2018-01-31 09:01:15,142 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 160 transitions. Word has length 23 [2018-01-31 09:01:15,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:01:15,143 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 160 transitions. [2018-01-31 09:01:15,143 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:01:15,143 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 160 transitions. [2018-01-31 09:01:15,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-31 09:01:15,144 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:01:15,144 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 09:01:15,144 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 09:01:15,145 INFO L82 PathProgramCache]: Analyzing trace with hash 769916616, now seen corresponding path program 1 times [2018-01-31 09:01:15,145 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:01:15,145 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:01:15,146 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:01:15,147 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:01:15,147 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:01:15,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:01:15,167 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:01:15,723 WARN L146 SmtUtils]: Spent 392ms on a formula simplification. DAG size of input: 19 DAG size of output 17 [2018-01-31 09:01:15,907 WARN L146 SmtUtils]: Spent 165ms on a formula simplification. DAG size of input: 17 DAG size of output 15 [2018-01-31 09:01:15,956 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 09:01:15,956 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:01:15,956 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 09:01:15,957 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 09:01:15,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 09:01:15,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-31 09:01:15,959 INFO L87 Difference]: Start difference. First operand 152 states and 160 transitions. Second operand 7 states. [2018-01-31 09:01:16,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:01:16,493 INFO L93 Difference]: Finished difference Result 155 states and 163 transitions. [2018-01-31 09:01:16,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 09:01:16,494 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-01-31 09:01:16,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:01:16,496 INFO L225 Difference]: With dead ends: 155 [2018-01-31 09:01:16,497 INFO L226 Difference]: Without dead ends: 154 [2018-01-31 09:01:16,497 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-31 09:01:16,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-31 09:01:16,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2018-01-31 09:01:16,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-01-31 09:01:16,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 159 transitions. [2018-01-31 09:01:16,515 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 159 transitions. Word has length 23 [2018-01-31 09:01:16,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:01:16,516 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 159 transitions. [2018-01-31 09:01:16,516 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 09:01:16,521 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 159 transitions. [2018-01-31 09:01:16,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-31 09:01:16,523 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:01:16,523 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 09:01:16,523 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 09:01:16,523 INFO L82 PathProgramCache]: Analyzing trace with hash -670738525, now seen corresponding path program 1 times [2018-01-31 09:01:16,523 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:01:16,523 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:01:16,525 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:01:16,525 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:01:16,525 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:01:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:01:16,562 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:01:16,763 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 09:01:16,763 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:01:16,764 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-31 09:01:16,764 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-31 09:01:16,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-31 09:01:16,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-31 09:01:16,765 INFO L87 Difference]: Start difference. First operand 151 states and 159 transitions. Second operand 10 states. [2018-01-31 09:01:17,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:01:17,109 INFO L93 Difference]: Finished difference Result 153 states and 161 transitions. [2018-01-31 09:01:17,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 09:01:17,110 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-01-31 09:01:17,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:01:17,112 INFO L225 Difference]: With dead ends: 153 [2018-01-31 09:01:17,112 INFO L226 Difference]: Without dead ends: 152 [2018-01-31 09:01:17,113 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-01-31 09:01:17,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-31 09:01:17,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2018-01-31 09:01:17,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-31 09:01:17,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 158 transitions. [2018-01-31 09:01:17,125 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 158 transitions. Word has length 39 [2018-01-31 09:01:17,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:01:17,126 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 158 transitions. [2018-01-31 09:01:17,126 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-31 09:01:17,126 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 158 transitions. [2018-01-31 09:01:17,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-31 09:01:17,128 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:01:17,128 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 09:01:17,128 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 09:01:17,128 INFO L82 PathProgramCache]: Analyzing trace with hash -670738524, now seen corresponding path program 1 times [2018-01-31 09:01:17,128 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:01:17,129 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:01:17,130 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:01:17,130 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:01:17,130 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:01:17,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:01:17,150 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:01:17,200 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 09:01:17,201 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:01:17,201 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 09:01:17,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 09:01:17,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 09:01:17,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 09:01:17,201 INFO L87 Difference]: Start difference. First operand 150 states and 158 transitions. Second operand 4 states. [2018-01-31 09:01:17,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:01:17,230 INFO L93 Difference]: Finished difference Result 266 states and 280 transitions. [2018-01-31 09:01:17,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 09:01:17,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-01-31 09:01:17,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:01:17,234 INFO L225 Difference]: With dead ends: 266 [2018-01-31 09:01:17,234 INFO L226 Difference]: Without dead ends: 154 [2018-01-31 09:01:17,235 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 09:01:17,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-31 09:01:17,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2018-01-31 09:01:17,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-01-31 09:01:17,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 159 transitions. [2018-01-31 09:01:17,248 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 159 transitions. Word has length 39 [2018-01-31 09:01:17,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:01:17,248 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 159 transitions. [2018-01-31 09:01:17,248 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 09:01:17,249 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 159 transitions. [2018-01-31 09:01:17,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-31 09:01:17,250 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:01:17,250 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 09:01:17,250 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 09:01:17,251 INFO L82 PathProgramCache]: Analyzing trace with hash -973665193, now seen corresponding path program 1 times [2018-01-31 09:01:17,251 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:01:17,251 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:01:17,252 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:01:17,252 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:01:17,252 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:01:17,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:01:17,273 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:01:17,665 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 09:01:17,665 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:01:17,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-31 09:01:17,665 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 09:01:17,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 09:01:17,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-31 09:01:17,666 INFO L87 Difference]: Start difference. First operand 151 states and 159 transitions. Second operand 9 states. [2018-01-31 09:01:17,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:01:17,836 INFO L93 Difference]: Finished difference Result 244 states and 259 transitions. [2018-01-31 09:01:17,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-31 09:01:17,837 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2018-01-31 09:01:17,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:01:17,839 INFO L225 Difference]: With dead ends: 244 [2018-01-31 09:01:17,839 INFO L226 Difference]: Without dead ends: 169 [2018-01-31 09:01:17,840 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-01-31 09:01:17,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-01-31 09:01:17,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2018-01-31 09:01:17,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-01-31 09:01:17,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 174 transitions. [2018-01-31 09:01:17,856 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 174 transitions. Word has length 43 [2018-01-31 09:01:17,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:01:17,856 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 174 transitions. [2018-01-31 09:01:17,856 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 09:01:17,856 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 174 transitions. [2018-01-31 09:01:17,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-31 09:01:17,858 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:01:17,858 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 09:01:17,858 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 09:01:17,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1507760222, now seen corresponding path program 1 times [2018-01-31 09:01:17,858 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:01:17,859 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:01:17,860 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:01:17,860 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:01:17,860 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:01:17,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:01:17,878 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:01:17,968 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 09:01:17,969 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:01:17,969 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 09:01:17,976 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:01:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:01:18,040 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:01:18,074 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 09:01:18,110 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:01:18,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-01-31 09:01:18,111 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:01:18,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:01:18,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:01:18,112 INFO L87 Difference]: Start difference. First operand 165 states and 174 transitions. Second operand 6 states. [2018-01-31 09:01:18,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:01:18,246 INFO L93 Difference]: Finished difference Result 284 states and 299 transitions. [2018-01-31 09:01:18,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 09:01:18,248 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2018-01-31 09:01:18,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:01:18,250 INFO L225 Difference]: With dead ends: 284 [2018-01-31 09:01:18,250 INFO L226 Difference]: Without dead ends: 172 [2018-01-31 09:01:18,251 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 09:01:18,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-01-31 09:01:18,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 169. [2018-01-31 09:01:18,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-01-31 09:01:18,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 178 transitions. [2018-01-31 09:01:18,264 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 178 transitions. Word has length 43 [2018-01-31 09:01:18,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:01:18,264 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 178 transitions. [2018-01-31 09:01:18,264 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:01:18,264 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 178 transitions. [2018-01-31 09:01:18,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-31 09:01:18,266 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:01:18,266 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] [2018-01-31 09:01:18,266 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 09:01:18,266 INFO L82 PathProgramCache]: Analyzing trace with hash -341758177, now seen corresponding path program 1 times [2018-01-31 09:01:18,266 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:01:18,267 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:01:18,268 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:01:18,268 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:01:18,268 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:01:18,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:01:18,280 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:01:18,367 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 09:01:18,368 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:01:18,368 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 09:01:18,368 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 09:01:18,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 09:01:18,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:01:18,369 INFO L87 Difference]: Start difference. First operand 169 states and 178 transitions. Second operand 3 states. [2018-01-31 09:01:18,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:01:18,793 INFO L93 Difference]: Finished difference Result 193 states and 204 transitions. [2018-01-31 09:01:18,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 09:01:18,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-01-31 09:01:18,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:01:18,796 INFO L225 Difference]: With dead ends: 193 [2018-01-31 09:01:18,796 INFO L226 Difference]: Without dead ends: 175 [2018-01-31 09:01:18,797 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:01:18,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-01-31 09:01:18,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 162. [2018-01-31 09:01:18,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-01-31 09:01:18,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 170 transitions. [2018-01-31 09:01:18,810 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 170 transitions. Word has length 43 [2018-01-31 09:01:18,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:01:18,810 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 170 transitions. [2018-01-31 09:01:18,810 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 09:01:18,810 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 170 transitions. [2018-01-31 09:01:18,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-31 09:01:18,811 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:01:18,812 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] [2018-01-31 09:01:18,812 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 09:01:18,812 INFO L82 PathProgramCache]: Analyzing trace with hash -366281494, now seen corresponding path program 1 times [2018-01-31 09:01:18,812 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:01:18,812 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:01:18,814 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:01:18,814 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:01:18,814 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:01:18,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:01:18,825 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:01:18,948 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 09:01:18,949 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:01:18,949 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 09:01:18,949 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:01:18,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:01:18,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:01:18,950 INFO L87 Difference]: Start difference. First operand 162 states and 170 transitions. Second operand 6 states. [2018-01-31 09:01:18,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:01:18,984 INFO L93 Difference]: Finished difference Result 166 states and 173 transitions. [2018-01-31 09:01:18,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 09:01:18,985 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-01-31 09:01:18,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:01:18,986 INFO L225 Difference]: With dead ends: 166 [2018-01-31 09:01:18,987 INFO L226 Difference]: Without dead ends: 147 [2018-01-31 09:01:18,987 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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 09:01:18,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-01-31 09:01:18,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-01-31 09:01:18,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-01-31 09:01:18,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 153 transitions. [2018-01-31 09:01:18,998 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 153 transitions. Word has length 44 [2018-01-31 09:01:18,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:01:18,998 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 153 transitions. [2018-01-31 09:01:18,998 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:01:18,999 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 153 transitions. [2018-01-31 09:01:19,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-31 09:01:19,000 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:01:19,000 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 09:01:19,000 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 09:01:19,000 INFO L82 PathProgramCache]: Analyzing trace with hash -409384800, now seen corresponding path program 2 times [2018-01-31 09:01:19,001 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:01:19,001 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:01:19,002 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:01:19,002 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:01:19,002 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:01:19,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:01:19,019 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:01:19,298 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 09:01:19,298 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:01:19,298 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 09:01:19,304 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 09:01:19,331 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:01:19,344 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:01:19,349 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:01:19,395 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 09:01:19,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:01:19,655 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 09:01:19,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:01:19,861 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 09:01:19,861 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-31 09:01:20,060 WARN L143 SmtUtils]: Spent 107ms on a formula simplification that was a NOOP. DAG size: 24 [2018-01-31 09:01:20,739 WARN L143 SmtUtils]: Spent 193ms on a formula simplification that was a NOOP. DAG size: 27 [2018-01-31 09:01:21,295 WARN L146 SmtUtils]: Spent 237ms on a formula simplification. DAG size of input: 45 DAG size of output 17 [2018-01-31 09:01:21,669 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 09:01:21,692 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 09:01:21,692 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 19 [2018-01-31 09:01:21,692 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-31 09:01:21,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-31 09:01:21,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-01-31 09:01:21,693 INFO L87 Difference]: Start difference. First operand 147 states and 153 transitions. Second operand 19 states. [2018-01-31 09:01:23,984 WARN L143 SmtUtils]: Spent 2073ms on a formula simplification that was a NOOP. DAG size: 39 [2018-01-31 09:01:25,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:01:25,236 INFO L93 Difference]: Finished difference Result 265 states and 278 transitions. [2018-01-31 09:01:25,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-31 09:01:25,271 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2018-01-31 09:01:25,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:01:25,273 INFO L225 Difference]: With dead ends: 265 [2018-01-31 09:01:25,273 INFO L226 Difference]: Without dead ends: 153 [2018-01-31 09:01:25,274 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2018-01-31 09:01:25,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-01-31 09:01:25,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 150. [2018-01-31 09:01:25,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-31 09:01:25,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 156 transitions. [2018-01-31 09:01:25,300 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 156 transitions. Word has length 47 [2018-01-31 09:01:25,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:01:25,301 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 156 transitions. [2018-01-31 09:01:25,301 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-31 09:01:25,301 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 156 transitions. [2018-01-31 09:01:25,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-31 09:01:25,302 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:01:25,302 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 09:01:25,302 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 09:01:25,302 INFO L82 PathProgramCache]: Analyzing trace with hash -146998063, now seen corresponding path program 1 times [2018-01-31 09:01:25,303 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:01:25,303 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:01:25,304 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:01:25,304 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:01:25,304 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:01:25,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:01:25,336 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:01:25,548 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 09:01:25,548 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:01:25,549 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-31 09:01:25,549 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-31 09:01:25,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-31 09:01:25,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-01-31 09:01:25,550 INFO L87 Difference]: Start difference. First operand 150 states and 156 transitions. Second operand 12 states. [2018-01-31 09:01:25,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:01:25,868 INFO L93 Difference]: Finished difference Result 150 states and 156 transitions. [2018-01-31 09:01:25,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-31 09:01:25,868 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-01-31 09:01:25,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:01:25,869 INFO L225 Difference]: With dead ends: 150 [2018-01-31 09:01:25,870 INFO L226 Difference]: Without dead ends: 148 [2018-01-31 09:01:25,870 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-01-31 09:01:25,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-01-31 09:01:25,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-01-31 09:01:25,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-01-31 09:01:25,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 154 transitions. [2018-01-31 09:01:25,887 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 154 transitions. Word has length 56 [2018-01-31 09:01:25,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:01:25,887 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 154 transitions. [2018-01-31 09:01:25,887 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-31 09:01:25,887 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 154 transitions. [2018-01-31 09:01:25,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-31 09:01:25,888 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:01:25,888 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 09:01:25,889 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 09:01:25,889 INFO L82 PathProgramCache]: Analyzing trace with hash -146998062, now seen corresponding path program 1 times [2018-01-31 09:01:25,889 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:01:25,889 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:01:25,890 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:01:25,890 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:01:25,890 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:01:25,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:01:25,908 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:01:26,005 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 09:01:26,005 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:01:26,006 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 09:01:26,013 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:01:26,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:01:26,042 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:01:26,056 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:01:26,077 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:01:26,077 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-01-31 09:01:26,078 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 09:01:26,078 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 09:01:26,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:01:26,078 INFO L87 Difference]: Start difference. First operand 148 states and 154 transitions. Second operand 8 states. [2018-01-31 09:01:26,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:01:26,411 INFO L93 Difference]: Finished difference Result 264 states and 276 transitions. [2018-01-31 09:01:26,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 09:01:26,412 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2018-01-31 09:01:26,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:01:26,414 INFO L225 Difference]: With dead ends: 264 [2018-01-31 09:01:26,414 INFO L226 Difference]: Without dead ends: 155 [2018-01-31 09:01:26,414 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 09:01:26,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-01-31 09:01:26,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2018-01-31 09:01:26,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-01-31 09:01:26,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 158 transitions. [2018-01-31 09:01:26,430 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 158 transitions. Word has length 56 [2018-01-31 09:01:26,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:01:26,430 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 158 transitions. [2018-01-31 09:01:26,431 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 09:01:26,431 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 158 transitions. [2018-01-31 09:01:26,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-31 09:01:26,431 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:01:26,432 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 09:01:26,432 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 09:01:26,432 INFO L82 PathProgramCache]: Analyzing trace with hash 966731924, now seen corresponding path program 2 times [2018-01-31 09:01:26,432 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:01:26,432 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:01:26,433 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:01:26,433 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:01:26,434 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:01:26,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:01:26,451 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:01:26,772 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 09:01:26,773 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:01:26,773 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 09:01:26,778 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 09:01:26,801 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:01:26,805 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:01:26,810 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:01:26,836 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 09:01:26,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:01:26,932 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 09:01:26,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:01:26,945 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 09:01:26,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-31 09:01:27,616 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 09:01:27,635 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 09:01:27,636 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 22 [2018-01-31 09:01:27,636 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-31 09:01:27,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-31 09:01:27,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2018-01-31 09:01:27,637 INFO L87 Difference]: Start difference. First operand 152 states and 158 transitions. Second operand 22 states. [2018-01-31 09:01:27,956 WARN L143 SmtUtils]: Spent 121ms on a formula simplification that was a NOOP. DAG size: 39 [2018-01-31 09:01:32,083 WARN L143 SmtUtils]: Spent 4027ms on a formula simplification that was a NOOP. DAG size: 31 [2018-01-31 09:01:36,153 WARN L143 SmtUtils]: Spent 3763ms on a formula simplification that was a NOOP. DAG size: 32 [2018-01-31 09:01:37,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:01:37,235 INFO L93 Difference]: Finished difference Result 266 states and 280 transitions. [2018-01-31 09:01:37,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-31 09:01:37,236 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 60 [2018-01-31 09:01:37,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:01:37,237 INFO L225 Difference]: With dead ends: 266 [2018-01-31 09:01:37,237 INFO L226 Difference]: Without dead ends: 157 [2018-01-31 09:01:37,238 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=152, Invalid=904, Unknown=0, NotChecked=0, Total=1056 [2018-01-31 09:01:37,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-01-31 09:01:37,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 154. [2018-01-31 09:01:37,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-01-31 09:01:37,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 160 transitions. [2018-01-31 09:01:37,260 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 160 transitions. Word has length 60 [2018-01-31 09:01:37,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:01:37,261 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 160 transitions. [2018-01-31 09:01:37,261 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-31 09:01:37,261 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 160 transitions. [2018-01-31 09:01:37,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-01-31 09:01:37,263 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:01:37,263 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] [2018-01-31 09:01:37,263 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 09:01:37,263 INFO L82 PathProgramCache]: Analyzing trace with hash 610719468, now seen corresponding path program 1 times [2018-01-31 09:01:37,263 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:01:37,263 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:01:37,265 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:01:37,265 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:01:37,265 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:01:37,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:01:37,290 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:01:37,726 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 09:01:37,726 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:01:37,726 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 09:01:37,727 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 09:01:37,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 09:01:37,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:01:37,727 INFO L87 Difference]: Start difference. First operand 154 states and 160 transitions. Second operand 8 states. [2018-01-31 09:01:37,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:01:37,814 INFO L93 Difference]: Finished difference Result 239 states and 248 transitions. [2018-01-31 09:01:37,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 09:01:37,817 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 77 [2018-01-31 09:01:37,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:01:37,818 INFO L225 Difference]: With dead ends: 239 [2018-01-31 09:01:37,818 INFO L226 Difference]: Without dead ends: 154 [2018-01-31 09:01:37,819 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-01-31 09:01:37,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-31 09:01:37,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-01-31 09:01:37,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-01-31 09:01:37,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 159 transitions. [2018-01-31 09:01:37,839 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 159 transitions. Word has length 77 [2018-01-31 09:01:37,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:01:37,840 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 159 transitions. [2018-01-31 09:01:37,840 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 09:01:37,840 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 159 transitions. [2018-01-31 09:01:37,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-01-31 09:01:37,841 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:01:37,841 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] [2018-01-31 09:01:37,841 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 09:01:37,841 INFO L82 PathProgramCache]: Analyzing trace with hash 311971301, now seen corresponding path program 1 times [2018-01-31 09:01:37,841 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:01:37,842 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:01:37,843 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:01:37,843 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:01:37,843 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:01:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:01:37,863 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:01:37,970 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 09:01:37,970 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:01:37,970 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-31 09:01:37,970 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-31 09:01:37,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-31 09:01:37,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-31 09:01:37,971 INFO L87 Difference]: Start difference. First operand 154 states and 159 transitions. Second operand 10 states. [2018-01-31 09:01:38,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:01:38,064 INFO L93 Difference]: Finished difference Result 241 states and 249 transitions. [2018-01-31 09:01:38,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-31 09:01:38,067 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 82 [2018-01-31 09:01:38,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:01:38,069 INFO L225 Difference]: With dead ends: 241 [2018-01-31 09:01:38,069 INFO L226 Difference]: Without dead ends: 154 [2018-01-31 09:01:38,069 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-01-31 09:01:38,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-31 09:01:38,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-01-31 09:01:38,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-01-31 09:01:38,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 158 transitions. [2018-01-31 09:01:38,093 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 158 transitions. Word has length 82 [2018-01-31 09:01:38,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:01:38,093 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 158 transitions. [2018-01-31 09:01:38,094 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-31 09:01:38,094 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 158 transitions. [2018-01-31 09:01:38,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-01-31 09:01:38,095 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:01:38,095 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, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:01:38,095 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 09:01:38,095 INFO L82 PathProgramCache]: Analyzing trace with hash -101181527, now seen corresponding path program 1 times [2018-01-31 09:01:38,095 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:01:38,096 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:01:38,096 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:01:38,097 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:01:38,097 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:01:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:01:38,122 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:01:39,033 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 09:01:39,033 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:01:39,033 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-01-31 09:01:39,034 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-31 09:01:39,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-31 09:01:39,034 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2018-01-31 09:01:39,034 INFO L87 Difference]: Start difference. First operand 154 states and 158 transitions. Second operand 23 states. [2018-01-31 09:01:39,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:01:39,608 INFO L93 Difference]: Finished difference Result 195 states and 205 transitions. [2018-01-31 09:01:39,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-31 09:01:39,608 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 93 [2018-01-31 09:01:39,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:01:39,609 INFO L225 Difference]: With dead ends: 195 [2018-01-31 09:01:39,609 INFO L226 Difference]: Without dead ends: 193 [2018-01-31 09:01:39,610 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=911, Unknown=0, NotChecked=0, Total=992 [2018-01-31 09:01:39,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-01-31 09:01:39,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 187. [2018-01-31 09:01:39,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-01-31 09:01:39,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 197 transitions. [2018-01-31 09:01:39,635 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 197 transitions. Word has length 93 [2018-01-31 09:01:39,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:01:39,635 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 197 transitions. [2018-01-31 09:01:39,635 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-31 09:01:39,636 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 197 transitions. [2018-01-31 09:01:39,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-01-31 09:01:39,638 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:01:39,638 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, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:01:39,638 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 09:01:39,638 INFO L82 PathProgramCache]: Analyzing trace with hash -101181526, now seen corresponding path program 1 times [2018-01-31 09:01:39,638 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:01:39,638 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:01:39,639 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:01:39,639 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:01:39,640 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:01:39,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:01:39,677 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:01:39,832 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 09:01:39,832 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:01:39,832 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 09:01:39,839 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:01:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:01:39,898 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:01:39,938 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 09:01:39,958 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:01:39,958 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-01-31 09:01:39,959 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-31 09:01:39,959 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-31 09:01:39,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-01-31 09:01:39,959 INFO L87 Difference]: Start difference. First operand 187 states and 197 transitions. Second operand 10 states. [2018-01-31 09:01:40,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:01:40,339 INFO L93 Difference]: Finished difference Result 334 states and 354 transitions. [2018-01-31 09:01:40,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 09:01:40,342 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2018-01-31 09:01:40,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:01:40,344 INFO L225 Difference]: With dead ends: 334 [2018-01-31 09:01:40,344 INFO L226 Difference]: Without dead ends: 194 [2018-01-31 09:01:40,344 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 93 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 09:01:40,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-01-31 09:01:40,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2018-01-31 09:01:40,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-01-31 09:01:40,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 201 transitions. [2018-01-31 09:01:40,372 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 201 transitions. Word has length 93 [2018-01-31 09:01:40,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:01:40,373 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 201 transitions. [2018-01-31 09:01:40,373 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-31 09:01:40,373 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 201 transitions. [2018-01-31 09:01:40,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-01-31 09:01:40,375 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:01:40,376 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, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:01:40,376 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 09:01:40,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1916830424, now seen corresponding path program 2 times [2018-01-31 09:01:40,376 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:01:40,376 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:01:40,377 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:01:40,377 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:01:40,377 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:01:40,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:01:40,403 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:01:40,619 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 09:01:40,619 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:01:40,638 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 09:01:40,643 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 09:01:40,678 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:01:40,681 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:01:40,686 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:01:40,696 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 09:01:40,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:01:40,710 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 09:01:40,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:01:40,722 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 09:01:40,723 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-31 09:01:42,157 WARN L143 SmtUtils]: Spent 104ms on a formula simplification that was a NOOP. DAG size: 17 [2018-01-31 09:01:43,121 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 09:01:43,142 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 09:01:43,142 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [10] total 31 [2018-01-31 09:01:43,142 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-31 09:01:43,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-31 09:01:43,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=815, Unknown=0, NotChecked=0, Total=930 [2018-01-31 09:01:43,143 INFO L87 Difference]: Start difference. First operand 191 states and 201 transitions. Second operand 31 states. [2018-01-31 09:01:44,782 WARN L143 SmtUtils]: Spent 163ms on a formula simplification that was a NOOP. DAG size: 25 [2018-01-31 09:01:45,816 WARN L143 SmtUtils]: Spent 177ms on a formula simplification that was a NOOP. DAG size: 25 [2018-01-31 09:01:46,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:01:46,768 INFO L93 Difference]: Finished difference Result 336 states and 358 transitions. [2018-01-31 09:01:46,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-31 09:01:46,769 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 97 [2018-01-31 09:01:46,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:01:46,771 INFO L225 Difference]: With dead ends: 336 [2018-01-31 09:01:46,771 INFO L226 Difference]: Without dead ends: 196 [2018-01-31 09:01:46,772 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=252, Invalid=2004, Unknown=0, NotChecked=0, Total=2256 [2018-01-31 09:01:46,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-01-31 09:01:46,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 193. [2018-01-31 09:01:46,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-01-31 09:01:46,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 201 transitions. [2018-01-31 09:01:46,798 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 201 transitions. Word has length 97 [2018-01-31 09:01:46,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:01:46,799 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 201 transitions. [2018-01-31 09:01:46,799 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-31 09:01:46,799 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 201 transitions. [2018-01-31 09:01:46,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-01-31 09:01:46,800 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:01:46,800 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] [2018-01-31 09:01:46,800 INFO L371 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 09:01:46,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1578756499, now seen corresponding path program 1 times [2018-01-31 09:01:46,800 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:01:46,800 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:01:46,801 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:01:46,801 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:01:46,802 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:01:46,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:01:46,820 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:01:47,031 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 09:01:47,031 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:01:47,031 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 09:01:47,037 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:01:47,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:01:47,076 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:01:47,240 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 09:01:47,260 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:01:47,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2018-01-31 09:01:47,261 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-31 09:01:47,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-31 09:01:47,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2018-01-31 09:01:47,262 INFO L87 Difference]: Start difference. First operand 193 states and 201 transitions. Second operand 22 states. [2018-01-31 09:01:47,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:01:47,803 INFO L93 Difference]: Finished difference Result 342 states and 358 transitions. [2018-01-31 09:01:47,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-31 09:01:47,803 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 101 [2018-01-31 09:01:47,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:01:47,804 INFO L225 Difference]: With dead ends: 342 [2018-01-31 09:01:47,804 INFO L226 Difference]: Without dead ends: 198 [2018-01-31 09:01:47,805 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=715, Unknown=0, NotChecked=0, Total=812 [2018-01-31 09:01:47,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-01-31 09:01:47,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 195. [2018-01-31 09:01:47,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-01-31 09:01:47,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 201 transitions. [2018-01-31 09:01:47,835 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 201 transitions. Word has length 101 [2018-01-31 09:01:47,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:01:47,835 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 201 transitions. [2018-01-31 09:01:47,835 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-31 09:01:47,835 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 201 transitions. [2018-01-31 09:01:47,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-01-31 09:01:47,836 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:01:47,836 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] [2018-01-31 09:01:47,836 INFO L371 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 09:01:47,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1204062251, now seen corresponding path program 1 times [2018-01-31 09:01:47,837 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:01:47,837 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:01:47,838 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:01:47,839 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:01:47,839 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:01:47,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:01:47,865 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:01:48,781 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-01-31 09:01:48,781 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:01:48,782 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2018-01-31 09:01:48,782 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-31 09:01:48,782 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-31 09:01:48,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=755, Unknown=0, NotChecked=0, Total=812 [2018-01-31 09:01:48,783 INFO L87 Difference]: Start difference. First operand 195 states and 201 transitions. Second operand 29 states. [2018-01-31 09:01:49,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:01:49,566 INFO L93 Difference]: Finished difference Result 211 states and 221 transitions. [2018-01-31 09:01:49,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-31 09:01:49,566 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 124 [2018-01-31 09:01:49,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:01:49,568 INFO L225 Difference]: With dead ends: 211 [2018-01-31 09:01:49,568 INFO L226 Difference]: Without dead ends: 209 [2018-01-31 09:01:49,569 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=115, Invalid=1607, Unknown=0, NotChecked=0, Total=1722 [2018-01-31 09:01:49,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-01-31 09:01:49,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 204. [2018-01-31 09:01:49,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-01-31 09:01:49,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 214 transitions. [2018-01-31 09:01:49,600 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 214 transitions. Word has length 124 [2018-01-31 09:01:49,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:01:49,600 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 214 transitions. [2018-01-31 09:01:49,600 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-31 09:01:49,600 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 214 transitions. [2018-01-31 09:01:49,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-01-31 09:01:49,601 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:01:49,601 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] [2018-01-31 09:01:49,601 INFO L371 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 09:01:49,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1204062252, now seen corresponding path program 1 times [2018-01-31 09:01:49,601 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:01:49,601 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:01:49,602 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:01:49,602 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:01:49,602 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:01:49,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:01:49,644 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:01:50,264 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 09:01:50,264 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:01:50,264 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 09:01:50,270 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:01:50,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:01:50,332 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:01:50,355 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 09:01:50,390 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:01:50,390 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-01-31 09:01:50,391 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-31 09:01:50,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-31 09:01:50,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-01-31 09:01:50,391 INFO L87 Difference]: Start difference. First operand 204 states and 214 transitions. Second operand 13 states. [2018-01-31 09:01:50,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:01:50,471 INFO L93 Difference]: Finished difference Result 356 states and 376 transitions. [2018-01-31 09:01:50,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-31 09:01:50,472 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 124 [2018-01-31 09:01:50,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:01:50,472 INFO L225 Difference]: With dead ends: 356 [2018-01-31 09:01:50,473 INFO L226 Difference]: Without dead ends: 211 [2018-01-31 09:01:50,473 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2018-01-31 09:01:50,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-01-31 09:01:50,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 208. [2018-01-31 09:01:50,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-01-31 09:01:50,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 218 transitions. [2018-01-31 09:01:50,502 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 218 transitions. Word has length 124 [2018-01-31 09:01:50,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:01:50,503 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 218 transitions. [2018-01-31 09:01:50,503 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-31 09:01:50,503 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 218 transitions. [2018-01-31 09:01:50,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-01-31 09:01:50,504 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:01:50,504 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] [2018-01-31 09:01:50,504 INFO L371 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 09:01:50,504 INFO L82 PathProgramCache]: Analyzing trace with hash 202371822, now seen corresponding path program 2 times [2018-01-31 09:01:50,504 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:01:50,505 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:01:50,505 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:01:50,506 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:01:50,506 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:01:50,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:01:50,535 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:01:50,702 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 09:01:50,703 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:01:50,703 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 09:01:50,708 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 09:01:50,759 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:01:50,771 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:01:50,781 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:01:50,801 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 09:01:50,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:01:50,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 20 treesize of output 19 [2018-01-31 09:01:50,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:01:50,936 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 09:01:50,936 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-31 09:01:52,612 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 09:01:52,632 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 09:01:52,632 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [13] total 40 [2018-01-31 09:01:52,632 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-31 09:01:52,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-31 09:01:52,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1391, Unknown=0, NotChecked=0, Total=1560 [2018-01-31 09:01:52,633 INFO L87 Difference]: Start difference. First operand 208 states and 218 transitions. Second operand 40 states. [2018-01-31 09:01:55,028 WARN L143 SmtUtils]: Spent 2025ms on a formula simplification that was a NOOP. DAG size: 35 [2018-01-31 09:01:57,152 WARN L143 SmtUtils]: Spent 2025ms on a formula simplification that was a NOOP. DAG size: 35 [2018-01-31 09:01:59,492 WARN L143 SmtUtils]: Spent 2062ms on a formula simplification that was a NOOP. DAG size: 36 [2018-01-31 09:02:01,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:02:01,360 INFO L93 Difference]: Finished difference Result 358 states and 380 transitions. [2018-01-31 09:02:01,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-01-31 09:02:01,362 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 128 [2018-01-31 09:02:01,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:02:01,363 INFO L225 Difference]: With dead ends: 358 [2018-01-31 09:02:01,363 INFO L226 Difference]: Without dead ends: 213 [2018-01-31 09:02:01,364 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 99 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=399, Invalid=3633, Unknown=0, NotChecked=0, Total=4032 [2018-01-31 09:02:01,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-01-31 09:02:01,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 210. [2018-01-31 09:02:01,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-01-31 09:02:01,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 219 transitions. [2018-01-31 09:02:01,385 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 219 transitions. Word has length 128 [2018-01-31 09:02:01,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:02:01,386 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 219 transitions. [2018-01-31 09:02:01,386 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-01-31 09:02:01,386 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 219 transitions. [2018-01-31 09:02:01,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-01-31 09:02:01,387 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:02:01,387 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] [2018-01-31 09:02:01,387 INFO L371 AbstractCegarLoop]: === Iteration 23 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 09:02:01,388 INFO L82 PathProgramCache]: Analyzing trace with hash 465695045, now seen corresponding path program 1 times [2018-01-31 09:02:01,388 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:02:01,388 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:02:01,389 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:01,389 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:02:01,389 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:02:01,421 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:02:01,624 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 09:02:01,624 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:02:01,624 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 09:02:01,631 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:02:01,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:02:01,688 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:02:01,726 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 09:02:01,746 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:02:01,746 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-01-31 09:02:01,747 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-31 09:02:01,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-31 09:02:01,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-01-31 09:02:01,747 INFO L87 Difference]: Start difference. First operand 210 states and 219 transitions. Second operand 15 states. [2018-01-31 09:02:01,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:02:01,835 INFO L93 Difference]: Finished difference Result 360 states and 378 transitions. [2018-01-31 09:02:01,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-31 09:02:01,836 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 137 [2018-01-31 09:02:01,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:02:01,837 INFO L225 Difference]: With dead ends: 360 [2018-01-31 09:02:01,837 INFO L226 Difference]: Without dead ends: 217 [2018-01-31 09:02:01,838 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=143, Unknown=0, NotChecked=0, Total=240 [2018-01-31 09:02:01,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-01-31 09:02:01,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 214. [2018-01-31 09:02:01,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-01-31 09:02:01,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 223 transitions. [2018-01-31 09:02:01,875 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 223 transitions. Word has length 137 [2018-01-31 09:02:01,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:02:01,876 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 223 transitions. [2018-01-31 09:02:01,876 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-31 09:02:01,876 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 223 transitions. [2018-01-31 09:02:01,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-01-31 09:02:01,877 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:02:01,878 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] [2018-01-31 09:02:01,878 INFO L371 AbstractCegarLoop]: === Iteration 24 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 09:02:01,878 INFO L82 PathProgramCache]: Analyzing trace with hash -387608125, now seen corresponding path program 2 times [2018-01-31 09:02:01,878 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:02:01,878 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:02:01,879 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:01,879 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:02:01,880 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:01,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:02:01,906 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:02:02,258 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 09:02:02,258 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:02:02,258 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 09:02:02,263 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 09:02:02,310 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:02:02,326 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:02:02,328 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:02:02,333 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:02:02,358 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 09:02:02,389 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:02:02,389 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-01-31 09:02:02,389 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-31 09:02:02,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-31 09:02:02,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2018-01-31 09:02:02,390 INFO L87 Difference]: Start difference. First operand 214 states and 223 transitions. Second operand 16 states. [2018-01-31 09:02:02,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:02:02,500 INFO L93 Difference]: Finished difference Result 364 states and 382 transitions. [2018-01-31 09:02:02,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-31 09:02:02,502 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 141 [2018-01-31 09:02:02,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:02:02,504 INFO L225 Difference]: With dead ends: 364 [2018-01-31 09:02:02,504 INFO L226 Difference]: Without dead ends: 221 [2018-01-31 09:02:02,505 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=161, Unknown=0, NotChecked=0, Total=272 [2018-01-31 09:02:02,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-01-31 09:02:02,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 218. [2018-01-31 09:02:02,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-01-31 09:02:02,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 227 transitions. [2018-01-31 09:02:02,541 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 227 transitions. Word has length 141 [2018-01-31 09:02:02,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:02:02,542 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 227 transitions. [2018-01-31 09:02:02,542 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-31 09:02:02,542 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 227 transitions. [2018-01-31 09:02:02,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-01-31 09:02:02,544 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:02:02,544 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] [2018-01-31 09:02:02,544 INFO L371 AbstractCegarLoop]: === Iteration 25 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 09:02:02,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1109967681, now seen corresponding path program 3 times [2018-01-31 09:02:02,544 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:02:02,545 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:02:02,548 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:02,548 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:02:02,548 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:02,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:02:02,578 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:02:03,432 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 09:02:03,432 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:02:03,432 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 09:02:03,439 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 09:02:03,484 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:02:03,495 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:02:03,515 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:02:03,570 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:02:03,782 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:02:03,799 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:02:03,863 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:02:03,934 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:02:04,042 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:02:04,531 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:02:04,723 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:02:04,870 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:02:05,546 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:02:05,548 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:02:05,555 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:02:05,794 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 09:02:05,815 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:02:05,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21] total 35 [2018-01-31 09:02:05,816 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-31 09:02:05,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-31 09:02:05,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=862, Unknown=0, NotChecked=0, Total=1190 [2018-01-31 09:02:05,817 INFO L87 Difference]: Start difference. First operand 218 states and 227 transitions. Second operand 35 states. [2018-01-31 09:02:05,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:02:05,989 INFO L93 Difference]: Finished difference Result 368 states and 386 transitions. [2018-01-31 09:02:05,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-31 09:02:05,994 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 145 [2018-01-31 09:02:05,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:02:05,996 INFO L225 Difference]: With dead ends: 368 [2018-01-31 09:02:05,996 INFO L226 Difference]: Without dead ends: 225 [2018-01-31 09:02:05,997 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=372, Invalid=1110, Unknown=0, NotChecked=0, Total=1482 [2018-01-31 09:02:05,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-01-31 09:02:06,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 222. [2018-01-31 09:02:06,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-01-31 09:02:06,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 231 transitions. [2018-01-31 09:02:06,036 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 231 transitions. Word has length 145 [2018-01-31 09:02:06,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:02:06,037 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 231 transitions. [2018-01-31 09:02:06,037 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-31 09:02:06,037 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 231 transitions. [2018-01-31 09:02:06,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-01-31 09:02:06,038 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:02:06,039 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] [2018-01-31 09:02:06,039 INFO L371 AbstractCegarLoop]: === Iteration 26 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 09:02:06,039 INFO L82 PathProgramCache]: Analyzing trace with hash -77920833, now seen corresponding path program 4 times [2018-01-31 09:02:06,039 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:02:06,039 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:02:06,040 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:06,040 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:02:06,040 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:06,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:02:06,068 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:02:06,348 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 09:02:06,348 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:02:06,348 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 09:02:06,353 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-31 09:02:06,568 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:02:06,573 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:02:06,591 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 09:02:06,611 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:02:06,611 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-01-31 09:02:06,612 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-31 09:02:06,612 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-31 09:02:06,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-01-31 09:02:06,612 INFO L87 Difference]: Start difference. First operand 222 states and 231 transitions. Second operand 18 states. [2018-01-31 09:02:06,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:02:06,703 INFO L93 Difference]: Finished difference Result 372 states and 390 transitions. [2018-01-31 09:02:06,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-31 09:02:06,708 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 149 [2018-01-31 09:02:06,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:02:06,710 INFO L225 Difference]: With dead ends: 372 [2018-01-31 09:02:06,710 INFO L226 Difference]: Without dead ends: 229 [2018-01-31 09:02:06,711 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=200, Unknown=0, NotChecked=0, Total=342 [2018-01-31 09:02:06,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-01-31 09:02:06,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2018-01-31 09:02:06,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-01-31 09:02:06,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 235 transitions. [2018-01-31 09:02:06,747 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 235 transitions. Word has length 149 [2018-01-31 09:02:06,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:02:06,748 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 235 transitions. [2018-01-31 09:02:06,748 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-31 09:02:06,748 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 235 transitions. [2018-01-31 09:02:06,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-01-31 09:02:06,749 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:02:06,749 INFO L351 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:02:06,749 INFO L371 AbstractCegarLoop]: === Iteration 27 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 09:02:06,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1955322173, now seen corresponding path program 5 times [2018-01-31 09:02:06,749 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:02:06,750 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:02:06,750 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:06,750 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:02:06,751 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:06,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:02:06,778 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:02:07,675 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:02:07,675 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:02:07,675 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 09:02:07,680 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-31 09:02:07,697 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:02:07,699 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:02:07,701 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:02:07,703 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:02:07,709 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:02:07,721 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:02:07,733 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:02:07,764 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:02:07,819 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:02:07,859 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:02:07,987 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:02:08,058 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:02:08,084 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:02:08,185 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:02:08,422 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:02:08,427 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:02:08,432 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:02:08,477 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:02:08,498 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:02:08,498 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-01-31 09:02:08,499 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-31 09:02:08,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-31 09:02:08,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-01-31 09:02:08,499 INFO L87 Difference]: Start difference. First operand 226 states and 235 transitions. Second operand 19 states. [2018-01-31 09:02:08,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:02:08,645 INFO L93 Difference]: Finished difference Result 376 states and 394 transitions. [2018-01-31 09:02:08,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-31 09:02:08,645 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 153 [2018-01-31 09:02:08,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:02:08,646 INFO L225 Difference]: With dead ends: 376 [2018-01-31 09:02:08,646 INFO L226 Difference]: Without dead ends: 233 [2018-01-31 09:02:08,647 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=159, Invalid=221, Unknown=0, NotChecked=0, Total=380 [2018-01-31 09:02:08,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-01-31 09:02:08,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 230. [2018-01-31 09:02:08,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-01-31 09:02:08,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 239 transitions. [2018-01-31 09:02:08,680 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 239 transitions. Word has length 153 [2018-01-31 09:02:08,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:02:08,681 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 239 transitions. [2018-01-31 09:02:08,681 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-31 09:02:08,682 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 239 transitions. [2018-01-31 09:02:08,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-01-31 09:02:08,683 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:02:08,683 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:02:08,683 INFO L371 AbstractCegarLoop]: === Iteration 28 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 09:02:08,684 INFO L82 PathProgramCache]: Analyzing trace with hash 2047524283, now seen corresponding path program 6 times [2018-01-31 09:02:08,684 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:02:08,684 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:02:08,685 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:08,685 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:02:08,685 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:08,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:02:08,715 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:02:09,154 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:02:09,155 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:02:09,184 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 09:02:09,190 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-31 09:02:09,233 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:02:09,248 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:02:09,258 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:02:09,359 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:02:09,490 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:02:09,626 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:02:09,840 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:02:10,676 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:02:11,058 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:02:11,237 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:02:13,120 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:02:15,627 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:02:16,039 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:02:18,808 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:02:23,086 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:02:25,879 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 09:02:25,882 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:02:25,895 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:02:26,414 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:02:26,452 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:02:26,453 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 24] total 41 [2018-01-31 09:02:26,453 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-31 09:02:26,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-31 09:02:26,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=1168, Unknown=0, NotChecked=0, Total=1640 [2018-01-31 09:02:26,454 INFO L87 Difference]: Start difference. First operand 230 states and 239 transitions. Second operand 41 states. [2018-01-31 09:02:26,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:02:26,887 INFO L93 Difference]: Finished difference Result 380 states and 398 transitions. [2018-01-31 09:02:26,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-31 09:02:26,890 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 157 [2018-01-31 09:02:26,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:02:26,891 INFO L225 Difference]: With dead ends: 380 [2018-01-31 09:02:26,891 INFO L226 Difference]: Without dead ends: 237 [2018-01-31 09:02:26,892 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=522, Invalid=1458, Unknown=0, NotChecked=0, Total=1980 [2018-01-31 09:02:26,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-01-31 09:02:26,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 234. [2018-01-31 09:02:26,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-01-31 09:02:26,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 243 transitions. [2018-01-31 09:02:26,917 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 243 transitions. Word has length 157 [2018-01-31 09:02:26,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:02:26,917 INFO L432 AbstractCegarLoop]: Abstraction has 234 states and 243 transitions. [2018-01-31 09:02:26,917 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-31 09:02:26,917 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 243 transitions. [2018-01-31 09:02:26,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-01-31 09:02:26,918 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:02:26,918 INFO L351 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:02:26,918 INFO L371 AbstractCegarLoop]: === Iteration 29 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 09:02:26,919 INFO L82 PathProgramCache]: Analyzing trace with hash 610743097, now seen corresponding path program 7 times [2018-01-31 09:02:26,919 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:02:26,919 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:02:26,920 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:26,920 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:02:26,920 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:02:27,063 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:02:30,111 WARN L146 SmtUtils]: Spent 178ms on a formula simplification. DAG size of input: 13 DAG size of output 7 [2018-01-31 09:02:33,311 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:02:33,312 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:02:33,312 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 09:02:33,317 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:02:33,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:02:33,396 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:02:34,566 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 09:02:34,568 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 09:02:34,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:02:34,570 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:02:34,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:02:34,575 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-01-31 09:02:34,717 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 09:02:34,719 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:34,724 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 09:02:34,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:02:34,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:02:34,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:02:34,739 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-01-31 09:02:34,903 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 09:02:34,905 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:34,906 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:34,907 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:34,908 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 09:02:34,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:02:34,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:02:34,956 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 09:02:34,956 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:43 [2018-01-31 09:02:35,143 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 09:02:35,149 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:35,150 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:35,151 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:35,153 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:35,154 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:35,155 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:35,155 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 09:02:35,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:02:35,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:02:35,263 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 09:02:35,263 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:59 [2018-01-31 09:02:35,480 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 09:02:35,527 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:35,552 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:35,557 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:35,558 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:35,559 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:35,560 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:35,561 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:35,562 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:35,588 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:35,598 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:35,599 INFO L303 Elim1Store]: Index analysis took 117 ms [2018-01-31 09:02:35,599 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 09:02:35,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:02:35,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:02:35,640 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 09:02:35,640 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:79, output treesize:75 [2018-01-31 09:02:35,899 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 09:02:35,905 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:35,906 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:35,907 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:35,908 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:35,909 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:35,910 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:35,911 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:35,912 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:35,913 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:35,914 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:35,914 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:35,915 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:35,916 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:35,917 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:35,918 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:35,919 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 09:02:35,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:02:35,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:02:35,974 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 09:02:35,974 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:95, output treesize:91 [2018-01-31 09:02:36,392 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 09:02:36,431 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:36,453 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:36,472 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:36,473 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:36,474 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:36,475 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:36,476 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:36,477 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:36,478 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:36,479 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:36,480 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:36,481 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:36,482 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:36,483 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:36,484 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:36,485 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:36,486 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:36,486 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:36,488 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:36,489 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:36,490 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:36,491 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 09:02:36,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:02:36,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:02:36,571 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 09:02:36,571 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:111, output treesize:107 [2018-01-31 09:02:37,386 WARN L143 SmtUtils]: Spent 601ms on a formula simplification that was a NOOP. DAG size: 50 [2018-01-31 09:02:38,705 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 09:02:38,709 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:38,710 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:38,711 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:38,712 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:38,713 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:38,714 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:38,715 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:38,716 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:38,717 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:38,718 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:38,719 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:38,720 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:38,721 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:38,722 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:38,723 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:38,724 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:38,725 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:38,726 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:38,728 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:38,729 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:38,730 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:38,731 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:38,732 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:38,733 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:38,734 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:38,735 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:38,736 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:38,737 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:38,738 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 09:02:38,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:02:38,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:02:38,840 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 09:02:38,840 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:127, output treesize:123 [2018-01-31 09:02:51,253 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 09:02:51,258 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:51,259 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:51,260 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:51,261 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:51,262 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:51,263 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:51,264 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:51,265 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:51,267 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:51,268 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:51,269 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:51,270 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:51,271 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:51,272 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:51,273 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:51,275 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:51,276 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:51,277 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:51,278 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:51,279 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:51,280 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:51,282 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:51,284 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:51,285 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:51,286 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:51,287 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:51,288 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:51,289 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:51,290 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:51,291 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:51,292 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:51,293 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:51,294 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:51,295 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:51,297 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:51,298 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:02:51,299 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 09:02:51,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:02:51,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:02:51,464 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 09:02:51,464 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:143, output treesize:139 [2018-01-31 09:03:02,408 WARN L143 SmtUtils]: Spent 106ms on a formula simplification that was a NOOP. DAG size: 62 [2018-01-31 09:03:26,938 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 09:03:26,943 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:03:26,945 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:03:26,946 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:03:26,947 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:03:26,948 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:03:26,949 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:03:26,950 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:03:26,951 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:03:26,952 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:03:26,953 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:03:26,954 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:03:26,956 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:03:26,957 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:03:26,958 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:03:26,959 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:03:26,960 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:03:26,961 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:03:26,963 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:03:26,964 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:03:26,965 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:03:26,966 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:03:26,967 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:03:26,968 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:03:26,970 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:03:26,971 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:03:26,972 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:03:26,973 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:03:26,974 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:03:26,975 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:03:26,977 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:03:26,978 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:03:26,979 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:03:26,980 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:03:26,982 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:03:26,983 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:03:26,984 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:03:26,985 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:03:26,986 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:03:26,987 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:03:26,988 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:03:26,990 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:03:26,991 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:03:26,992 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:03:26,993 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:03:26,994 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:03:26,996 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 09:03:26,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:03:27,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:03:27,165 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 09:03:27,165 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:159, output treesize:155 Received shutdown request... [2018-01-31 09:03:41,486 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-31 09:03:41,487 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-31 09:03:41,492 WARN L185 ceAbstractionStarter]: Timeout [2018-01-31 09:03:41,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 09:03:41 BoogieIcfgContainer [2018-01-31 09:03:41,492 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 09:03:41,493 INFO L168 Benchmark]: Toolchain (without parser) took 149041.56 ms. Allocated memory was 309.9 MB in the beginning and 917.5 MB in the end (delta: 607.6 MB). Free memory was 268.7 MB in the beginning and 731.4 MB in the end (delta: -462.6 MB). Peak memory consumption was 145.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:03:41,494 INFO L168 Benchmark]: CDTParser took 2.67 ms. Allocated memory is still 309.9 MB. Free memory is still 275.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 09:03:41,494 INFO L168 Benchmark]: CACSL2BoogieTranslator took 364.19 ms. Allocated memory is still 309.9 MB. Free memory was 268.7 MB in the beginning and 254.7 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:03:41,494 INFO L168 Benchmark]: Boogie Preprocessor took 60.54 ms. Allocated memory is still 309.9 MB. Free memory was 254.7 MB in the beginning and 252.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. [2018-01-31 09:03:41,494 INFO L168 Benchmark]: RCFGBuilder took 918.07 ms. Allocated memory is still 309.9 MB. Free memory was 252.6 MB in the beginning and 217.5 MB in the end (delta: 35.1 MB). Peak memory consumption was 35.1 MB. Max. memory is 5.3 GB. [2018-01-31 09:03:41,495 INFO L168 Benchmark]: TraceAbstraction took 147686.13 ms. Allocated memory was 309.9 MB in the beginning and 917.5 MB in the end (delta: 607.6 MB). Free memory was 217.5 MB in the beginning and 731.4 MB in the end (delta: -513.9 MB). Peak memory consumption was 93.8 MB. Max. memory is 5.3 GB. [2018-01-31 09:03:41,496 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.67 ms. Allocated memory is still 309.9 MB. Free memory is still 275.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 364.19 ms. Allocated memory is still 309.9 MB. Free memory was 268.7 MB in the beginning and 254.7 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 60.54 ms. Allocated memory is still 309.9 MB. Free memory was 254.7 MB in the beginning and 252.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. * RCFGBuilder took 918.07 ms. Allocated memory is still 309.9 MB. Free memory was 252.6 MB in the beginning and 217.5 MB in the end (delta: 35.1 MB). Peak memory consumption was 35.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 147686.13 ms. Allocated memory was 309.9 MB in the beginning and 917.5 MB in the end (delta: 607.6 MB). Free memory was 217.5 MB in the beginning and 731.4 MB in the end (delta: -513.9 MB). Peak memory consumption was 93.8 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 162 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 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 162 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 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 162 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 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 162 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 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 162 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 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 162 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 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 162 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 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 162 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was analyzing trace of length 162 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was analyzing trace of length 162 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was analyzing trace of length 162 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was analyzing trace of length 162 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 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 162 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 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 162 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 known predicates. - TimeoutResultAtElement [Line: 1452]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1452). Cancelled while BasicCegarLoop was analyzing trace of length 162 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 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 162 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 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 162 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 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 162 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 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 162 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 19 procedures, 151 locations, 19 error locations. TIMEOUT Result, 147.6s OverallTime, 29 OverallIterations, 16 TraceHistogramMax, 32.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3667 SDtfs, 1671 SDslu, 35027 SDs, 0 SdLazy, 9253 SolverSat, 267 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2069 GetRequests, 1540 SyntacticMatches, 5 SemanticMatches, 524 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3209 ImplicationChecksByTransitivity, 35.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=234occurred in iteration=28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 28 MinimizatonAttempts, 86 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 20.6s SatisfiabilityAnalysisTime, 18.4s InterpolantComputationTime, 3970 NumberOfCodeBlocks, 3886 NumberOfCodeBlocksAsserted, 86 NumberOfCheckSat, 3927 ConstructedInterpolants, 268 QuantifiedInterpolants, 1651724 SizeOfPredicates, 86 NumberOfNonLiveVariables, 5505 ConjunctsInSsa, 427 ConjunctsInUnsatCore, 43 InterpolantComputations, 17 PerfectInterpolantSequences, 627/5006 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_5_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_09-03-41-505.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_5_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_09-03-41-505.csv Completed graceful shutdown