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_imprecise.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_4_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 17:23:15,710 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 17:23:15,712 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 17:23:15,728 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 17:23:15,728 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 17:23:15,729 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 17:23:15,730 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 17:23:15,732 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 17:23:15,734 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 17:23:15,735 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 17:23:15,736 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 17:23:15,736 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 17:23:15,737 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 17:23:15,738 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 17:23:15,739 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 17:23:15,742 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 17:23:15,744 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 17:23:15,746 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 17:23:15,747 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 17:23:15,748 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 17:23:15,750 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 17:23:15,751 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 17:23:15,751 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 17:23:15,752 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 17:23:15,753 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 17:23:15,754 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 17:23:15,754 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 17:23:15,755 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 17:23:15,755 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 17:23:15,755 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 17:23:15,756 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 17:23:15,756 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_imprecise.epf [2018-01-24 17:23:15,766 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 17:23:15,766 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 17:23:15,767 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 17:23:15,767 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 17:23:15,767 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 17:23:15,768 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 17:23:15,768 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 17:23:15,768 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 17:23:15,769 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 17:23:15,769 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 17:23:15,769 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 17:23:15,769 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 17:23:15,769 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 17:23:15,770 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 17:23:15,770 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 17:23:15,770 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 17:23:15,770 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 17:23:15,770 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 17:23:15,770 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 17:23:15,771 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 17:23:15,771 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 17:23:15,771 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 17:23:15,771 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 17:23:15,771 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 17:23:15,772 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 17:23:15,772 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 17:23:15,772 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 17:23:15,772 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 17:23:15,772 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 17:23:15,773 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 17:23:15,773 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 17:23:15,773 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 17:23:15,773 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 17:23:15,773 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 17:23:15,774 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 17:23:15,774 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 17:23:15,806 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 17:23:15,815 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 17:23:15,819 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 17:23:15,821 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 17:23:15,821 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 17:23:15,822 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_4_false-valid-memtrack_true-termination.i [2018-01-24 17:23:15,995 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 17:23:16,001 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 17:23:16,001 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 17:23:16,002 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 17:23:16,006 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 17:23:16,007 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:23:15" (1/1) ... [2018-01-24 17:23:16,010 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d434187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:23:16, skipping insertion in model container [2018-01-24 17:23:16,010 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:23:15" (1/1) ... [2018-01-24 17:23:16,028 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:23:16,079 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:23:16,193 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:23:16,215 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:23:16,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:23:16 WrapperNode [2018-01-24 17:23:16,228 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 17:23:16,229 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 17:23:16,229 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 17:23:16,230 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 17:23:16,244 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:23:16" (1/1) ... [2018-01-24 17:23:16,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:23:16" (1/1) ... [2018-01-24 17:23:16,255 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:23:16" (1/1) ... [2018-01-24 17:23:16,255 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:23:16" (1/1) ... [2018-01-24 17:23:16,261 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:23:16" (1/1) ... [2018-01-24 17:23:16,263 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:23:16" (1/1) ... [2018-01-24 17:23:16,265 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:23:16" (1/1) ... [2018-01-24 17:23:16,268 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 17:23:16,269 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 17:23:16,269 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 17:23:16,269 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 17:23:16,271 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:23:16" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 17:23:16,313 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 17:23:16,313 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 17:23:16,313 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-01-24 17:23:16,313 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 17:23:16,313 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-01-24 17:23:16,314 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2018-01-24 17:23:16,314 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-01-24 17:23:16,314 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-01-24 17:23:16,314 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-01-24 17:23:16,314 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2018-01-24 17:23:16,314 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-01-24 17:23:16,314 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-01-24 17:23:16,314 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-01-24 17:23:16,314 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-01-24 17:23:16,314 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2018-01-24 17:23:16,315 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-01-24 17:23:16,315 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-01-24 17:23:16,315 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-01-24 17:23:16,315 INFO L136 BoogieDeclarations]: Found implementation of procedure f_22_get [2018-01-24 17:23:16,315 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 17:23:16,315 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 17:23:16,316 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 17:23:16,316 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 17:23:16,316 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 17:23:16,316 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 17:23:16,316 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 17:23:16,316 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 17:23:16,317 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 17:23:16,317 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-24 17:23:16,317 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-24 17:23:16,317 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 17:23:16,317 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 17:23:16,317 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 17:23:16,318 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-24 17:23:16,318 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 17:23:16,318 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-01-24 17:23:16,318 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2018-01-24 17:23:16,318 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-01-24 17:23:16,318 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-01-24 17:23:16,319 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-01-24 17:23:16,319 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-01-24 17:23:16,319 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2018-01-24 17:23:16,319 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-01-24 17:23:16,319 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-01-24 17:23:16,319 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-01-24 17:23:16,319 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-01-24 17:23:16,319 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2018-01-24 17:23:16,320 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-01-24 17:23:16,320 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-01-24 17:23:16,320 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-01-24 17:23:16,320 INFO L128 BoogieDeclarations]: Found specification of procedure f_22_get [2018-01-24 17:23:16,320 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 17:23:16,320 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 17:23:16,320 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 17:23:16,321 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 17:23:16,547 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-24 17:23:16,730 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 17:23:16,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:23:16 BoogieIcfgContainer [2018-01-24 17:23:16,731 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 17:23:16,732 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 17:23:16,732 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 17:23:16,735 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 17:23:16,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 05:23:15" (1/3) ... [2018-01-24 17:23:16,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61aa9b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:23:16, skipping insertion in model container [2018-01-24 17:23:16,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:23:16" (2/3) ... [2018-01-24 17:23:16,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61aa9b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:23:16, skipping insertion in model container [2018-01-24 17:23:16,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:23:16" (3/3) ... [2018-01-24 17:23:16,739 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test22_4_false-valid-memtrack_true-termination.i [2018-01-24 17:23:16,746 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 17:23:16,753 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-01-24 17:23:16,794 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 17:23:16,794 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 17:23:16,794 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 17:23:16,794 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 17:23:16,794 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 17:23:16,794 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 17:23:16,794 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 17:23:16,794 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 17:23:16,795 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 17:23:16,815 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states. [2018-01-24 17:23:16,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 17:23:16,821 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:23:16,822 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:23:16,822 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 17:23:16,826 INFO L82 PathProgramCache]: Analyzing trace with hash -367619766, now seen corresponding path program 1 times [2018-01-24 17:23:16,827 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:23:16,874 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:16,874 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:23:16,874 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:16,875 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:23:16,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:16,929 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:23:17,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:17,154 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:23:17,154 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:23:17,155 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:23:17,157 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:23:17,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:23:17,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:23:17,169 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 5 states. [2018-01-24 17:23:17,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:23:17,234 INFO L93 Difference]: Finished difference Result 280 states and 295 transitions. [2018-01-24 17:23:17,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:23:17,235 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-24 17:23:17,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:23:17,249 INFO L225 Difference]: With dead ends: 280 [2018-01-24 17:23:17,249 INFO L226 Difference]: Without dead ends: 149 [2018-01-24 17:23:17,254 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:23:17,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-01-24 17:23:17,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2018-01-24 17:23:17,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-01-24 17:23:17,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 155 transitions. [2018-01-24 17:23:17,299 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 155 transitions. Word has length 17 [2018-01-24 17:23:17,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:23:17,299 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 155 transitions. [2018-01-24 17:23:17,299 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:23:17,300 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 155 transitions. [2018-01-24 17:23:17,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 17:23:17,300 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:23:17,301 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:23:17,301 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 17:23:17,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1040907540, now seen corresponding path program 1 times [2018-01-24 17:23:17,301 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:23:17,303 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:17,303 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:23:17,303 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:17,303 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:23:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:17,326 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:23:17,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:17,396 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:23:17,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:23:17,396 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:23:17,397 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:23:17,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:23:17,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:23:17,398 INFO L87 Difference]: Start difference. First operand 147 states and 155 transitions. Second operand 6 states. [2018-01-24 17:23:17,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:23:17,602 INFO L93 Difference]: Finished difference Result 149 states and 157 transitions. [2018-01-24 17:23:17,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:23:17,603 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 17:23:17,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:23:17,604 INFO L225 Difference]: With dead ends: 149 [2018-01-24 17:23:17,604 INFO L226 Difference]: Without dead ends: 148 [2018-01-24 17:23:17,605 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:23:17,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-01-24 17:23:17,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2018-01-24 17:23:17,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-01-24 17:23:17,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 154 transitions. [2018-01-24 17:23:17,616 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 154 transitions. Word has length 19 [2018-01-24 17:23:17,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:23:17,616 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 154 transitions. [2018-01-24 17:23:17,616 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:23:17,616 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 154 transitions. [2018-01-24 17:23:17,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 17:23:17,617 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:23:17,617 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:23:17,617 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 17:23:17,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1040907539, now seen corresponding path program 1 times [2018-01-24 17:23:17,617 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:23:17,619 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:17,619 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:23:17,619 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:17,619 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:23:17,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:17,640 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:23:17,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:17,879 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:23:17,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 17:23:17,879 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:23:17,880 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 17:23:17,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 17:23:17,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:23:17,880 INFO L87 Difference]: Start difference. First operand 146 states and 154 transitions. Second operand 7 states. [2018-01-24 17:23:18,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:23:18,176 INFO L93 Difference]: Finished difference Result 148 states and 156 transitions. [2018-01-24 17:23:18,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 17:23:18,176 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-01-24 17:23:18,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:23:18,178 INFO L225 Difference]: With dead ends: 148 [2018-01-24 17:23:18,179 INFO L226 Difference]: Without dead ends: 147 [2018-01-24 17:23:18,179 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-24 17:23:18,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-01-24 17:23:18,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2018-01-24 17:23:18,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-01-24 17:23:18,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 153 transitions. [2018-01-24 17:23:18,189 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 153 transitions. Word has length 19 [2018-01-24 17:23:18,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:23:18,189 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 153 transitions. [2018-01-24 17:23:18,190 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 17:23:18,190 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 153 transitions. [2018-01-24 17:23:18,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 17:23:18,190 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:23:18,190 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-24 17:23:18,191 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 17:23:18,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1287954832, now seen corresponding path program 1 times [2018-01-24 17:23:18,191 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:23:18,192 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:18,192 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:23:18,192 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:18,193 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:23:18,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:18,211 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:23:18,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:18,318 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:23:18,318 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 17:23:18,318 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:23:18,319 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 17:23:18,319 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 17:23:18,319 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-24 17:23:18,319 INFO L87 Difference]: Start difference. First operand 145 states and 153 transitions. Second operand 9 states. [2018-01-24 17:23:18,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:23:18,451 INFO L93 Difference]: Finished difference Result 245 states and 257 transitions. [2018-01-24 17:23:18,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 17:23:18,451 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-01-24 17:23:18,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:23:18,454 INFO L225 Difference]: With dead ends: 245 [2018-01-24 17:23:18,455 INFO L226 Difference]: Without dead ends: 165 [2018-01-24 17:23:18,456 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-24 17:23:18,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-01-24 17:23:18,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 159. [2018-01-24 17:23:18,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-01-24 17:23:18,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 167 transitions. [2018-01-24 17:23:18,475 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 167 transitions. Word has length 29 [2018-01-24 17:23:18,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:23:18,476 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 167 transitions. [2018-01-24 17:23:18,476 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 17:23:18,476 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 167 transitions. [2018-01-24 17:23:18,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 17:23:18,477 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:23:18,477 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:23:18,478 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 17:23:18,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1025625474, now seen corresponding path program 1 times [2018-01-24 17:23:18,478 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:23:18,479 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:18,479 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:23:18,480 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:18,480 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:23:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:18,498 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:23:18,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:18,578 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:23:18,578 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 17:23:18,578 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:23:18,579 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 17:23:18,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 17:23:18,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 17:23:18,579 INFO L87 Difference]: Start difference. First operand 159 states and 167 transitions. Second operand 10 states. [2018-01-24 17:23:18,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:23:18,800 INFO L93 Difference]: Finished difference Result 159 states and 167 transitions. [2018-01-24 17:23:18,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 17:23:18,800 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-01-24 17:23:18,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:23:18,802 INFO L225 Difference]: With dead ends: 159 [2018-01-24 17:23:18,803 INFO L226 Difference]: Without dead ends: 158 [2018-01-24 17:23:18,803 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-01-24 17:23:18,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-01-24 17:23:18,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-01-24 17:23:18,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-01-24 17:23:18,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 166 transitions. [2018-01-24 17:23:18,816 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 166 transitions. Word has length 34 [2018-01-24 17:23:18,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:23:18,816 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 166 transitions. [2018-01-24 17:23:18,816 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 17:23:18,816 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 166 transitions. [2018-01-24 17:23:18,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 17:23:18,817 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:23:18,818 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:23:18,818 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 17:23:18,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1025625475, now seen corresponding path program 1 times [2018-01-24 17:23:18,818 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:23:18,819 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:18,819 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:23:18,819 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:18,819 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:23:18,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:18,834 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:23:18,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:18,859 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:23:18,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:23:18,859 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:23:18,860 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:23:18,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:23:18,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:23:18,860 INFO L87 Difference]: Start difference. First operand 158 states and 166 transitions. Second operand 4 states. [2018-01-24 17:23:18,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:23:18,878 INFO L93 Difference]: Finished difference Result 277 states and 291 transitions. [2018-01-24 17:23:18,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 17:23:18,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-01-24 17:23:18,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:23:18,880 INFO L225 Difference]: With dead ends: 277 [2018-01-24 17:23:18,880 INFO L226 Difference]: Without dead ends: 159 [2018-01-24 17:23:18,881 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:23:18,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-01-24 17:23:18,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-01-24 17:23:18,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-01-24 17:23:18,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 167 transitions. [2018-01-24 17:23:18,891 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 167 transitions. Word has length 34 [2018-01-24 17:23:18,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:23:18,892 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 167 transitions. [2018-01-24 17:23:18,892 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:23:18,892 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 167 transitions. [2018-01-24 17:23:18,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-24 17:23:18,893 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:23:18,893 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:23:18,893 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 17:23:18,894 INFO L82 PathProgramCache]: Analyzing trace with hash -553427227, now seen corresponding path program 1 times [2018-01-24 17:23:18,894 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:23:18,895 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:18,895 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:23:18,895 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:18,895 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:23:18,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:18,912 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:23:18,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:18,955 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:23:18,956 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:23:18,956 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-01-24 17:23:18,958 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [31], [36], [52], [58], [62], [66], [69], [71], [72], [76], [78], [79], [129], [132], [133], [134], [136], [137], [138], [160], [161], [162], [163], [164], [166], [172], [176], [182], [198], [199], [200] [2018-01-24 17:23:19,005 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:23:19,005 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:23:19,210 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:23:19,212 INFO L268 AbstractInterpreter]: Visited 35 different actions 39 times. Merged at 3 different actions 3 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 21 variables. [2018-01-24 17:23:19,218 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:23:19,218 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:23:19,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 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:23:19,240 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:23:19,241 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:23:19,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:19,288 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:23:19,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:19,337 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:23:19,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:19,422 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:23:19,422 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-24 17:23:19,427 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:23:19,427 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:23:19,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:19,491 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:23:19,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:19,498 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:23:19,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:19,532 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:23:19,533 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5] total 9 [2018-01-24 17:23:19,533 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:23:19,533 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:23:19,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:23:19,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-01-24 17:23:19,534 INFO L87 Difference]: Start difference. First operand 159 states and 167 transitions. Second operand 6 states. [2018-01-24 17:23:19,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:23:19,581 INFO L93 Difference]: Finished difference Result 278 states and 292 transitions. [2018-01-24 17:23:19,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:23:19,582 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-24 17:23:19,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:23:19,583 INFO L225 Difference]: With dead ends: 278 [2018-01-24 17:23:19,584 INFO L226 Difference]: Without dead ends: 160 [2018-01-24 17:23:19,585 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 134 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-01-24 17:23:19,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-01-24 17:23:19,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-01-24 17:23:19,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-01-24 17:23:19,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 168 transitions. [2018-01-24 17:23:19,596 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 168 transitions. Word has length 35 [2018-01-24 17:23:19,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:23:19,597 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 168 transitions. [2018-01-24 17:23:19,597 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:23:19,597 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 168 transitions. [2018-01-24 17:23:19,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 17:23:19,598 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:23:19,599 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:23:19,599 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 17:23:19,599 INFO L82 PathProgramCache]: Analyzing trace with hash 2035546563, now seen corresponding path program 2 times [2018-01-24 17:23:19,599 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:23:19,601 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:19,601 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:23:19,601 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:19,601 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:23:19,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:19,621 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:23:19,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:19,693 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:23:19,693 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:23:19,694 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 17:23:19,694 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 17:23:19,694 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:23:19,694 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-24 17:23:19,702 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 17:23:19,702 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 17:23:19,724 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 17:23:19,726 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 17:23:19,731 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:23:19,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-24 17:23:19,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:23:19,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-24 17:23:19,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:23:19,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 17:23:19,789 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-24 17:23:22,203 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 45 DAG size of output 17 [2018-01-24 17:23:22,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 17:23:22,373 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:23:22,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 17:23:22,741 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 17:23:22,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14, 13] imperfect sequences [6] total 31 [2018-01-24 17:23:22,741 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:23:22,741 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 17:23:22,741 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 17:23:22,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=839, Unknown=1, NotChecked=0, Total=930 [2018-01-24 17:23:22,742 INFO L87 Difference]: Start difference. First operand 160 states and 168 transitions. Second operand 15 states. [2018-01-24 17:23:24,824 WARN L143 SmtUtils]: Spent 2032ms on a formula simplification that was a NOOP. DAG size: 39 [2018-01-24 17:23:29,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:23:29,809 INFO L93 Difference]: Finished difference Result 218 states and 229 transitions. [2018-01-24 17:23:29,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 17:23:29,810 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2018-01-24 17:23:29,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:23:29,812 INFO L225 Difference]: With dead ends: 218 [2018-01-24 17:23:29,812 INFO L226 Difference]: Without dead ends: 217 [2018-01-24 17:23:29,813 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=118, Invalid=1071, Unknown=1, NotChecked=0, Total=1190 [2018-01-24 17:23:29,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-01-24 17:23:29,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 159. [2018-01-24 17:23:29,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-01-24 17:23:29,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 167 transitions. [2018-01-24 17:23:29,830 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 167 transitions. Word has length 36 [2018-01-24 17:23:29,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:23:29,830 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 167 transitions. [2018-01-24 17:23:29,831 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 17:23:29,831 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 167 transitions. [2018-01-24 17:23:29,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-24 17:23:29,832 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:23:29,832 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] [2018-01-24 17:23:29,832 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 17:23:29,832 INFO L82 PathProgramCache]: Analyzing trace with hash -2073429328, now seen corresponding path program 1 times [2018-01-24 17:23:29,833 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:23:29,833 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:29,834 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 17:23:29,834 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:29,834 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:23:29,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:29,846 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:23:29,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:29,920 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:23:29,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 17:23:29,920 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:23:29,920 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 17:23:29,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 17:23:29,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:23:29,921 INFO L87 Difference]: Start difference. First operand 159 states and 167 transitions. Second operand 7 states. [2018-01-24 17:23:29,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:23:29,999 INFO L93 Difference]: Finished difference Result 222 states and 232 transitions. [2018-01-24 17:23:29,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 17:23:29,999 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2018-01-24 17:23:30,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:23:30,001 INFO L225 Difference]: With dead ends: 222 [2018-01-24 17:23:30,001 INFO L226 Difference]: Without dead ends: 168 [2018-01-24 17:23:30,002 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 17:23:30,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-01-24 17:23:30,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 164. [2018-01-24 17:23:30,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-01-24 17:23:30,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 172 transitions. [2018-01-24 17:23:30,017 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 172 transitions. Word has length 40 [2018-01-24 17:23:30,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:23:30,018 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 172 transitions. [2018-01-24 17:23:30,018 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 17:23:30,018 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 172 transitions. [2018-01-24 17:23:30,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 17:23:30,019 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:23:30,019 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] [2018-01-24 17:23:30,020 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 17:23:30,020 INFO L82 PathProgramCache]: Analyzing trace with hash 2040053740, now seen corresponding path program 1 times [2018-01-24 17:23:30,020 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:23:30,021 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:30,021 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:23:30,021 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:30,021 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:23:30,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:30,030 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:23:30,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:30,058 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:23:30,058 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 17:23:30,058 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:23:30,059 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 17:23:30,059 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 17:23:30,059 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 17:23:30,059 INFO L87 Difference]: Start difference. First operand 164 states and 172 transitions. Second operand 3 states. [2018-01-24 17:23:30,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:23:30,188 INFO L93 Difference]: Finished difference Result 181 states and 190 transitions. [2018-01-24 17:23:30,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 17:23:30,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-01-24 17:23:30,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:23:30,190 INFO L225 Difference]: With dead ends: 181 [2018-01-24 17:23:30,190 INFO L226 Difference]: Without dead ends: 168 [2018-01-24 17:23:30,191 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 17:23:30,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-01-24 17:23:30,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 160. [2018-01-24 17:23:30,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-01-24 17:23:30,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 167 transitions. [2018-01-24 17:23:30,208 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 167 transitions. Word has length 38 [2018-01-24 17:23:30,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:23:30,208 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 167 transitions. [2018-01-24 17:23:30,208 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 17:23:30,209 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 167 transitions. [2018-01-24 17:23:30,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 17:23:30,210 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:23:30,210 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-24 17:23:30,210 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 17:23:30,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1765321240, now seen corresponding path program 1 times [2018-01-24 17:23:30,210 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:23:30,211 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:30,211 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:23:30,211 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:30,212 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:23:30,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:30,226 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:23:30,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 17:23:30,317 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:23:30,318 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 17:23:30,318 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:23:30,318 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 17:23:30,318 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 17:23:30,318 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 17:23:30,318 INFO L87 Difference]: Start difference. First operand 160 states and 167 transitions. Second operand 10 states. [2018-01-24 17:23:30,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:23:30,590 INFO L93 Difference]: Finished difference Result 160 states and 167 transitions. [2018-01-24 17:23:30,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 17:23:30,591 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2018-01-24 17:23:30,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:23:30,592 INFO L225 Difference]: With dead ends: 160 [2018-01-24 17:23:30,592 INFO L226 Difference]: Without dead ends: 158 [2018-01-24 17:23:30,593 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-01-24 17:23:30,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-01-24 17:23:30,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-01-24 17:23:30,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-01-24 17:23:30,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 165 transitions. [2018-01-24 17:23:30,611 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 165 transitions. Word has length 41 [2018-01-24 17:23:30,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:23:30,612 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 165 transitions. [2018-01-24 17:23:30,612 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 17:23:30,612 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 165 transitions. [2018-01-24 17:23:30,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 17:23:30,613 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:23:30,613 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-24 17:23:30,613 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 17:23:30,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1765321239, now seen corresponding path program 1 times [2018-01-24 17:23:30,613 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:23:30,614 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:30,615 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:23:30,615 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:30,615 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:23:30,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:30,632 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:23:30,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:30,666 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:23:30,666 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:23:30,667 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-01-24 17:23:30,667 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [31], [36], [52], [58], [62], [66], [67], [70], [71], [72], [76], [78], [79], [121], [124], [129], [132], [133], [134], [136], [137], [138], [160], [161], [162], [163], [164], [166], [172], [176], [182], [183], [184], [198], [199], [200] [2018-01-24 17:23:30,668 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:23:30,668 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:23:30,774 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:23:30,774 INFO L268 AbstractInterpreter]: Visited 40 different actions 44 times. Merged at 3 different actions 3 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 21 variables. [2018-01-24 17:23:30,775 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:23:30,776 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:23:30,776 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-24 17:23:30,785 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:23:30,786 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:23:30,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:30,818 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:23:30,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:30,833 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:23:30,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:30,946 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:23:30,946 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-24 17:23:30,950 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:23:30,950 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:23:31,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:31,007 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:23:31,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:31,013 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:23:31,072 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:31,074 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:23:31,074 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6] total 11 [2018-01-24 17:23:31,074 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:23:31,074 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 17:23:31,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 17:23:31,075 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-01-24 17:23:31,075 INFO L87 Difference]: Start difference. First operand 158 states and 165 transitions. Second operand 7 states. [2018-01-24 17:23:31,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:23:31,107 INFO L93 Difference]: Finished difference Result 274 states and 287 transitions. [2018-01-24 17:23:31,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:23:31,108 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-01-24 17:23:31,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:23:31,109 INFO L225 Difference]: With dead ends: 274 [2018-01-24 17:23:31,109 INFO L226 Difference]: Without dead ends: 159 [2018-01-24 17:23:31,109 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2018-01-24 17:23:31,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-01-24 17:23:31,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-01-24 17:23:31,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-01-24 17:23:31,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 166 transitions. [2018-01-24 17:23:31,121 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 166 transitions. Word has length 41 [2018-01-24 17:23:31,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:23:31,121 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 166 transitions. [2018-01-24 17:23:31,121 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 17:23:31,121 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 166 transitions. [2018-01-24 17:23:31,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-24 17:23:31,122 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:23:31,122 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] [2018-01-24 17:23:31,122 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 17:23:31,122 INFO L82 PathProgramCache]: Analyzing trace with hash 8062858, now seen corresponding path program 1 times [2018-01-24 17:23:31,122 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:23:31,123 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:31,123 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:23:31,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:31,124 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:23:31,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:31,129 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:23:31,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:31,201 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:23:31,201 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 17:23:31,201 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:23:31,202 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:23:31,202 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:23:31,202 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:23:31,202 INFO L87 Difference]: Start difference. First operand 159 states and 166 transitions. Second operand 6 states. [2018-01-24 17:23:31,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:23:31,258 INFO L93 Difference]: Finished difference Result 163 states and 169 transitions. [2018-01-24 17:23:31,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:23:31,259 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-01-24 17:23:31,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:23:31,259 INFO L225 Difference]: With dead ends: 163 [2018-01-24 17:23:31,259 INFO L226 Difference]: Without dead ends: 140 [2018-01-24 17:23:31,260 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:23:31,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-24 17:23:31,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-01-24 17:23:31,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-24 17:23:31,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 146 transitions. [2018-01-24 17:23:31,269 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 146 transitions. Word has length 40 [2018-01-24 17:23:31,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:23:31,269 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 146 transitions. [2018-01-24 17:23:31,269 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:23:31,269 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 146 transitions. [2018-01-24 17:23:31,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-24 17:23:31,270 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:23:31,270 INFO L322 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:23:31,270 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 17:23:31,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1805397433, now seen corresponding path program 2 times [2018-01-24 17:23:31,270 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:23:31,271 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:31,271 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:23:31,271 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:31,271 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:23:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:31,284 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:23:31,388 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:31,388 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:23:31,388 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:23:31,389 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 17:23:31,389 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 17:23:31,389 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:23:31,389 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-24 17:23:31,405 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 17:23:31,405 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 17:23:31,427 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 17:23:31,438 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 17:23:31,442 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:23:31,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-24 17:23:31,449 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:23:31,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-24 17:23:31,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:23:31,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 17:23:31,476 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-24 17:23:32,104 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 17:23:32,104 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:23:34,640 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 17:23:34,661 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 17:23:34,661 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15, 13] imperfect sequences [7] total 33 [2018-01-24 17:23:34,661 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:23:34,661 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 17:23:34,661 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 17:23:34,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=950, Unknown=1, NotChecked=0, Total=1056 [2018-01-24 17:23:34,662 INFO L87 Difference]: Start difference. First operand 140 states and 146 transitions. Second operand 16 states. [2018-01-24 17:23:35,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:23:35,550 INFO L93 Difference]: Finished difference Result 140 states and 146 transitions. [2018-01-24 17:23:35,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 17:23:35,550 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2018-01-24 17:23:35,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:23:35,552 INFO L225 Difference]: With dead ends: 140 [2018-01-24 17:23:35,552 INFO L226 Difference]: Without dead ends: 138 [2018-01-24 17:23:35,553 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=136, Invalid=1195, Unknown=1, NotChecked=0, Total=1332 [2018-01-24 17:23:35,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-01-24 17:23:35,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-01-24 17:23:35,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-01-24 17:23:35,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 144 transitions. [2018-01-24 17:23:35,571 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 144 transitions. Word has length 42 [2018-01-24 17:23:35,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:23:35,571 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 144 transitions. [2018-01-24 17:23:35,571 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 17:23:35,571 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 144 transitions. [2018-01-24 17:23:35,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-24 17:23:35,572 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:23:35,572 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-24 17:23:35,572 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 17:23:35,573 INFO L82 PathProgramCache]: Analyzing trace with hash -578251942, now seen corresponding path program 1 times [2018-01-24 17:23:35,573 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:23:35,574 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:35,574 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 17:23:35,574 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:35,574 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:23:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:35,588 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:23:35,660 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 17:23:35,660 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:23:35,661 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 17:23:35,661 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:23:35,661 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 17:23:35,661 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 17:23:35,661 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 17:23:35,662 INFO L87 Difference]: Start difference. First operand 138 states and 144 transitions. Second operand 8 states. [2018-01-24 17:23:35,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:23:35,704 INFO L93 Difference]: Finished difference Result 229 states and 238 transitions. [2018-01-24 17:23:35,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 17:23:35,704 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-01-24 17:23:35,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:23:35,705 INFO L225 Difference]: With dead ends: 229 [2018-01-24 17:23:35,705 INFO L226 Difference]: Without dead ends: 138 [2018-01-24 17:23:35,706 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-24 17:23:35,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-01-24 17:23:35,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-01-24 17:23:35,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-01-24 17:23:35,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 143 transitions. [2018-01-24 17:23:35,718 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 143 transitions. Word has length 47 [2018-01-24 17:23:35,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:23:35,719 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 143 transitions. [2018-01-24 17:23:35,719 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 17:23:35,719 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2018-01-24 17:23:35,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-24 17:23:35,719 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:23:35,720 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-24 17:23:35,720 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 17:23:35,720 INFO L82 PathProgramCache]: Analyzing trace with hash -792817057, now seen corresponding path program 1 times [2018-01-24 17:23:35,720 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:23:35,721 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:35,721 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:23:35,721 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:35,721 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:23:35,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:35,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:23:35,787 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 17:23:35,787 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:23:35,787 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 17:23:35,787 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:23:35,788 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 17:23:35,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 17:23:35,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 17:23:35,788 INFO L87 Difference]: Start difference. First operand 138 states and 143 transitions. Second operand 10 states. [2018-01-24 17:23:35,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:23:35,873 INFO L93 Difference]: Finished difference Result 231 states and 239 transitions. [2018-01-24 17:23:35,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 17:23:35,874 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2018-01-24 17:23:35,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:23:35,875 INFO L225 Difference]: With dead ends: 231 [2018-01-24 17:23:35,875 INFO L226 Difference]: Without dead ends: 138 [2018-01-24 17:23:35,876 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-01-24 17:23:35,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-01-24 17:23:35,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-01-24 17:23:35,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-01-24 17:23:35,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 142 transitions. [2018-01-24 17:23:35,893 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 142 transitions. Word has length 52 [2018-01-24 17:23:35,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:23:35,893 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 142 transitions. [2018-01-24 17:23:35,893 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 17:23:35,893 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 142 transitions. [2018-01-24 17:23:35,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-24 17:23:35,894 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:23:35,894 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-24 17:23:35,894 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 17:23:35,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1949575069, now seen corresponding path program 1 times [2018-01-24 17:23:35,895 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:23:35,896 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:35,896 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:23:35,896 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:35,896 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:23:35,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:35,915 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:23:36,082 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 17:23:36,083 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:23:36,083 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-24 17:23:36,083 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:23:36,083 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 17:23:36,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 17:23:36,084 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-01-24 17:23:36,084 INFO L87 Difference]: Start difference. First operand 138 states and 142 transitions. Second operand 15 states. [2018-01-24 17:23:36,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:23:36,536 INFO L93 Difference]: Finished difference Result 138 states and 142 transitions. [2018-01-24 17:23:36,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 17:23:36,536 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 63 [2018-01-24 17:23:36,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:23:36,537 INFO L225 Difference]: With dead ends: 138 [2018-01-24 17:23:36,537 INFO L226 Difference]: Without dead ends: 136 [2018-01-24 17:23:36,537 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-01-24 17:23:36,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-01-24 17:23:36,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-01-24 17:23:36,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-01-24 17:23:36,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 140 transitions. [2018-01-24 17:23:36,555 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 140 transitions. Word has length 63 [2018-01-24 17:23:36,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:23:36,556 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 140 transitions. [2018-01-24 17:23:36,556 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 17:23:36,556 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 140 transitions. [2018-01-24 17:23:36,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-24 17:23:36,557 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:23:36,557 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-24 17:23:36,557 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 17:23:36,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1949575070, now seen corresponding path program 1 times [2018-01-24 17:23:36,558 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:23:36,558 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:36,559 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:23:36,559 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:36,559 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:23:36,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:36,581 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:23:36,668 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:36,668 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:23:36,669 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:23:36,669 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 64 with the following transitions: [2018-01-24 17:23:36,669 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [12], [13], [17], [31], [36], [38], [52], [54], [58], [62], [65], [66], [67], [70], [71], [72], [76], [78], [79], [90], [93], [121], [122], [125], [128], [129], [132], [133], [134], [136], [137], [138], [143], [146], [153], [160], [161], [162], [163], [164], [165], [166], [168], [172], [173], [176], [177], [178], [182], [183], [184], [185], [194], [196], [198], [199], [200] [2018-01-24 17:23:36,671 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:23:36,672 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:23:36,833 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:23:36,834 INFO L268 AbstractInterpreter]: Visited 61 different actions 65 times. Merged at 3 different actions 3 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 22 variables. [2018-01-24 17:23:36,835 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:23:36,835 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:23:36,836 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-24 17:23:36,844 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:23:36,844 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:23:36,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:36,883 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:23:36,902 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:36,902 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:23:37,015 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:37,037 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:23:37,037 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-24 17:23:37,043 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:23:37,043 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:23:37,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:37,135 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:23:37,141 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:37,141 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:23:37,206 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:37,207 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:23:37,208 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 13 [2018-01-24 17:23:37,208 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:23:37,208 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 17:23:37,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 17:23:37,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-01-24 17:23:37,208 INFO L87 Difference]: Start difference. First operand 136 states and 140 transitions. Second operand 8 states. [2018-01-24 17:23:37,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:23:37,263 INFO L93 Difference]: Finished difference Result 248 states and 256 transitions. [2018-01-24 17:23:37,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 17:23:37,263 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2018-01-24 17:23:37,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:23:37,264 INFO L225 Difference]: With dead ends: 248 [2018-01-24 17:23:37,264 INFO L226 Difference]: Without dead ends: 137 [2018-01-24 17:23:37,264 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-24 17:23:37,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-24 17:23:37,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-01-24 17:23:37,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-01-24 17:23:37,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 141 transitions. [2018-01-24 17:23:37,275 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 141 transitions. Word has length 63 [2018-01-24 17:23:37,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:23:37,275 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 141 transitions. [2018-01-24 17:23:37,275 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 17:23:37,275 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2018-01-24 17:23:37,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-24 17:23:37,275 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:23:37,276 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-24 17:23:37,276 INFO L371 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 17:23:37,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1497491836, now seen corresponding path program 2 times [2018-01-24 17:23:37,276 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:23:37,277 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:37,277 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:23:37,277 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:37,278 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:23:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:37,294 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:23:37,384 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:37,385 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:23:37,385 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:23:37,385 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 17:23:37,385 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 17:23:37,385 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:23:37,385 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-24 17:23:37,394 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 17:23:37,394 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 17:23:37,424 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 17:23:37,427 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 17:23:37,432 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:23:37,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-24 17:23:37,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:23:37,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-24 17:23:37,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:23:37,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 17:23:37,484 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-24 17:23:38,310 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 17:23:38,310 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:23:42,235 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 17:23:42,261 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 17:23:42,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20, 18] imperfect sequences [8] total 44 [2018-01-24 17:23:42,262 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:23:42,262 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 17:23:42,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 17:23:42,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1745, Unknown=1, NotChecked=0, Total=1892 [2018-01-24 17:23:42,263 INFO L87 Difference]: Start difference. First operand 137 states and 141 transitions. Second operand 21 states. [2018-01-24 17:23:44,372 WARN L143 SmtUtils]: Spent 2035ms on a formula simplification that was a NOOP. DAG size: 39 [2018-01-24 17:23:45,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:23:45,428 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2018-01-24 17:23:45,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-24 17:23:45,428 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-01-24 17:23:45,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:23:45,429 INFO L225 Difference]: With dead ends: 137 [2018-01-24 17:23:45,429 INFO L226 Difference]: Without dead ends: 135 [2018-01-24 17:23:45,430 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=195, Invalid=2254, Unknown=1, NotChecked=0, Total=2450 [2018-01-24 17:23:45,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-24 17:23:45,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-01-24 17:23:45,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-24 17:23:45,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2018-01-24 17:23:45,449 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 64 [2018-01-24 17:23:45,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:23:45,449 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2018-01-24 17:23:45,449 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-24 17:23:45,450 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2018-01-24 17:23:45,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-24 17:23:45,451 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:23:45,451 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] [2018-01-24 17:23:45,451 INFO L371 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 17:23:45,451 INFO L82 PathProgramCache]: Analyzing trace with hash -938431803, now seen corresponding path program 1 times [2018-01-24 17:23:45,451 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:23:45,452 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:45,452 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 17:23:45,453 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:45,453 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:23:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:45,473 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:23:45,626 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 17:23:45,626 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:23:45,626 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-24 17:23:45,626 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:23:45,626 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 17:23:45,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 17:23:45,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-01-24 17:23:45,627 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand 13 states. [2018-01-24 17:23:45,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:23:45,726 INFO L93 Difference]: Finished difference Result 198 states and 204 transitions. [2018-01-24 17:23:45,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 17:23:45,726 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 75 [2018-01-24 17:23:45,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:23:45,727 INFO L225 Difference]: With dead ends: 198 [2018-01-24 17:23:45,727 INFO L226 Difference]: Without dead ends: 135 [2018-01-24 17:23:45,728 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-24 17:23:45,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-24 17:23:45,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-01-24 17:23:45,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-24 17:23:45,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 138 transitions. [2018-01-24 17:23:45,739 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 138 transitions. Word has length 75 [2018-01-24 17:23:45,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:23:45,740 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 138 transitions. [2018-01-24 17:23:45,740 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 17:23:45,740 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 138 transitions. [2018-01-24 17:23:45,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-01-24 17:23:45,741 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:23:45,741 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] [2018-01-24 17:23:45,741 INFO L371 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 17:23:45,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1956264887, now seen corresponding path program 1 times [2018-01-24 17:23:45,741 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:23:45,742 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:45,742 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:23:45,742 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:45,742 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:23:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:45,759 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:23:46,008 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 17:23:46,008 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:23:46,008 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-01-24 17:23:46,009 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:23:46,009 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-24 17:23:46,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-24 17:23:46,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2018-01-24 17:23:46,009 INFO L87 Difference]: Start difference. First operand 135 states and 138 transitions. Second operand 20 states. [2018-01-24 17:23:46,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:23:46,359 INFO L93 Difference]: Finished difference Result 144 states and 147 transitions. [2018-01-24 17:23:46,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-24 17:23:46,359 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 88 [2018-01-24 17:23:46,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:23:46,360 INFO L225 Difference]: With dead ends: 144 [2018-01-24 17:23:46,361 INFO L226 Difference]: Without dead ends: 142 [2018-01-24 17:23:46,361 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2018-01-24 17:23:46,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-01-24 17:23:46,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 133. [2018-01-24 17:23:46,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-24 17:23:46,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 136 transitions. [2018-01-24 17:23:46,374 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 136 transitions. Word has length 88 [2018-01-24 17:23:46,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:23:46,374 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 136 transitions. [2018-01-24 17:23:46,374 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-24 17:23:46,374 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2018-01-24 17:23:46,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-01-24 17:23:46,374 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:23:46,375 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] [2018-01-24 17:23:46,375 INFO L371 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 17:23:46,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1956264888, now seen corresponding path program 1 times [2018-01-24 17:23:46,375 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:23:46,376 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:46,376 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:23:46,376 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:46,376 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:23:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:46,397 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:23:46,473 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:46,474 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:23:46,474 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:23:46,474 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 89 with the following transitions: [2018-01-24 17:23:46,475 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [12], [13], [17], [19], [20], [21], [24], [31], [36], [38], [39], [42], [52], [54], [58], [62], [65], [66], [67], [70], [71], [72], [76], [78], [79], [80], [90], [91], [94], [95], [98], [99], [121], [122], [125], [128], [129], [132], [133], [134], [136], [137], [138], [139], [143], [146], [151], [152], [153], [155], [156], [160], [161], [162], [163], [164], [165], [166], [168], [169], [170], [172], [173], [176], [177], [178], [179], [180], [182], [183], [184], [185], [186], [192], [194], [195], [196], [197], [198], [199], [200] [2018-01-24 17:23:46,478 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:23:46,478 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:23:46,678 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:23:46,679 INFO L268 AbstractInterpreter]: Visited 85 different actions 89 times. Merged at 3 different actions 3 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 26 variables. [2018-01-24 17:23:46,693 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:23:46,693 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:23:46,693 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-24 17:23:46,699 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:23:46,700 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:23:46,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:46,752 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:23:46,763 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:46,763 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:23:46,956 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:46,975 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:23:46,975 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-24 17:23:46,978 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:23:46,978 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:23:47,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:47,137 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:23:47,146 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:47,146 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:23:47,329 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:47,331 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:23:47,332 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8] total 15 [2018-01-24 17:23:47,332 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:23:47,332 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 17:23:47,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 17:23:47,332 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-01-24 17:23:47,333 INFO L87 Difference]: Start difference. First operand 133 states and 136 transitions. Second operand 9 states. [2018-01-24 17:23:47,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:23:47,371 INFO L93 Difference]: Finished difference Result 241 states and 247 transitions. [2018-01-24 17:23:47,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 17:23:47,371 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2018-01-24 17:23:47,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:23:47,372 INFO L225 Difference]: With dead ends: 241 [2018-01-24 17:23:47,372 INFO L226 Difference]: Without dead ends: 134 [2018-01-24 17:23:47,373 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 343 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=103, Invalid=137, Unknown=0, NotChecked=0, Total=240 [2018-01-24 17:23:47,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-01-24 17:23:47,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-01-24 17:23:47,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-01-24 17:23:47,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 137 transitions. [2018-01-24 17:23:47,389 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 137 transitions. Word has length 88 [2018-01-24 17:23:47,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:23:47,389 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 137 transitions. [2018-01-24 17:23:47,389 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 17:23:47,389 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 137 transitions. [2018-01-24 17:23:47,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-01-24 17:23:47,390 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:23:47,390 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] [2018-01-24 17:23:47,391 INFO L371 AbstractCegarLoop]: === Iteration 23 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 17:23:47,391 INFO L82 PathProgramCache]: Analyzing trace with hash -632442982, now seen corresponding path program 2 times [2018-01-24 17:23:47,391 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:23:47,392 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:47,392 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:23:47,392 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:47,392 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:23:47,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:47,415 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:23:47,547 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:47,548 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:23:47,548 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:23:47,548 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 17:23:47,548 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 17:23:47,548 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:23:47,548 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-24 17:23:47,554 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 17:23:47,554 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 17:23:47,593 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 17:23:47,602 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 17:23:47,607 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:23:47,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-24 17:23:47,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:23:47,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-24 17:23:47,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:23:47,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 17:23:47,648 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-24 17:23:48,685 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-24 17:23:48,685 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:23:51,398 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-24 17:23:51,419 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 17:23:51,419 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20, 18] imperfect sequences [9] total 45 [2018-01-24 17:23:51,419 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:23:51,419 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 17:23:51,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 17:23:51,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1826, Unknown=1, NotChecked=0, Total=1980 [2018-01-24 17:23:51,420 INFO L87 Difference]: Start difference. First operand 134 states and 137 transitions. Second operand 21 states. [2018-01-24 17:23:52,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:23:52,566 INFO L93 Difference]: Finished difference Result 134 states and 137 transitions. [2018-01-24 17:23:52,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-24 17:23:52,566 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 89 [2018-01-24 17:23:52,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:23:52,567 INFO L225 Difference]: With dead ends: 134 [2018-01-24 17:23:52,567 INFO L226 Difference]: Without dead ends: 132 [2018-01-24 17:23:52,567 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 139 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=202, Invalid=2347, Unknown=1, NotChecked=0, Total=2550 [2018-01-24 17:23:52,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-24 17:23:52,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-01-24 17:23:52,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-24 17:23:52,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 135 transitions. [2018-01-24 17:23:52,582 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 135 transitions. Word has length 89 [2018-01-24 17:23:52,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:23:52,583 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 135 transitions. [2018-01-24 17:23:52,583 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-24 17:23:52,583 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 135 transitions. [2018-01-24 17:23:52,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-24 17:23:52,583 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:23:52,583 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] [2018-01-24 17:23:52,584 INFO L371 AbstractCegarLoop]: === Iteration 24 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 17:23:52,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1819895019, now seen corresponding path program 1 times [2018-01-24 17:23:52,584 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:23:52,585 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:52,585 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 17:23:52,585 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:52,585 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:23:52,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:52,603 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:23:52,754 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-24 17:23:52,755 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:23:52,755 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-24 17:23:52,755 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:23:52,755 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 17:23:52,756 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 17:23:52,756 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-01-24 17:23:52,756 INFO L87 Difference]: Start difference. First operand 132 states and 135 transitions. Second operand 11 states. [2018-01-24 17:23:52,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:23:52,853 INFO L93 Difference]: Finished difference Result 138 states and 140 transitions. [2018-01-24 17:23:52,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 17:23:52,853 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 87 [2018-01-24 17:23:52,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:23:52,855 INFO L225 Difference]: With dead ends: 138 [2018-01-24 17:23:52,855 INFO L226 Difference]: Without dead ends: 132 [2018-01-24 17:23:52,855 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-01-24 17:23:52,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-24 17:23:52,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-01-24 17:23:52,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-24 17:23:52,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 134 transitions. [2018-01-24 17:23:52,876 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 134 transitions. Word has length 87 [2018-01-24 17:23:52,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:23:52,877 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 134 transitions. [2018-01-24 17:23:52,877 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 17:23:52,877 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 134 transitions. [2018-01-24 17:23:52,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-01-24 17:23:52,878 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:23:52,878 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:23:52,879 INFO L371 AbstractCegarLoop]: === Iteration 25 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 17:23:52,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1903839439, now seen corresponding path program 1 times [2018-01-24 17:23:52,879 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:23:52,880 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:52,880 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:23:52,880 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:52,880 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:23:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:52,903 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:23:53,226 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-24 17:23:53,226 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:23:53,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-01-24 17:23:53,226 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:23:53,227 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-24 17:23:53,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-24 17:23:53,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2018-01-24 17:23:53,227 INFO L87 Difference]: Start difference. First operand 132 states and 134 transitions. Second operand 24 states. [2018-01-24 17:23:53,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:23:53,663 INFO L93 Difference]: Finished difference Result 137 states and 139 transitions. [2018-01-24 17:23:53,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-24 17:23:53,663 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 103 [2018-01-24 17:23:53,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:23:53,664 INFO L225 Difference]: With dead ends: 137 [2018-01-24 17:23:53,664 INFO L226 Difference]: Without dead ends: 135 [2018-01-24 17:23:53,665 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=973, Unknown=0, NotChecked=0, Total=1056 [2018-01-24 17:23:53,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-24 17:23:53,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 130. [2018-01-24 17:23:53,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-01-24 17:23:53,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 132 transitions. [2018-01-24 17:23:53,680 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 132 transitions. Word has length 103 [2018-01-24 17:23:53,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:23:53,693 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 132 transitions. [2018-01-24 17:23:53,693 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-24 17:23:53,693 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 132 transitions. [2018-01-24 17:23:53,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-01-24 17:23:53,694 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:23:53,694 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:23:53,694 INFO L371 AbstractCegarLoop]: === Iteration 26 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 17:23:53,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1903839438, now seen corresponding path program 1 times [2018-01-24 17:23:53,694 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:23:53,695 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:53,695 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:23:53,695 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:53,695 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:23:53,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:53,715 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:23:53,812 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:53,813 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:23:53,813 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:23:53,813 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 104 with the following transitions: [2018-01-24 17:23:53,813 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [12], [13], [17], [19], [20], [21], [24], [31], [36], [38], [39], [40], [43], [44], [47], [48], [49], [52], [54], [58], [62], [65], [66], [67], [70], [71], [72], [76], [78], [79], [80], [82], [85], [90], [91], [94], [95], [98], [99], [100], [103], [106], [121], [122], [125], [128], [129], [132], [133], [134], [136], [137], [138], [139], [143], [146], [151], [152], [153], [155], [156], [160], [161], [162], [163], [164], [165], [166], [168], [169], [170], [172], [173], [174], [176], [177], [178], [179], [180], [182], [183], [184], [185], [186], [187], [188], [190], [192], [194], [195], [196], [197], [198], [199], [200] [2018-01-24 17:23:53,816 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:23:53,817 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:23:54,020 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:23:54,020 INFO L268 AbstractInterpreter]: Visited 99 different actions 103 times. Merged at 3 different actions 3 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 27 variables. [2018-01-24 17:23:54,039 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:23:54,039 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:23:54,040 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:23:54,047 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:23:54,047 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:23:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:54,107 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:23:54,117 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:54,117 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:23:54,256 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:54,276 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:23:54,277 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 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 15 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 17:23:54,280 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:23:54,280 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:23:54,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:54,389 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:23:54,396 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:54,396 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:23:54,480 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:54,482 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:23:54,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9] total 17 [2018-01-24 17:23:54,482 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:23:54,483 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 17:23:54,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 17:23:54,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-01-24 17:23:54,483 INFO L87 Difference]: Start difference. First operand 130 states and 132 transitions. Second operand 10 states. [2018-01-24 17:23:54,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:23:54,520 INFO L93 Difference]: Finished difference Result 234 states and 238 transitions. [2018-01-24 17:23:54,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 17:23:54,521 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 103 [2018-01-24 17:23:54,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:23:54,522 INFO L225 Difference]: With dead ends: 234 [2018-01-24 17:23:54,522 INFO L226 Difference]: Without dead ends: 131 [2018-01-24 17:23:54,523 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 402 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=133, Invalid=173, Unknown=0, NotChecked=0, Total=306 [2018-01-24 17:23:54,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-01-24 17:23:54,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-01-24 17:23:54,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-01-24 17:23:54,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 133 transitions. [2018-01-24 17:23:54,540 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 133 transitions. Word has length 103 [2018-01-24 17:23:54,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:23:54,541 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 133 transitions. [2018-01-24 17:23:54,541 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 17:23:54,541 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 133 transitions. [2018-01-24 17:23:54,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-01-24 17:23:54,542 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:23:54,542 INFO L322 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:23:54,542 INFO L371 AbstractCegarLoop]: === Iteration 27 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 17:23:54,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1440989968, now seen corresponding path program 2 times [2018-01-24 17:23:54,542 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:23:54,543 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:54,543 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:23:54,543 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:23:54,544 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:23:54,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:23:54,568 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:23:54,659 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:23:54,659 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:23:54,660 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:23:54,660 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 17:23:54,660 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 17:23:54,660 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:23:54,660 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:23:54,668 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 17:23:54,669 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 17:23:54,740 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 17:23:54,753 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 17:23:54,758 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:23:54,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-24 17:23:54,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:23:54,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-24 17:23:54,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:23:54,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 17:23:54,796 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-24 17:23:55,998 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-01-24 17:23:55,998 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:24:04,973 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-01-24 17:24:04,994 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 17:24:04,995 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24, 22] imperfect sequences [10] total 54 [2018-01-24 17:24:04,995 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:24:04,995 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-24 17:24:04,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-24 17:24:04,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=2669, Unknown=4, NotChecked=0, Total=2862 [2018-01-24 17:24:04,996 INFO L87 Difference]: Start difference. First operand 131 states and 133 transitions. Second operand 25 states. [2018-01-24 17:24:06,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:24:06,370 INFO L93 Difference]: Finished difference Result 131 states and 133 transitions. [2018-01-24 17:24:06,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-24 17:24:06,371 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 104 [2018-01-24 17:24:06,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:24:06,372 INFO L225 Difference]: With dead ends: 131 [2018-01-24 17:24:06,372 INFO L226 Difference]: Without dead ends: 129 [2018-01-24 17:24:06,373 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 159 SyntacticMatches, 6 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=254, Invalid=3524, Unknown=4, NotChecked=0, Total=3782 [2018-01-24 17:24:06,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-01-24 17:24:06,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-01-24 17:24:06,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-24 17:24:06,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 131 transitions. [2018-01-24 17:24:06,389 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 131 transitions. Word has length 104 [2018-01-24 17:24:06,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:24:06,390 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 131 transitions. [2018-01-24 17:24:06,390 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-24 17:24:06,390 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2018-01-24 17:24:06,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-01-24 17:24:06,391 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:24:06,391 INFO L322 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:24:06,391 INFO L371 AbstractCegarLoop]: === Iteration 28 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 17:24:06,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1765921617, now seen corresponding path program 1 times [2018-01-24 17:24:06,391 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:24:06,392 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:24:06,393 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 17:24:06,393 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:24:06,393 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:24:06,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:24:06,411 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:24:06,516 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:24:06,516 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:24:06,516 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:24:06,517 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 109 with the following transitions: [2018-01-24 17:24:06,517 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [12], [13], [17], [19], [20], [21], [24], [31], [36], [38], [39], [40], [43], [44], [47], [48], [49], [52], [54], [58], [62], [65], [66], [67], [70], [71], [72], [76], [78], [79], [80], [82], [85], [90], [91], [94], [95], [98], [99], [100], [103], [104], [107], [108], [113], [115], [121], [122], [125], [128], [129], [132], [133], [134], [136], [137], [138], [139], [143], [146], [151], [152], [153], [155], [156], [160], [161], [162], [163], [164], [165], [166], [168], [169], [170], [172], [173], [174], [176], [177], [178], [179], [180], [182], [183], [184], [185], [186], [187], [188], [190], [192], [194], [195], [196], [197], [198], [199], [200] [2018-01-24 17:24:06,518 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:24:06,519 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:24:06,757 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:24:06,757 INFO L268 AbstractInterpreter]: Visited 103 different actions 107 times. Merged at 3 different actions 3 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 27 variables. [2018-01-24 17:24:06,768 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:24:06,768 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:24:06,768 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:24:06,778 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:24:06,778 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:24:06,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:24:06,833 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:24:06,844 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:24:06,844 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:24:07,005 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:24:07,026 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:24:07,026 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 18 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 18 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 17:24:07,029 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:24:07,029 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:24:07,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:24:07,146 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:24:07,153 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:24:07,153 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:24:07,239 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:24:07,240 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:24:07,241 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 10, 10] total 19 [2018-01-24 17:24:07,241 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:24:07,241 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 17:24:07,241 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 17:24:07,241 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-01-24 17:24:07,241 INFO L87 Difference]: Start difference. First operand 129 states and 131 transitions. Second operand 11 states. [2018-01-24 17:24:07,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:24:07,277 INFO L93 Difference]: Finished difference Result 231 states and 235 transitions. [2018-01-24 17:24:07,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 17:24:07,277 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 108 [2018-01-24 17:24:07,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:24:07,278 INFO L225 Difference]: With dead ends: 231 [2018-01-24 17:24:07,279 INFO L226 Difference]: Without dead ends: 130 [2018-01-24 17:24:07,279 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 421 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=167, Invalid=213, Unknown=0, NotChecked=0, Total=380 [2018-01-24 17:24:07,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-01-24 17:24:07,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-01-24 17:24:07,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-01-24 17:24:07,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 132 transitions. [2018-01-24 17:24:07,306 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 132 transitions. Word has length 108 [2018-01-24 17:24:07,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:24:07,307 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 132 transitions. [2018-01-24 17:24:07,307 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 17:24:07,307 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 132 transitions. [2018-01-24 17:24:07,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-01-24 17:24:07,308 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:24:07,308 INFO L322 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:24:07,308 INFO L371 AbstractCegarLoop]: === Iteration 29 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 17:24:07,308 INFO L82 PathProgramCache]: Analyzing trace with hash -859405773, now seen corresponding path program 2 times [2018-01-24 17:24:07,308 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:24:07,309 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:24:07,309 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:24:07,309 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:24:07,309 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:24:07,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:24:07,332 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:24:07,491 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:24:07,491 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:24:07,491 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:24:07,491 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 17:24:07,491 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 17:24:07,491 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:24:07,491 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:24:07,497 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 17:24:07,498 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 17:24:07,543 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 17:24:07,551 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 17:24:07,558 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:24:07,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 17:24:07,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 17:24:07,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:24:07,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:24:07,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:24:07,638 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-01-24 17:24:07,715 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:24:07,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:24:07,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 17:24:07,723 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:26 [2018-01-24 17:24:07,726 WARN L1029 $PredicateComparison]: unable to prove that (exists ((LDV_INIT_LIST_HEAD_~list.offset Int) (v_DerPreprocessor_2 Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (let ((.cse0 (+ LDV_INIT_LIST_HEAD_~list.offset 4))) (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) LDV_INIT_LIST_HEAD_~list.offset v_DerPreprocessor_2) .cse0 (select (select |c_#memory_int| |c_LDV_INIT_LIST_HEAD_#in~list.base|) .cse0))))) (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) is different from true [2018-01-24 17:24:07,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2018-01-24 17:24:07,744 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:24:07,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-01-24 17:24:07,755 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:24:07,756 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:24:07,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-01-24 17:24:07,760 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 17:24:07,766 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:24:07,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:24:07,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:24:07,775 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:37, output treesize:9 [2018-01-24 17:24:08,215 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:24:08,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 36 [2018-01-24 17:24:08,217 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 17:24:08,217 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:24:08,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2018-01-24 17:24:08,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:24:08,220 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:24:08,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:24:08,223 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:13 [2018-01-24 17:24:08,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-01-24 17:24:08,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-01-24 17:24:08,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:24:08,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:24:08,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:24:08,591 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-01-24 17:24:08,635 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-01-24 17:24:08,636 INFO L314 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2018-01-24 17:24:09,650 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 17:24:09,651 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 17:24:09,655 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 17:24:09,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 05:24:09 BoogieIcfgContainer [2018-01-24 17:24:09,655 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 17:24:09,656 INFO L168 Benchmark]: Toolchain (without parser) took 53660.80 ms. Allocated memory was 297.8 MB in the beginning and 723.5 MB in the end (delta: 425.7 MB). Free memory was 256.8 MB in the beginning and 661.5 MB in the end (delta: -404.7 MB). Peak memory consumption was 397.3 MB. Max. memory is 5.3 GB. [2018-01-24 17:24:09,657 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 297.8 MB. Free memory is still 263.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 17:24:09,657 INFO L168 Benchmark]: CACSL2BoogieTranslator took 227.39 ms. Allocated memory is still 297.8 MB. Free memory was 256.8 MB in the beginning and 242.8 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 5.3 GB. [2018-01-24 17:24:09,657 INFO L168 Benchmark]: Boogie Preprocessor took 39.16 ms. Allocated memory is still 297.8 MB. Free memory was 242.8 MB in the beginning and 240.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 17:24:09,658 INFO L168 Benchmark]: RCFGBuilder took 462.37 ms. Allocated memory is still 297.8 MB. Free memory was 240.8 MB in the beginning and 205.2 MB in the end (delta: 35.6 MB). Peak memory consumption was 35.6 MB. Max. memory is 5.3 GB. [2018-01-24 17:24:09,658 INFO L168 Benchmark]: TraceAbstraction took 52923.20 ms. Allocated memory was 297.8 MB in the beginning and 723.5 MB in the end (delta: 425.7 MB). Free memory was 205.2 MB in the beginning and 661.5 MB in the end (delta: -456.4 MB). Peak memory consumption was 345.6 MB. Max. memory is 5.3 GB. [2018-01-24 17:24:09,660 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 297.8 MB. Free memory is still 263.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 227.39 ms. Allocated memory is still 297.8 MB. Free memory was 256.8 MB in the beginning and 242.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 39.16 ms. Allocated memory is still 297.8 MB. Free memory was 242.8 MB in the beginning and 240.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 462.37 ms. Allocated memory is still 297.8 MB. Free memory was 240.8 MB in the beginning and 205.2 MB in the end (delta: 35.6 MB). Peak memory consumption was 35.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 52923.20 ms. Allocated memory was 297.8 MB in the beginning and 723.5 MB in the end (delta: 425.7 MB). Free memory was 205.2 MB in the beginning and 661.5 MB in the end (delta: -456.4 MB). Peak memory consumption was 345.6 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 : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 237 LocStat_NO_SUPPORTING_DISEQUALITIES : 25 LocStat_NO_DISJUNCTIONS : -68 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 53 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 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.613416 RENAME_VARIABLES(MILLISECONDS) : 0.204404 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.237931 PROJECTAWAY(MILLISECONDS) : 0.069185 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001427 DISJOIN(MILLISECONDS) : 1.951061 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.239856 ADD_EQUALITY(MILLISECONDS) : 0.020075 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.014586 #CONJOIN_DISJUNCTIVE : 74 #RENAME_VARIABLES : 112 #UNFREEZE : 0 #CONJOIN : 154 #PROJECTAWAY : 118 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 1 #RENAME_VARIABLES_DISJUNCTIVE : 108 #ADD_EQUALITY : 111 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 39 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 272 LocStat_NO_SUPPORTING_DISEQUALITIES : 30 LocStat_NO_DISJUNCTIONS : -78 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 60 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 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.528758 RENAME_VARIABLES(MILLISECONDS) : 0.149573 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.181610 PROJECTAWAY(MILLISECONDS) : 0.043252 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001122 DISJOIN(MILLISECONDS) : 0.357417 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.177749 ADD_EQUALITY(MILLISECONDS) : 0.028684 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.012219 #CONJOIN_DISJUNCTIVE : 84 #RENAME_VARIABLES : 127 #UNFREEZE : 0 #CONJOIN : 179 #PROJECTAWAY : 135 #ADD_WEAK_EQUALITY : 15 #DISJOIN : 1 #RENAME_VARIABLES_DISJUNCTIVE : 123 #ADD_EQUALITY : 128 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 60 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 418 LocStat_NO_SUPPORTING_DISEQUALITIES : 51 LocStat_NO_DISJUNCTIONS : -120 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 89 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 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.525359 RENAME_VARIABLES(MILLISECONDS) : 0.120131 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.255005 PROJECTAWAY(MILLISECONDS) : 0.036872 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001127 DISJOIN(MILLISECONDS) : 0.449010 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.143724 ADD_EQUALITY(MILLISECONDS) : 0.025298 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.012847 #CONJOIN_DISJUNCTIVE : 126 #RENAME_VARIABLES : 190 #UNFREEZE : 0 #CONJOIN : 270 #PROJECTAWAY : 206 #ADD_WEAK_EQUALITY : 27 #DISJOIN : 1 #RENAME_VARIABLES_DISJUNCTIVE : 185 #ADD_EQUALITY : 190 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 10 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 84 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 621 LocStat_NO_SUPPORTING_DISEQUALITIES : 75 LocStat_NO_DISJUNCTIONS : -168 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 121 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 243 TransStat_NO_SUPPORTING_DISEQUALITIES : 13 TransStat_NO_DISJUNCTIONS : 127 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.403487 RENAME_VARIABLES(MILLISECONDS) : 0.102738 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.160082 PROJECTAWAY(MILLISECONDS) : 0.040752 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001478 DISJOIN(MILLISECONDS) : 0.471605 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.128164 ADD_EQUALITY(MILLISECONDS) : 0.019558 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.010997 #CONJOIN_DISJUNCTIVE : 171 #RENAME_VARIABLES : 259 #UNFREEZE : 0 #CONJOIN : 375 #PROJECTAWAY : 283 #ADD_WEAK_EQUALITY : 33 #DISJOIN : 1 #RENAME_VARIABLES_DISJUNCTIVE : 253 #ADD_EQUALITY : 264 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 12 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 98 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 750 LocStat_NO_SUPPORTING_DISEQUALITIES : 89 LocStat_NO_DISJUNCTIONS : -196 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 141 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 275 TransStat_NO_SUPPORTING_DISEQUALITIES : 13 TransStat_NO_DISJUNCTIONS : 147 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.339647 RENAME_VARIABLES(MILLISECONDS) : 0.107826 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.132126 PROJECTAWAY(MILLISECONDS) : 0.041950 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001264 DISJOIN(MILLISECONDS) : 0.486747 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.132755 ADD_EQUALITY(MILLISECONDS) : 0.017997 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.008080 #CONJOIN_DISJUNCTIVE : 194 #RENAME_VARIABLES : 296 #UNFREEZE : 0 #CONJOIN : 423 #PROJECTAWAY : 324 #ADD_WEAK_EQUALITY : 39 #DISJOIN : 1 #RENAME_VARIABLES_DISJUNCTIVE : 290 #ADD_EQUALITY : 301 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 12 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 102 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 792 LocStat_NO_SUPPORTING_DISEQUALITIES : 97 LocStat_NO_DISJUNCTIONS : -204 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 145 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 292 TransStat_NO_SUPPORTING_DISEQUALITIES : 18 TransStat_NO_DISJUNCTIONS : 154 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.533452 RENAME_VARIABLES(MILLISECONDS) : 0.215936 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.499267 PROJECTAWAY(MILLISECONDS) : 0.060663 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.002638 DISJOIN(MILLISECONDS) : 0.624818 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.244194 ADD_EQUALITY(MILLISECONDS) : 0.022346 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.012548 #CONJOIN_DISJUNCTIVE : 202 #RENAME_VARIABLES : 309 #UNFREEZE : 0 #CONJOIN : 460 #PROJECTAWAY : 336 #ADD_WEAK_EQUALITY : 40 #DISJOIN : 1 #RENAME_VARIABLES_DISJUNCTIVE : 300 #ADD_EQUALITY : 310 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 16 * 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 110 with TraceHistMax 7, while TraceCheckSpWp was constructing backward predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 24. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1294). Cancelled while BasicCegarLoop was analyzing trace of length 110 with TraceHistMax 7, while TraceCheckSpWp was constructing backward predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 24. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1411). Cancelled while BasicCegarLoop was analyzing trace of length 110 with TraceHistMax 7, while TraceCheckSpWp was constructing backward predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 24. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1411). Cancelled while BasicCegarLoop was analyzing trace of length 110 with TraceHistMax 7, while TraceCheckSpWp was constructing backward predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 24. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1265). Cancelled while BasicCegarLoop was analyzing trace of length 110 with TraceHistMax 7, while TraceCheckSpWp was constructing backward predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 24. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1265). Cancelled while BasicCegarLoop was analyzing trace of length 110 with TraceHistMax 7, while TraceCheckSpWp was constructing backward predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 24. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1267). Cancelled while BasicCegarLoop was analyzing trace of length 110 with TraceHistMax 7, while TraceCheckSpWp was constructing backward predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 24. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1267). Cancelled while BasicCegarLoop was analyzing trace of length 110 with TraceHistMax 7, while TraceCheckSpWp was constructing backward predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 24. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1256). Cancelled while BasicCegarLoop was analyzing trace of length 110 with TraceHistMax 7, while TraceCheckSpWp was constructing backward predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 24. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1256). Cancelled while BasicCegarLoop was analyzing trace of length 110 with TraceHistMax 7, while TraceCheckSpWp was constructing backward predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 24. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1258). Cancelled while BasicCegarLoop was analyzing trace of length 110 with TraceHistMax 7, while TraceCheckSpWp was constructing backward predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 24. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1258). Cancelled while BasicCegarLoop was analyzing trace of length 110 with TraceHistMax 7, while TraceCheckSpWp was constructing backward predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 24. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was analyzing trace of length 110 with TraceHistMax 7, while TraceCheckSpWp was constructing backward predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 24. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was analyzing trace of length 110 with TraceHistMax 7, while TraceCheckSpWp was constructing backward predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 24. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was analyzing trace of length 110 with TraceHistMax 7, while TraceCheckSpWp was constructing backward predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 24. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was analyzing trace of length 110 with TraceHistMax 7, while TraceCheckSpWp was constructing backward predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 24. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1339). Cancelled while BasicCegarLoop was analyzing trace of length 110 with TraceHistMax 7, while TraceCheckSpWp was constructing backward predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 24. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1339). Cancelled while BasicCegarLoop was analyzing trace of length 110 with TraceHistMax 7, while TraceCheckSpWp was constructing backward predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 24. - TimeoutResultAtElement [Line: 1452]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1452). Cancelled while BasicCegarLoop was analyzing trace of length 110 with TraceHistMax 7, while TraceCheckSpWp was constructing backward predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 24. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1099). Cancelled while BasicCegarLoop was analyzing trace of length 110 with TraceHistMax 7, while TraceCheckSpWp was constructing backward predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 24. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1100). Cancelled while BasicCegarLoop was analyzing trace of length 110 with TraceHistMax 7, while TraceCheckSpWp was constructing backward predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 24. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1100). Cancelled while BasicCegarLoop was analyzing trace of length 110 with TraceHistMax 7, while TraceCheckSpWp was constructing backward predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 24. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1099). Cancelled while BasicCegarLoop was analyzing trace of length 110 with TraceHistMax 7, while TraceCheckSpWp was constructing backward predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 24. - StatisticsResult: Ultimate Automizer benchmark data CFG has 22 procedures, 146 locations, 23 error locations. TIMEOUT Result, 52.8s OverallTime, 29 OverallIterations, 7 TraceHistogramMax, 17.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3625 SDtfs, 1127 SDslu, 22881 SDs, 0 SdLazy, 7943 SolverSat, 279 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 9.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2740 GetRequests, 2228 SyntacticMatches, 28 SemanticMatches, 484 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3222 ImplicationChecksByTransitivity, 31.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=164occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.2s AbstIntTime, 6 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 28 MinimizatonAttempts, 96 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 29.6s InterpolantComputationTime, 2810 NumberOfCodeBlocks, 2790 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 3959 ConstructedInterpolants, 270 QuantifiedInterpolants, 1088530 SizeOfPredicates, 93 NumberOfNonLiveVariables, 5712 ConjunctsInSsa, 389 ConjunctsInUnsatCore, 62 InterpolantComputations, 27 PerfectInterpolantSequences, 181/516 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_4_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_17-24-09-673.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_4_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_17-24-09-673.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_4_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_17-24-09-673.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_4_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_17-24-09-673.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_4_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_17-24-09-673.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_4_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-24_17-24-09-673.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_4_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-24_17-24-09-673.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_4_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-24_17-24-09-673.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_4_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-24_17-24-09-673.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_4_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-4-2018-01-24_17-24-09-673.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_4_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-4-2018-01-24_17-24-09-673.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_4_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-5-2018-01-24_17-24-09-673.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_4_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-5-2018-01-24_17-24-09-673.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_4_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_17-24-09-673.csv Completed graceful shutdown