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.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_2_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:30:39,872 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:30:39,874 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:30:39,888 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:30:39,888 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:30:39,889 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:30:39,891 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:30:39,892 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:30:39,894 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:30:39,895 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:30:39,896 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:30:39,896 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:30:39,897 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:30:39,898 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:30:39,899 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:30:39,901 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:30:39,903 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:30:39,905 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:30:39,907 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:30:39,908 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:30:39,910 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:30:39,910 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:30:39,910 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:30:39,911 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:30:39,912 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:30:39,913 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:30:39,914 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:30:39,914 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:30:39,915 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:30:39,915 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:30:39,915 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:30:39,916 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.epf [2018-01-24 12:30:39,924 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:30:39,924 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:30:39,925 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:30:39,925 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:30:39,925 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:30:39,925 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:30:39,925 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:30:39,926 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:30:39,926 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:30:39,926 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:30:39,926 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:30:39,926 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:30:39,927 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:30:39,927 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:30:39,927 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:30:39,927 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:30:39,927 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:30:39,927 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:30:39,927 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:30:39,927 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:30:39,928 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:30:39,928 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:30:39,928 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:30:39,928 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:30:39,928 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:30:39,929 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:30:39,929 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:30:39,929 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:30:39,929 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 12:30:39,929 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:30:39,929 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:30:39,929 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:30:39,930 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:30:39,930 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:30:39,962 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:30:39,971 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:30:39,974 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:30:39,975 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:30:39,976 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:30:39,976 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_2_true-valid-memsafety_true-termination.i [2018-01-24 12:30:40,162 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:30:40,167 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:30:40,200 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:30:40,200 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:30:40,205 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:30:40,206 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:30:40" (1/1) ... [2018-01-24 12:30:40,209 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c105265 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:30:40, skipping insertion in model container [2018-01-24 12:30:40,209 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:30:40" (1/1) ... [2018-01-24 12:30:40,222 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:30:40,267 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:30:40,392 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:30:40,418 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:30:40,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:30:40 WrapperNode [2018-01-24 12:30:40,432 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:30:40,433 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:30:40,433 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:30:40,433 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:30:40,443 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:30:40" (1/1) ... [2018-01-24 12:30:40,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:30:40" (1/1) ... [2018-01-24 12:30:40,454 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:30:40" (1/1) ... [2018-01-24 12:30:40,454 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:30:40" (1/1) ... [2018-01-24 12:30:40,465 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:30:40" (1/1) ... [2018-01-24 12:30:40,469 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:30:40" (1/1) ... [2018-01-24 12:30:40,471 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:30:40" (1/1) ... [2018-01-24 12:30:40,475 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:30:40,476 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:30:40,476 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:30:40,476 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:30:40,477 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:30:40" (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-24 12:30:40,525 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:30:40,525 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:30:40,525 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-01-24 12:30:40,525 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 12:30:40,526 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-01-24 12:30:40,526 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2018-01-24 12:30:40,526 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-01-24 12:30:40,526 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-01-24 12:30:40,526 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-01-24 12:30:40,526 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2018-01-24 12:30:40,526 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-01-24 12:30:40,526 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-01-24 12:30:40,526 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-01-24 12:30:40,526 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-01-24 12:30:40,527 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2018-01-24 12:30:40,527 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-01-24 12:30:40,527 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-01-24 12:30:40,527 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-01-24 12:30:40,527 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 12:30:40,527 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:30:40,527 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 12:30:40,528 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 12:30:40,528 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 12:30:40,528 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 12:30:40,528 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:30:40,528 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:30:40,528 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:30:40,529 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-24 12:30:40,529 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-24 12:30:40,529 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 12:30:40,529 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 12:30:40,529 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:30:40,530 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-24 12:30:40,530 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 12:30:40,530 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-01-24 12:30:40,530 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2018-01-24 12:30:40,530 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-01-24 12:30:40,530 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-01-24 12:30:40,530 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-01-24 12:30:40,530 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-01-24 12:30:40,531 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2018-01-24 12:30:40,531 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-01-24 12:30:40,531 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-01-24 12:30:40,531 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-01-24 12:30:40,531 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-01-24 12:30:40,531 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2018-01-24 12:30:40,531 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-01-24 12:30:40,532 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-01-24 12:30:40,532 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-01-24 12:30:40,532 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 12:30:40,532 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:30:40,532 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:30:40,532 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:30:40,813 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-24 12:30:40,974 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:30:40,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:30:40 BoogieIcfgContainer [2018-01-24 12:30:40,975 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:30:40,976 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:30:40,976 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:30:40,978 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:30:40,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:30:40" (1/3) ... [2018-01-24 12:30:40,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db18c1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:30:40, skipping insertion in model container [2018-01-24 12:30:40,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:30:40" (2/3) ... [2018-01-24 12:30:40,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db18c1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:30:40, skipping insertion in model container [2018-01-24 12:30:40,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:30:40" (3/3) ... [2018-01-24 12:30:40,982 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test22_2_true-valid-memsafety_true-termination.i [2018-01-24 12:30:40,991 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:30:40,998 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-01-24 12:30:41,050 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:30:41,050 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:30:41,050 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:30:41,050 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:30:41,051 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:30:41,051 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:30:41,051 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:30:41,051 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:30:41,052 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:30:41,074 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2018-01-24 12:30:41,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 12:30:41,080 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:30:41,081 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:30:41,082 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-24 12:30:41,087 INFO L82 PathProgramCache]: Analyzing trace with hash -998986606, now seen corresponding path program 1 times [2018-01-24 12:30:41,089 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:30:41,089 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:30:41,141 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:30:41,141 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:30:41,141 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:30:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:30:41,197 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:30:41,437 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-24 12:30:41,439 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:30:41,440 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:30:41,441 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:30:41,451 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:30:41,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:30:41,453 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 5 states. [2018-01-24 12:30:41,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:30:41,521 INFO L93 Difference]: Finished difference Result 274 states and 291 transitions. [2018-01-24 12:30:41,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:30:41,523 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-24 12:30:41,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:30:41,536 INFO L225 Difference]: With dead ends: 274 [2018-01-24 12:30:41,536 INFO L226 Difference]: Without dead ends: 146 [2018-01-24 12:30:41,540 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:30:41,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-01-24 12:30:41,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2018-01-24 12:30:41,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-01-24 12:30:41,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 153 transitions. [2018-01-24 12:30:41,580 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 153 transitions. Word has length 17 [2018-01-24 12:30:41,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:30:41,580 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 153 transitions. [2018-01-24 12:30:41,580 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:30:41,580 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2018-01-24 12:30:41,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 12:30:41,581 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:30:41,581 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:30:41,581 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-24 12:30:41,581 INFO L82 PathProgramCache]: Analyzing trace with hash -2077747980, now seen corresponding path program 1 times [2018-01-24 12:30:41,581 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:30:41,581 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:30:41,583 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:30:41,584 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:30:41,584 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:30:41,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:30:41,607 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:30:41,668 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-24 12:30:41,668 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:30:41,668 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:30:41,670 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:30:41,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:30:41,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:30:41,670 INFO L87 Difference]: Start difference. First operand 144 states and 153 transitions. Second operand 6 states. [2018-01-24 12:30:41,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:30:41,875 INFO L93 Difference]: Finished difference Result 146 states and 155 transitions. [2018-01-24 12:30:41,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:30:41,876 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 12:30:41,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:30:41,878 INFO L225 Difference]: With dead ends: 146 [2018-01-24 12:30:41,878 INFO L226 Difference]: Without dead ends: 145 [2018-01-24 12:30:41,879 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:30:41,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-01-24 12:30:41,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2018-01-24 12:30:41,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-24 12:30:41,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 152 transitions. [2018-01-24 12:30:41,896 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 152 transitions. Word has length 19 [2018-01-24 12:30:41,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:30:41,896 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 152 transitions. [2018-01-24 12:30:41,896 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:30:41,896 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 152 transitions. [2018-01-24 12:30:41,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 12:30:41,897 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:30:41,897 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:30:41,897 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-24 12:30:41,898 INFO L82 PathProgramCache]: Analyzing trace with hash -2077747979, now seen corresponding path program 1 times [2018-01-24 12:30:41,898 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:30:41,898 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:30:41,900 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:30:41,900 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:30:41,900 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:30:41,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:30:41,921 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:30:42,139 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-24 12:30:42,139 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:30:42,139 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:30:42,140 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:30:42,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:30:42,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:30:42,140 INFO L87 Difference]: Start difference. First operand 143 states and 152 transitions. Second operand 7 states. [2018-01-24 12:30:42,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:30:42,374 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2018-01-24 12:30:42,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:30:42,375 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-01-24 12:30:42,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:30:42,377 INFO L225 Difference]: With dead ends: 145 [2018-01-24 12:30:42,377 INFO L226 Difference]: Without dead ends: 144 [2018-01-24 12:30:42,377 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:30:42,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-01-24 12:30:42,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2018-01-24 12:30:42,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-01-24 12:30:42,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 151 transitions. [2018-01-24 12:30:42,393 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 151 transitions. Word has length 19 [2018-01-24 12:30:42,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:30:42,394 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 151 transitions. [2018-01-24 12:30:42,394 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:30:42,394 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2018-01-24 12:30:42,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 12:30:42,395 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:30:42,395 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:30:42,396 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-24 12:30:42,396 INFO L82 PathProgramCache]: Analyzing trace with hash -471802203, now seen corresponding path program 1 times [2018-01-24 12:30:42,396 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:30:42,396 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:30:42,398 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:30:42,398 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:30:42,398 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:30:42,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:30:42,416 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:30:42,495 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-24 12:30:42,496 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:30:42,496 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:30:42,496 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:30:42,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:30:42,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:30:42,497 INFO L87 Difference]: Start difference. First operand 142 states and 151 transitions. Second operand 7 states. [2018-01-24 12:30:42,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:30:42,563 INFO L93 Difference]: Finished difference Result 238 states and 253 transitions. [2018-01-24 12:30:42,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:30:42,563 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-01-24 12:30:42,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:30:42,565 INFO L225 Difference]: With dead ends: 238 [2018-01-24 12:30:42,565 INFO L226 Difference]: Without dead ends: 159 [2018-01-24 12:30:42,566 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:30:42,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-01-24 12:30:42,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 151. [2018-01-24 12:30:42,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-01-24 12:30:42,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2018-01-24 12:30:42,585 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 27 [2018-01-24 12:30:42,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:30:42,585 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2018-01-24 12:30:42,585 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:30:42,585 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2018-01-24 12:30:42,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 12:30:42,587 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:30:42,587 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:30:42,588 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-24 12:30:42,588 INFO L82 PathProgramCache]: Analyzing trace with hash 131109242, now seen corresponding path program 1 times [2018-01-24 12:30:42,588 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:30:42,588 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:30:42,589 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:30:42,590 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:30:42,590 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:30:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:30:42,620 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:30:42,701 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-24 12:30:42,701 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:30:42,701 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 12:30:42,702 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 12:30:42,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 12:30:42,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:30:42,702 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand 10 states. [2018-01-24 12:30:42,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:30:42,932 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2018-01-24 12:30:42,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:30:42,932 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-01-24 12:30:42,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:30:42,934 INFO L225 Difference]: With dead ends: 151 [2018-01-24 12:30:42,934 INFO L226 Difference]: Without dead ends: 150 [2018-01-24 12:30:42,934 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:30:42,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-01-24 12:30:42,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-01-24 12:30:42,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-24 12:30:42,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 159 transitions. [2018-01-24 12:30:42,946 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 159 transitions. Word has length 34 [2018-01-24 12:30:42,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:30:42,946 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 159 transitions. [2018-01-24 12:30:42,947 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 12:30:42,947 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 159 transitions. [2018-01-24 12:30:42,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 12:30:42,948 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:30:42,948 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:30:42,948 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-24 12:30:42,948 INFO L82 PathProgramCache]: Analyzing trace with hash 131109243, now seen corresponding path program 1 times [2018-01-24 12:30:42,949 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:30:42,949 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:30:42,950 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:30:42,950 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:30:42,950 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:30:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:30:42,966 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:30:42,992 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-24 12:30:42,992 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:30:42,992 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:30:42,993 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:30:42,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:30:42,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:30:42,993 INFO L87 Difference]: Start difference. First operand 150 states and 159 transitions. Second operand 4 states. [2018-01-24 12:30:43,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:30:43,014 INFO L93 Difference]: Finished difference Result 266 states and 282 transitions. [2018-01-24 12:30:43,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:30:43,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-01-24 12:30:43,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:30:43,016 INFO L225 Difference]: With dead ends: 266 [2018-01-24 12:30:43,017 INFO L226 Difference]: Without dead ends: 151 [2018-01-24 12:30:43,018 INFO L525 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-24 12:30:43,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-01-24 12:30:43,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-01-24 12:30:43,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-01-24 12:30:43,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2018-01-24 12:30:43,029 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 34 [2018-01-24 12:30:43,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:30:43,030 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2018-01-24 12:30:43,030 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:30:43,030 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2018-01-24 12:30:43,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-24 12:30:43,031 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:30:43,031 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:30:43,031 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-24 12:30:43,032 INFO L82 PathProgramCache]: Analyzing trace with hash -2110897305, now seen corresponding path program 1 times [2018-01-24 12:30:43,032 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:30:43,032 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:30:43,033 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:30:43,033 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:30:43,033 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:30:43,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:30:43,050 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:30:43,122 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-24 12:30:43,122 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:30:43,122 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-24 12:30:43,134 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:30:43,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:30:43,180 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:30:43,202 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-24 12:30:43,223 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:30:43,223 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-01-24 12:30:43,223 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:30:43,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:30:43,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:30:43,224 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand 6 states. [2018-01-24 12:30:43,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:30:43,259 INFO L93 Difference]: Finished difference Result 267 states and 283 transitions. [2018-01-24 12:30:43,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:30:43,260 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-24 12:30:43,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:30:43,262 INFO L225 Difference]: With dead ends: 267 [2018-01-24 12:30:43,262 INFO L226 Difference]: Without dead ends: 152 [2018-01-24 12:30:43,263 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:30:43,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-24 12:30:43,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-01-24 12:30:43,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-01-24 12:30:43,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 161 transitions. [2018-01-24 12:30:43,275 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 161 transitions. Word has length 35 [2018-01-24 12:30:43,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:30:43,275 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 161 transitions. [2018-01-24 12:30:43,275 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:30:43,276 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 161 transitions. [2018-01-24 12:30:43,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 12:30:43,277 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:30:43,278 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:30:43,278 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-24 12:30:43,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1181841647, now seen corresponding path program 1 times [2018-01-24 12:30:43,278 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:30:43,278 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:30:43,280 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:30:43,280 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:30:43,280 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:30:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:30:43,297 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:30:43,367 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-24 12:30:43,368 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:30:43,368 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:30:43,368 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:30:43,368 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:30:43,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:30:43,369 INFO L87 Difference]: Start difference. First operand 152 states and 161 transitions. Second operand 7 states. [2018-01-24 12:30:43,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:30:43,416 INFO L93 Difference]: Finished difference Result 220 states and 236 transitions. [2018-01-24 12:30:43,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:30:43,417 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-01-24 12:30:43,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:30:43,418 INFO L225 Difference]: With dead ends: 220 [2018-01-24 12:30:43,418 INFO L226 Difference]: Without dead ends: 163 [2018-01-24 12:30:43,418 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:30:43,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-01-24 12:30:43,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2018-01-24 12:30:43,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-01-24 12:30:43,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 169 transitions. [2018-01-24 12:30:43,427 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 169 transitions. Word has length 36 [2018-01-24 12:30:43,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:30:43,427 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 169 transitions. [2018-01-24 12:30:43,428 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:30:43,428 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 169 transitions. [2018-01-24 12:30:43,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 12:30:43,429 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:30:43,429 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:30:43,429 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-24 12:30:43,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1401343739, now seen corresponding path program 2 times [2018-01-24 12:30:43,429 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:30:43,430 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:30:43,431 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:30:43,431 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:30:43,431 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:30:43,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:30:43,447 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:30:43,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:30:43,522 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:30:43,522 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-24 12:30:43,530 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:30:43,563 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:30:43,567 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:30:43,572 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:30:43,616 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-24 12:30:43,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:30:43,639 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-24 12:30:43,640 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:30:43,655 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-24 12:30:43,655 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-24 12:30:45,901 WARN L143 SmtUtils]: Spent 2030ms on a formula simplification that was a NOOP. DAG size: 21 [2018-01-24 12:30:46,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 12:30:46,382 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:30:46,382 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 19 [2018-01-24 12:30:46,383 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 12:30:46,383 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 12:30:46,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-01-24 12:30:46,384 INFO L87 Difference]: Start difference. First operand 159 states and 169 transitions. Second operand 19 states. [2018-01-24 12:30:48,779 WARN L143 SmtUtils]: Spent 2026ms on a formula simplification that was a NOOP. DAG size: 31 [2018-01-24 12:30:54,854 WARN L143 SmtUtils]: Spent 6037ms on a formula simplification that was a NOOP. DAG size: 32 [2018-01-24 12:30:55,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:30:55,669 INFO L93 Difference]: Finished difference Result 294 states and 312 transitions. [2018-01-24 12:30:55,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 12:30:55,669 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-01-24 12:30:55,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:30:55,671 INFO L225 Difference]: With dead ends: 294 [2018-01-24 12:30:55,671 INFO L226 Difference]: Without dead ends: 179 [2018-01-24 12:30:55,672 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2018-01-24 12:30:55,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-01-24 12:30:55,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 159. [2018-01-24 12:30:55,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-01-24 12:30:55,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 169 transitions. [2018-01-24 12:30:55,689 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 169 transitions. Word has length 36 [2018-01-24 12:30:55,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:30:55,689 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 169 transitions. [2018-01-24 12:30:55,689 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-24 12:30:55,689 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 169 transitions. [2018-01-24 12:30:55,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-24 12:30:55,690 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:30:55,691 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:30:55,691 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-24 12:30:55,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1379512829, now seen corresponding path program 1 times [2018-01-24 12:30:55,691 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:30:55,691 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:30:55,692 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:30:55,693 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:30:55,693 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:30:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:30:55,703 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:30:55,734 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-24 12:30:55,734 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:30:55,734 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 12:30:55,735 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:30:55,735 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:30:55,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:30:55,735 INFO L87 Difference]: Start difference. First operand 159 states and 169 transitions. Second operand 3 states. [2018-01-24 12:30:55,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:30:55,892 INFO L93 Difference]: Finished difference Result 178 states and 191 transitions. [2018-01-24 12:30:55,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:30:55,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-01-24 12:30:55,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:30:55,893 INFO L225 Difference]: With dead ends: 178 [2018-01-24 12:30:55,894 INFO L226 Difference]: Without dead ends: 163 [2018-01-24 12:30:55,894 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:30:55,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-01-24 12:30:55,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 155. [2018-01-24 12:30:55,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-01-24 12:30:55,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 164 transitions. [2018-01-24 12:30:55,916 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 164 transitions. Word has length 39 [2018-01-24 12:30:55,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:30:55,916 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 164 transitions. [2018-01-24 12:30:55,916 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:30:55,916 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 164 transitions. [2018-01-24 12:30:55,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-24 12:30:55,917 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:30:55,917 INFO L322 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:30:55,917 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-24 12:30:55,918 INFO L82 PathProgramCache]: Analyzing trace with hash 710655878, now seen corresponding path program 1 times [2018-01-24 12:30:55,918 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:30:55,918 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:30:55,918 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:30:55,919 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:30:55,919 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:30:55,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:30:55,934 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:30:56,023 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-24 12:30:56,023 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:30:56,023 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 12:30:56,023 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 12:30:56,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 12:30:56,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:30:56,024 INFO L87 Difference]: Start difference. First operand 155 states and 164 transitions. Second operand 10 states. [2018-01-24 12:30:56,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:30:56,271 INFO L93 Difference]: Finished difference Result 155 states and 164 transitions. [2018-01-24 12:30:56,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:30:56,271 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-01-24 12:30:56,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:30:56,272 INFO L225 Difference]: With dead ends: 155 [2018-01-24 12:30:56,272 INFO L226 Difference]: Without dead ends: 153 [2018-01-24 12:30:56,272 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:30:56,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-01-24 12:30:56,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-01-24 12:30:56,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-01-24 12:30:56,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 162 transitions. [2018-01-24 12:30:56,287 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 162 transitions. Word has length 42 [2018-01-24 12:30:56,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:30:56,288 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 162 transitions. [2018-01-24 12:30:56,288 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 12:30:56,288 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 162 transitions. [2018-01-24 12:30:56,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-24 12:30:56,289 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:30:56,289 INFO L322 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:30:56,289 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-24 12:30:56,289 INFO L82 PathProgramCache]: Analyzing trace with hash 710655879, now seen corresponding path program 1 times [2018-01-24 12:30:56,289 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:30:56,289 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:30:56,290 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:30:56,290 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:30:56,290 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:30:56,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:30:56,307 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:30:56,374 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-24 12:30:56,374 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:30:56,374 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-24 12:30:56,381 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:30:56,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:30:56,410 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:30:56,427 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-24 12:30:56,447 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:30:56,447 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-01-24 12:30:56,447 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:30:56,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:30:56,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:30:56,448 INFO L87 Difference]: Start difference. First operand 153 states and 162 transitions. Second operand 8 states. [2018-01-24 12:30:56,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:30:56,484 INFO L93 Difference]: Finished difference Result 266 states and 282 transitions. [2018-01-24 12:30:56,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:30:56,484 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-01-24 12:30:56,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:30:56,486 INFO L225 Difference]: With dead ends: 266 [2018-01-24 12:30:56,486 INFO L226 Difference]: Without dead ends: 154 [2018-01-24 12:30:56,487 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:30:56,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-24 12:30:56,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-01-24 12:30:56,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-01-24 12:30:56,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 163 transitions. [2018-01-24 12:30:56,507 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 163 transitions. Word has length 42 [2018-01-24 12:30:56,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:30:56,507 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 163 transitions. [2018-01-24 12:30:56,507 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:30:56,507 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 163 transitions. [2018-01-24 12:30:56,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 12:30:56,508 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:30:56,508 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:30:56,508 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-24 12:30:56,509 INFO L82 PathProgramCache]: Analyzing trace with hash -495427355, now seen corresponding path program 1 times [2018-01-24 12:30:56,509 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:30:56,509 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:30:56,510 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:30:56,510 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:30:56,510 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:30:56,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:30:56,518 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:30:56,561 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-24 12:30:56,561 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:30:56,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:30:56,562 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:30:56,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:30:56,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:30:56,562 INFO L87 Difference]: Start difference. First operand 154 states and 163 transitions. Second operand 6 states. [2018-01-24 12:30:56,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:30:56,595 INFO L93 Difference]: Finished difference Result 158 states and 166 transitions. [2018-01-24 12:30:56,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:30:56,595 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-01-24 12:30:56,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:30:56,596 INFO L225 Difference]: With dead ends: 158 [2018-01-24 12:30:56,596 INFO L226 Difference]: Without dead ends: 138 [2018-01-24 12:30:56,597 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:30:56,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-01-24 12:30:56,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-01-24 12:30:56,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-01-24 12:30:56,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 145 transitions. [2018-01-24 12:30:56,615 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 145 transitions. Word has length 41 [2018-01-24 12:30:56,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:30:56,615 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 145 transitions. [2018-01-24 12:30:56,615 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:30:56,615 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 145 transitions. [2018-01-24 12:30:56,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-24 12:30:56,616 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:30:56,616 INFO L322 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:30:56,616 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-24 12:30:56,616 INFO L82 PathProgramCache]: Analyzing trace with hash -141638285, now seen corresponding path program 2 times [2018-01-24 12:30:56,616 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:30:56,617 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:30:56,617 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:30:56,618 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:30:56,618 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:30:56,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:30:56,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:30:56,686 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:30:56,686 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:30:56,686 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-24 12:30:56,694 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:30:56,712 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:30:56,715 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:30:56,718 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:30:56,723 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-24 12:30:56,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:30:56,740 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-24 12:30:56,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:30:56,756 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-24 12:30:56,756 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-24 12:30:57,278 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 12:30:57,298 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:30:57,300 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 22 [2018-01-24 12:30:57,300 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-24 12:30:57,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-24 12:30:57,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2018-01-24 12:30:57,301 INFO L87 Difference]: Start difference. First operand 138 states and 145 transitions. Second operand 22 states. [2018-01-24 12:30:59,379 WARN L143 SmtUtils]: Spent 2031ms on a formula simplification that was a NOOP. DAG size: 39 [2018-01-24 12:31:00,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:31:00,386 INFO L93 Difference]: Finished difference Result 249 states and 265 transitions. [2018-01-24 12:31:00,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-24 12:31:00,386 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 43 [2018-01-24 12:31:00,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:31:00,387 INFO L225 Difference]: With dead ends: 249 [2018-01-24 12:31:00,387 INFO L226 Difference]: Without dead ends: 137 [2018-01-24 12:31:00,387 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=147, Invalid=845, Unknown=0, NotChecked=0, Total=992 [2018-01-24 12:31:00,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-24 12:31:00,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-01-24 12:31:00,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-01-24 12:31:00,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 144 transitions. [2018-01-24 12:31:00,407 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 144 transitions. Word has length 43 [2018-01-24 12:31:00,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:31:00,408 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 144 transitions. [2018-01-24 12:31:00,408 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-24 12:31:00,408 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 144 transitions. [2018-01-24 12:31:00,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-24 12:31:00,409 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:31:00,409 INFO L322 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:31:00,409 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-24 12:31:00,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1517747909, now seen corresponding path program 1 times [2018-01-24 12:31:00,409 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:31:00,409 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:31:00,410 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:00,410 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:31:00,411 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:00,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:31:00,423 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:31:00,495 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-24 12:31:00,496 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:31:00,496 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 12:31:00,496 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:31:00,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:31:00,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:31:00,496 INFO L87 Difference]: Start difference. First operand 137 states and 144 transitions. Second operand 8 states. [2018-01-24 12:31:00,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:31:00,537 INFO L93 Difference]: Finished difference Result 225 states and 236 transitions. [2018-01-24 12:31:00,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:31:00,538 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-01-24 12:31:00,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:31:00,538 INFO L225 Difference]: With dead ends: 225 [2018-01-24 12:31:00,539 INFO L226 Difference]: Without dead ends: 137 [2018-01-24 12:31:00,539 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:31:00,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-24 12:31:00,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-01-24 12:31:00,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-01-24 12:31:00,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 143 transitions. [2018-01-24 12:31:00,556 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 143 transitions. Word has length 47 [2018-01-24 12:31:00,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:31:00,557 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 143 transitions. [2018-01-24 12:31:00,557 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:31:00,557 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 143 transitions. [2018-01-24 12:31:00,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-24 12:31:00,558 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:31:00,558 INFO L322 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:31:00,558 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-24 12:31:00,558 INFO L82 PathProgramCache]: Analyzing trace with hash 2035822852, now seen corresponding path program 1 times [2018-01-24 12:31:00,558 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:31:00,558 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:31:00,559 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:00,559 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:31:00,559 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:00,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:31:00,571 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:31:00,630 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-24 12:31:00,630 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:31:00,630 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 12:31:00,630 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 12:31:00,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 12:31:00,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:31:00,631 INFO L87 Difference]: Start difference. First operand 137 states and 143 transitions. Second operand 10 states. [2018-01-24 12:31:00,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:31:00,701 INFO L93 Difference]: Finished difference Result 227 states and 237 transitions. [2018-01-24 12:31:00,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:31:00,701 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2018-01-24 12:31:00,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:31:00,702 INFO L225 Difference]: With dead ends: 227 [2018-01-24 12:31:00,702 INFO L226 Difference]: Without dead ends: 137 [2018-01-24 12:31:00,702 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:31:00,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-24 12:31:00,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-01-24 12:31:00,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-01-24 12:31:00,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 142 transitions. [2018-01-24 12:31:00,715 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 142 transitions. Word has length 52 [2018-01-24 12:31:00,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:31:00,715 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 142 transitions. [2018-01-24 12:31:00,715 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 12:31:00,715 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 142 transitions. [2018-01-24 12:31:00,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-24 12:31:00,716 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:31:00,716 INFO L322 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:31:00,716 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-24 12:31:00,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1511828740, now seen corresponding path program 1 times [2018-01-24 12:31:00,716 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:31:00,717 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:31:00,717 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:00,717 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:31:00,717 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:00,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:31:00,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:31:00,854 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-24 12:31:00,854 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:31:00,854 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-24 12:31:00,854 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 12:31:00,854 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 12:31:00,854 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:31:00,855 INFO L87 Difference]: Start difference. First operand 137 states and 142 transitions. Second operand 13 states. [2018-01-24 12:31:01,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:31:01,126 INFO L93 Difference]: Finished difference Result 137 states and 142 transitions. [2018-01-24 12:31:01,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 12:31:01,127 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 63 [2018-01-24 12:31:01,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:31:01,128 INFO L225 Difference]: With dead ends: 137 [2018-01-24 12:31:01,128 INFO L226 Difference]: Without dead ends: 135 [2018-01-24 12:31:01,128 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-01-24 12:31:01,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-24 12:31:01,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-01-24 12:31:01,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-24 12:31:01,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 140 transitions. [2018-01-24 12:31:01,149 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 140 transitions. Word has length 63 [2018-01-24 12:31:01,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:31:01,150 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 140 transitions. [2018-01-24 12:31:01,150 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 12:31:01,150 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 140 transitions. [2018-01-24 12:31:01,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-24 12:31:01,151 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:31:01,151 INFO L322 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:31:01,151 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-24 12:31:01,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1511828741, now seen corresponding path program 1 times [2018-01-24 12:31:01,151 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:31:01,151 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:31:01,152 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:01,152 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:31:01,153 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:01,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:31:01,172 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:31:01,258 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-24 12:31:01,258 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:31:01,258 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-24 12:31:01,271 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:31:01,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:31:01,310 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:31:01,323 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-24 12:31:01,344 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:31:01,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-01-24 12:31:01,344 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 12:31:01,344 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 12:31:01,344 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:31:01,345 INFO L87 Difference]: Start difference. First operand 135 states and 140 transitions. Second operand 10 states. [2018-01-24 12:31:01,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:31:01,408 INFO L93 Difference]: Finished difference Result 244 states and 254 transitions. [2018-01-24 12:31:01,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:31:01,409 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2018-01-24 12:31:01,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:31:01,409 INFO L225 Difference]: With dead ends: 244 [2018-01-24 12:31:01,410 INFO L226 Difference]: Without dead ends: 136 [2018-01-24 12:31:01,410 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:31:01,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-01-24 12:31:01,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-01-24 12:31:01,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-01-24 12:31:01,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 141 transitions. [2018-01-24 12:31:01,424 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 141 transitions. Word has length 63 [2018-01-24 12:31:01,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:31:01,424 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 141 transitions. [2018-01-24 12:31:01,424 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 12:31:01,424 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 141 transitions. [2018-01-24 12:31:01,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-24 12:31:01,425 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:31:01,425 INFO L322 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:31:01,425 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-24 12:31:01,426 INFO L82 PathProgramCache]: Analyzing trace with hash 2058801817, now seen corresponding path program 2 times [2018-01-24 12:31:01,426 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:31:01,426 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:31:01,426 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:01,427 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:31:01,427 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:01,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:31:01,441 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:31:01,628 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:31:01,628 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:31:01,628 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-24 12:31:01,638 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:31:01,669 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:31:01,682 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:31:01,688 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:31:01,701 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-24 12:31:01,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:31:01,799 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-24 12:31:01,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:31:01,866 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-24 12:31:01,866 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-24 12:31:02,657 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-01-24 12:31:02,677 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:31:02,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [10] total 27 [2018-01-24 12:31:02,678 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-24 12:31:02,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-24 12:31:02,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2018-01-24 12:31:02,678 INFO L87 Difference]: Start difference. First operand 136 states and 141 transitions. Second operand 27 states. [2018-01-24 12:31:04,824 WARN L143 SmtUtils]: Spent 2022ms on a formula simplification that was a NOOP. DAG size: 31 [2018-01-24 12:31:05,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:31:05,982 INFO L93 Difference]: Finished difference Result 243 states and 255 transitions. [2018-01-24 12:31:05,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-24 12:31:05,983 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 64 [2018-01-24 12:31:05,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:31:05,984 INFO L225 Difference]: With dead ends: 243 [2018-01-24 12:31:05,984 INFO L226 Difference]: Without dead ends: 135 [2018-01-24 12:31:05,985 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=213, Invalid=1347, Unknown=0, NotChecked=0, Total=1560 [2018-01-24 12:31:05,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-24 12:31:06,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-01-24 12:31:06,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-24 12:31:06,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 140 transitions. [2018-01-24 12:31:06,007 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 140 transitions. Word has length 64 [2018-01-24 12:31:06,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:31:06,007 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 140 transitions. [2018-01-24 12:31:06,007 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-24 12:31:06,007 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 140 transitions. [2018-01-24 12:31:06,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-24 12:31:06,008 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:31:06,008 INFO L322 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:31:06,009 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-24 12:31:06,009 INFO L82 PathProgramCache]: Analyzing trace with hash -243629328, now seen corresponding path program 1 times [2018-01-24 12:31:06,009 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:31:06,009 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:31:06,010 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:06,010 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:31:06,010 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:06,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:31:06,029 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:31:06,182 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-24 12:31:06,182 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:31:06,182 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-24 12:31:06,183 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 12:31:06,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 12:31:06,183 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:31:06,183 INFO L87 Difference]: Start difference. First operand 135 states and 140 transitions. Second operand 11 states. [2018-01-24 12:31:06,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:31:06,357 INFO L93 Difference]: Finished difference Result 197 states and 205 transitions. [2018-01-24 12:31:06,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 12:31:06,357 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2018-01-24 12:31:06,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:31:06,359 INFO L225 Difference]: With dead ends: 197 [2018-01-24 12:31:06,359 INFO L226 Difference]: Without dead ends: 135 [2018-01-24 12:31:06,359 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-01-24 12:31:06,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-24 12:31:06,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-01-24 12:31:06,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-24 12:31:06,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2018-01-24 12:31:06,380 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 74 [2018-01-24 12:31:06,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:31:06,381 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2018-01-24 12:31:06,381 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 12:31:06,381 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2018-01-24 12:31:06,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-24 12:31:06,382 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:31:06,382 INFO L322 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:31:06,382 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-24 12:31:06,383 INFO L82 PathProgramCache]: Analyzing trace with hash 254396120, now seen corresponding path program 1 times [2018-01-24 12:31:06,383 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:31:06,383 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:31:06,384 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:06,384 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:31:06,384 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:06,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:31:06,407 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:31:06,663 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-24 12:31:06,663 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:31:06,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-01-24 12:31:06,663 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 12:31:06,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 12:31:06,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-01-24 12:31:06,664 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand 18 states. [2018-01-24 12:31:07,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:31:07,147 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2018-01-24 12:31:07,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 12:31:07,148 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2018-01-24 12:31:07,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:31:07,149 INFO L225 Difference]: With dead ends: 165 [2018-01-24 12:31:07,149 INFO L226 Difference]: Without dead ends: 163 [2018-01-24 12:31:07,150 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2018-01-24 12:31:07,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-01-24 12:31:07,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 158. [2018-01-24 12:31:07,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-01-24 12:31:07,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 170 transitions. [2018-01-24 12:31:07,167 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 170 transitions. Word has length 87 [2018-01-24 12:31:07,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:31:07,167 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 170 transitions. [2018-01-24 12:31:07,167 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-24 12:31:07,167 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 170 transitions. [2018-01-24 12:31:07,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-24 12:31:07,168 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:31:07,168 INFO L322 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:31:07,168 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-24 12:31:07,168 INFO L82 PathProgramCache]: Analyzing trace with hash 254396121, now seen corresponding path program 1 times [2018-01-24 12:31:07,168 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:31:07,168 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:31:07,169 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:07,169 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:31:07,169 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:07,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:31:07,187 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:31:07,450 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-24 12:31:07,451 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:31:07,478 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-24 12:31:07,483 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:31:07,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:31:07,545 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:31:07,657 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-24 12:31:07,679 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:31:07,679 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-01-24 12:31:07,679 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 12:31:07,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 12:31:07,680 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-01-24 12:31:07,680 INFO L87 Difference]: Start difference. First operand 158 states and 170 transitions. Second operand 12 states. [2018-01-24 12:31:07,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:31:07,738 INFO L93 Difference]: Finished difference Result 288 states and 312 transitions. [2018-01-24 12:31:07,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 12:31:07,740 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 87 [2018-01-24 12:31:07,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:31:07,740 INFO L225 Difference]: With dead ends: 288 [2018-01-24 12:31:07,741 INFO L226 Difference]: Without dead ends: 159 [2018-01-24 12:31:07,741 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:31:07,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-01-24 12:31:07,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-01-24 12:31:07,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-01-24 12:31:07,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 171 transitions. [2018-01-24 12:31:07,760 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 171 transitions. Word has length 87 [2018-01-24 12:31:07,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:31:07,760 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 171 transitions. [2018-01-24 12:31:07,760 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 12:31:07,760 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 171 transitions. [2018-01-24 12:31:07,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-01-24 12:31:07,761 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:31:07,761 INFO L322 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:31:07,761 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-24 12:31:07,761 INFO L82 PathProgramCache]: Analyzing trace with hash -388927379, now seen corresponding path program 2 times [2018-01-24 12:31:07,762 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:31:07,762 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:31:07,762 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:07,762 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:31:07,762 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:31:07,779 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:31:07,945 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:31:07,945 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:31:07,946 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-24 12:31:07,952 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:31:08,002 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:31:08,011 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:31:08,018 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:31:08,027 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-24 12:31:08,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:31:08,048 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-24 12:31:08,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:31:08,064 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-24 12:31:08,064 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-24 12:31:10,243 WARN L143 SmtUtils]: Spent 2013ms on a formula simplification that was a NOOP. DAG size: 21 [2018-01-24 12:31:11,012 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-01-24 12:31:11,044 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:31:11,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [12] total 31 [2018-01-24 12:31:11,044 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-24 12:31:11,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-24 12:31:11,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=804, Unknown=0, NotChecked=0, Total=930 [2018-01-24 12:31:11,045 INFO L87 Difference]: Start difference. First operand 159 states and 171 transitions. Second operand 31 states. [2018-01-24 12:31:13,168 WARN L143 SmtUtils]: Spent 2039ms on a formula simplification that was a NOOP. DAG size: 39 [2018-01-24 12:31:15,558 WARN L143 SmtUtils]: Spent 2023ms on a formula simplification that was a NOOP. DAG size: 35 [2018-01-24 12:31:16,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:31:16,765 INFO L93 Difference]: Finished difference Result 287 states and 313 transitions. [2018-01-24 12:31:16,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-24 12:31:16,765 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 88 [2018-01-24 12:31:16,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:31:16,766 INFO L225 Difference]: With dead ends: 287 [2018-01-24 12:31:16,766 INFO L226 Difference]: Without dead ends: 158 [2018-01-24 12:31:16,767 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=286, Invalid=1876, Unknown=0, NotChecked=0, Total=2162 [2018-01-24 12:31:16,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-01-24 12:31:16,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-01-24 12:31:16,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-01-24 12:31:16,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 168 transitions. [2018-01-24 12:31:16,801 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 168 transitions. Word has length 88 [2018-01-24 12:31:16,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:31:16,802 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 168 transitions. [2018-01-24 12:31:16,802 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-24 12:31:16,802 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 168 transitions. [2018-01-24 12:31:16,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-01-24 12:31:16,804 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:31:16,804 INFO L322 BasicCegarLoop]: trace histogram [9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:31:16,804 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-24 12:31:16,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1868073210, now seen corresponding path program 1 times [2018-01-24 12:31:16,804 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:31:16,804 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:31:16,805 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:16,806 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:31:16,806 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:16,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:31:16,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:31:16,989 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-01-24 12:31:16,989 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:31:16,990 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-24 12:31:17,001 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:31:17,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:31:17,063 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:31:17,296 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 12:31:17,317 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:31:17,317 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 22 [2018-01-24 12:31:17,318 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-24 12:31:17,318 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-24 12:31:17,318 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-01-24 12:31:17,318 INFO L87 Difference]: Start difference. First operand 158 states and 168 transitions. Second operand 22 states. [2018-01-24 12:31:17,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:31:17,486 INFO L93 Difference]: Finished difference Result 287 states and 305 transitions. [2018-01-24 12:31:17,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-24 12:31:17,487 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 92 [2018-01-24 12:31:17,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:31:17,488 INFO L225 Difference]: With dead ends: 287 [2018-01-24 12:31:17,488 INFO L226 Difference]: Without dead ends: 156 [2018-01-24 12:31:17,489 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2018-01-24 12:31:17,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-24 12:31:17,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-01-24 12:31:17,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-01-24 12:31:17,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 162 transitions. [2018-01-24 12:31:17,528 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 162 transitions. Word has length 92 [2018-01-24 12:31:17,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:31:17,528 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 162 transitions. [2018-01-24 12:31:17,529 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-24 12:31:17,529 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 162 transitions. [2018-01-24 12:31:17,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-01-24 12:31:17,529 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:31:17,530 INFO L322 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:31:17,530 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-24 12:31:17,530 INFO L82 PathProgramCache]: Analyzing trace with hash -63866368, now seen corresponding path program 1 times [2018-01-24 12:31:17,530 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:31:17,530 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:31:17,531 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:17,531 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:31:17,531 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:17,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:31:17,552 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:31:17,945 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-01-24 12:31:17,945 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:31:17,945 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-01-24 12:31:17,945 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 12:31:17,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 12:31:17,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-01-24 12:31:17,946 INFO L87 Difference]: Start difference. First operand 156 states and 162 transitions. Second operand 21 states. [2018-01-24 12:31:18,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:31:18,343 INFO L93 Difference]: Finished difference Result 168 states and 178 transitions. [2018-01-24 12:31:18,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-24 12:31:18,367 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 104 [2018-01-24 12:31:18,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:31:18,368 INFO L225 Difference]: With dead ends: 168 [2018-01-24 12:31:18,368 INFO L226 Difference]: Without dead ends: 166 [2018-01-24 12:31:18,369 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2018-01-24 12:31:18,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-01-24 12:31:18,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2018-01-24 12:31:18,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-01-24 12:31:18,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 172 transitions. [2018-01-24 12:31:18,391 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 172 transitions. Word has length 104 [2018-01-24 12:31:18,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:31:18,392 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 172 transitions. [2018-01-24 12:31:18,392 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-24 12:31:18,392 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 172 transitions. [2018-01-24 12:31:18,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-01-24 12:31:18,393 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:31:18,393 INFO L322 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:31:18,393 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-24 12:31:18,394 INFO L82 PathProgramCache]: Analyzing trace with hash -63866367, now seen corresponding path program 1 times [2018-01-24 12:31:18,394 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:31:18,394 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:31:18,395 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:18,395 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:31:18,395 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:31:18,424 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:31:18,643 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:31:18,643 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:31:18,643 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-24 12:31:18,653 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:31:18,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:31:18,721 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:31:18,839 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:31:18,860 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:31:18,861 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-01-24 12:31:18,861 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 12:31:18,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 12:31:18,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-01-24 12:31:18,862 INFO L87 Difference]: Start difference. First operand 162 states and 172 transitions. Second operand 15 states. [2018-01-24 12:31:18,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:31:18,990 INFO L93 Difference]: Finished difference Result 293 states and 313 transitions. [2018-01-24 12:31:18,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 12:31:18,991 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 104 [2018-01-24 12:31:18,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:31:18,992 INFO L225 Difference]: With dead ends: 293 [2018-01-24 12:31:18,992 INFO L226 Difference]: Without dead ends: 163 [2018-01-24 12:31:18,993 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=143, Unknown=0, NotChecked=0, Total=240 [2018-01-24 12:31:18,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-01-24 12:31:19,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-01-24 12:31:19,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-01-24 12:31:19,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 173 transitions. [2018-01-24 12:31:19,014 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 173 transitions. Word has length 104 [2018-01-24 12:31:19,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:31:19,015 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 173 transitions. [2018-01-24 12:31:19,015 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 12:31:19,015 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 173 transitions. [2018-01-24 12:31:19,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-01-24 12:31:19,015 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:31:19,016 INFO L322 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:31:19,016 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-24 12:31:19,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1207457043, now seen corresponding path program 2 times [2018-01-24 12:31:19,016 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:31:19,016 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:31:19,017 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:19,017 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:31:19,017 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:19,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:31:19,037 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:31:19,213 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-24 12:31:19,213 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:31:19,213 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-24 12:31:19,220 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:31:19,263 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:31:19,269 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:31:19,276 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:31:19,281 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-24 12:31:19,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:31:19,307 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-24 12:31:19,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:31:19,319 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-24 12:31:19,319 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-24 12:31:20,420 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-24 12:31:20,440 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:31:20,440 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [15] total 38 [2018-01-24 12:31:20,441 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-24 12:31:20,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-24 12:31:20,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1228, Unknown=0, NotChecked=0, Total=1406 [2018-01-24 12:31:20,441 INFO L87 Difference]: Start difference. First operand 163 states and 173 transitions. Second operand 38 states. [2018-01-24 12:31:22,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:31:22,479 INFO L93 Difference]: Finished difference Result 292 states and 314 transitions. [2018-01-24 12:31:22,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-01-24 12:31:22,479 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 105 [2018-01-24 12:31:22,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:31:22,480 INFO L225 Difference]: With dead ends: 292 [2018-01-24 12:31:22,480 INFO L226 Difference]: Without dead ends: 162 [2018-01-24 12:31:22,481 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 78 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=425, Invalid=2997, Unknown=0, NotChecked=0, Total=3422 [2018-01-24 12:31:22,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-01-24 12:31:22,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-01-24 12:31:22,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-01-24 12:31:22,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 171 transitions. [2018-01-24 12:31:22,509 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 171 transitions. Word has length 105 [2018-01-24 12:31:22,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:31:22,509 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 171 transitions. [2018-01-24 12:31:22,509 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-01-24 12:31:22,509 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 171 transitions. [2018-01-24 12:31:22,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-01-24 12:31:22,510 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:31:22,510 INFO L322 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:31:22,510 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-24 12:31:22,511 INFO L82 PathProgramCache]: Analyzing trace with hash 2055534530, now seen corresponding path program 1 times [2018-01-24 12:31:22,511 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:31:22,511 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:31:22,511 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:22,511 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:31:22,512 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:22,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:31:22,539 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:31:22,771 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:31:22,771 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:31:22,771 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-24 12:31:22,778 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:31:22,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:31:22,843 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:31:22,862 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:31:22,883 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:31:22,883 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-01-24 12:31:22,883 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 12:31:22,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 12:31:22,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-01-24 12:31:22,884 INFO L87 Difference]: Start difference. First operand 162 states and 171 transitions. Second operand 17 states. [2018-01-24 12:31:22,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:31:22,934 INFO L93 Difference]: Finished difference Result 291 states and 309 transitions. [2018-01-24 12:31:22,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 12:31:22,935 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 110 [2018-01-24 12:31:22,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:31:22,935 INFO L225 Difference]: With dead ends: 291 [2018-01-24 12:31:22,936 INFO L226 Difference]: Without dead ends: 163 [2018-01-24 12:31:22,936 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=180, Unknown=0, NotChecked=0, Total=306 [2018-01-24 12:31:22,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-01-24 12:31:22,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-01-24 12:31:22,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-01-24 12:31:22,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 172 transitions. [2018-01-24 12:31:22,981 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 172 transitions. Word has length 110 [2018-01-24 12:31:22,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:31:22,981 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 172 transitions. [2018-01-24 12:31:22,981 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 12:31:22,981 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 172 transitions. [2018-01-24 12:31:22,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-01-24 12:31:22,982 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:31:22,982 INFO L322 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:31:22,983 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-24 12:31:22,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1832241070, now seen corresponding path program 2 times [2018-01-24 12:31:22,983 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:31:22,983 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:31:22,984 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:22,984 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:31:22,984 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:31:23,015 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:31:23,201 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-24 12:31:23,201 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:31:23,201 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-24 12:31:23,206 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:31:23,246 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:31:23,254 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:31:23,261 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:31:23,328 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-24 12:31:23,329 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-24 12:31:23,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:31:23,331 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:31:23,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:31:23,332 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-01-24 12:31:23,415 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-24 12:31:23,417 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-24 12:31:23,439 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-24 12:31:23,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:26 [2018-01-24 12:31:23,442 WARN L1029 $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-24 12:31:23,448 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-24 12:31:23,450 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:31:23,453 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-24 12:31:23,456 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:31:23,457 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:31:23,460 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-24 12:31:23,461 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:31:23,475 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:31:23,477 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:31:23,484 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-24 12:31:23,484 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:37, output treesize:9 [2018-01-24 12:31:23,873 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:31:23,873 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-24 12:31:23,876 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:31:23,876 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:31:23,877 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-24 12:31:23,877 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:31:23,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:31:23,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:31:23,883 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:13 [2018-01-24 12:31:24,288 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-24 12:31:24,289 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-24 12:31:24,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:31:24,290 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:31:24,291 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-24 12:31:24,291 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-01-24 12:31:24,335 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-24 12:31:24,355 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:31:24,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [41] imperfect sequences [17] total 56 [2018-01-24 12:31:24,356 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-01-24 12:31:24,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-01-24 12:31:24,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=2761, Unknown=1, NotChecked=106, Total=3080 [2018-01-24 12:31:24,357 INFO L87 Difference]: Start difference. First operand 163 states and 172 transitions. Second operand 56 states. [2018-01-24 12:31:26,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:31:26,535 INFO L93 Difference]: Finished difference Result 285 states and 301 transitions. [2018-01-24 12:31:26,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-01-24 12:31:26,535 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 111 [2018-01-24 12:31:26,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:31:26,536 INFO L225 Difference]: With dead ends: 285 [2018-01-24 12:31:26,537 INFO L226 Difference]: Without dead ends: 157 [2018-01-24 12:31:26,539 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1026 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=325, Invalid=5530, Unknown=1, NotChecked=150, Total=6006 [2018-01-24 12:31:26,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-01-24 12:31:26,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-01-24 12:31:26,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-01-24 12:31:26,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 160 transitions. [2018-01-24 12:31:26,584 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 160 transitions. Word has length 111 [2018-01-24 12:31:26,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:31:26,584 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 160 transitions. [2018-01-24 12:31:26,584 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-01-24 12:31:26,584 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 160 transitions. [2018-01-24 12:31:26,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-01-24 12:31:26,585 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:31:26,585 INFO L322 BasicCegarLoop]: trace histogram [14, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:31:26,585 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-24 12:31:26,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1142789455, now seen corresponding path program 1 times [2018-01-24 12:31:26,586 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:31:26,586 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:31:26,587 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:26,587 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:31:26,587 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:26,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:31:26,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:31:26,924 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-01-24 12:31:26,925 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:31:26,925 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-24 12:31:26,931 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:31:27,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:31:27,018 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:31:27,322 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-01-24 12:31:27,355 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:31:27,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2018-01-24 12:31:27,355 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-24 12:31:27,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-24 12:31:27,356 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1016, Unknown=0, NotChecked=0, Total=1190 [2018-01-24 12:31:27,356 INFO L87 Difference]: Start difference. First operand 157 states and 160 transitions. Second operand 35 states. [2018-01-24 12:31:28,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:31:28,300 INFO L93 Difference]: Finished difference Result 288 states and 295 transitions. [2018-01-24 12:31:28,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-24 12:31:28,301 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 119 [2018-01-24 12:31:28,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:31:28,302 INFO L225 Difference]: With dead ends: 288 [2018-01-24 12:31:28,302 INFO L226 Difference]: Without dead ends: 167 [2018-01-24 12:31:28,303 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=521, Invalid=3639, Unknown=0, NotChecked=0, Total=4160 [2018-01-24 12:31:28,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-01-24 12:31:28,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-01-24 12:31:28,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-01-24 12:31:28,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 168 transitions. [2018-01-24 12:31:28,331 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 168 transitions. Word has length 119 [2018-01-24 12:31:28,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:31:28,331 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 168 transitions. [2018-01-24 12:31:28,331 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-24 12:31:28,332 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 168 transitions. [2018-01-24 12:31:28,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-01-24 12:31:28,332 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:31:28,332 INFO L322 BasicCegarLoop]: trace histogram [15, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:31:28,332 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-24 12:31:28,333 INFO L82 PathProgramCache]: Analyzing trace with hash -577478985, now seen corresponding path program 1 times [2018-01-24 12:31:28,333 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:31:28,333 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:31:28,333 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:28,334 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:31:28,334 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:31:28,361 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:31:28,699 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-01-24 12:31:28,699 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:31:28,712 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-24 12:31:28,719 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:31:28,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:31:28,783 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:31:29,085 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-24 12:31:29,106 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:31:29,106 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 39 [2018-01-24 12:31:29,106 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-24 12:31:29,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-24 12:31:29,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1287, Unknown=0, NotChecked=0, Total=1482 [2018-01-24 12:31:29,107 INFO L87 Difference]: Start difference. First operand 165 states and 168 transitions. Second operand 39 states. [2018-01-24 12:31:30,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:31:30,517 INFO L93 Difference]: Finished difference Result 295 states and 302 transitions. [2018-01-24 12:31:30,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-01-24 12:31:30,518 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 134 [2018-01-24 12:31:30,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:31:30,518 INFO L225 Difference]: With dead ends: 295 [2018-01-24 12:31:30,518 INFO L226 Difference]: Without dead ends: 167 [2018-01-24 12:31:30,520 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=595, Invalid=4807, Unknown=0, NotChecked=0, Total=5402 [2018-01-24 12:31:30,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-01-24 12:31:30,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-01-24 12:31:30,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-01-24 12:31:30,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 168 transitions. [2018-01-24 12:31:30,549 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 168 transitions. Word has length 134 [2018-01-24 12:31:30,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:31:30,549 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 168 transitions. [2018-01-24 12:31:30,549 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-24 12:31:30,549 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 168 transitions. [2018-01-24 12:31:30,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-01-24 12:31:30,549 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:31:30,550 INFO L322 BasicCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:31:30,550 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-24 12:31:30,550 INFO L82 PathProgramCache]: Analyzing trace with hash -460832411, now seen corresponding path program 1 times [2018-01-24 12:31:30,550 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:31:30,550 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:31:30,551 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:30,551 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:31:30,551 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:31:30,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:31:30,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-01-24 12:31:32,506 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 12:31:32,512 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 12:31:32,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:31:32 BoogieIcfgContainer [2018-01-24 12:31:32,513 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:31:32,514 INFO L168 Benchmark]: Toolchain (without parser) took 52351.56 ms. Allocated memory was 307.2 MB in the beginning and 878.7 MB in the end (delta: 571.5 MB). Free memory was 266.3 MB in the beginning and 769.8 MB in the end (delta: -503.5 MB). Peak memory consumption was 67.9 MB. Max. memory is 5.3 GB. [2018-01-24 12:31:32,515 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 307.2 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:31:32,515 INFO L168 Benchmark]: CACSL2BoogieTranslator took 232.53 ms. Allocated memory is still 307.2 MB. Free memory was 266.3 MB in the beginning and 252.1 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 5.3 GB. [2018-01-24 12:31:32,516 INFO L168 Benchmark]: Boogie Preprocessor took 42.57 ms. Allocated memory is still 307.2 MB. Free memory was 252.1 MB in the beginning and 250.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:31:32,516 INFO L168 Benchmark]: RCFGBuilder took 499.04 ms. Allocated memory is still 307.2 MB. Free memory was 250.1 MB in the beginning and 215.3 MB in the end (delta: 34.8 MB). Peak memory consumption was 34.8 MB. Max. memory is 5.3 GB. [2018-01-24 12:31:32,516 INFO L168 Benchmark]: TraceAbstraction took 51537.32 ms. Allocated memory was 307.2 MB in the beginning and 878.7 MB in the end (delta: 571.5 MB). Free memory was 215.3 MB in the beginning and 769.8 MB in the end (delta: -554.5 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:31:32,518 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 307.2 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 232.53 ms. Allocated memory is still 307.2 MB. Free memory was 266.3 MB in the beginning and 252.1 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.57 ms. Allocated memory is still 307.2 MB. Free memory was 252.1 MB in the beginning and 250.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 499.04 ms. Allocated memory is still 307.2 MB. Free memory was 250.1 MB in the beginning and 215.3 MB in the end (delta: 34.8 MB). Peak memory consumption was 34.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 51537.32 ms. Allocated memory was 307.2 MB in the beginning and 878.7 MB in the end (delta: 571.5 MB). Free memory was 215.3 MB in the beginning and 769.8 MB in the end (delta: -554.5 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1294). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1294). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1411). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1411). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1265). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1265). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1267). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1267). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1256). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1256). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1258). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1258). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1339). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1339). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1443]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1443). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1099). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1100). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1100). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1099). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 143 locations, 23 error locations. TIMEOUT Result, 51.4s OverallTime, 32 OverallIterations, 16 TraceHistogramMax, 31.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3830 SDtfs, 1260 SDslu, 33974 SDs, 0 SdLazy, 16437 SolverSat, 389 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1762 GetRequests, 1105 SyntacticMatches, 11 SemanticMatches, 646 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4246 ImplicationChecksByTransitivity, 33.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=165occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 31 MinimizatonAttempts, 59 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 15.2s InterpolantComputationTime, 3201 NumberOfCodeBlocks, 3157 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 3155 ConstructedInterpolants, 273 QuantifiedInterpolants, 1039597 SizeOfPredicates, 112 NumberOfNonLiveVariables, 5731 ConjunctsInSsa, 560 ConjunctsInUnsatCore, 46 InterpolantComputations, 22 PerfectInterpolantSequences, 706/1588 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-31-32-526.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_12-31-32-526.csv Completed graceful shutdown