java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_3_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 08:58:53,096 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 08:58:53,098 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 08:58:53,115 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 08:58:53,116 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 08:58:53,117 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 08:58:53,118 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 08:58:53,120 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 08:58:53,122 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 08:58:53,123 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 08:58:53,124 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 08:58:53,124 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 08:58:53,125 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 08:58:53,126 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 08:58:53,127 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 08:58:53,130 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 08:58:53,132 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 08:58:53,134 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 08:58:53,136 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 08:58:53,137 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 08:58:53,139 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 08:58:53,140 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 08:58:53,140 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 08:58:53,141 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 08:58:53,142 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 08:58:53,144 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 08:58:53,144 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 08:58:53,144 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 08:58:53,145 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 08:58:53,145 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 08:58:53,146 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 08:58:53,146 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-31 08:58:53,157 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 08:58:53,157 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 08:58:53,158 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 08:58:53,158 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 08:58:53,159 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 08:58:53,159 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 08:58:53,159 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 08:58:53,160 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 08:58:53,160 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 08:58:53,160 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 08:58:53,160 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 08:58:53,161 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 08:58:53,161 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 08:58:53,161 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 08:58:53,161 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 08:58:53,161 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 08:58:53,162 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 08:58:53,162 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 08:58:53,162 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 08:58:53,162 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 08:58:53,163 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 08:58:53,163 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 08:58:53,163 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 08:58:53,163 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:58:53,163 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 08:58:53,164 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 08:58:53,164 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 08:58:53,164 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 08:58:53,164 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 08:58:53,164 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 08:58:53,164 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 08:58:53,165 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 08:58:53,165 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 08:58:53,166 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 08:58:53,213 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 08:58:53,223 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 08:58:53,226 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 08:58:53,227 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 08:58:53,227 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 08:58:53,228 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_3_true-valid-memsafety_true-termination.i [2018-01-31 08:58:53,435 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 08:58:53,447 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 08:58:53,449 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 08:58:53,449 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 08:58:53,459 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 08:58:53,460 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:58:53" (1/1) ... [2018-01-31 08:58:53,466 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ad862a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:53, skipping insertion in model container [2018-01-31 08:58:53,467 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:58:53" (1/1) ... [2018-01-31 08:58:53,486 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:58:53,566 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:58:53,768 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:58:53,794 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:58:53,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:53 WrapperNode [2018-01-31 08:58:53,808 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 08:58:53,809 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 08:58:53,809 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 08:58:53,809 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 08:58:53,825 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:53" (1/1) ... [2018-01-31 08:58:53,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:53" (1/1) ... [2018-01-31 08:58:53,845 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:53" (1/1) ... [2018-01-31 08:58:53,845 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:53" (1/1) ... [2018-01-31 08:58:53,870 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:53" (1/1) ... [2018-01-31 08:58:53,874 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:53" (1/1) ... [2018-01-31 08:58:53,876 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:53" (1/1) ... [2018-01-31 08:58:53,886 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 08:58:53,887 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 08:58:53,887 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 08:58:53,887 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 08:58:53,888 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:53" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:58:53,969 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 08:58:53,969 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 08:58:53,970 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-01-31 08:58:53,970 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-31 08:58:53,970 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-01-31 08:58:53,970 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2018-01-31 08:58:53,970 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-01-31 08:58:53,970 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-01-31 08:58:53,971 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-01-31 08:58:53,971 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2018-01-31 08:58:53,971 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-01-31 08:58:53,971 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-01-31 08:58:53,971 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-01-31 08:58:53,971 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-01-31 08:58:53,972 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2018-01-31 08:58:53,972 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-01-31 08:58:53,972 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-01-31 08:58:53,972 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-01-31 08:58:53,972 INFO L136 BoogieDeclarations]: Found implementation of procedure f_22_get [2018-01-31 08:58:53,972 INFO L136 BoogieDeclarations]: Found implementation of procedure f_22_put [2018-01-31 08:58:53,973 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-31 08:58:53,973 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 08:58:53,973 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-31 08:58:53,973 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-31 08:58:53,973 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 08:58:53,973 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 08:58:53,974 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 08:58:53,974 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 08:58:53,974 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 08:58:53,974 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-31 08:58:53,974 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-31 08:58:53,974 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-31 08:58:53,974 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-31 08:58:53,975 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 08:58:53,975 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-31 08:58:53,975 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-31 08:58:53,975 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-01-31 08:58:53,975 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2018-01-31 08:58:53,975 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-01-31 08:58:53,976 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-01-31 08:58:53,976 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-01-31 08:58:53,976 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-01-31 08:58:53,978 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2018-01-31 08:58:53,978 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-01-31 08:58:53,978 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-01-31 08:58:53,978 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-01-31 08:58:53,979 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-01-31 08:58:53,979 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2018-01-31 08:58:53,979 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-01-31 08:58:53,979 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-01-31 08:58:53,979 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-01-31 08:58:53,979 INFO L128 BoogieDeclarations]: Found specification of procedure f_22_get [2018-01-31 08:58:53,979 INFO L128 BoogieDeclarations]: Found specification of procedure f_22_put [2018-01-31 08:58:53,980 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-31 08:58:53,980 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 08:58:53,980 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 08:58:53,980 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 08:58:54,506 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-31 08:58:54,857 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 08:58:54,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:58:54 BoogieIcfgContainer [2018-01-31 08:58:54,858 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 08:58:54,859 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 08:58:54,860 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 08:58:54,865 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 08:58:54,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:58:53" (1/3) ... [2018-01-31 08:58:54,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eca7fd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:58:54, skipping insertion in model container [2018-01-31 08:58:54,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:53" (2/3) ... [2018-01-31 08:58:54,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eca7fd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:58:54, skipping insertion in model container [2018-01-31 08:58:54,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:58:54" (3/3) ... [2018-01-31 08:58:54,869 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test22_3_true-valid-memsafety_true-termination.i [2018-01-31 08:58:54,878 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 08:58:54,884 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-01-31 08:58:54,944 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 08:58:54,944 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 08:58:54,944 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 08:58:54,944 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 08:58:54,944 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 08:58:54,944 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 08:58:54,945 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 08:58:54,945 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 08:58:54,946 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 08:58:54,979 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states. [2018-01-31 08:58:54,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-31 08:58:54,987 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:58:54,988 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:58:54,988 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:58:54,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1885508389, now seen corresponding path program 1 times [2018-01-31 08:58:54,996 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:58:54,997 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:58:55,065 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:55,065 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:58:55,065 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:58:55,155 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:58:55,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:58:55,550 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:58:55,550 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:58:55,552 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:58:55,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:58:55,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:58:55,571 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 5 states. [2018-01-31 08:58:55,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:58:55,700 INFO L93 Difference]: Finished difference Result 350 states and 367 transitions. [2018-01-31 08:58:55,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:58:55,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-31 08:58:55,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:58:55,715 INFO L225 Difference]: With dead ends: 350 [2018-01-31 08:58:55,715 INFO L226 Difference]: Without dead ends: 188 [2018-01-31 08:58:55,719 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:58:55,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-01-31 08:58:55,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2018-01-31 08:58:55,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-01-31 08:58:55,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 195 transitions. [2018-01-31 08:58:55,771 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 195 transitions. Word has length 22 [2018-01-31 08:58:55,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:58:55,772 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 195 transitions. [2018-01-31 08:58:55,772 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:58:55,772 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 195 transitions. [2018-01-31 08:58:55,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-31 08:58:55,773 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:58:55,773 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:58:55,773 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:58:55,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1475872018, now seen corresponding path program 1 times [2018-01-31 08:58:55,774 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:58:55,774 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:58:55,776 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:55,776 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:58:55,776 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:55,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:58:55,811 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:58:56,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:58:56,045 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:58:56,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:58:56,047 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:58:56,050 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:58:56,050 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:58:56,051 INFO L87 Difference]: Start difference. First operand 186 states and 195 transitions. Second operand 6 states. [2018-01-31 08:58:56,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:58:56,680 INFO L93 Difference]: Finished difference Result 189 states and 198 transitions. [2018-01-31 08:58:56,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:58:56,680 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-31 08:58:56,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:58:56,683 INFO L225 Difference]: With dead ends: 189 [2018-01-31 08:58:56,683 INFO L226 Difference]: Without dead ends: 188 [2018-01-31 08:58:56,684 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:58:56,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-01-31 08:58:56,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 185. [2018-01-31 08:58:56,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-31 08:58:56,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 194 transitions. [2018-01-31 08:58:56,702 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 194 transitions. Word has length 23 [2018-01-31 08:58:56,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:58:56,703 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 194 transitions. [2018-01-31 08:58:56,703 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:58:56,703 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 194 transitions. [2018-01-31 08:58:56,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-31 08:58:56,703 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:58:56,704 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:58:56,704 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:58:56,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1475872017, now seen corresponding path program 1 times [2018-01-31 08:58:56,704 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:58:56,704 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:58:56,706 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:56,706 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:58:56,706 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:56,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:58:56,731 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:58:57,113 WARN L146 SmtUtils]: Spent 219ms on a formula simplification. DAG size of input: 19 DAG size of output 17 [2018-01-31 08:58:57,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:58:57,219 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:58:57,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:58:57,220 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 08:58:57,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 08:58:57,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:58:57,220 INFO L87 Difference]: Start difference. First operand 185 states and 194 transitions. Second operand 7 states. [2018-01-31 08:58:57,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:58:57,787 INFO L93 Difference]: Finished difference Result 188 states and 197 transitions. [2018-01-31 08:58:57,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:58:57,789 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-01-31 08:58:57,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:58:57,791 INFO L225 Difference]: With dead ends: 188 [2018-01-31 08:58:57,792 INFO L226 Difference]: Without dead ends: 187 [2018-01-31 08:58:57,792 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:58:57,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-01-31 08:58:57,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 184. [2018-01-31 08:58:57,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-01-31 08:58:57,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 193 transitions. [2018-01-31 08:58:57,810 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 193 transitions. Word has length 23 [2018-01-31 08:58:57,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:58:57,811 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 193 transitions. [2018-01-31 08:58:57,811 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 08:58:57,811 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 193 transitions. [2018-01-31 08:58:57,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-31 08:58:57,816 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:58:57,816 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] [2018-01-31 08:58:57,817 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:58:57,817 INFO L82 PathProgramCache]: Analyzing trace with hash -39640287, now seen corresponding path program 1 times [2018-01-31 08:58:57,817 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:58:57,817 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:58:57,819 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:57,819 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:58:57,820 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:58:57,851 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:58:58,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:58:58,178 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:58:58,178 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-31 08:58:58,179 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 08:58:58,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 08:58:58,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:58:58,179 INFO L87 Difference]: Start difference. First operand 184 states and 193 transitions. Second operand 9 states. [2018-01-31 08:58:58,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:58:58,480 INFO L93 Difference]: Finished difference Result 312 states and 327 transitions. [2018-01-31 08:58:58,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-31 08:58:58,480 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-01-31 08:58:58,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:58:58,483 INFO L225 Difference]: With dead ends: 312 [2018-01-31 08:58:58,483 INFO L226 Difference]: Without dead ends: 206 [2018-01-31 08:58:58,484 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-01-31 08:58:58,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-01-31 08:58:58,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 199. [2018-01-31 08:58:58,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-01-31 08:58:58,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 208 transitions. [2018-01-31 08:58:58,509 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 208 transitions. Word has length 38 [2018-01-31 08:58:58,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:58:58,509 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 208 transitions. [2018-01-31 08:58:58,509 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 08:58:58,509 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 208 transitions. [2018-01-31 08:58:58,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-31 08:58:58,511 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:58:58,511 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:58:58,511 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:58:58,511 INFO L82 PathProgramCache]: Analyzing trace with hash 490857740, now seen corresponding path program 1 times [2018-01-31 08:58:58,512 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:58:58,512 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:58:58,513 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:58,513 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:58:58,514 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:58,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:58:58,536 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:58:58,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:58:58,650 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:58:58,650 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-31 08:58:58,650 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-31 08:58:58,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-31 08:58:58,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:58:58,651 INFO L87 Difference]: Start difference. First operand 199 states and 208 transitions. Second operand 10 states. [2018-01-31 08:58:59,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:58:59,363 INFO L93 Difference]: Finished difference Result 199 states and 208 transitions. [2018-01-31 08:58:59,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 08:58:59,364 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-01-31 08:58:59,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:58:59,366 INFO L225 Difference]: With dead ends: 199 [2018-01-31 08:58:59,366 INFO L226 Difference]: Without dead ends: 198 [2018-01-31 08:58:59,366 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 08:58:59,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-01-31 08:58:59,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-01-31 08:58:59,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-01-31 08:58:59,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 207 transitions. [2018-01-31 08:58:59,379 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 207 transitions. Word has length 39 [2018-01-31 08:58:59,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:58:59,380 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 207 transitions. [2018-01-31 08:58:59,380 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-31 08:58:59,380 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 207 transitions. [2018-01-31 08:58:59,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-31 08:58:59,381 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:58:59,381 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:58:59,382 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:58:59,382 INFO L82 PathProgramCache]: Analyzing trace with hash 490857741, now seen corresponding path program 1 times [2018-01-31 08:58:59,382 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:58:59,382 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:58:59,383 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:59,383 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:58:59,384 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:58:59,403 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:58:59,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:58:59,470 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:58:59,470 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:58:59,470 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:58:59,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:58:59,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:58:59,471 INFO L87 Difference]: Start difference. First operand 198 states and 207 transitions. Second operand 4 states. [2018-01-31 08:58:59,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:58:59,527 INFO L93 Difference]: Finished difference Result 347 states and 363 transitions. [2018-01-31 08:58:59,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 08:58:59,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-01-31 08:58:59,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:58:59,529 INFO L225 Difference]: With dead ends: 347 [2018-01-31 08:58:59,529 INFO L226 Difference]: Without dead ends: 202 [2018-01-31 08:58:59,530 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:58:59,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-01-31 08:58:59,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 199. [2018-01-31 08:58:59,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-01-31 08:58:59,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 208 transitions. [2018-01-31 08:58:59,548 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 208 transitions. Word has length 39 [2018-01-31 08:58:59,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:58:59,548 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 208 transitions. [2018-01-31 08:58:59,548 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:58:59,548 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 208 transitions. [2018-01-31 08:58:59,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-31 08:58:59,549 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:58:59,549 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:58:59,549 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:58:59,550 INFO L82 PathProgramCache]: Analyzing trace with hash -748848629, now seen corresponding path program 1 times [2018-01-31 08:58:59,550 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:58:59,550 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:58:59,551 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:59,551 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:58:59,551 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:59,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:58:59,571 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:58:59,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:58:59,642 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:58:59,643 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:58:59,650 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:58:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:58:59,711 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:58:59,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:58:59,774 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:58:59,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-01-31 08:58:59,775 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:58:59,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:58:59,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:58:59,776 INFO L87 Difference]: Start difference. First operand 199 states and 208 transitions. Second operand 6 states. [2018-01-31 08:58:59,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:58:59,839 INFO L93 Difference]: Finished difference Result 351 states and 367 transitions. [2018-01-31 08:58:59,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 08:58:59,842 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2018-01-31 08:58:59,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:58:59,844 INFO L225 Difference]: With dead ends: 351 [2018-01-31 08:58:59,844 INFO L226 Difference]: Without dead ends: 206 [2018-01-31 08:58:59,845 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:58:59,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-01-31 08:58:59,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 203. [2018-01-31 08:58:59,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-01-31 08:58:59,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 212 transitions. [2018-01-31 08:58:59,872 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 212 transitions. Word has length 43 [2018-01-31 08:58:59,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:58:59,873 INFO L432 AbstractCegarLoop]: Abstraction has 203 states and 212 transitions. [2018-01-31 08:58:59,873 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:58:59,873 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 212 transitions. [2018-01-31 08:58:59,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-31 08:58:59,875 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:58:59,875 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:58:59,875 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:58:59,882 INFO L82 PathProgramCache]: Analyzing trace with hash 931815433, now seen corresponding path program 2 times [2018-01-31 08:58:59,882 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:58:59,883 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:58:59,884 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:59,884 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:58:59,884 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:58:59,921 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:59:00,047 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:59:00,048 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:59:00,048 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:59:00,065 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:59:00,096 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:59:00,109 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:59:00,114 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:59:00,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-31 08:59:00,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:59:00,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 17 treesize of output 16 [2018-01-31 08:59:00,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:59:00,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-31 08:59:00,410 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-31 08:59:01,239 WARN L146 SmtUtils]: Spent 269ms on a formula simplification. DAG size of input: 45 DAG size of output 17 [2018-01-31 08:59:01,899 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-31 08:59:01,922 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:59:01,922 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 19 [2018-01-31 08:59:01,923 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-31 08:59:01,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-31 08:59:01,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-01-31 08:59:01,924 INFO L87 Difference]: Start difference. First operand 203 states and 212 transitions. Second operand 19 states. [2018-01-31 08:59:04,615 WARN L143 SmtUtils]: Spent 2038ms on a formula simplification that was a NOOP. DAG size: 32 [2018-01-31 08:59:07,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:59:07,794 INFO L93 Difference]: Finished difference Result 445 states and 466 transitions. [2018-01-31 08:59:07,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-31 08:59:07,796 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2018-01-31 08:59:07,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:59:07,798 INFO L225 Difference]: With dead ends: 445 [2018-01-31 08:59:07,798 INFO L226 Difference]: Without dead ends: 300 [2018-01-31 08:59:07,800 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2018-01-31 08:59:07,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-01-31 08:59:07,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 206. [2018-01-31 08:59:07,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-01-31 08:59:07,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 215 transitions. [2018-01-31 08:59:07,821 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 215 transitions. Word has length 47 [2018-01-31 08:59:07,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:59:07,822 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 215 transitions. [2018-01-31 08:59:07,822 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-31 08:59:07,822 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 215 transitions. [2018-01-31 08:59:07,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-31 08:59:07,824 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:59:07,825 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:59:07,825 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:59:07,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1281962573, now seen corresponding path program 1 times [2018-01-31 08:59:07,825 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:59:07,825 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:59:07,832 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:59:07,832 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:59:07,833 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:59:07,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:59:07,856 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:59:08,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:59:08,098 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:59:08,098 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-31 08:59:08,099 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 08:59:08,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 08:59:08,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:59:08,099 INFO L87 Difference]: Start difference. First operand 206 states and 215 transitions. Second operand 9 states. [2018-01-31 08:59:08,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:59:08,388 INFO L93 Difference]: Finished difference Result 295 states and 311 transitions. [2018-01-31 08:59:08,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-31 08:59:08,389 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-01-31 08:59:08,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:59:08,392 INFO L225 Difference]: With dead ends: 295 [2018-01-31 08:59:08,392 INFO L226 Difference]: Without dead ends: 220 [2018-01-31 08:59:08,393 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-01-31 08:59:08,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-01-31 08:59:08,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 216. [2018-01-31 08:59:08,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-01-31 08:59:08,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 226 transitions. [2018-01-31 08:59:08,410 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 226 transitions. Word has length 54 [2018-01-31 08:59:08,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:59:08,411 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 226 transitions. [2018-01-31 08:59:08,411 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 08:59:08,411 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 226 transitions. [2018-01-31 08:59:08,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-31 08:59:08,412 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:59:08,413 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:59:08,413 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:59:08,413 INFO L82 PathProgramCache]: Analyzing trace with hash 647693160, now seen corresponding path program 1 times [2018-01-31 08:59:08,413 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:59:08,413 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:59:08,414 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:59:08,414 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:59:08,415 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:59:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:59:08,427 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:59:08,527 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-31 08:59:08,528 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:59:08,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 08:59:08,528 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 08:59:08,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 08:59:08,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:59:08,529 INFO L87 Difference]: Start difference. First operand 216 states and 226 transitions. Second operand 3 states. [2018-01-31 08:59:08,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:59:08,998 INFO L93 Difference]: Finished difference Result 241 states and 254 transitions. [2018-01-31 08:59:08,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 08:59:08,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-01-31 08:59:08,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:59:09,001 INFO L225 Difference]: With dead ends: 241 [2018-01-31 08:59:09,001 INFO L226 Difference]: Without dead ends: 222 [2018-01-31 08:59:09,001 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 08:59:09,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-01-31 08:59:09,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 209. [2018-01-31 08:59:09,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-01-31 08:59:09,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 218 transitions. [2018-01-31 08:59:09,022 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 218 transitions. Word has length 54 [2018-01-31 08:59:09,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:59:09,022 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 218 transitions. [2018-01-31 08:59:09,022 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 08:59:09,022 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 218 transitions. [2018-01-31 08:59:09,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-31 08:59:09,023 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:59:09,023 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:59:09,023 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:59:09,024 INFO L82 PathProgramCache]: Analyzing trace with hash 407930235, now seen corresponding path program 1 times [2018-01-31 08:59:09,024 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:59:09,024 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:59:09,025 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:59:09,025 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:59:09,025 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:59:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:59:09,036 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:59:09,284 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-31 08:59:09,284 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:59:09,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:59:09,285 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:59:09,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:59:09,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:59:09,285 INFO L87 Difference]: Start difference. First operand 209 states and 218 transitions. Second operand 6 states. [2018-01-31 08:59:09,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:59:09,343 INFO L93 Difference]: Finished difference Result 213 states and 221 transitions. [2018-01-31 08:59:09,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:59:09,343 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-01-31 08:59:09,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:59:09,345 INFO L225 Difference]: With dead ends: 213 [2018-01-31 08:59:09,345 INFO L226 Difference]: Without dead ends: 183 [2018-01-31 08:59:09,345 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:59:09,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-01-31 08:59:09,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-01-31 08:59:09,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-01-31 08:59:09,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 190 transitions. [2018-01-31 08:59:09,361 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 190 transitions. Word has length 55 [2018-01-31 08:59:09,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:59:09,361 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 190 transitions. [2018-01-31 08:59:09,361 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:59:09,361 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 190 transitions. [2018-01-31 08:59:09,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-31 08:59:09,362 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:59:09,362 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:59:09,362 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:59:09,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1897274958, now seen corresponding path program 1 times [2018-01-31 08:59:09,363 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:59:09,363 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:59:09,364 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:59:09,364 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:59:09,364 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:59:09,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:59:09,388 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:59:09,678 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-31 08:59:09,678 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:59:09,712 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-31 08:59:09,712 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-31 08:59:09,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-31 08:59:09,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-01-31 08:59:09,712 INFO L87 Difference]: Start difference. First operand 183 states and 190 transitions. Second operand 12 states. [2018-01-31 08:59:10,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:59:10,756 INFO L93 Difference]: Finished difference Result 183 states and 190 transitions. [2018-01-31 08:59:10,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-31 08:59:10,756 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-01-31 08:59:10,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:59:10,757 INFO L225 Difference]: With dead ends: 183 [2018-01-31 08:59:10,757 INFO L226 Difference]: Without dead ends: 181 [2018-01-31 08:59:10,758 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-01-31 08:59:10,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-01-31 08:59:10,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-01-31 08:59:10,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-01-31 08:59:10,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 188 transitions. [2018-01-31 08:59:10,776 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 188 transitions. Word has length 56 [2018-01-31 08:59:10,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:59:10,776 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 188 transitions. [2018-01-31 08:59:10,776 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-31 08:59:10,777 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 188 transitions. [2018-01-31 08:59:10,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-31 08:59:10,777 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:59:10,777 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:59:10,778 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:59:10,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1897274959, now seen corresponding path program 1 times [2018-01-31 08:59:10,778 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:59:10,778 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:59:10,780 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:59:10,781 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:59:10,781 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:59:10,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:59:10,805 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:59:10,902 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:59:10,902 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:59:10,902 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:59:10,908 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:59:10,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:59:10,939 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:59:11,063 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:59:11,107 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:59:11,107 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-01-31 08:59:11,108 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:59:11,108 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:59:11,108 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:59:11,108 INFO L87 Difference]: Start difference. First operand 181 states and 188 transitions. Second operand 8 states. [2018-01-31 08:59:11,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:59:11,456 INFO L93 Difference]: Finished difference Result 330 states and 344 transitions. [2018-01-31 08:59:11,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:59:11,459 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2018-01-31 08:59:11,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:59:11,461 INFO L225 Difference]: With dead ends: 330 [2018-01-31 08:59:11,461 INFO L226 Difference]: Without dead ends: 188 [2018-01-31 08:59:11,461 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:59:11,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-01-31 08:59:11,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 185. [2018-01-31 08:59:11,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-31 08:59:11,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 192 transitions. [2018-01-31 08:59:11,478 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 192 transitions. Word has length 56 [2018-01-31 08:59:11,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:59:11,478 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 192 transitions. [2018-01-31 08:59:11,478 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:59:11,478 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 192 transitions. [2018-01-31 08:59:11,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-31 08:59:11,479 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:59:11,479 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:59:11,479 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:59:11,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1277991663, now seen corresponding path program 2 times [2018-01-31 08:59:11,479 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:59:11,479 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:59:11,480 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:59:11,480 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:59:11,480 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:59:11,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:59:11,499 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:59:11,775 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:59:11,776 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:59:11,776 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:59:11,783 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:59:11,817 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:59:11,829 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:59:11,835 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:59:11,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-31 08:59:11,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:59:11,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-31 08:59:11,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:59:11,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-31 08:59:11,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-31 08:59:12,822 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-01-31 08:59:12,841 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:59:12,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 22 [2018-01-31 08:59:12,842 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-31 08:59:12,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-31 08:59:12,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2018-01-31 08:59:12,842 INFO L87 Difference]: Start difference. First operand 185 states and 192 transitions. Second operand 22 states. [2018-01-31 08:59:15,354 WARN L143 SmtUtils]: Spent 2018ms on a formula simplification that was a NOOP. DAG size: 31 [2018-01-31 08:59:16,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:59:16,561 INFO L93 Difference]: Finished difference Result 332 states and 348 transitions. [2018-01-31 08:59:16,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-31 08:59:16,562 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 60 [2018-01-31 08:59:16,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:59:16,563 INFO L225 Difference]: With dead ends: 332 [2018-01-31 08:59:16,563 INFO L226 Difference]: Without dead ends: 190 [2018-01-31 08:59:16,564 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=152, Invalid=904, Unknown=0, NotChecked=0, Total=1056 [2018-01-31 08:59:16,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-01-31 08:59:16,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2018-01-31 08:59:16,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-01-31 08:59:16,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 194 transitions. [2018-01-31 08:59:16,583 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 194 transitions. Word has length 60 [2018-01-31 08:59:16,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:59:16,584 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 194 transitions. [2018-01-31 08:59:16,585 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-31 08:59:16,586 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 194 transitions. [2018-01-31 08:59:16,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-01-31 08:59:16,586 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:59:16,586 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] [2018-01-31 08:59:16,587 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:59:16,587 INFO L82 PathProgramCache]: Analyzing trace with hash 31187167, now seen corresponding path program 1 times [2018-01-31 08:59:16,587 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:59:16,587 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:59:16,588 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:59:16,588 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:59:16,588 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:59:16,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:59:16,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:59:16,761 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-01-31 08:59:16,761 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:59:16,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 08:59:16,762 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:59:16,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:59:16,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:59:16,762 INFO L87 Difference]: Start difference. First operand 187 states and 194 transitions. Second operand 8 states. [2018-01-31 08:59:16,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:59:16,811 INFO L93 Difference]: Finished difference Result 305 states and 316 transitions. [2018-01-31 08:59:16,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:59:16,812 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2018-01-31 08:59:16,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:59:16,814 INFO L225 Difference]: With dead ends: 305 [2018-01-31 08:59:16,814 INFO L226 Difference]: Without dead ends: 187 [2018-01-31 08:59:16,814 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:59:16,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-01-31 08:59:16,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-01-31 08:59:16,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-01-31 08:59:16,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 193 transitions. [2018-01-31 08:59:16,835 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 193 transitions. Word has length 72 [2018-01-31 08:59:16,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:59:16,836 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 193 transitions. [2018-01-31 08:59:16,836 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:59:16,836 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 193 transitions. [2018-01-31 08:59:16,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-01-31 08:59:16,837 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:59:16,837 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 08:59:16,837 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:59:16,837 INFO L82 PathProgramCache]: Analyzing trace with hash -605147406, now seen corresponding path program 1 times [2018-01-31 08:59:16,837 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:59:16,838 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:59:16,839 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:59:16,839 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:59:16,839 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:59:16,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:59:16,856 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:59:17,345 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-01-31 08:59:17,346 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:59:17,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-31 08:59:17,346 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-31 08:59:17,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-31 08:59:17,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:59:17,346 INFO L87 Difference]: Start difference. First operand 187 states and 193 transitions. Second operand 10 states. [2018-01-31 08:59:17,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:59:17,446 INFO L93 Difference]: Finished difference Result 307 states and 317 transitions. [2018-01-31 08:59:17,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-31 08:59:17,449 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2018-01-31 08:59:17,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:59:17,451 INFO L225 Difference]: With dead ends: 307 [2018-01-31 08:59:17,451 INFO L226 Difference]: Without dead ends: 187 [2018-01-31 08:59:17,451 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-01-31 08:59:17,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-01-31 08:59:17,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-01-31 08:59:17,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-01-31 08:59:17,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 192 transitions. [2018-01-31 08:59:17,476 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 192 transitions. Word has length 77 [2018-01-31 08:59:17,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:59:17,477 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 192 transitions. [2018-01-31 08:59:17,477 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-31 08:59:17,477 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 192 transitions. [2018-01-31 08:59:17,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-01-31 08:59:17,478 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:59:17,478 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] [2018-01-31 08:59:17,478 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:59:17,479 INFO L82 PathProgramCache]: Analyzing trace with hash 506176770, now seen corresponding path program 1 times [2018-01-31 08:59:17,479 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:59:17,479 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:59:17,480 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:59:17,480 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:59:17,480 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:59:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:59:17,501 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:59:17,950 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-01-31 08:59:17,950 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:59:17,950 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-01-31 08:59:17,951 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-31 08:59:17,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-31 08:59:17,951 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-01-31 08:59:17,951 INFO L87 Difference]: Start difference. First operand 187 states and 192 transitions. Second operand 17 states. [2018-01-31 08:59:18,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:59:18,739 INFO L93 Difference]: Finished difference Result 187 states and 192 transitions. [2018-01-31 08:59:18,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-31 08:59:18,739 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 88 [2018-01-31 08:59:18,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:59:18,740 INFO L225 Difference]: With dead ends: 187 [2018-01-31 08:59:18,740 INFO L226 Difference]: Without dead ends: 185 [2018-01-31 08:59:18,740 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=537, Unknown=0, NotChecked=0, Total=600 [2018-01-31 08:59:18,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-01-31 08:59:18,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-01-31 08:59:18,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-31 08:59:18,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 190 transitions. [2018-01-31 08:59:18,758 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 190 transitions. Word has length 88 [2018-01-31 08:59:18,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:59:18,758 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 190 transitions. [2018-01-31 08:59:18,758 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-31 08:59:18,758 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 190 transitions. [2018-01-31 08:59:18,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-01-31 08:59:18,759 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:59:18,759 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] [2018-01-31 08:59:18,759 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:59:18,760 INFO L82 PathProgramCache]: Analyzing trace with hash 506176771, now seen corresponding path program 1 times [2018-01-31 08:59:18,760 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:59:18,761 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:59:18,762 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:59:18,762 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:59:18,762 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:59:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:59:18,791 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:59:18,929 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:59:18,929 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:59:18,929 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:59:18,937 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:59:18,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:59:18,977 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:59:19,000 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:59:19,032 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:59:19,032 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-01-31 08:59:19,032 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-31 08:59:19,033 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-31 08:59:19,033 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:59:19,033 INFO L87 Difference]: Start difference. First operand 185 states and 190 transitions. Second operand 10 states. [2018-01-31 08:59:19,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:59:19,160 INFO L93 Difference]: Finished difference Result 330 states and 340 transitions. [2018-01-31 08:59:19,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:59:19,163 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2018-01-31 08:59:19,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:59:19,164 INFO L225 Difference]: With dead ends: 330 [2018-01-31 08:59:19,165 INFO L226 Difference]: Without dead ends: 192 [2018-01-31 08:59:19,165 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:59:19,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-01-31 08:59:19,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2018-01-31 08:59:19,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-01-31 08:59:19,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 194 transitions. [2018-01-31 08:59:19,184 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 194 transitions. Word has length 88 [2018-01-31 08:59:19,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:59:19,184 INFO L432 AbstractCegarLoop]: Abstraction has 189 states and 194 transitions. [2018-01-31 08:59:19,184 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-31 08:59:19,184 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 194 transitions. [2018-01-31 08:59:19,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-01-31 08:59:19,187 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:59:19,187 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] [2018-01-31 08:59:19,187 INFO L371 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:59:19,187 INFO L82 PathProgramCache]: Analyzing trace with hash -2016582715, now seen corresponding path program 2 times [2018-01-31 08:59:19,187 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:59:19,187 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:59:19,188 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:59:19,188 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:59:19,189 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:59:19,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:59:19,207 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:59:19,320 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:59:19,320 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:59:19,321 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:59:19,326 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:59:19,357 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:59:19,361 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:59:19,365 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:59:19,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-31 08:59:19,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:59:19,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-31 08:59:19,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:59:19,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-31 08:59:19,398 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-31 08:59:21,293 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-01-31 08:59:21,313 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:59:21,313 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [10] total 29 [2018-01-31 08:59:21,313 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-31 08:59:21,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-31 08:59:21,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=705, Unknown=0, NotChecked=0, Total=812 [2018-01-31 08:59:21,314 INFO L87 Difference]: Start difference. First operand 189 states and 194 transitions. Second operand 29 states. [2018-01-31 08:59:23,379 WARN L143 SmtUtils]: Spent 2033ms on a formula simplification that was a NOOP. DAG size: 39 [2018-01-31 08:59:25,426 WARN L143 SmtUtils]: Spent 2011ms on a formula simplification that was a NOOP. DAG size: 39 [2018-01-31 08:59:27,479 WARN L143 SmtUtils]: Spent 2019ms on a formula simplification that was a NOOP. DAG size: 31 [2018-01-31 08:59:29,540 WARN L143 SmtUtils]: Spent 2021ms on a formula simplification that was a NOOP. DAG size: 31 [2018-01-31 08:59:33,618 WARN L143 SmtUtils]: Spent 4022ms on a formula simplification that was a NOOP. DAG size: 31 [2018-01-31 08:59:35,665 WARN L143 SmtUtils]: Spent 2020ms on a formula simplification that was a NOOP. DAG size: 31 [2018-01-31 08:59:37,901 WARN L143 SmtUtils]: Spent 121ms on a formula simplification that was a NOOP. DAG size: 25 [2018-01-31 08:59:38,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:59:38,669 INFO L93 Difference]: Finished difference Result 332 states and 344 transitions. [2018-01-31 08:59:38,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-31 08:59:38,669 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 92 [2018-01-31 08:59:38,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:59:38,670 INFO L225 Difference]: With dead ends: 332 [2018-01-31 08:59:38,670 INFO L226 Difference]: Without dead ends: 194 [2018-01-31 08:59:38,671 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=238, Invalid=1742, Unknown=0, NotChecked=0, Total=1980 [2018-01-31 08:59:38,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-01-31 08:59:38,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2018-01-31 08:59:38,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-01-31 08:59:38,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 196 transitions. [2018-01-31 08:59:38,687 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 196 transitions. Word has length 92 [2018-01-31 08:59:38,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:59:38,687 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 196 transitions. [2018-01-31 08:59:38,688 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-31 08:59:38,688 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 196 transitions. [2018-01-31 08:59:38,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-01-31 08:59:38,688 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:59:38,689 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:59:38,689 INFO L371 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:59:38,689 INFO L82 PathProgramCache]: Analyzing trace with hash -559271400, now seen corresponding path program 1 times [2018-01-31 08:59:38,689 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:59:38,689 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:59:38,691 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:59:38,691 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:59:38,691 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:59:38,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:59:38,711 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:59:39,027 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-01-31 08:59:39,027 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:59:39,027 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-31 08:59:39,027 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-31 08:59:39,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-31 08:59:39,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-01-31 08:59:39,028 INFO L87 Difference]: Start difference. First operand 191 states and 196 transitions. Second operand 13 states. [2018-01-31 08:59:39,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:59:39,130 INFO L93 Difference]: Finished difference Result 275 states and 283 transitions. [2018-01-31 08:59:39,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-31 08:59:39,130 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 112 [2018-01-31 08:59:39,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:59:39,131 INFO L225 Difference]: With dead ends: 275 [2018-01-31 08:59:39,132 INFO L226 Difference]: Without dead ends: 191 [2018-01-31 08:59:39,132 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-01-31 08:59:39,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-01-31 08:59:39,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-01-31 08:59:39,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-01-31 08:59:39,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 195 transitions. [2018-01-31 08:59:39,145 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 195 transitions. Word has length 112 [2018-01-31 08:59:39,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:59:39,146 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 195 transitions. [2018-01-31 08:59:39,146 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-31 08:59:39,146 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 195 transitions. [2018-01-31 08:59:39,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-01-31 08:59:39,147 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:59:39,147 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:59:39,147 INFO L371 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:59:39,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1320811839, now seen corresponding path program 1 times [2018-01-31 08:59:39,147 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:59:39,147 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:59:39,148 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:59:39,148 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:59:39,148 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:59:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:59:39,175 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:59:39,300 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:59:39,301 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:59:39,301 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:59:39,306 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:59:39,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:59:39,386 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:59:39,454 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:59:39,482 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:59:39,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-01-31 08:59:39,482 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-31 08:59:39,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-31 08:59:39,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-01-31 08:59:39,483 INFO L87 Difference]: Start difference. First operand 191 states and 195 transitions. Second operand 12 states. [2018-01-31 08:59:39,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:59:39,584 INFO L93 Difference]: Finished difference Result 334 states and 342 transitions. [2018-01-31 08:59:39,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-31 08:59:39,584 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 130 [2018-01-31 08:59:39,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:59:39,585 INFO L225 Difference]: With dead ends: 334 [2018-01-31 08:59:39,586 INFO L226 Difference]: Without dead ends: 198 [2018-01-31 08:59:39,586 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2018-01-31 08:59:39,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-01-31 08:59:39,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 195. [2018-01-31 08:59:39,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-01-31 08:59:39,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 199 transitions. [2018-01-31 08:59:39,615 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 199 transitions. Word has length 130 [2018-01-31 08:59:39,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:59:39,615 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 199 transitions. [2018-01-31 08:59:39,615 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-31 08:59:39,616 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 199 transitions. [2018-01-31 08:59:39,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-01-31 08:59:39,616 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:59:39,617 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:59:39,617 INFO L371 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:59:39,617 INFO L82 PathProgramCache]: Analyzing trace with hash -848285949, now seen corresponding path program 2 times [2018-01-31 08:59:39,617 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:59:39,617 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:59:39,620 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:59:39,620 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:59:39,620 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:59:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:59:39,650 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:59:40,397 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:59:40,397 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:59:40,397 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:59:40,402 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:59:40,445 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:59:40,450 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:59:40,455 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:59:40,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-31 08:59:40,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:59:40,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-31 08:59:40,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:59:40,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-31 08:59:40,504 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-31 08:59:42,716 WARN L143 SmtUtils]: Spent 2011ms on a formula simplification that was a NOOP. DAG size: 21 [2018-01-31 08:59:44,759 WARN L143 SmtUtils]: Spent 2021ms on a formula simplification that was a NOOP. DAG size: 31 [2018-01-31 08:59:45,608 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-01-31 08:59:45,633 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:59:45,633 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [12] total 33 [2018-01-31 08:59:45,634 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-31 08:59:45,634 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-31 08:59:45,634 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=922, Unknown=0, NotChecked=0, Total=1056 [2018-01-31 08:59:45,634 INFO L87 Difference]: Start difference. First operand 195 states and 199 transitions. Second operand 33 states. [2018-01-31 08:59:48,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:59:48,653 INFO L93 Difference]: Finished difference Result 336 states and 346 transitions. [2018-01-31 08:59:48,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-01-31 08:59:48,686 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 134 [2018-01-31 08:59:48,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:59:48,687 INFO L225 Difference]: With dead ends: 336 [2018-01-31 08:59:48,687 INFO L226 Difference]: Without dead ends: 200 [2018-01-31 08:59:48,689 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 111 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=311, Invalid=2341, Unknown=0, NotChecked=0, Total=2652 [2018-01-31 08:59:48,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-01-31 08:59:48,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2018-01-31 08:59:48,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-01-31 08:59:48,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 201 transitions. [2018-01-31 08:59:48,716 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 201 transitions. Word has length 134 [2018-01-31 08:59:48,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:59:48,717 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 201 transitions. [2018-01-31 08:59:48,717 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-31 08:59:48,717 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 201 transitions. [2018-01-31 08:59:48,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-01-31 08:59:48,718 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:59:48,718 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:59:48,718 INFO L371 AbstractCegarLoop]: === Iteration 23 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:59:48,718 INFO L82 PathProgramCache]: Analyzing trace with hash 877029956, now seen corresponding path program 1 times [2018-01-31 08:59:48,719 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:59:48,719 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:59:48,719 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:59:48,720 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:59:48,720 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:59:48,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:59:48,746 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:59:49,137 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-01-31 08:59:49,138 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:59:49,138 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-01-31 08:59:49,138 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-31 08:59:49,138 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-31 08:59:49,139 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2018-01-31 08:59:49,139 INFO L87 Difference]: Start difference. First operand 197 states and 201 transitions. Second operand 22 states. [2018-01-31 08:59:49,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:59:49,574 INFO L93 Difference]: Finished difference Result 236 states and 246 transitions. [2018-01-31 08:59:49,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-31 08:59:49,574 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 138 [2018-01-31 08:59:49,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:59:49,575 INFO L225 Difference]: With dead ends: 236 [2018-01-31 08:59:49,576 INFO L226 Difference]: Without dead ends: 234 [2018-01-31 08:59:49,576 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2018-01-31 08:59:49,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-01-31 08:59:49,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 230. [2018-01-31 08:59:49,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-01-31 08:59:49,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 238 transitions. [2018-01-31 08:59:49,608 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 238 transitions. Word has length 138 [2018-01-31 08:59:49,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:59:49,609 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 238 transitions. [2018-01-31 08:59:49,609 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-31 08:59:49,609 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 238 transitions. [2018-01-31 08:59:49,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-01-31 08:59:49,610 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:59:49,610 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:59:49,610 INFO L371 AbstractCegarLoop]: === Iteration 24 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:59:49,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1488281606, now seen corresponding path program 1 times [2018-01-31 08:59:49,611 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:59:49,611 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:59:49,611 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:59:49,612 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:59:49,612 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:59:49,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:59:49,637 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:59:49,879 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-01-31 08:59:49,880 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:59:49,880 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:59:49,885 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:59:49,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:59:49,935 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:59:50,121 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-31 08:59:50,141 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:59:50,141 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-01-31 08:59:50,141 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-31 08:59:50,142 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-31 08:59:50,142 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2018-01-31 08:59:50,142 INFO L87 Difference]: Start difference. First operand 230 states and 238 transitions. Second operand 24 states. [2018-01-31 08:59:50,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:59:50,411 INFO L93 Difference]: Finished difference Result 408 states and 424 transitions. [2018-01-31 08:59:50,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-31 08:59:50,411 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 138 [2018-01-31 08:59:50,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:59:50,412 INFO L225 Difference]: With dead ends: 408 [2018-01-31 08:59:50,412 INFO L226 Difference]: Without dead ends: 235 [2018-01-31 08:59:50,413 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2018-01-31 08:59:50,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-01-31 08:59:50,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 232. [2018-01-31 08:59:50,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-01-31 08:59:50,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 238 transitions. [2018-01-31 08:59:50,436 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 238 transitions. Word has length 138 [2018-01-31 08:59:50,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:59:50,436 INFO L432 AbstractCegarLoop]: Abstraction has 232 states and 238 transitions. [2018-01-31 08:59:50,436 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-31 08:59:50,436 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 238 transitions. [2018-01-31 08:59:50,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-01-31 08:59:50,437 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:59:50,437 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:59:50,437 INFO L371 AbstractCegarLoop]: === Iteration 25 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:59:50,437 INFO L82 PathProgramCache]: Analyzing trace with hash 650404191, now seen corresponding path program 1 times [2018-01-31 08:59:50,438 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:59:50,438 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:59:50,439 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:59:50,439 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:59:50,439 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:59:50,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:59:50,466 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:59:52,201 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-01-31 08:59:52,201 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:59:52,201 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2018-01-31 08:59:52,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-31 08:59:52,202 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-31 08:59:52,202 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-01-31 08:59:52,202 INFO L87 Difference]: Start difference. First operand 232 states and 238 transitions. Second operand 27 states. [2018-01-31 08:59:53,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:59:53,231 INFO L93 Difference]: Finished difference Result 248 states and 258 transitions. [2018-01-31 08:59:53,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-31 08:59:53,232 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 161 [2018-01-31 08:59:53,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:59:53,233 INFO L225 Difference]: With dead ends: 248 [2018-01-31 08:59:53,233 INFO L226 Difference]: Without dead ends: 246 [2018-01-31 08:59:53,234 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=109, Invalid=1451, Unknown=0, NotChecked=0, Total=1560 [2018-01-31 08:59:53,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-01-31 08:59:53,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 241. [2018-01-31 08:59:53,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-01-31 08:59:53,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 251 transitions. [2018-01-31 08:59:53,269 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 251 transitions. Word has length 161 [2018-01-31 08:59:53,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:59:53,270 INFO L432 AbstractCegarLoop]: Abstraction has 241 states and 251 transitions. [2018-01-31 08:59:53,270 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-31 08:59:53,271 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 251 transitions. [2018-01-31 08:59:53,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-01-31 08:59:53,272 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:59:53,272 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:59:53,272 INFO L371 AbstractCegarLoop]: === Iteration 26 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:59:53,272 INFO L82 PathProgramCache]: Analyzing trace with hash 650404192, now seen corresponding path program 1 times [2018-01-31 08:59:53,272 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:59:53,272 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:59:53,273 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:59:53,273 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:59:53,273 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:59:53,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:59:53,303 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:59:53,664 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:59:53,664 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:59:53,697 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:59:53,720 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:59:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:59:53,787 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:59:53,811 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:59:53,841 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:59:53,842 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-01-31 08:59:53,842 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-31 08:59:53,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-31 08:59:53,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-01-31 08:59:53,843 INFO L87 Difference]: Start difference. First operand 241 states and 251 transitions. Second operand 15 states. [2018-01-31 08:59:53,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:59:53,918 INFO L93 Difference]: Finished difference Result 422 states and 442 transitions. [2018-01-31 08:59:53,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-31 08:59:53,918 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 161 [2018-01-31 08:59:53,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:59:53,920 INFO L225 Difference]: With dead ends: 422 [2018-01-31 08:59:53,920 INFO L226 Difference]: Without dead ends: 248 [2018-01-31 08:59:53,921 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=143, Unknown=0, NotChecked=0, Total=240 [2018-01-31 08:59:53,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-01-31 08:59:53,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 245. [2018-01-31 08:59:53,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-01-31 08:59:53,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 255 transitions. [2018-01-31 08:59:53,954 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 255 transitions. Word has length 161 [2018-01-31 08:59:53,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:59:53,955 INFO L432 AbstractCegarLoop]: Abstraction has 245 states and 255 transitions. [2018-01-31 08:59:53,955 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-31 08:59:53,955 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 255 transitions. [2018-01-31 08:59:53,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-01-31 08:59:53,956 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:59:53,956 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:59:53,956 INFO L371 AbstractCegarLoop]: === Iteration 27 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 08:59:53,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1824861406, now seen corresponding path program 2 times [2018-01-31 08:59:53,957 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:59:53,957 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:59:53,958 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:59:53,966 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:59:53,966 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:59:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:59:53,996 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:59:54,619 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:59:54,619 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:59:54,619 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:59:54,624 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:59:54,673 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:59:54,678 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:59:54,685 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:59:54,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-31 08:59:54,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:59:54,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-31 08:59:54,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:59:54,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-31 08:59:54,716 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-31 08:59:56,173 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-01-31 08:59:56,192 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:59:56,193 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [15] total 42 [2018-01-31 08:59:56,193 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-01-31 08:59:56,193 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-01-31 08:59:56,194 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1528, Unknown=0, NotChecked=0, Total=1722 [2018-01-31 08:59:56,194 INFO L87 Difference]: Start difference. First operand 245 states and 255 transitions. Second operand 42 states. [2018-01-31 08:59:58,262 WARN L143 SmtUtils]: Spent 2029ms on a formula simplification that was a NOOP. DAG size: 39 [2018-01-31 09:00:00,470 WARN L143 SmtUtils]: Spent 2027ms on a formula simplification that was a NOOP. DAG size: 35 [2018-01-31 09:00:02,062 WARN L143 SmtUtils]: Spent 131ms on a formula simplification that was a NOOP. DAG size: 25 [2018-01-31 09:00:03,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:00:03,217 INFO L93 Difference]: Finished difference Result 424 states and 446 transitions. [2018-01-31 09:00:03,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-01-31 09:00:03,217 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 165 [2018-01-31 09:00:03,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:00:03,219 INFO L225 Difference]: With dead ends: 424 [2018-01-31 09:00:03,219 INFO L226 Difference]: Without dead ends: 250 [2018-01-31 09:00:03,220 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 134 SyntacticMatches, 5 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1082 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=476, Invalid=4080, Unknown=0, NotChecked=0, Total=4556 [2018-01-31 09:00:03,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-01-31 09:00:03,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 247. [2018-01-31 09:00:03,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-01-31 09:00:03,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 256 transitions. [2018-01-31 09:00:03,265 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 256 transitions. Word has length 165 [2018-01-31 09:00:03,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:00:03,266 INFO L432 AbstractCegarLoop]: Abstraction has 247 states and 256 transitions. [2018-01-31 09:00:03,266 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-01-31 09:00:03,266 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 256 transitions. [2018-01-31 09:00:03,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-01-31 09:00:03,267 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:00:03,267 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:00:03,267 INFO L371 AbstractCegarLoop]: === Iteration 28 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 09:00:03,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1297898285, now seen corresponding path program 1 times [2018-01-31 09:00:03,267 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:00:03,268 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:00:03,270 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:00:03,270 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:00:03,270 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:00:03,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:00:03,305 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:00:03,657 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:00:03,657 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:00:03,657 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:00:03,663 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:00:03,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:00:03,730 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:00:03,781 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:00:03,800 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:00:03,800 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-01-31 09:00:03,801 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-31 09:00:03,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-31 09:00:03,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-01-31 09:00:03,802 INFO L87 Difference]: Start difference. First operand 247 states and 256 transitions. Second operand 17 states. [2018-01-31 09:00:03,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:00:03,887 INFO L93 Difference]: Finished difference Result 426 states and 444 transitions. [2018-01-31 09:00:03,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-31 09:00:03,888 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 174 [2018-01-31 09:00:03,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:00:03,890 INFO L225 Difference]: With dead ends: 426 [2018-01-31 09:00:03,890 INFO L226 Difference]: Without dead ends: 254 [2018-01-31 09:00:03,891 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=180, Unknown=0, NotChecked=0, Total=306 [2018-01-31 09:00:03,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-01-31 09:00:03,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 251. [2018-01-31 09:00:03,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-01-31 09:00:03,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 260 transitions. [2018-01-31 09:00:03,928 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 260 transitions. Word has length 174 [2018-01-31 09:00:03,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:00:03,928 INFO L432 AbstractCegarLoop]: Abstraction has 251 states and 260 transitions. [2018-01-31 09:00:03,928 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-31 09:00:03,929 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 260 transitions. [2018-01-31 09:00:03,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-01-31 09:00:03,929 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:00:03,929 INFO L351 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:00:03,930 INFO L371 AbstractCegarLoop]: === Iteration 29 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 09:00:03,930 INFO L82 PathProgramCache]: Analyzing trace with hash -781800337, now seen corresponding path program 2 times [2018-01-31 09:00:03,930 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:00:03,930 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:00:03,931 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:00:03,931 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:00:03,931 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:00:03,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:00:03,960 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:00:04,447 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:00:04,447 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:00:04,447 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:00:04,453 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 09:00:04,505 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:00:04,513 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:00:04,525 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:00:04,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-31 09:00:04,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-31 09:00:04,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:00:04,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:00:04,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:00:04,932 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-01-31 09:00:05,735 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 09:00:05,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 09:00:05,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-31 09:00:05,762 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:26 [2018-01-31 09:00:05,764 WARN L1033 $PredicateComparison]: unable to prove that (exists ((LDV_INIT_LIST_HEAD_~list.offset Int) (v_DerPreprocessor_2 Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (let ((.cse0 (+ LDV_INIT_LIST_HEAD_~list.offset 4))) (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) LDV_INIT_LIST_HEAD_~list.offset v_DerPreprocessor_2) .cse0 (select (select |c_#memory_int| |c_LDV_INIT_LIST_HEAD_#in~list.base|) .cse0))))) (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) is different from true [2018-01-31 09:00:05,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2018-01-31 09:00:05,774 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:05,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-01-31 09:00:05,828 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:05,837 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:05,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-01-31 09:00:05,841 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 09:00:05,847 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:00:05,850 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:00:05,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:00:05,854 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:37, output treesize:9 [2018-01-31 09:00:06,389 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:06,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 36 [2018-01-31 09:00:06,392 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 09:00:06,393 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:06,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2018-01-31 09:00:06,394 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:00:06,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:00:06,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:00:06,399 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:13 [2018-01-31 09:00:07,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-01-31 09:00:07,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-01-31 09:00:07,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:00:07,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:00:07,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:00:07,075 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-01-31 09:00:07,164 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-01-31 09:00:07,186 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 09:00:07,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [50] imperfect sequences [17] total 65 [2018-01-31 09:00:07,187 INFO L409 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-01-31 09:00:07,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-01-31 09:00:07,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=3796, Unknown=1, NotChecked=124, Total=4160 [2018-01-31 09:00:07,188 INFO L87 Difference]: Start difference. First operand 251 states and 260 transitions. Second operand 65 states. [2018-01-31 09:00:10,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:00:10,901 INFO L93 Difference]: Finished difference Result 420 states and 437 transitions. [2018-01-31 09:00:10,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-01-31 09:00:10,920 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 178 [2018-01-31 09:00:10,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:00:10,921 INFO L225 Difference]: With dead ends: 420 [2018-01-31 09:00:10,921 INFO L226 Difference]: Without dead ends: 248 [2018-01-31 09:00:10,926 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1594 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=406, Invalid=8339, Unknown=1, NotChecked=184, Total=8930 [2018-01-31 09:00:10,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-01-31 09:00:10,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 245. [2018-01-31 09:00:10,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-01-31 09:00:10,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 248 transitions. [2018-01-31 09:00:10,970 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 248 transitions. Word has length 178 [2018-01-31 09:00:10,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:00:10,970 INFO L432 AbstractCegarLoop]: Abstraction has 245 states and 248 transitions. [2018-01-31 09:00:10,970 INFO L433 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-01-31 09:00:10,971 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 248 transitions. [2018-01-31 09:00:10,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-01-31 09:00:10,972 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:00:10,973 INFO L351 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:00:10,973 INFO L371 AbstractCegarLoop]: === Iteration 30 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 09:00:10,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1588564862, now seen corresponding path program 1 times [2018-01-31 09:00:10,973 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:00:10,973 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:00:10,974 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:00:10,974 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:00:10,975 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:00:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:00:11,002 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:00:12,413 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-01-31 09:00:12,414 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:00:12,414 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:00:12,420 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:00:12,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:00:12,520 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:00:12,963 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-01-31 09:00:12,983 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:00:12,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 37 [2018-01-31 09:00:12,983 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-31 09:00:12,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-31 09:00:12,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1154, Unknown=0, NotChecked=0, Total=1332 [2018-01-31 09:00:12,984 INFO L87 Difference]: Start difference. First operand 245 states and 248 transitions. Second operand 37 states. [2018-01-31 09:00:14,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:00:14,726 INFO L93 Difference]: Finished difference Result 430 states and 436 transitions. [2018-01-31 09:00:14,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-01-31 09:00:14,727 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 197 [2018-01-31 09:00:14,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:00:14,729 INFO L225 Difference]: With dead ends: 430 [2018-01-31 09:00:14,729 INFO L226 Difference]: Without dead ends: 268 [2018-01-31 09:00:14,731 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=540, Invalid=4290, Unknown=0, NotChecked=0, Total=4830 [2018-01-31 09:00:14,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-01-31 09:00:14,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 252. [2018-01-31 09:00:14,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-01-31 09:00:14,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 254 transitions. [2018-01-31 09:00:14,757 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 254 transitions. Word has length 197 [2018-01-31 09:00:14,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:00:14,758 INFO L432 AbstractCegarLoop]: Abstraction has 252 states and 254 transitions. [2018-01-31 09:00:14,758 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-31 09:00:14,758 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 254 transitions. [2018-01-31 09:00:14,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-01-31 09:00:14,759 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:00:14,759 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:00:14,759 INFO L371 AbstractCegarLoop]: === Iteration 31 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 09:00:14,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1611558565, now seen corresponding path program 1 times [2018-01-31 09:00:14,759 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:00:14,760 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:00:14,761 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:00:14,761 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:00:14,761 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:00:14,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:00:14,795 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:00:16,087 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 446 trivial. 0 not checked. [2018-01-31 09:00:16,087 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:00:16,109 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:00:16,114 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:00:16,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:00:16,198 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:00:17,337 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-01-31 09:00:17,357 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:00:17,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 19] total 43 [2018-01-31 09:00:17,358 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-01-31 09:00:17,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-01-31 09:00:17,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1603, Unknown=0, NotChecked=0, Total=1806 [2018-01-31 09:00:17,359 INFO L87 Difference]: Start difference. First operand 252 states and 254 transitions. Second operand 43 states. [2018-01-31 09:00:20,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:00:20,397 INFO L93 Difference]: Finished difference Result 436 states and 441 transitions. [2018-01-31 09:00:20,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-01-31 09:00:20,397 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 220 [2018-01-31 09:00:20,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:00:20,398 INFO L225 Difference]: With dead ends: 436 [2018-01-31 09:00:20,398 INFO L226 Difference]: Without dead ends: 271 [2018-01-31 09:00:20,401 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=631, Invalid=6011, Unknown=0, NotChecked=0, Total=6642 [2018-01-31 09:00:20,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-01-31 09:00:20,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 255. [2018-01-31 09:00:20,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-01-31 09:00:20,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 257 transitions. [2018-01-31 09:00:20,443 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 257 transitions. Word has length 220 [2018-01-31 09:00:20,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:00:20,444 INFO L432 AbstractCegarLoop]: Abstraction has 255 states and 257 transitions. [2018-01-31 09:00:20,444 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-01-31 09:00:20,444 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 257 transitions. [2018-01-31 09:00:20,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-01-31 09:00:20,446 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:00:20,446 INFO L351 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:00:20,446 INFO L371 AbstractCegarLoop]: === Iteration 32 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-31 09:00:20,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1417048159, now seen corresponding path program 1 times [2018-01-31 09:00:20,446 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:00:20,446 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:00:20,449 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:00:20,449 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:00:20,449 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:00:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:00:20,659 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:00:29,933 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 34 proven. 477 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-31 09:00:29,933 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:00:29,933 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:00:29,939 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:00:30,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:00:30,040 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:00:30,248 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:00:30,249 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:00:30,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:00:30,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:00:30,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:00:30,255 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-01-31 09:00:30,414 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:00:30,417 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:30,417 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:00:30,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:00:30,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:00:30,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:00:30,428 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-01-31 09:00:30,629 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:00:30,632 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:30,633 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:30,633 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:30,634 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:00:30,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:00:30,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:00:30,652 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:00:30,652 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:43 [2018-01-31 09:00:30,895 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:00:30,898 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:30,899 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:30,900 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:30,901 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:30,902 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:30,902 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:30,903 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:00:30,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:00:30,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:00:30,931 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:00:30,931 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:59 [2018-01-31 09:00:31,380 WARN L143 SmtUtils]: Spent 322ms on a formula simplification that was a NOOP. DAG size: 32 [2018-01-31 09:00:31,603 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:00:31,606 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:31,607 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:31,608 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:31,611 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:31,613 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:31,613 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:31,614 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:31,615 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:31,616 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:31,617 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:31,618 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:00:31,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:00:31,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:00:31,656 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:00:31,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:79, output treesize:75 [2018-01-31 09:00:32,025 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:00:32,028 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:32,029 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:32,030 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:32,031 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:32,032 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:32,033 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:32,034 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:32,035 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:32,036 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:32,037 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:32,037 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:32,038 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:32,039 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:32,040 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:32,041 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:32,042 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:00:32,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:00:32,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:00:32,096 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:00:32,096 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:95, output treesize:91 [2018-01-31 09:00:32,926 WARN L143 SmtUtils]: Spent 665ms on a formula simplification that was a NOOP. DAG size: 44 [2018-01-31 09:00:33,931 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:00:33,981 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:34,003 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:34,025 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:34,049 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:34,068 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:34,070 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:34,071 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:34,071 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:34,073 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:34,074 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:34,075 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:34,076 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:34,077 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:34,077 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:34,079 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:34,080 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:34,081 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:34,082 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:34,115 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:34,116 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:34,117 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:34,118 INFO L303 Elim1Store]: Index analysis took 184 ms [2018-01-31 09:00:34,118 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:00:34,119 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:00:34,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:00:34,193 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:00:34,193 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:111, output treesize:107 [2018-01-31 09:00:35,876 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:00:35,880 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:35,881 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:35,882 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:35,883 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:35,884 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:35,885 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:35,885 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:35,886 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:35,887 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:35,888 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:35,889 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:35,889 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:35,890 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:35,891 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:35,892 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:35,893 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:35,893 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:35,894 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:35,895 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:35,896 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:35,897 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:35,898 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:35,899 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:35,899 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:35,900 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:35,901 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:35,902 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:35,903 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:35,904 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:00:35,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:00:36,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:00:36,053 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:00:36,054 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:127, output treesize:123 [2018-01-31 09:00:39,220 WARN L143 SmtUtils]: Spent 1693ms on a formula simplification that was a NOOP. DAG size: 56 [2018-01-31 09:00:50,231 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:00:50,236 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:50,237 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:50,238 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:50,239 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:50,241 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:50,242 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:50,243 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:50,244 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:50,245 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:50,246 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:50,247 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:50,248 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:50,249 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:50,250 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:50,250 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:50,251 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:50,252 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:50,253 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:50,254 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:50,255 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:50,256 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:50,257 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:50,257 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:50,258 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:50,259 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:50,260 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:50,261 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:50,262 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:50,263 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:50,264 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:50,264 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:50,265 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:50,266 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:50,267 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:50,268 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:50,269 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:00:50,271 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:00:50,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:00:50,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:00:50,423 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:00:50,423 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:143, output treesize:139 [2018-01-31 09:01:01,870 WARN L143 SmtUtils]: Spent 467ms on a formula simplification that was a NOOP. DAG size: 62 Received shutdown request... [2018-01-31 09:01:09,023 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-31 09:01:09,023 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-31 09:01:09,027 WARN L185 ceAbstractionStarter]: Timeout [2018-01-31 09:01:09,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 09:01:09 BoogieIcfgContainer [2018-01-31 09:01:09,028 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 09:01:09,028 INFO L168 Benchmark]: Toolchain (without parser) took 135592.64 ms. Allocated memory was 305.7 MB in the beginning and 1.2 GB in the end (delta: 922.2 MB). Free memory was 264.5 MB in the beginning and 1.0 GB in the end (delta: -777.2 MB). Peak memory consumption was 145.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:01:09,030 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 305.7 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 09:01:09,030 INFO L168 Benchmark]: CACSL2BoogieTranslator took 359.99 ms. Allocated memory is still 305.7 MB. Free memory was 264.5 MB in the beginning and 250.5 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:01:09,030 INFO L168 Benchmark]: Boogie Preprocessor took 77.52 ms. Allocated memory is still 305.7 MB. Free memory was 250.5 MB in the beginning and 246.5 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:01:09,031 INFO L168 Benchmark]: RCFGBuilder took 971.32 ms. Allocated memory is still 305.7 MB. Free memory was 246.5 MB in the beginning and 207.6 MB in the end (delta: 38.9 MB). Peak memory consumption was 38.9 MB. Max. memory is 5.3 GB. [2018-01-31 09:01:09,031 INFO L168 Benchmark]: TraceAbstraction took 134168.33 ms. Allocated memory was 305.7 MB in the beginning and 1.2 GB in the end (delta: 922.2 MB). Free memory was 207.6 MB in the beginning and 1.0 GB in the end (delta: -834.2 MB). Peak memory consumption was 88.1 MB. Max. memory is 5.3 GB. [2018-01-31 09:01:09,033 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 305.7 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 359.99 ms. Allocated memory is still 305.7 MB. Free memory was 264.5 MB in the beginning and 250.5 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 77.52 ms. Allocated memory is still 305.7 MB. Free memory was 250.5 MB in the beginning and 246.5 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 971.32 ms. Allocated memory is still 305.7 MB. Free memory was 246.5 MB in the beginning and 207.6 MB in the end (delta: 38.9 MB). Peak memory consumption was 38.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 134168.33 ms. Allocated memory was 305.7 MB in the beginning and 1.2 GB in the end (delta: 922.2 MB). Free memory was 207.6 MB in the beginning and 1.0 GB in the end (delta: -834.2 MB). Peak memory consumption was 88.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1294). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 100 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1294). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 100 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1411). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 100 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1411). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 100 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1265). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 100 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1265). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 100 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1267). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 100 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1267). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 100 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1256). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 100 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1256). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 100 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1258). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 100 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1258). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 100 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 100 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 100 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 100 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 100 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1339). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 100 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1339). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 100 known predicates. - TimeoutResultAtElement [Line: 1452]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1452). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 100 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1099). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 100 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1100). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 100 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1100). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 100 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1099). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 100 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 23 procedures, 184 locations, 23 error locations. TIMEOUT Result, 134.0s OverallTime, 32 OverallIterations, 16 TraceHistogramMax, 53.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5081 SDtfs, 2410 SDslu, 50930 SDs, 0 SdLazy, 22096 SolverSat, 424 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 20.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2504 GetRequests, 1744 SyntacticMatches, 11 SemanticMatches, 749 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5651 ImplicationChecksByTransitivity, 54.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=255occurred in iteration=31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 31 MinimizatonAttempts, 206 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 28.4s InterpolantComputationTime, 4817 NumberOfCodeBlocks, 4641 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 4771 ConstructedInterpolants, 420 QuantifiedInterpolants, 2789395 SizeOfPredicates, 145 NumberOfNonLiveVariables, 6185 ConjunctsInSsa, 610 ConjunctsInUnsatCore, 46 InterpolantComputations, 22 PerfectInterpolantSequences, 2391/5394 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_09-01-09-042.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_09-01-09-042.csv Completed graceful shutdown