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_Taipan+AI_EQ_smtcomp.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_3_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 06:11:02,990 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 06:11:02,992 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 06:11:03,008 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 06:11:03,008 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 06:11:03,009 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 06:11:03,010 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 06:11:03,012 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 06:11:03,013 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 06:11:03,014 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 06:11:03,015 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 06:11:03,015 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 06:11:03,015 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 06:11:03,016 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 06:11:03,017 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 06:11:03,019 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 06:11:03,021 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 06:11:03,023 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 06:11:03,025 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 06:11:03,026 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 06:11:03,028 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 06:11:03,029 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 06:11:03,029 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 06:11:03,030 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 06:11:03,031 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 06:11:03,032 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 06:11:03,032 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 06:11:03,033 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 06:11:03,033 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 06:11:03,033 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 06:11:03,034 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 06:11:03,034 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf [2018-01-25 06:11:03,044 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 06:11:03,045 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 06:11:03,045 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 06:11:03,046 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 06:11:03,046 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 06:11:03,046 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 06:11:03,046 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 06:11:03,046 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 06:11:03,047 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 06:11:03,047 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 06:11:03,048 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 06:11:03,048 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 06:11:03,048 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 06:11:03,048 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 06:11:03,048 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 06:11:03,049 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 06:11:03,049 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 06:11:03,049 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 06:11:03,049 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 06:11:03,049 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 06:11:03,050 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 06:11:03,050 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 06:11:03,050 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 06:11:03,050 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 06:11:03,050 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 06:11:03,051 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 06:11:03,051 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 06:11:03,051 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 06:11:03,051 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 06:11:03,051 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 06:11:03,052 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 06:11:03,052 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 06:11:03,052 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 06:11:03,052 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 06:11:03,053 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 06:11:03,053 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 06:11:03,088 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 06:11:03,102 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 06:11:03,106 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 06:11:03,108 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 06:11:03,109 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 06:11:03,109 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_3_true-valid-memsafety_true-termination.i [2018-01-25 06:11:03,304 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 06:11:03,310 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 06:11:03,311 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 06:11:03,312 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 06:11:03,318 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 06:11:03,319 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:11:03" (1/1) ... [2018-01-25 06:11:03,322 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71d0b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:11:03, skipping insertion in model container [2018-01-25 06:11:03,322 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:11:03" (1/1) ... [2018-01-25 06:11:03,335 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:11:03,383 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:11:03,510 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:11:03,533 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:11:03,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:11:03 WrapperNode [2018-01-25 06:11:03,548 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 06:11:03,549 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 06:11:03,549 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 06:11:03,550 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 06:11:03,564 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:11:03" (1/1) ... [2018-01-25 06:11:03,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:11:03" (1/1) ... [2018-01-25 06:11:03,576 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:11:03" (1/1) ... [2018-01-25 06:11:03,576 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:11:03" (1/1) ... [2018-01-25 06:11:03,584 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:11:03" (1/1) ... [2018-01-25 06:11:03,588 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:11:03" (1/1) ... [2018-01-25 06:11:03,589 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:11:03" (1/1) ... [2018-01-25 06:11:03,592 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 06:11:03,593 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 06:11:03,593 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 06:11:03,593 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 06:11:03,594 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:11:03" (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-25 06:11:03,638 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 06:11:03,638 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 06:11:03,638 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-01-25 06:11:03,639 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-25 06:11:03,639 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-01-25 06:11:03,639 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2018-01-25 06:11:03,639 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-01-25 06:11:03,639 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-01-25 06:11:03,639 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-01-25 06:11:03,640 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2018-01-25 06:11:03,640 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-01-25 06:11:03,640 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-01-25 06:11:03,640 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-01-25 06:11:03,640 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-01-25 06:11:03,640 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2018-01-25 06:11:03,640 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-01-25 06:11:03,641 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-01-25 06:11:03,641 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-01-25 06:11:03,641 INFO L136 BoogieDeclarations]: Found implementation of procedure f_22_get [2018-01-25 06:11:03,641 INFO L136 BoogieDeclarations]: Found implementation of procedure f_22_put [2018-01-25 06:11:03,641 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-25 06:11:03,641 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 06:11:03,642 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 06:11:03,642 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 06:11:03,642 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 06:11:03,642 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 06:11:03,643 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 06:11:03,643 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 06:11:03,643 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 06:11:03,643 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-25 06:11:03,643 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-25 06:11:03,643 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 06:11:03,643 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 06:11:03,644 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 06:11:03,644 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-25 06:11:03,644 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-25 06:11:03,644 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-01-25 06:11:03,644 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2018-01-25 06:11:03,644 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-01-25 06:11:03,645 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-01-25 06:11:03,645 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-01-25 06:11:03,645 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-01-25 06:11:03,645 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2018-01-25 06:11:03,645 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-01-25 06:11:03,645 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-01-25 06:11:03,645 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-01-25 06:11:03,645 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-01-25 06:11:03,646 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2018-01-25 06:11:03,646 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-01-25 06:11:03,646 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-01-25 06:11:03,646 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-01-25 06:11:03,646 INFO L128 BoogieDeclarations]: Found specification of procedure f_22_get [2018-01-25 06:11:03,646 INFO L128 BoogieDeclarations]: Found specification of procedure f_22_put [2018-01-25 06:11:03,646 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-25 06:11:03,646 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 06:11:03,647 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 06:11:03,647 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 06:11:03,918 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-25 06:11:04,102 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 06:11:04,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:11:04 BoogieIcfgContainer [2018-01-25 06:11:04,103 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 06:11:04,104 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 06:11:04,104 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 06:11:04,107 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 06:11:04,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 06:11:03" (1/3) ... [2018-01-25 06:11:04,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@620aecce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:11:04, skipping insertion in model container [2018-01-25 06:11:04,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:11:03" (2/3) ... [2018-01-25 06:11:04,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@620aecce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:11:04, skipping insertion in model container [2018-01-25 06:11:04,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:11:04" (3/3) ... [2018-01-25 06:11:04,111 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test22_3_true-valid-memsafety_true-termination.i [2018-01-25 06:11:04,119 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 06:11:04,125 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-01-25 06:11:04,177 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 06:11:04,177 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 06:11:04,177 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 06:11:04,177 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 06:11:04,178 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 06:11:04,178 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 06:11:04,178 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 06:11:04,178 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 06:11:04,179 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 06:11:04,202 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2018-01-25 06:11:04,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 06:11:04,208 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:11:04,209 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:11:04,209 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-25 06:11:04,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1245228870, now seen corresponding path program 1 times [2018-01-25 06:11:04,217 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:11:04,273 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:04,273 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:04,273 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:04,274 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:11:04,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:04,337 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:11:04,517 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-25 06:11:04,520 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:11:04,520 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:11:04,520 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:11:04,523 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:11:04,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:11:04,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:11:04,541 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 5 states. [2018-01-25 06:11:04,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:11:04,613 INFO L93 Difference]: Finished difference Result 290 states and 307 transitions. [2018-01-25 06:11:04,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:11:04,615 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-25 06:11:04,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:11:04,628 INFO L225 Difference]: With dead ends: 290 [2018-01-25 06:11:04,628 INFO L226 Difference]: Without dead ends: 154 [2018-01-25 06:11:04,632 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-25 06:11:04,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-25 06:11:04,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2018-01-25 06:11:04,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-01-25 06:11:04,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 161 transitions. [2018-01-25 06:11:04,678 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 161 transitions. Word has length 17 [2018-01-25 06:11:04,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:11:04,679 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 161 transitions. [2018-01-25 06:11:04,679 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:11:04,679 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 161 transitions. [2018-01-25 06:11:04,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 06:11:04,680 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:11:04,680 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-25 06:11:04,680 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-25 06:11:04,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1572748952, now seen corresponding path program 1 times [2018-01-25 06:11:04,681 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:11:04,683 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:04,683 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:04,683 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:04,683 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:11:04,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:04,706 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:11:04,786 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-25 06:11:04,786 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:11:04,786 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:11:04,786 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:11:04,788 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:11:04,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:11:04,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:11:04,789 INFO L87 Difference]: Start difference. First operand 152 states and 161 transitions. Second operand 6 states. [2018-01-25 06:11:04,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:11:04,973 INFO L93 Difference]: Finished difference Result 154 states and 163 transitions. [2018-01-25 06:11:04,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:11:04,974 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-25 06:11:04,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:11:04,977 INFO L225 Difference]: With dead ends: 154 [2018-01-25 06:11:04,977 INFO L226 Difference]: Without dead ends: 153 [2018-01-25 06:11:04,978 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-25 06:11:04,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-01-25 06:11:04,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2018-01-25 06:11:04,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-01-25 06:11:04,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2018-01-25 06:11:04,993 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 19 [2018-01-25 06:11:04,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:11:04,993 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2018-01-25 06:11:04,993 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:11:04,993 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2018-01-25 06:11:04,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 06:11:04,994 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:11:04,994 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-25 06:11:04,994 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-25 06:11:04,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1572748951, now seen corresponding path program 1 times [2018-01-25 06:11:04,994 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:11:04,995 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:04,995 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:04,996 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:04,996 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:11:05,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:05,020 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:11:05,235 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-25 06:11:05,236 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:11:05,236 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 06:11:05,236 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:11:05,236 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 06:11:05,237 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 06:11:05,237 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:11:05,237 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand 7 states. [2018-01-25 06:11:05,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:11:05,520 INFO L93 Difference]: Finished difference Result 153 states and 162 transitions. [2018-01-25 06:11:05,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 06:11:05,521 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-01-25 06:11:05,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:11:05,523 INFO L225 Difference]: With dead ends: 153 [2018-01-25 06:11:05,523 INFO L226 Difference]: Without dead ends: 152 [2018-01-25 06:11:05,523 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-25 06:11:05,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-25 06:11:05,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2018-01-25 06:11:05,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-25 06:11:05,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 159 transitions. [2018-01-25 06:11:05,537 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 159 transitions. Word has length 19 [2018-01-25 06:11:05,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:11:05,537 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 159 transitions. [2018-01-25 06:11:05,537 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 06:11:05,537 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 159 transitions. [2018-01-25 06:11:05,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 06:11:05,539 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:11:05,539 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] [2018-01-25 06:11:05,539 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-25 06:11:05,539 INFO L82 PathProgramCache]: Analyzing trace with hash -336004596, now seen corresponding path program 1 times [2018-01-25 06:11:05,539 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:11:05,541 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:05,541 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:05,541 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:05,541 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:11:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:05,561 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:11:05,677 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-25 06:11:05,677 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:11:05,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 06:11:05,678 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:11:05,678 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 06:11:05,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 06:11:05,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-25 06:11:05,679 INFO L87 Difference]: Start difference. First operand 150 states and 159 transitions. Second operand 9 states. [2018-01-25 06:11:05,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:11:05,815 INFO L93 Difference]: Finished difference Result 256 states and 271 transitions. [2018-01-25 06:11:05,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 06:11:05,815 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-01-25 06:11:05,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:11:05,817 INFO L225 Difference]: With dead ends: 256 [2018-01-25 06:11:05,818 INFO L226 Difference]: Without dead ends: 171 [2018-01-25 06:11:05,819 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-25 06:11:05,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-01-25 06:11:05,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 164. [2018-01-25 06:11:05,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-01-25 06:11:05,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 173 transitions. [2018-01-25 06:11:05,835 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 173 transitions. Word has length 29 [2018-01-25 06:11:05,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:11:05,836 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 173 transitions. [2018-01-25 06:11:05,836 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 06:11:05,836 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 173 transitions. [2018-01-25 06:11:05,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 06:11:05,837 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:11:05,838 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-25 06:11:05,838 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-25 06:11:05,838 INFO L82 PathProgramCache]: Analyzing trace with hash 610577100, now seen corresponding path program 1 times [2018-01-25 06:11:05,838 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:11:05,840 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:05,840 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:05,840 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:05,840 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:11:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:05,859 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:11:05,938 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-25 06:11:05,939 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:11:05,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 06:11:05,939 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:11:05,940 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 06:11:05,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 06:11:05,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:11:05,940 INFO L87 Difference]: Start difference. First operand 164 states and 173 transitions. Second operand 10 states. [2018-01-25 06:11:06,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:11:06,177 INFO L93 Difference]: Finished difference Result 164 states and 173 transitions. [2018-01-25 06:11:06,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 06:11:06,177 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-01-25 06:11:06,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:11:06,179 INFO L225 Difference]: With dead ends: 164 [2018-01-25 06:11:06,179 INFO L226 Difference]: Without dead ends: 163 [2018-01-25 06:11:06,179 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-25 06:11:06,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-01-25 06:11:06,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-01-25 06:11:06,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-01-25 06:11:06,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 172 transitions. [2018-01-25 06:11:06,193 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 172 transitions. Word has length 34 [2018-01-25 06:11:06,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:11:06,194 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 172 transitions. [2018-01-25 06:11:06,194 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 06:11:06,194 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 172 transitions. [2018-01-25 06:11:06,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 06:11:06,195 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:11:06,195 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-25 06:11:06,195 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-25 06:11:06,196 INFO L82 PathProgramCache]: Analyzing trace with hash 610577101, now seen corresponding path program 1 times [2018-01-25 06:11:06,196 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:11:06,197 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:06,197 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:06,198 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:06,198 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:11:06,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:06,216 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:11:06,251 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-25 06:11:06,251 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:11:06,251 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 06:11:06,251 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:11:06,252 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:11:06,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:11:06,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:11:06,252 INFO L87 Difference]: Start difference. First operand 163 states and 172 transitions. Second operand 4 states. [2018-01-25 06:11:06,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:11:06,282 INFO L93 Difference]: Finished difference Result 287 states and 303 transitions. [2018-01-25 06:11:06,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 06:11:06,283 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-01-25 06:11:06,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:11:06,284 INFO L225 Difference]: With dead ends: 287 [2018-01-25 06:11:06,284 INFO L226 Difference]: Without dead ends: 164 [2018-01-25 06:11:06,286 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-25 06:11:06,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-01-25 06:11:06,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-01-25 06:11:06,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-01-25 06:11:06,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 173 transitions. [2018-01-25 06:11:06,298 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 173 transitions. Word has length 34 [2018-01-25 06:11:06,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:11:06,298 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 173 transitions. [2018-01-25 06:11:06,298 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:11:06,298 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 173 transitions. [2018-01-25 06:11:06,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-25 06:11:06,300 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:11:06,300 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-25 06:11:06,300 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-25 06:11:06,300 INFO L82 PathProgramCache]: Analyzing trace with hash -838244594, now seen corresponding path program 1 times [2018-01-25 06:11:06,300 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:11:06,301 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:06,302 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:06,302 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:06,302 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:11:06,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:06,320 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:11:06,362 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-25 06:11:06,363 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:11:06,363 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:11:06,364 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-01-25 06:11:06,366 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [31], [36], [52], [59], [63], [67], [70], [72], [73], [77], [79], [80], [133], [136], [137], [138], [140], [141], [142], [164], [165], [166], [167], [168], [170], [176], [180], [188], [206], [207], [208] [2018-01-25 06:11:06,433 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:11:06,434 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:11:09,064 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 06:11:09,065 INFO L268 AbstractInterpreter]: Visited 35 different actions 43 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 21 variables. [2018-01-25 06:11:09,084 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 06:11:09,084 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:11:09,084 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-25 06:11:09,103 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:09,103 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:11:09,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:09,151 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:11:09,212 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-25 06:11:09,212 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:11:09,391 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-25 06:11:09,426 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:11:09,426 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 06:11:09,433 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:09,433 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:11:09,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:09,504 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:11:09,510 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-25 06:11:09,510 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:11:09,555 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-25 06:11:09,557 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 06:11:09,558 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5] total 9 [2018-01-25 06:11:09,558 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 06:11:09,559 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:11:09,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:11:09,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-01-25 06:11:09,559 INFO L87 Difference]: Start difference. First operand 164 states and 173 transitions. Second operand 6 states. [2018-01-25 06:11:09,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:11:09,592 INFO L93 Difference]: Finished difference Result 288 states and 304 transitions. [2018-01-25 06:11:09,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:11:09,593 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-25 06:11:09,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:11:09,595 INFO L225 Difference]: With dead ends: 288 [2018-01-25 06:11:09,595 INFO L226 Difference]: Without dead ends: 165 [2018-01-25 06:11:09,596 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 134 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:11:09,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-01-25 06:11:09,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-01-25 06:11:09,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-01-25 06:11:09,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 174 transitions. [2018-01-25 06:11:09,608 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 174 transitions. Word has length 35 [2018-01-25 06:11:09,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:11:09,609 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 174 transitions. [2018-01-25 06:11:09,609 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:11:09,609 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 174 transitions. [2018-01-25 06:11:09,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-25 06:11:09,610 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:11:09,611 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-25 06:11:09,611 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-25 06:11:09,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1492923117, now seen corresponding path program 2 times [2018-01-25 06:11:09,611 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:11:09,612 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:09,613 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:09,613 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:09,613 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:11:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:09,633 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:11:09,730 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-25 06:11:09,731 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:11:09,731 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:11:09,731 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 06:11:09,731 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 06:11:09,732 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:11:09,732 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-25 06:11:09,742 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 06:11:09,742 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 06:11:09,772 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:11:09,777 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:11:09,782 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:11:09,811 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-25 06:11:09,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:11:09,842 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-25 06:11:09,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:11:09,862 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-25 06:11:09,863 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-25 06:11:10,560 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-25 06:11:10,560 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:11:11,287 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-25 06:11:11,307 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 06:11:11,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14, 13] imperfect sequences [6] total 31 [2018-01-25 06:11:11,307 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:11:11,308 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-25 06:11:11,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-25 06:11:11,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=840, Unknown=0, NotChecked=0, Total=930 [2018-01-25 06:11:11,309 INFO L87 Difference]: Start difference. First operand 165 states and 174 transitions. Second operand 15 states. [2018-01-25 06:11:16,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:11:16,609 INFO L93 Difference]: Finished difference Result 241 states and 253 transitions. [2018-01-25 06:11:16,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-25 06:11:16,610 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2018-01-25 06:11:16,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:11:16,612 INFO L225 Difference]: With dead ends: 241 [2018-01-25 06:11:16,612 INFO L226 Difference]: Without dead ends: 240 [2018-01-25 06:11:16,613 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=118, Invalid=1072, Unknown=0, NotChecked=0, Total=1190 [2018-01-25 06:11:16,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-01-25 06:11:16,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 164. [2018-01-25 06:11:16,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-01-25 06:11:16,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 173 transitions. [2018-01-25 06:11:16,627 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 173 transitions. Word has length 36 [2018-01-25 06:11:16,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:11:16,627 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 173 transitions. [2018-01-25 06:11:16,627 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-25 06:11:16,627 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 173 transitions. [2018-01-25 06:11:16,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-25 06:11:16,629 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:11:16,629 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, 1, 1, 1, 1, 1, 1] [2018-01-25 06:11:16,629 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-25 06:11:16,629 INFO L82 PathProgramCache]: Analyzing trace with hash 278126369, now seen corresponding path program 1 times [2018-01-25 06:11:16,629 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:11:16,630 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:16,631 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 06:11:16,631 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:16,631 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:11:16,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:16,645 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:11:16,787 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-25 06:11:16,788 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:11:16,788 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 06:11:16,788 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:11:16,788 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 06:11:16,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 06:11:16,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-25 06:11:16,789 INFO L87 Difference]: Start difference. First operand 164 states and 173 transitions. Second operand 9 states. [2018-01-25 06:11:16,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:11:16,861 INFO L93 Difference]: Finished difference Result 237 states and 253 transitions. [2018-01-25 06:11:16,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 06:11:16,862 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-01-25 06:11:16,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:11:16,864 INFO L225 Difference]: With dead ends: 237 [2018-01-25 06:11:16,864 INFO L226 Difference]: Without dead ends: 178 [2018-01-25 06:11:16,865 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-25 06:11:16,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-01-25 06:11:16,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 174. [2018-01-25 06:11:16,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-01-25 06:11:16,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 184 transitions. [2018-01-25 06:11:16,883 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 184 transitions. Word has length 42 [2018-01-25 06:11:16,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:11:16,884 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 184 transitions. [2018-01-25 06:11:16,884 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 06:11:16,884 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 184 transitions. [2018-01-25 06:11:16,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-25 06:11:16,886 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:11:16,886 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, 1, 1, 1, 1, 1] [2018-01-25 06:11:16,886 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-25 06:11:16,886 INFO L82 PathProgramCache]: Analyzing trace with hash -870895777, now seen corresponding path program 1 times [2018-01-25 06:11:16,886 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:11:16,887 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:16,888 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:16,888 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:16,888 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:11:16,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:16,906 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:11:16,997 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-25 06:11:16,997 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:11:16,997 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 06:11:16,997 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:11:16,997 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 06:11:16,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 06:11:16,998 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:11:16,998 INFO L87 Difference]: Start difference. First operand 174 states and 184 transitions. Second operand 10 states. [2018-01-25 06:11:17,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:11:17,293 INFO L93 Difference]: Finished difference Result 174 states and 184 transitions. [2018-01-25 06:11:17,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 06:11:17,293 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2018-01-25 06:11:17,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:11:17,294 INFO L225 Difference]: With dead ends: 174 [2018-01-25 06:11:17,294 INFO L226 Difference]: Without dead ends: 172 [2018-01-25 06:11:17,295 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-25 06:11:17,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-01-25 06:11:17,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-01-25 06:11:17,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-01-25 06:11:17,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 182 transitions. [2018-01-25 06:11:17,307 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 182 transitions. Word has length 41 [2018-01-25 06:11:17,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:11:17,307 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 182 transitions. [2018-01-25 06:11:17,308 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 06:11:17,308 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 182 transitions. [2018-01-25 06:11:17,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-25 06:11:17,309 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:11:17,309 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, 1, 1, 1, 1, 1] [2018-01-25 06:11:17,309 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-25 06:11:17,309 INFO L82 PathProgramCache]: Analyzing trace with hash -870895776, now seen corresponding path program 1 times [2018-01-25 06:11:17,309 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:11:17,310 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:17,311 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:17,311 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:17,311 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:11:17,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:17,328 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:11:17,382 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-25 06:11:17,382 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:11:17,382 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:11:17,382 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-01-25 06:11:17,383 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [31], [36], [52], [59], [63], [67], [68], [71], [72], [73], [77], [79], [80], [122], [125], [133], [136], [137], [138], [140], [141], [142], [164], [165], [166], [167], [168], [170], [176], [180], [188], [189], [190], [206], [207], [208] [2018-01-25 06:11:17,384 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:11:17,384 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:11:20,487 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 06:11:20,487 INFO L268 AbstractInterpreter]: Visited 40 different actions 48 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 21 variables. [2018-01-25 06:11:20,494 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 06:11:20,495 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:11:20,495 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-25 06:11:20,509 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:20,509 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:11:20,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:20,543 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:11:20,602 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-25 06:11:20,603 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:11:20,728 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-25 06:11:20,749 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:11:20,750 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 06:11:20,756 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:20,756 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:11:20,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:20,814 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:11:20,819 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-25 06:11:20,820 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:11:20,850 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-25 06:11:20,852 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 06:11:20,852 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6] total 11 [2018-01-25 06:11:20,853 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 06:11:20,853 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 06:11:20,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 06:11:20,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-01-25 06:11:20,854 INFO L87 Difference]: Start difference. First operand 172 states and 182 transitions. Second operand 7 states. [2018-01-25 06:11:20,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:11:20,885 INFO L93 Difference]: Finished difference Result 293 states and 310 transitions. [2018-01-25 06:11:20,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:11:20,886 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-01-25 06:11:20,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:11:20,887 INFO L225 Difference]: With dead ends: 293 [2018-01-25 06:11:20,887 INFO L226 Difference]: Without dead ends: 173 [2018-01-25 06:11:20,888 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2018-01-25 06:11:20,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-01-25 06:11:20,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-01-25 06:11:20,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-01-25 06:11:20,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 183 transitions. [2018-01-25 06:11:20,904 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 183 transitions. Word has length 41 [2018-01-25 06:11:20,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:11:20,904 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 183 transitions. [2018-01-25 06:11:20,904 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 06:11:20,904 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 183 transitions. [2018-01-25 06:11:20,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-25 06:11:20,905 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:11:20,905 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-25 06:11:20,905 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-25 06:11:20,906 INFO L82 PathProgramCache]: Analyzing trace with hash 2131974143, now seen corresponding path program 2 times [2018-01-25 06:11:20,906 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:11:20,907 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:20,907 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:20,907 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:20,907 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:11:20,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:20,924 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:11:20,998 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-25 06:11:20,998 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:11:20,998 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:11:20,999 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 06:11:20,999 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 06:11:20,999 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:11:20,999 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-25 06:11:21,008 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 06:11:21,009 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 06:11:21,028 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:11:21,030 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:11:21,034 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:11:21,052 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-25 06:11:21,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:11:21,099 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-25 06:11:21,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:11:21,115 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-25 06:11:21,116 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-25 06:11:21,632 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-25 06:11:21,633 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:11:28,040 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-25 06:11:28,061 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 06:11:28,061 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15, 13] imperfect sequences [7] total 33 [2018-01-25 06:11:28,061 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:11:28,062 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-25 06:11:28,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-25 06:11:28,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=948, Unknown=3, NotChecked=0, Total=1056 [2018-01-25 06:11:28,063 INFO L87 Difference]: Start difference. First operand 173 states and 183 transitions. Second operand 16 states. [2018-01-25 06:11:29,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:11:29,207 INFO L93 Difference]: Finished difference Result 205 states and 214 transitions. [2018-01-25 06:11:29,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-25 06:11:29,207 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2018-01-25 06:11:29,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:11:29,208 INFO L225 Difference]: With dead ends: 205 [2018-01-25 06:11:29,208 INFO L226 Difference]: Without dead ends: 203 [2018-01-25 06:11:29,209 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=136, Invalid=1193, Unknown=3, NotChecked=0, Total=1332 [2018-01-25 06:11:29,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-01-25 06:11:29,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 171. [2018-01-25 06:11:29,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-01-25 06:11:29,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 181 transitions. [2018-01-25 06:11:29,225 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 181 transitions. Word has length 42 [2018-01-25 06:11:29,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:11:29,226 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 181 transitions. [2018-01-25 06:11:29,226 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-25 06:11:29,226 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 181 transitions. [2018-01-25 06:11:29,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-25 06:11:29,227 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:11:29,227 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, 1, 1, 1, 1, 1] [2018-01-25 06:11:29,227 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-25 06:11:29,227 INFO L82 PathProgramCache]: Analyzing trace with hash 799197829, now seen corresponding path program 1 times [2018-01-25 06:11:29,228 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:11:29,229 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:29,229 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 06:11:29,229 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:29,229 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:11:29,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:29,240 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:11:29,306 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-25 06:11:29,307 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:11:29,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 06:11:29,307 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:11:29,307 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 06:11:29,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 06:11:29,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-25 06:11:29,308 INFO L87 Difference]: Start difference. First operand 171 states and 181 transitions. Second operand 8 states. [2018-01-25 06:11:29,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:11:29,364 INFO L93 Difference]: Finished difference Result 291 states and 306 transitions. [2018-01-25 06:11:29,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 06:11:29,366 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-01-25 06:11:29,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:11:29,366 INFO L225 Difference]: With dead ends: 291 [2018-01-25 06:11:29,367 INFO L226 Difference]: Without dead ends: 171 [2018-01-25 06:11:29,367 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-25 06:11:29,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-01-25 06:11:29,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-01-25 06:11:29,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-01-25 06:11:29,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 179 transitions. [2018-01-25 06:11:29,380 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 179 transitions. Word has length 47 [2018-01-25 06:11:29,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:11:29,381 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 179 transitions. [2018-01-25 06:11:29,381 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 06:11:29,381 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 179 transitions. [2018-01-25 06:11:29,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-25 06:11:29,381 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:11:29,381 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, 1, 1, 1, 1, 1, 1] [2018-01-25 06:11:29,381 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-25 06:11:29,382 INFO L82 PathProgramCache]: Analyzing trace with hash 689381786, now seen corresponding path program 1 times [2018-01-25 06:11:29,382 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:11:29,383 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:29,383 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:29,383 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:29,383 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:11:29,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:29,390 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:11:29,414 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-25 06:11:29,415 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:11:29,415 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 06:11:29,415 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:11:29,415 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 06:11:29,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 06:11:29,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 06:11:29,415 INFO L87 Difference]: Start difference. First operand 171 states and 179 transitions. Second operand 3 states. [2018-01-25 06:11:29,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:11:29,595 INFO L93 Difference]: Finished difference Result 185 states and 193 transitions. [2018-01-25 06:11:29,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 06:11:29,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-01-25 06:11:29,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:11:29,596 INFO L225 Difference]: With dead ends: 185 [2018-01-25 06:11:29,596 INFO L226 Difference]: Without dead ends: 153 [2018-01-25 06:11:29,596 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 06:11:29,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-01-25 06:11:29,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 143. [2018-01-25 06:11:29,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-25 06:11:29,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 149 transitions. [2018-01-25 06:11:29,608 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 149 transitions. Word has length 47 [2018-01-25 06:11:29,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:11:29,608 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 149 transitions. [2018-01-25 06:11:29,608 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 06:11:29,608 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 149 transitions. [2018-01-25 06:11:29,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-25 06:11:29,609 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:11:29,609 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:11:29,609 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-25 06:11:29,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1696219427, now seen corresponding path program 1 times [2018-01-25 06:11:29,610 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:11:29,611 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:29,611 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:29,611 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:29,611 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:11:29,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:29,620 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:11:29,713 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-25 06:11:29,714 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:11:29,714 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-25 06:11:29,714 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:11:29,714 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 06:11:29,714 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 06:11:29,714 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:11:29,714 INFO L87 Difference]: Start difference. First operand 143 states and 149 transitions. Second operand 10 states. [2018-01-25 06:11:29,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:11:29,821 INFO L93 Difference]: Finished difference Result 241 states and 251 transitions. [2018-01-25 06:11:29,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 06:11:29,821 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2018-01-25 06:11:29,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:11:29,822 INFO L225 Difference]: With dead ends: 241 [2018-01-25 06:11:29,822 INFO L226 Difference]: Without dead ends: 143 [2018-01-25 06:11:29,823 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-25 06:11:29,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-25 06:11:29,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-01-25 06:11:29,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-25 06:11:29,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 148 transitions. [2018-01-25 06:11:29,837 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 148 transitions. Word has length 52 [2018-01-25 06:11:29,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:11:29,837 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 148 transitions. [2018-01-25 06:11:29,837 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 06:11:29,837 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 148 transitions. [2018-01-25 06:11:29,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-25 06:11:29,838 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:11:29,838 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:11:29,838 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-25 06:11:29,838 INFO L82 PathProgramCache]: Analyzing trace with hash 381457938, now seen corresponding path program 1 times [2018-01-25 06:11:29,839 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:11:29,839 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:29,839 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:29,840 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:29,840 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:11:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:29,854 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:11:30,354 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-25 06:11:30,354 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:11:30,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-25 06:11:30,354 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:11:30,354 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-25 06:11:30,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-25 06:11:30,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-01-25 06:11:30,355 INFO L87 Difference]: Start difference. First operand 143 states and 148 transitions. Second operand 15 states. [2018-01-25 06:11:30,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:11:30,752 INFO L93 Difference]: Finished difference Result 143 states and 148 transitions. [2018-01-25 06:11:30,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-25 06:11:30,752 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 63 [2018-01-25 06:11:30,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:11:30,754 INFO L225 Difference]: With dead ends: 143 [2018-01-25 06:11:30,754 INFO L226 Difference]: Without dead ends: 141 [2018-01-25 06:11:30,754 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-01-25 06:11:30,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-01-25 06:11:30,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-01-25 06:11:30,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-01-25 06:11:30,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 146 transitions. [2018-01-25 06:11:30,769 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 146 transitions. Word has length 63 [2018-01-25 06:11:30,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:11:30,769 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 146 transitions. [2018-01-25 06:11:30,769 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-25 06:11:30,769 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 146 transitions. [2018-01-25 06:11:30,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-25 06:11:30,770 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:11:30,770 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:11:30,771 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-25 06:11:30,771 INFO L82 PathProgramCache]: Analyzing trace with hash 381457939, now seen corresponding path program 1 times [2018-01-25 06:11:30,771 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:11:30,773 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:30,773 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:30,773 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:30,773 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:11:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:30,793 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:11:30,875 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-25 06:11:30,876 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:11:30,876 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:11:30,876 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 64 with the following transitions: [2018-01-25 06:11:30,876 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [12], [13], [17], [31], [36], [38], [52], [54], [59], [63], [66], [67], [68], [71], [72], [73], [77], [79], [80], [91], [94], [122], [123], [126], [129], [133], [136], [137], [138], [140], [141], [142], [147], [150], [157], [164], [165], [166], [167], [168], [169], [170], [172], [176], [177], [180], [181], [182], [188], [189], [190], [191], [202], [204], [206], [207], [208] [2018-01-25 06:11:30,881 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:11:30,881 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:11:34,617 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 06:11:34,617 INFO L268 AbstractInterpreter]: Visited 61 different actions 69 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 22 variables. [2018-01-25 06:11:34,634 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 06:11:34,634 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:11:34,634 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-25 06:11:34,642 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:34,642 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:11:34,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:34,685 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:11:34,698 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-25 06:11:34,699 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:11:34,826 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-25 06:11:34,860 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:11:34,860 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 06:11:34,866 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:34,866 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:11:34,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:34,946 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:11:34,953 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-25 06:11:34,953 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:11:35,034 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-25 06:11:35,036 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 06:11:35,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 13 [2018-01-25 06:11:35,036 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 06:11:35,036 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 06:11:35,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 06:11:35,036 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-01-25 06:11:35,036 INFO L87 Difference]: Start difference. First operand 141 states and 146 transitions. Second operand 8 states. [2018-01-25 06:11:35,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:11:35,070 INFO L93 Difference]: Finished difference Result 258 states and 268 transitions. [2018-01-25 06:11:35,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 06:11:35,071 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2018-01-25 06:11:35,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:11:35,072 INFO L225 Difference]: With dead ends: 258 [2018-01-25 06:11:35,073 INFO L226 Difference]: Without dead ends: 142 [2018-01-25 06:11:35,073 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 244 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=105, Unknown=0, NotChecked=0, Total=182 [2018-01-25 06:11:35,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-01-25 06:11:35,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-01-25 06:11:35,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-01-25 06:11:35,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 147 transitions. [2018-01-25 06:11:35,092 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 147 transitions. Word has length 63 [2018-01-25 06:11:35,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:11:35,092 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 147 transitions. [2018-01-25 06:11:35,092 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 06:11:35,092 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 147 transitions. [2018-01-25 06:11:35,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-25 06:11:35,093 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:11:35,093 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:11:35,093 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-25 06:11:35,094 INFO L82 PathProgramCache]: Analyzing trace with hash -109515406, now seen corresponding path program 2 times [2018-01-25 06:11:35,094 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:11:35,095 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:35,095 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:35,095 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:35,095 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:11:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:35,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:11:35,191 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-25 06:11:35,192 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:11:35,192 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:11:35,192 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 06:11:35,192 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 06:11:35,192 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:11:35,192 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-25 06:11:35,204 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 06:11:35,204 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 06:11:35,243 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:11:35,249 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:11:35,254 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:11:35,260 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-25 06:11:35,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:11:35,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-25 06:11:35,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:11:35,318 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-25 06:11:35,318 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-25 06:11:37,524 WARN L143 SmtUtils]: Spent 2019ms on a formula simplification that was a NOOP. DAG size: 27 [2018-01-25 06:11:38,179 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-25 06:11:38,179 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:11:39,082 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-25 06:11:39,103 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 06:11:39,104 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20, 18] imperfect sequences [8] total 44 [2018-01-25 06:11:39,104 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:11:39,104 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-25 06:11:39,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-25 06:11:39,105 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1746, Unknown=0, NotChecked=0, Total=1892 [2018-01-25 06:11:39,105 INFO L87 Difference]: Start difference. First operand 142 states and 147 transitions. Second operand 21 states. [2018-01-25 06:11:40,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:11:40,586 INFO L93 Difference]: Finished difference Result 142 states and 147 transitions. [2018-01-25 06:11:40,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-25 06:11:40,631 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-01-25 06:11:40,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:11:40,632 INFO L225 Difference]: With dead ends: 142 [2018-01-25 06:11:40,632 INFO L226 Difference]: Without dead ends: 140 [2018-01-25 06:11:40,633 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=195, Invalid=2255, Unknown=0, NotChecked=0, Total=2450 [2018-01-25 06:11:40,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-25 06:11:40,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-01-25 06:11:40,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-25 06:11:40,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 145 transitions. [2018-01-25 06:11:40,647 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 145 transitions. Word has length 64 [2018-01-25 06:11:40,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:11:40,647 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 145 transitions. [2018-01-25 06:11:40,647 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-25 06:11:40,647 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 145 transitions. [2018-01-25 06:11:40,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-01-25 06:11:40,649 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:11:40,649 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 06:11:40,649 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-25 06:11:40,649 INFO L82 PathProgramCache]: Analyzing trace with hash -866691108, now seen corresponding path program 1 times [2018-01-25 06:11:40,650 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:11:40,651 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:40,651 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 06:11:40,651 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:40,651 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:11:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:40,666 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:11:40,872 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-25 06:11:40,873 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:11:40,873 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-25 06:11:40,873 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:11:40,873 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-25 06:11:40,873 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-25 06:11:40,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-01-25 06:11:40,874 INFO L87 Difference]: Start difference. First operand 140 states and 145 transitions. Second operand 13 states. [2018-01-25 06:11:40,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:11:40,968 INFO L93 Difference]: Finished difference Result 208 states and 216 transitions. [2018-01-25 06:11:40,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-25 06:11:40,968 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 77 [2018-01-25 06:11:40,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:11:40,969 INFO L225 Difference]: With dead ends: 208 [2018-01-25 06:11:40,969 INFO L226 Difference]: Without dead ends: 140 [2018-01-25 06:11:40,970 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 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-25 06:11:40,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-25 06:11:40,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-01-25 06:11:40,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-25 06:11:40,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 144 transitions. [2018-01-25 06:11:40,982 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 144 transitions. Word has length 77 [2018-01-25 06:11:40,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:11:40,982 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 144 transitions. [2018-01-25 06:11:40,982 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-25 06:11:40,983 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 144 transitions. [2018-01-25 06:11:40,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-01-25 06:11:40,983 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:11:40,984 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 06:11:40,984 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-25 06:11:40,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1579109870, now seen corresponding path program 1 times [2018-01-25 06:11:40,984 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:11:40,984 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:40,985 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:40,985 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:40,985 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:11:41,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:41,002 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:11:41,522 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-25 06:11:41,522 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:11:41,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-01-25 06:11:41,522 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:11:41,523 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-25 06:11:41,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-25 06:11:41,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2018-01-25 06:11:41,523 INFO L87 Difference]: Start difference. First operand 140 states and 144 transitions. Second operand 22 states. [2018-01-25 06:11:42,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:11:42,373 INFO L93 Difference]: Finished difference Result 169 states and 179 transitions. [2018-01-25 06:11:42,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-25 06:11:42,373 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 90 [2018-01-25 06:11:42,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:11:42,374 INFO L225 Difference]: With dead ends: 169 [2018-01-25 06:11:42,375 INFO L226 Difference]: Without dead ends: 167 [2018-01-25 06:11:42,375 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2018-01-25 06:11:42,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-01-25 06:11:42,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 162. [2018-01-25 06:11:42,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-01-25 06:11:42,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 172 transitions. [2018-01-25 06:11:42,391 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 172 transitions. Word has length 90 [2018-01-25 06:11:42,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:11:42,391 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 172 transitions. [2018-01-25 06:11:42,391 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-25 06:11:42,391 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 172 transitions. [2018-01-25 06:11:42,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-01-25 06:11:42,392 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:11:42,392 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 06:11:42,392 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-25 06:11:42,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1579109869, now seen corresponding path program 1 times [2018-01-25 06:11:42,392 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:11:42,393 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:42,393 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:42,393 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:42,393 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:11:42,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:42,410 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:11:42,536 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-25 06:11:42,536 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:11:42,536 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:11:42,537 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 91 with the following transitions: [2018-01-25 06:11:42,537 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [12], [13], [17], [19], [20], [21], [24], [31], [36], [38], [39], [42], [52], [54], [59], [63], [66], [67], [68], [71], [72], [73], [77], [79], [80], [81], [91], [92], [95], [96], [99], [100], [122], [123], [126], [129], [130], [133], [136], [137], [138], [140], [141], [142], [143], [147], [150], [155], [156], [157], [159], [160], [164], [165], [166], [167], [168], [169], [170], [172], [173], [174], [176], [177], [180], [181], [182], [183], [184], [188], [189], [190], [191], [192], [198], [200], [202], [203], [204], [205], [206], [207], [208] [2018-01-25 06:11:42,540 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:11:42,540 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:11:45,215 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 06:11:45,215 INFO L268 AbstractInterpreter]: Visited 87 different actions 95 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 26 variables. [2018-01-25 06:11:45,218 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 06:11:45,218 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:11:45,218 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-25 06:11:45,224 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:45,225 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:11:45,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:45,273 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:11:45,285 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-25 06:11:45,285 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:11:45,438 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-25 06:11:45,459 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:11:45,459 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 06:11:45,462 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:45,462 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:11:45,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:45,555 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:11:45,562 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-25 06:11:45,562 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:11:45,636 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-25 06:11:45,638 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 06:11:45,675 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8] total 15 [2018-01-25 06:11:45,675 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 06:11:45,676 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 06:11:45,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 06:11:45,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-01-25 06:11:45,676 INFO L87 Difference]: Start difference. First operand 162 states and 172 transitions. Second operand 9 states. [2018-01-25 06:11:45,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:11:45,711 INFO L93 Difference]: Finished difference Result 299 states and 319 transitions. [2018-01-25 06:11:45,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 06:11:45,712 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 90 [2018-01-25 06:11:45,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:11:45,712 INFO L225 Difference]: With dead ends: 299 [2018-01-25 06:11:45,713 INFO L226 Difference]: Without dead ends: 163 [2018-01-25 06:11:45,713 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 351 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=137, Unknown=0, NotChecked=0, Total=240 [2018-01-25 06:11:45,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-01-25 06:11:45,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-01-25 06:11:45,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-01-25 06:11:45,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 173 transitions. [2018-01-25 06:11:45,732 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 173 transitions. Word has length 90 [2018-01-25 06:11:45,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:11:45,732 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 173 transitions. [2018-01-25 06:11:45,732 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 06:11:45,732 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 173 transitions. [2018-01-25 06:11:45,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-01-25 06:11:45,733 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:11:45,733 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, 1, 1, 1, 1, 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-25 06:11:45,734 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-25 06:11:45,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1354217300, now seen corresponding path program 2 times [2018-01-25 06:11:45,734 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:11:45,735 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:45,735 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:45,735 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:45,735 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:11:45,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:45,759 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:11:45,862 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-25 06:11:45,862 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:11:45,862 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:11:45,862 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 06:11:45,862 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 06:11:45,862 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:11:45,862 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-25 06:11:45,871 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 06:11:45,871 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 06:11:45,914 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:11:45,920 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:11:45,925 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:11:45,929 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-25 06:11:45,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:11:45,954 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-25 06:11:45,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:11:45,997 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-25 06:11:45,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 Received shutdown request... [2018-01-25 06:11:48,216 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 06:11:48,216 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 06:11:48,220 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 06:11:48,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 06:11:48 BoogieIcfgContainer [2018-01-25 06:11:48,220 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 06:11:48,221 INFO L168 Benchmark]: Toolchain (without parser) took 44916.53 ms. Allocated memory was 302.0 MB in the beginning and 1.2 GB in the end (delta: 923.3 MB). Free memory was 260.9 MB in the beginning and 296.0 MB in the end (delta: -35.1 MB). Peak memory consumption was 888.1 MB. Max. memory is 5.3 GB. [2018-01-25 06:11:48,221 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 302.0 MB. Free memory is still 266.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 06:11:48,221 INFO L168 Benchmark]: CACSL2BoogieTranslator took 237.52 ms. Allocated memory is still 302.0 MB. Free memory was 260.9 MB in the beginning and 246.8 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 5.3 GB. [2018-01-25 06:11:48,221 INFO L168 Benchmark]: Boogie Preprocessor took 43.15 ms. Allocated memory is still 302.0 MB. Free memory was 246.8 MB in the beginning and 244.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 06:11:48,222 INFO L168 Benchmark]: RCFGBuilder took 510.37 ms. Allocated memory is still 302.0 MB. Free memory was 242.8 MB in the beginning and 207.9 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 5.3 GB. [2018-01-25 06:11:48,222 INFO L168 Benchmark]: TraceAbstraction took 44116.06 ms. Allocated memory was 302.0 MB in the beginning and 1.2 GB in the end (delta: 923.3 MB). Free memory was 207.9 MB in the beginning and 296.0 MB in the end (delta: -88.1 MB). Peak memory consumption was 835.1 MB. Max. memory is 5.3 GB. [2018-01-25 06:11:48,224 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.20 ms. Allocated memory is still 302.0 MB. Free memory is still 266.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 237.52 ms. Allocated memory is still 302.0 MB. Free memory was 260.9 MB in the beginning and 246.8 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.15 ms. Allocated memory is still 302.0 MB. Free memory was 246.8 MB in the beginning and 244.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 510.37 ms. Allocated memory is still 302.0 MB. Free memory was 242.8 MB in the beginning and 207.9 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 44116.06 ms. Allocated memory was 302.0 MB in the beginning and 1.2 GB in the end (delta: 923.3 MB). Free memory was 207.9 MB in the beginning and 296.0 MB in the end (delta: -88.1 MB). Peak memory consumption was 835.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 34 LocStat_MAX_WEQGRAPH_SIZE : 3 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 256 LocStat_NO_SUPPORTING_DISEQUALITIES : 25 LocStat_NO_DISJUNCTIONS : -68 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 53 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 108 TransStat_NO_SUPPORTING_DISEQUALITIES : 9 TransStat_NO_DISJUNCTIONS : 57 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.315467 RENAME_VARIABLES(MILLISECONDS) : 0.058376 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.129760 PROJECTAWAY(MILLISECONDS) : 0.029104 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.110333 DISJOIN(MILLISECONDS) : 0.707983 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.075208 ADD_EQUALITY(MILLISECONDS) : 0.014770 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.008921 #CONJOIN_DISJUNCTIVE : 86 #RENAME_VARIABLES : 145 #UNFREEZE : 0 #CONJOIN : 178 #PROJECTAWAY : 142 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 141 #ADD_EQUALITY : 111 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 39 LocStat_MAX_WEQGRAPH_SIZE : 6 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 296 LocStat_NO_SUPPORTING_DISEQUALITIES : 30 LocStat_NO_DISJUNCTIONS : -78 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 60 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 120 TransStat_NO_SUPPORTING_DISEQUALITIES : 9 TransStat_NO_DISJUNCTIONS : 64 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.304125 RENAME_VARIABLES(MILLISECONDS) : 0.084195 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.110886 PROJECTAWAY(MILLISECONDS) : 0.031691 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.049327 DISJOIN(MILLISECONDS) : 0.373798 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.110479 ADD_EQUALITY(MILLISECONDS) : 0.022016 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.007601 #CONJOIN_DISJUNCTIVE : 96 #RENAME_VARIABLES : 160 #UNFREEZE : 0 #CONJOIN : 203 #PROJECTAWAY : 159 #ADD_WEAK_EQUALITY : 15 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 156 #ADD_EQUALITY : 128 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 60 LocStat_MAX_WEQGRAPH_SIZE : 6 LocStat_MAX_SIZEOF_WEQEDGELABEL : 3 LocStat_NO_SUPPORTING_EQUALITIES : 469 LocStat_NO_SUPPORTING_DISEQUALITIES : 51 LocStat_NO_DISJUNCTIONS : -120 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 89 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 2 TransStat_NO_SUPPORTING_EQUALITIES : 174 TransStat_NO_SUPPORTING_DISEQUALITIES : 11 TransStat_NO_DISJUNCTIONS : 94 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.392169 RENAME_VARIABLES(MILLISECONDS) : 0.074667 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.178721 PROJECTAWAY(MILLISECONDS) : 0.041005 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.054290 DISJOIN(MILLISECONDS) : 0.637804 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.097894 ADD_EQUALITY(MILLISECONDS) : 0.016273 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.005082 #CONJOIN_DISJUNCTIVE : 138 #RENAME_VARIABLES : 223 #UNFREEZE : 0 #CONJOIN : 294 #PROJECTAWAY : 230 #ADD_WEAK_EQUALITY : 27 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 218 #ADD_EQUALITY : 190 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 10 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 86 LocStat_MAX_WEQGRAPH_SIZE : 6 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 716 LocStat_NO_SUPPORTING_DISEQUALITIES : 77 LocStat_NO_DISJUNCTIONS : -172 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 125 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 255 TransStat_NO_SUPPORTING_DISEQUALITIES : 13 TransStat_NO_DISJUNCTIONS : 131 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.215822 RENAME_VARIABLES(MILLISECONDS) : 0.048972 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.090517 PROJECTAWAY(MILLISECONDS) : 0.022388 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.032358 DISJOIN(MILLISECONDS) : 0.381772 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.061993 ADD_EQUALITY(MILLISECONDS) : 0.010785 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.004204 #CONJOIN_DISJUNCTIVE : 189 #RENAME_VARIABLES : 298 #UNFREEZE : 0 #CONJOIN : 411 #PROJECTAWAY : 314 #ADD_WEAK_EQUALITY : 33 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 292 #ADD_EQUALITY : 276 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 12 * 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 92 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) 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 92 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) 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 92 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) 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 92 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) 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 92 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) 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 92 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) 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 92 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) 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 92 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) 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 92 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) 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 92 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) 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 92 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) 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 92 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) 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 92 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) 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 92 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) 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 92 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) 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 92 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) 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 92 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) 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 92 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 13 known predicates. - TimeoutResultAtElement [Line: 1452]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1452). Cancelled while BasicCegarLoop was analyzing trace of length 92 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) 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 92 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) 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 92 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) 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 92 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) 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 92 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 13 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 23 procedures, 151 locations, 23 error locations. TIMEOUT Result, 44.0s OverallTime, 22 OverallIterations, 5 TraceHistogramMax, 11.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3034 SDtfs, 816 SDslu, 18754 SDs, 0 SdLazy, 5762 SolverSat, 170 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 8.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1427 GetRequests, 1114 SyntacticMatches, 14 SemanticMatches, 299 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1344 ImplicationChecksByTransitivity, 15.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=174occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 12.2s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 140 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 16.2s InterpolantComputationTime, 1582 NumberOfCodeBlocks, 1573 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2139 ConstructedInterpolants, 103 QuantifiedInterpolants, 375357 SizeOfPredicates, 51 NumberOfNonLiveVariables, 2834 ConjunctsInSsa, 199 ConjunctsInUnsatCore, 43 InterpolantComputations, 20 PerfectInterpolantSequences, 83/202 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_3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_06-11-48-234.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_06-11-48-234.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_06-11-48-234.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_06-11-48-234.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_06-11-48-234.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-25_06-11-48-234.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-25_06-11-48-234.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-25_06-11-48-234.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-25_06-11-48-234.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_06-11-48-234.csv Completed graceful shutdown