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.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 15:57:44,756 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 15:57:44,758 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 15:57:44,773 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 15:57:44,774 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 15:57:44,775 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 15:57:44,776 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 15:57:44,778 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 15:57:44,780 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 15:57:44,780 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 15:57:44,782 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 15:57:44,782 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 15:57:44,783 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 15:57:44,784 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 15:57:44,785 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 15:57:44,788 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 15:57:44,790 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 15:57:44,792 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 15:57:44,794 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 15:57:44,795 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 15:57:44,798 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 15:57:44,798 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 15:57:44,798 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 15:57:44,799 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 15:57:44,800 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 15:57:44,802 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 15:57:44,802 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 15:57:44,802 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 15:57:44,803 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 15:57:44,803 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 15:57:44,804 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 15:57:44,804 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.epf [2018-01-24 15:57:44,812 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 15:57:44,813 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 15:57:44,814 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 15:57:44,814 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 15:57:44,814 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 15:57:44,814 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 15:57:44,814 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 15:57:44,815 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 15:57:44,815 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 15:57:44,815 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 15:57:44,815 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 15:57:44,815 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 15:57:44,816 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 15:57:44,816 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 15:57:44,816 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 15:57:44,816 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 15:57:44,816 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 15:57:44,816 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 15:57:44,816 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 15:57:44,817 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 15:57:44,817 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 15:57:44,817 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 15:57:44,817 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 15:57:44,817 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 15:57:44,817 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 15:57:44,818 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 15:57:44,818 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 15:57:44,818 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 15:57:44,818 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 15:57:44,818 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 15:57:44,818 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 15:57:44,819 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 15:57:44,819 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 15:57:44,819 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 15:57:44,819 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 15:57:44,854 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 15:57:44,866 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 15:57:44,870 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 15:57:44,872 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 15:57:44,872 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 15:57:44,873 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 15:57:45,060 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 15:57:45,066 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 15:57:45,066 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 15:57:45,067 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 15:57:45,072 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 15:57:45,073 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:57:45" (1/1) ... [2018-01-24 15:57:45,077 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42577689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:57:45, skipping insertion in model container [2018-01-24 15:57:45,077 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:57:45" (1/1) ... [2018-01-24 15:57:45,098 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:57:45,151 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:57:45,277 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:57:45,302 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:57:45,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:57:45 WrapperNode [2018-01-24 15:57:45,317 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 15:57:45,318 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 15:57:45,318 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 15:57:45,318 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 15:57:45,332 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:57:45" (1/1) ... [2018-01-24 15:57:45,332 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:57:45" (1/1) ... [2018-01-24 15:57:45,346 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:57:45" (1/1) ... [2018-01-24 15:57:45,346 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:57:45" (1/1) ... [2018-01-24 15:57:45,356 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:57:45" (1/1) ... [2018-01-24 15:57:45,360 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:57:45" (1/1) ... [2018-01-24 15:57:45,363 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:57:45" (1/1) ... [2018-01-24 15:57:45,366 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 15:57:45,367 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 15:57:45,367 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 15:57:45,367 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 15:57:45,368 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:57:45" (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 15:57:45,416 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 15:57:45,417 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 15:57:45,417 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-01-24 15:57:45,417 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 15:57:45,417 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-01-24 15:57:45,417 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2018-01-24 15:57:45,417 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-01-24 15:57:45,417 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-01-24 15:57:45,417 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-01-24 15:57:45,418 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2018-01-24 15:57:45,418 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-01-24 15:57:45,418 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-01-24 15:57:45,418 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-01-24 15:57:45,418 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-01-24 15:57:45,418 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2018-01-24 15:57:45,418 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-01-24 15:57:45,418 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-01-24 15:57:45,419 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-01-24 15:57:45,419 INFO L136 BoogieDeclarations]: Found implementation of procedure f_22_get [2018-01-24 15:57:45,419 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 15:57:45,419 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 15:57:45,419 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 15:57:45,419 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 15:57:45,420 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 15:57:45,420 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 15:57:45,420 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 15:57:45,420 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 15:57:45,420 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 15:57:45,420 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-24 15:57:45,421 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-24 15:57:45,421 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 15:57:45,421 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 15:57:45,421 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 15:57:45,421 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-24 15:57:45,421 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 15:57:45,422 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-01-24 15:57:45,422 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2018-01-24 15:57:45,422 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-01-24 15:57:45,422 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-01-24 15:57:45,422 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-01-24 15:57:45,422 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-01-24 15:57:45,422 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2018-01-24 15:57:45,423 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-01-24 15:57:45,423 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-01-24 15:57:45,423 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-01-24 15:57:45,423 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-01-24 15:57:45,423 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2018-01-24 15:57:45,423 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-01-24 15:57:45,423 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-01-24 15:57:45,424 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-01-24 15:57:45,424 INFO L128 BoogieDeclarations]: Found specification of procedure f_22_get [2018-01-24 15:57:45,424 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 15:57:45,424 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 15:57:45,424 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 15:57:45,424 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 15:57:45,674 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-24 15:57:45,867 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 15:57:45,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:57:45 BoogieIcfgContainer [2018-01-24 15:57:45,868 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 15:57:45,869 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 15:57:45,869 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 15:57:45,872 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 15:57:45,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 03:57:45" (1/3) ... [2018-01-24 15:57:45,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bd1982a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:57:45, skipping insertion in model container [2018-01-24 15:57:45,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:57:45" (2/3) ... [2018-01-24 15:57:45,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bd1982a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:57:45, skipping insertion in model container [2018-01-24 15:57:45,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:57:45" (3/3) ... [2018-01-24 15:57:45,876 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test22_4_false-valid-memtrack_true-termination.i [2018-01-24 15:57:45,883 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 15:57:45,890 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-01-24 15:57:45,932 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 15:57:45,933 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 15:57:45,933 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 15:57:45,933 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 15:57:45,933 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 15:57:45,933 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 15:57:45,933 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 15:57:45,933 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 15:57:45,934 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 15:57:45,955 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states. [2018-01-24 15:57:45,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 15:57:45,962 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:57:45,963 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 15:57:45,963 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 15:57:45,967 INFO L82 PathProgramCache]: Analyzing trace with hash -367619766, now seen corresponding path program 1 times [2018-01-24 15:57:45,970 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:57:46,023 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:46,023 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:57:46,023 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:46,024 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:57:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:57:46,082 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:57:46,322 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 15:57:46,324 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:57:46,325 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:57:46,325 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:57:46,329 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:57:46,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:57:46,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:57:46,349 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 5 states. [2018-01-24 15:57:46,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:57:46,432 INFO L93 Difference]: Finished difference Result 280 states and 295 transitions. [2018-01-24 15:57:46,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:57:46,434 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-24 15:57:46,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:57:46,449 INFO L225 Difference]: With dead ends: 280 [2018-01-24 15:57:46,449 INFO L226 Difference]: Without dead ends: 149 [2018-01-24 15:57:46,453 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:57:46,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-01-24 15:57:46,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2018-01-24 15:57:46,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-01-24 15:57:46,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 155 transitions. [2018-01-24 15:57:46,494 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 155 transitions. Word has length 17 [2018-01-24 15:57:46,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:57:46,495 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 155 transitions. [2018-01-24 15:57:46,495 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:57:46,495 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 155 transitions. [2018-01-24 15:57:46,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 15:57:46,496 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:57:46,496 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 15:57:46,496 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 15:57:46,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1040907540, now seen corresponding path program 1 times [2018-01-24 15:57:46,496 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:57:46,498 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:46,499 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:57:46,499 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:46,499 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:57:46,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:57:46,524 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:57:46,591 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 15:57:46,591 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:57:46,591 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:57:46,591 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:57:46,593 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:57:46,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:57:46,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:57:46,593 INFO L87 Difference]: Start difference. First operand 147 states and 155 transitions. Second operand 6 states. [2018-01-24 15:57:46,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:57:46,790 INFO L93 Difference]: Finished difference Result 149 states and 157 transitions. [2018-01-24 15:57:46,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:57:46,790 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 15:57:46,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:57:46,792 INFO L225 Difference]: With dead ends: 149 [2018-01-24 15:57:46,792 INFO L226 Difference]: Without dead ends: 148 [2018-01-24 15:57:46,793 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 15:57:46,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-01-24 15:57:46,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2018-01-24 15:57:46,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-01-24 15:57:46,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 154 transitions. [2018-01-24 15:57:46,804 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 154 transitions. Word has length 19 [2018-01-24 15:57:46,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:57:46,805 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 154 transitions. [2018-01-24 15:57:46,805 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:57:46,805 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 154 transitions. [2018-01-24 15:57:46,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 15:57:46,805 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:57:46,806 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 15:57:46,806 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 15:57:46,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1040907539, now seen corresponding path program 1 times [2018-01-24 15:57:46,806 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:57:46,807 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:46,807 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:57:46,807 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:46,808 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:57:46,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:57:46,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:57:47,131 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 15:57:47,132 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:57:47,132 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 15:57:47,132 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:57:47,132 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 15:57:47,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 15:57:47,133 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:57:47,133 INFO L87 Difference]: Start difference. First operand 146 states and 154 transitions. Second operand 7 states. [2018-01-24 15:57:47,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:57:47,412 INFO L93 Difference]: Finished difference Result 148 states and 156 transitions. [2018-01-24 15:57:47,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 15:57:47,413 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-01-24 15:57:47,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:57:47,415 INFO L225 Difference]: With dead ends: 148 [2018-01-24 15:57:47,415 INFO L226 Difference]: Without dead ends: 147 [2018-01-24 15:57:47,416 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 15:57:47,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-01-24 15:57:47,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2018-01-24 15:57:47,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-01-24 15:57:47,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 153 transitions. [2018-01-24 15:57:47,429 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 153 transitions. Word has length 19 [2018-01-24 15:57:47,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:57:47,429 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 153 transitions. [2018-01-24 15:57:47,429 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 15:57:47,430 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 153 transitions. [2018-01-24 15:57:47,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 15:57:47,430 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:57:47,431 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 15:57:47,431 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 15:57:47,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1287954832, now seen corresponding path program 1 times [2018-01-24 15:57:47,431 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:57:47,433 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:47,433 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:57:47,433 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:47,433 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:57:47,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:57:47,453 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:57:47,575 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 15:57:47,575 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:57:47,575 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 15:57:47,575 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:57:47,576 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 15:57:47,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 15:57:47,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-24 15:57:47,577 INFO L87 Difference]: Start difference. First operand 145 states and 153 transitions. Second operand 9 states. [2018-01-24 15:57:47,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:57:47,729 INFO L93 Difference]: Finished difference Result 245 states and 257 transitions. [2018-01-24 15:57:47,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 15:57:47,730 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-01-24 15:57:47,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:57:47,733 INFO L225 Difference]: With dead ends: 245 [2018-01-24 15:57:47,734 INFO L226 Difference]: Without dead ends: 165 [2018-01-24 15:57:47,735 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-24 15:57:47,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-01-24 15:57:47,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 159. [2018-01-24 15:57:47,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-01-24 15:57:47,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 167 transitions. [2018-01-24 15:57:47,757 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 167 transitions. Word has length 29 [2018-01-24 15:57:47,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:57:47,757 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 167 transitions. [2018-01-24 15:57:47,757 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 15:57:47,757 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 167 transitions. [2018-01-24 15:57:47,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 15:57:47,759 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:57:47,759 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 15:57:47,759 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 15:57:47,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1025625474, now seen corresponding path program 1 times [2018-01-24 15:57:47,759 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:57:47,760 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:47,760 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:57:47,760 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:47,761 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:57:47,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:57:47,780 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:57:47,868 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 15:57:47,869 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:57:47,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 15:57:47,869 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:57:47,869 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 15:57:47,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 15:57:47,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 15:57:47,870 INFO L87 Difference]: Start difference. First operand 159 states and 167 transitions. Second operand 10 states. [2018-01-24 15:57:48,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:57:48,108 INFO L93 Difference]: Finished difference Result 159 states and 167 transitions. [2018-01-24 15:57:48,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 15:57:48,108 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-01-24 15:57:48,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:57:48,109 INFO L225 Difference]: With dead ends: 159 [2018-01-24 15:57:48,110 INFO L226 Difference]: Without dead ends: 158 [2018-01-24 15:57:48,110 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 15:57:48,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-01-24 15:57:48,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-01-24 15:57:48,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-01-24 15:57:48,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 166 transitions. [2018-01-24 15:57:48,122 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 166 transitions. Word has length 34 [2018-01-24 15:57:48,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:57:48,123 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 166 transitions. [2018-01-24 15:57:48,123 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 15:57:48,123 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 166 transitions. [2018-01-24 15:57:48,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 15:57:48,124 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:57:48,124 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 15:57:48,125 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 15:57:48,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1025625475, now seen corresponding path program 1 times [2018-01-24 15:57:48,125 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:57:48,126 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:48,127 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:57:48,127 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:48,127 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:57:48,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:57:48,144 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:57:48,187 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 15:57:48,188 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:57:48,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 15:57:48,188 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:57:48,189 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 15:57:48,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 15:57:48,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 15:57:48,189 INFO L87 Difference]: Start difference. First operand 158 states and 166 transitions. Second operand 4 states. [2018-01-24 15:57:48,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:57:48,220 INFO L93 Difference]: Finished difference Result 277 states and 291 transitions. [2018-01-24 15:57:48,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 15:57:48,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-01-24 15:57:48,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:57:48,223 INFO L225 Difference]: With dead ends: 277 [2018-01-24 15:57:48,223 INFO L226 Difference]: Without dead ends: 159 [2018-01-24 15:57:48,224 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 15:57:48,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-01-24 15:57:48,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-01-24 15:57:48,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-01-24 15:57:48,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 167 transitions. [2018-01-24 15:57:48,236 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 167 transitions. Word has length 34 [2018-01-24 15:57:48,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:57:48,236 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 167 transitions. [2018-01-24 15:57:48,236 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 15:57:48,236 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 167 transitions. [2018-01-24 15:57:48,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-24 15:57:48,238 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:57:48,238 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 15:57:48,238 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 15:57:48,238 INFO L82 PathProgramCache]: Analyzing trace with hash -553427227, now seen corresponding path program 1 times [2018-01-24 15:57:48,239 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:57:48,240 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:48,240 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:57:48,240 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:48,240 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:57:48,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:57:48,258 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:57:48,291 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 15:57:48,292 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:57:48,292 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:57:48,293 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-01-24 15:57:48,295 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 15:57:48,352 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:57:48,352 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:57:51,139 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:57:51,140 INFO L268 AbstractInterpreter]: Visited 35 different actions 43 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 21 variables. [2018-01-24 15:57:51,163 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:57:51,164 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:57:51,164 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 15:57:51,175 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:57:51,175 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:57:51,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:57:51,233 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:57:51,263 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 15:57:51,264 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:57:51,365 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 15:57:51,388 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:57:51,388 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 15:57:51,392 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:57:51,392 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:57:51,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:57:51,445 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:57:51,451 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 15:57:51,451 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:57:51,583 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 15:57:51,585 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:57:51,585 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5] total 9 [2018-01-24 15:57:51,585 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:57:51,586 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:57:51,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:57:51,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-01-24 15:57:51,586 INFO L87 Difference]: Start difference. First operand 159 states and 167 transitions. Second operand 6 states. [2018-01-24 15:57:51,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:57:51,680 INFO L93 Difference]: Finished difference Result 278 states and 292 transitions. [2018-01-24 15:57:51,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:57:51,680 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-24 15:57:51,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:57:51,682 INFO L225 Difference]: With dead ends: 278 [2018-01-24 15:57:51,682 INFO L226 Difference]: Without dead ends: 160 [2018-01-24 15:57:51,683 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 15:57:51,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-01-24 15:57:51,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-01-24 15:57:51,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-01-24 15:57:51,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 168 transitions. [2018-01-24 15:57:51,694 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 168 transitions. Word has length 35 [2018-01-24 15:57:51,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:57:51,695 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 168 transitions. [2018-01-24 15:57:51,695 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:57:51,695 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 168 transitions. [2018-01-24 15:57:51,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 15:57:51,697 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:57:51,697 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 15:57:51,697 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 15:57:51,697 INFO L82 PathProgramCache]: Analyzing trace with hash 2035546563, now seen corresponding path program 2 times [2018-01-24 15:57:51,697 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:57:51,699 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:51,699 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:57:51,699 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:51,699 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:57:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:57:51,732 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:57:51,815 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 15:57:51,816 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:57:51,816 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:57:51,816 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:57:51,816 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:57:51,816 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:57:51,816 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 15:57:51,839 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:57:51,839 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:57:51,862 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:57:51,868 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:57:51,873 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:57:51,909 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 15:57:51,910 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:57:51,985 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 15:57:51,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:57:52,037 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 15:57:52,037 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-24 15:57:52,719 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 15:57:52,719 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:57:55,135 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 15:57:55,156 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 15:57:55,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14, 13] imperfect sequences [6] total 31 [2018-01-24 15:57:55,156 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:57:55,156 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 15:57:55,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 15:57:55,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=839, Unknown=1, NotChecked=0, Total=930 [2018-01-24 15:57:55,157 INFO L87 Difference]: Start difference. First operand 160 states and 168 transitions. Second operand 15 states. [2018-01-24 15:57:57,240 WARN L143 SmtUtils]: Spent 2033ms on a formula simplification that was a NOOP. DAG size: 39 [2018-01-24 15:58:00,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:58:00,203 INFO L93 Difference]: Finished difference Result 228 states and 239 transitions. [2018-01-24 15:58:00,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 15:58:00,232 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2018-01-24 15:58:00,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:58:00,234 INFO L225 Difference]: With dead ends: 228 [2018-01-24 15:58:00,234 INFO L226 Difference]: Without dead ends: 227 [2018-01-24 15:58:00,235 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=118, Invalid=1071, Unknown=1, NotChecked=0, Total=1190 [2018-01-24 15:58:00,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-01-24 15:58:00,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 159. [2018-01-24 15:58:00,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-01-24 15:58:00,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 167 transitions. [2018-01-24 15:58:00,249 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 167 transitions. Word has length 36 [2018-01-24 15:58:00,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:58:00,249 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 167 transitions. [2018-01-24 15:58:00,250 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 15:58:00,250 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 167 transitions. [2018-01-24 15:58:00,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-24 15:58:00,251 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:58:00,251 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 15:58:00,252 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 15:58:00,252 INFO L82 PathProgramCache]: Analyzing trace with hash -2073429328, now seen corresponding path program 1 times [2018-01-24 15:58:00,252 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:58:00,253 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:00,253 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 15:58:00,253 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:00,254 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:58:00,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:58:00,268 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:58:00,422 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 15:58:00,422 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:58:00,422 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 15:58:00,422 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:58:00,423 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 15:58:00,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 15:58:00,423 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:58:00,423 INFO L87 Difference]: Start difference. First operand 159 states and 167 transitions. Second operand 7 states. [2018-01-24 15:58:00,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:58:00,493 INFO L93 Difference]: Finished difference Result 222 states and 232 transitions. [2018-01-24 15:58:00,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 15:58:00,493 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2018-01-24 15:58:00,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:58:00,495 INFO L225 Difference]: With dead ends: 222 [2018-01-24 15:58:00,495 INFO L226 Difference]: Without dead ends: 168 [2018-01-24 15:58:00,496 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:58:00,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-01-24 15:58:00,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 164. [2018-01-24 15:58:00,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-01-24 15:58:00,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 172 transitions. [2018-01-24 15:58:00,513 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 172 transitions. Word has length 40 [2018-01-24 15:58:00,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:58:00,513 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 172 transitions. [2018-01-24 15:58:00,513 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 15:58:00,514 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 172 transitions. [2018-01-24 15:58:00,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 15:58:00,515 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:58:00,515 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 15:58:00,515 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 15:58:00,516 INFO L82 PathProgramCache]: Analyzing trace with hash 2040053740, now seen corresponding path program 1 times [2018-01-24 15:58:00,516 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:58:00,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:00,517 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:58:00,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:00,517 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:58:00,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:58:00,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:58:00,561 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 15:58:00,561 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:58:00,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 15:58:00,562 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:58:00,562 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 15:58:00,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 15:58:00,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:58:00,563 INFO L87 Difference]: Start difference. First operand 164 states and 172 transitions. Second operand 3 states. [2018-01-24 15:58:00,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:58:00,748 INFO L93 Difference]: Finished difference Result 181 states and 190 transitions. [2018-01-24 15:58:00,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 15:58:00,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-01-24 15:58:00,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:58:00,750 INFO L225 Difference]: With dead ends: 181 [2018-01-24 15:58:00,750 INFO L226 Difference]: Without dead ends: 168 [2018-01-24 15:58:00,751 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 15:58:00,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-01-24 15:58:00,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 160. [2018-01-24 15:58:00,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-01-24 15:58:00,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 167 transitions. [2018-01-24 15:58:00,770 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 167 transitions. Word has length 38 [2018-01-24 15:58:00,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:58:00,771 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 167 transitions. [2018-01-24 15:58:00,771 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 15:58:00,771 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 167 transitions. [2018-01-24 15:58:00,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 15:58:00,772 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:58:00,772 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 15:58:00,772 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 15:58:00,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1765321240, now seen corresponding path program 1 times [2018-01-24 15:58:00,773 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:58:00,774 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:00,774 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:58:00,774 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:00,774 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:58:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:58:00,791 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:58:00,899 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 15:58:00,900 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:58:00,900 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 15:58:00,900 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:58:00,900 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 15:58:00,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 15:58:00,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 15:58:00,901 INFO L87 Difference]: Start difference. First operand 160 states and 167 transitions. Second operand 10 states. [2018-01-24 15:58:01,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:58:01,167 INFO L93 Difference]: Finished difference Result 160 states and 167 transitions. [2018-01-24 15:58:01,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 15:58:01,167 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2018-01-24 15:58:01,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:58:01,168 INFO L225 Difference]: With dead ends: 160 [2018-01-24 15:58:01,168 INFO L226 Difference]: Without dead ends: 158 [2018-01-24 15:58:01,168 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-01-24 15:58:01,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-01-24 15:58:01,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-01-24 15:58:01,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-01-24 15:58:01,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 165 transitions. [2018-01-24 15:58:01,181 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 165 transitions. Word has length 41 [2018-01-24 15:58:01,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:58:01,181 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 165 transitions. [2018-01-24 15:58:01,181 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 15:58:01,181 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 165 transitions. [2018-01-24 15:58:01,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 15:58:01,182 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:58:01,182 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 15:58:01,182 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 15:58:01,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1765321239, now seen corresponding path program 1 times [2018-01-24 15:58:01,183 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:58:01,184 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:01,184 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:58:01,184 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:01,184 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:58:01,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:58:01,199 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:58:01,302 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 15:58:01,302 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:58:01,302 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:58:01,302 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-01-24 15:58:01,303 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 15:58:01,305 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:58:01,305 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:58:04,123 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:58:04,123 INFO L268 AbstractInterpreter]: Visited 40 different actions 48 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 21 variables. [2018-01-24 15:58:04,130 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:58:04,130 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:58:04,130 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 15:58:04,154 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:58:04,154 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:58:04,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:58:04,188 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:58:04,253 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 15:58:04,253 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:58:04,468 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 15:58:04,488 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:58:04,488 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 15:58:04,491 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:58:04,492 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:58:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:58:04,540 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:58:04,546 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 15:58:04,546 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:58:04,569 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 15:58:04,571 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:58:04,571 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6] total 11 [2018-01-24 15:58:04,571 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:58:04,572 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 15:58:04,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 15:58:04,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-01-24 15:58:04,572 INFO L87 Difference]: Start difference. First operand 158 states and 165 transitions. Second operand 7 states. [2018-01-24 15:58:04,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:58:04,621 INFO L93 Difference]: Finished difference Result 274 states and 287 transitions. [2018-01-24 15:58:04,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:58:04,621 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-01-24 15:58:04,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:58:04,622 INFO L225 Difference]: With dead ends: 274 [2018-01-24 15:58:04,623 INFO L226 Difference]: Without dead ends: 159 [2018-01-24 15:58:04,623 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2018-01-24 15:58:04,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-01-24 15:58:04,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-01-24 15:58:04,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-01-24 15:58:04,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 166 transitions. [2018-01-24 15:58:04,640 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 166 transitions. Word has length 41 [2018-01-24 15:58:04,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:58:04,640 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 166 transitions. [2018-01-24 15:58:04,641 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 15:58:04,641 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 166 transitions. [2018-01-24 15:58:04,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-24 15:58:04,641 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:58:04,642 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 15:58:04,642 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 15:58:04,642 INFO L82 PathProgramCache]: Analyzing trace with hash 8062858, now seen corresponding path program 1 times [2018-01-24 15:58:04,642 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:58:04,643 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:04,643 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:58:04,644 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:04,644 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:58:04,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:58:04,652 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:58:04,702 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 15:58:04,703 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:58:04,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 15:58:04,703 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:58:04,703 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:58:04,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:58:04,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:58:04,704 INFO L87 Difference]: Start difference. First operand 159 states and 166 transitions. Second operand 6 states. [2018-01-24 15:58:04,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:58:04,727 INFO L93 Difference]: Finished difference Result 163 states and 169 transitions. [2018-01-24 15:58:04,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:58:04,727 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-01-24 15:58:04,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:58:04,728 INFO L225 Difference]: With dead ends: 163 [2018-01-24 15:58:04,728 INFO L226 Difference]: Without dead ends: 140 [2018-01-24 15:58:04,728 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 15:58:04,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-24 15:58:04,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-01-24 15:58:04,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-24 15:58:04,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 146 transitions. [2018-01-24 15:58:04,737 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 146 transitions. Word has length 40 [2018-01-24 15:58:04,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:58:04,738 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 146 transitions. [2018-01-24 15:58:04,738 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:58:04,738 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 146 transitions. [2018-01-24 15:58:04,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-24 15:58:04,738 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:58:04,738 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 15:58:04,738 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 15:58:04,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1805397433, now seen corresponding path program 2 times [2018-01-24 15:58:04,739 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:58:04,740 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:04,740 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:58:04,740 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:04,740 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:58:04,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:58:04,753 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:58:04,834 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 15:58:04,834 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:58:04,834 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:58:04,835 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:58:04,835 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:58:04,835 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:58:04,835 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 15:58:04,847 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:58:04,847 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:58:04,869 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:58:04,874 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:58:04,877 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:58:04,892 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 15:58:04,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:58:04,955 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 15:58:04,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:58:04,968 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 15:58:04,968 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-24 15:58:05,469 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 15:58:05,470 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:58:09,819 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 15:58:09,839 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 15:58:09,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15, 13] imperfect sequences [7] total 33 [2018-01-24 15:58:09,839 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:58:09,839 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 15:58:09,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 15:58:09,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=949, Unknown=2, NotChecked=0, Total=1056 [2018-01-24 15:58:09,840 INFO L87 Difference]: Start difference. First operand 140 states and 146 transitions. Second operand 16 states. [2018-01-24 15:58:11,909 WARN L143 SmtUtils]: Spent 2032ms on a formula simplification that was a NOOP. DAG size: 39 [2018-01-24 15:58:12,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:58:12,662 INFO L93 Difference]: Finished difference Result 140 states and 146 transitions. [2018-01-24 15:58:12,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 15:58:12,662 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2018-01-24 15:58:12,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:58:12,663 INFO L225 Difference]: With dead ends: 140 [2018-01-24 15:58:12,663 INFO L226 Difference]: Without dead ends: 138 [2018-01-24 15:58:12,664 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=136, Invalid=1194, Unknown=2, NotChecked=0, Total=1332 [2018-01-24 15:58:12,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-01-24 15:58:12,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-01-24 15:58:12,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-01-24 15:58:12,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 144 transitions. [2018-01-24 15:58:12,680 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 144 transitions. Word has length 42 [2018-01-24 15:58:12,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:58:12,680 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 144 transitions. [2018-01-24 15:58:12,680 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 15:58:12,680 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 144 transitions. [2018-01-24 15:58:12,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-24 15:58:12,681 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:58:12,681 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 15:58:12,681 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 15:58:12,682 INFO L82 PathProgramCache]: Analyzing trace with hash -578251942, now seen corresponding path program 1 times [2018-01-24 15:58:12,682 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:58:12,683 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:12,683 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 15:58:12,683 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:12,683 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:58:12,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:58:12,696 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:58:12,782 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 15:58:12,782 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:58:12,782 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 15:58:12,782 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:58:12,783 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 15:58:12,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 15:58:12,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:58:12,783 INFO L87 Difference]: Start difference. First operand 138 states and 144 transitions. Second operand 8 states. [2018-01-24 15:58:12,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:58:12,824 INFO L93 Difference]: Finished difference Result 229 states and 238 transitions. [2018-01-24 15:58:12,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 15:58:12,824 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-01-24 15:58:12,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:58:12,826 INFO L225 Difference]: With dead ends: 229 [2018-01-24 15:58:12,826 INFO L226 Difference]: Without dead ends: 138 [2018-01-24 15:58:12,826 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 15:58:12,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-01-24 15:58:12,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-01-24 15:58:12,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-01-24 15:58:12,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 143 transitions. [2018-01-24 15:58:12,838 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 143 transitions. Word has length 47 [2018-01-24 15:58:12,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:58:12,838 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 143 transitions. [2018-01-24 15:58:12,838 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 15:58:12,839 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2018-01-24 15:58:12,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-24 15:58:12,839 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:58:12,839 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 15:58:12,839 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 15:58:12,839 INFO L82 PathProgramCache]: Analyzing trace with hash -792817057, now seen corresponding path program 1 times [2018-01-24 15:58:12,839 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:58:12,840 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:12,840 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:58:12,840 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:12,841 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:58:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:58:12,849 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:58:12,912 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 15:58:12,912 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:58:12,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 15:58:12,912 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:58:12,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 15:58:12,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 15:58:12,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 15:58:12,913 INFO L87 Difference]: Start difference. First operand 138 states and 143 transitions. Second operand 10 states. [2018-01-24 15:58:12,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:58:12,994 INFO L93 Difference]: Finished difference Result 231 states and 239 transitions. [2018-01-24 15:58:12,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 15:58:12,994 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2018-01-24 15:58:12,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:58:12,996 INFO L225 Difference]: With dead ends: 231 [2018-01-24 15:58:12,996 INFO L226 Difference]: Without dead ends: 138 [2018-01-24 15:58:12,997 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 15:58:12,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-01-24 15:58:13,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-01-24 15:58:13,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-01-24 15:58:13,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 142 transitions. [2018-01-24 15:58:13,013 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 142 transitions. Word has length 52 [2018-01-24 15:58:13,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:58:13,013 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 142 transitions. [2018-01-24 15:58:13,014 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 15:58:13,014 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 142 transitions. [2018-01-24 15:58:13,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-24 15:58:13,014 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:58:13,015 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 15:58:13,015 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 15:58:13,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1949575069, now seen corresponding path program 1 times [2018-01-24 15:58:13,015 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:58:13,016 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:13,016 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:58:13,016 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:13,016 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:58:13,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:58:13,035 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:58:13,281 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 15:58:13,281 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:58:13,281 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-24 15:58:13,281 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:58:13,282 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 15:58:13,282 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 15:58:13,282 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-01-24 15:58:13,282 INFO L87 Difference]: Start difference. First operand 138 states and 142 transitions. Second operand 15 states. [2018-01-24 15:58:13,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:58:13,691 INFO L93 Difference]: Finished difference Result 138 states and 142 transitions. [2018-01-24 15:58:13,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 15:58:13,691 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 63 [2018-01-24 15:58:13,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:58:13,692 INFO L225 Difference]: With dead ends: 138 [2018-01-24 15:58:13,692 INFO L226 Difference]: Without dead ends: 136 [2018-01-24 15:58:13,693 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-01-24 15:58:13,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-01-24 15:58:13,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-01-24 15:58:13,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-01-24 15:58:13,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 140 transitions. [2018-01-24 15:58:13,703 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 140 transitions. Word has length 63 [2018-01-24 15:58:13,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:58:13,704 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 140 transitions. [2018-01-24 15:58:13,704 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 15:58:13,704 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 140 transitions. [2018-01-24 15:58:13,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-24 15:58:13,704 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:58:13,704 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 15:58:13,704 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 15:58:13,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1949575070, now seen corresponding path program 1 times [2018-01-24 15:58:13,705 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:58:13,705 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:13,705 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:58:13,705 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:13,705 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:58:13,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:58:13,719 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:58:13,779 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 15:58:13,779 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:58:13,779 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:58:13,779 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 64 with the following transitions: [2018-01-24 15:58:13,780 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 15:58:13,782 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:58:13,782 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:58:17,020 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:58:17,021 INFO L268 AbstractInterpreter]: Visited 61 different actions 69 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 22 variables. [2018-01-24 15:58:17,055 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:58:17,056 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:58:17,056 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 15:58:17,062 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:58:17,062 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:58:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:58:17,099 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:58:17,121 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 15:58:17,121 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:58:17,205 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 15:58:17,225 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:58:17,225 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 15:58:17,229 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:58:17,229 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:58:17,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:58:17,290 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:58:17,294 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 15:58:17,295 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:58:17,365 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 15:58:17,367 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:58:17,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 13 [2018-01-24 15:58:17,367 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:58:17,368 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 15:58:17,368 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 15:58:17,368 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-01-24 15:58:17,368 INFO L87 Difference]: Start difference. First operand 136 states and 140 transitions. Second operand 8 states. [2018-01-24 15:58:17,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:58:17,406 INFO L93 Difference]: Finished difference Result 248 states and 256 transitions. [2018-01-24 15:58:17,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 15:58:17,406 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2018-01-24 15:58:17,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:58:17,407 INFO L225 Difference]: With dead ends: 248 [2018-01-24 15:58:17,407 INFO L226 Difference]: Without dead ends: 137 [2018-01-24 15:58:17,408 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 15:58:17,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-24 15:58:17,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-01-24 15:58:17,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-01-24 15:58:17,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 141 transitions. [2018-01-24 15:58:17,425 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 141 transitions. Word has length 63 [2018-01-24 15:58:17,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:58:17,425 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 141 transitions. [2018-01-24 15:58:17,425 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 15:58:17,425 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2018-01-24 15:58:17,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-24 15:58:17,426 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:58:17,426 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 15:58:17,426 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 15:58:17,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1497491836, now seen corresponding path program 2 times [2018-01-24 15:58:17,427 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:58:17,428 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:17,428 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:58:17,428 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:17,428 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:58:17,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:58:17,448 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:58:17,505 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 15:58:17,505 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:58:17,505 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:58:17,506 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:58:17,506 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:58:17,506 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:58:17,506 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 15:58:17,517 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:58:17,517 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:58:17,555 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:58:17,560 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:58:17,565 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:58:17,573 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 15:58:17,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:58:17,593 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 15:58:17,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:58:17,609 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 15:58:17,610 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-24 15:58:18,242 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 15:58:18,242 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:58:22,908 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 15:58:22,928 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 15:58:22,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20, 18] imperfect sequences [8] total 44 [2018-01-24 15:58:22,928 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:58:22,929 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 15:58:22,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 15:58:22,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1744, Unknown=2, NotChecked=0, Total=1892 [2018-01-24 15:58:22,930 INFO L87 Difference]: Start difference. First operand 137 states and 141 transitions. Second operand 21 states. [2018-01-24 15:58:25,017 WARN L143 SmtUtils]: Spent 2036ms on a formula simplification that was a NOOP. DAG size: 39 [2018-01-24 15:58:26,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:58:26,093 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2018-01-24 15:58:26,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-24 15:58:26,093 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-01-24 15:58:26,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:58:26,094 INFO L225 Difference]: With dead ends: 137 [2018-01-24 15:58:26,094 INFO L226 Difference]: Without dead ends: 135 [2018-01-24 15:58:26,095 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=195, Invalid=2253, Unknown=2, NotChecked=0, Total=2450 [2018-01-24 15:58:26,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-24 15:58:26,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-01-24 15:58:26,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-24 15:58:26,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2018-01-24 15:58:26,108 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 64 [2018-01-24 15:58:26,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:58:26,108 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2018-01-24 15:58:26,108 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-24 15:58:26,109 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2018-01-24 15:58:26,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-24 15:58:26,110 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:58:26,110 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 15:58:26,110 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 15:58:26,110 INFO L82 PathProgramCache]: Analyzing trace with hash -938431803, now seen corresponding path program 1 times [2018-01-24 15:58:26,111 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:58:26,111 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:26,111 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 15:58:26,111 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:26,112 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:58:26,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:58:26,128 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:58:26,297 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 15:58:26,298 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:58:26,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-24 15:58:26,298 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:58:26,298 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 15:58:26,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 15:58:26,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-01-24 15:58:26,299 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand 13 states. [2018-01-24 15:58:26,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:58:26,426 INFO L93 Difference]: Finished difference Result 198 states and 204 transitions. [2018-01-24 15:58:26,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 15:58:26,427 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 75 [2018-01-24 15:58:26,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:58:26,428 INFO L225 Difference]: With dead ends: 198 [2018-01-24 15:58:26,428 INFO L226 Difference]: Without dead ends: 135 [2018-01-24 15:58:26,428 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 15:58:26,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-24 15:58:26,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-01-24 15:58:26,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-24 15:58:26,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 138 transitions. [2018-01-24 15:58:26,446 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 138 transitions. Word has length 75 [2018-01-24 15:58:26,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:58:26,446 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 138 transitions. [2018-01-24 15:58:26,446 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 15:58:26,446 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 138 transitions. [2018-01-24 15:58:26,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-01-24 15:58:26,447 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:58:26,447 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 15:58:26,447 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 15:58:26,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1956264887, now seen corresponding path program 1 times [2018-01-24 15:58:26,448 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:58:26,449 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:26,449 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:58:26,449 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:26,449 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:58:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:58:26,470 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:58:26,808 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 15:58:26,809 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:58:26,809 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-01-24 15:58:26,809 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:58:26,809 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-24 15:58:26,809 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-24 15:58:26,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2018-01-24 15:58:26,810 INFO L87 Difference]: Start difference. First operand 135 states and 138 transitions. Second operand 20 states. [2018-01-24 15:58:27,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:58:27,206 INFO L93 Difference]: Finished difference Result 144 states and 147 transitions. [2018-01-24 15:58:27,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-24 15:58:27,207 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 88 [2018-01-24 15:58:27,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:58:27,208 INFO L225 Difference]: With dead ends: 144 [2018-01-24 15:58:27,208 INFO L226 Difference]: Without dead ends: 142 [2018-01-24 15:58:27,208 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2018-01-24 15:58:27,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-01-24 15:58:27,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 133. [2018-01-24 15:58:27,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-24 15:58:27,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 136 transitions. [2018-01-24 15:58:27,220 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 136 transitions. Word has length 88 [2018-01-24 15:58:27,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:58:27,220 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 136 transitions. [2018-01-24 15:58:27,220 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-24 15:58:27,220 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2018-01-24 15:58:27,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-01-24 15:58:27,221 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:58:27,221 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 15:58:27,221 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 15:58:27,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1956264888, now seen corresponding path program 1 times [2018-01-24 15:58:27,221 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:58:27,222 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:27,222 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:58:27,222 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:27,222 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:58:27,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:58:27,238 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:58:27,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 15:58:27,385 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:58:27,385 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:58:27,385 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 89 with the following transitions: [2018-01-24 15:58:27,385 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 15:58:27,388 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:58:27,388 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:58:30,282 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:58:30,282 INFO L268 AbstractInterpreter]: Visited 85 different actions 93 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 26 variables. [2018-01-24 15:58:30,293 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:58:30,293 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:58:30,293 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 15:58:30,304 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:58:30,304 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:58:30,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:58:30,369 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:58:30,394 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 15:58:30,394 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:58:30,616 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 15:58:30,649 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:58:30,649 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 15:58:30,654 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:58:30,654 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:58:30,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:58:30,759 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:58:30,764 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 15:58:30,765 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:58:30,860 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 15:58:30,862 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:58:30,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8] total 15 [2018-01-24 15:58:30,862 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:58:30,862 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 15:58:30,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 15:58:30,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-01-24 15:58:30,863 INFO L87 Difference]: Start difference. First operand 133 states and 136 transitions. Second operand 9 states. [2018-01-24 15:58:30,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:58:30,901 INFO L93 Difference]: Finished difference Result 241 states and 247 transitions. [2018-01-24 15:58:30,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 15:58:30,901 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2018-01-24 15:58:30,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:58:30,902 INFO L225 Difference]: With dead ends: 241 [2018-01-24 15:58:30,902 INFO L226 Difference]: Without dead ends: 134 [2018-01-24 15:58:30,903 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 343 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=137, Unknown=0, NotChecked=0, Total=240 [2018-01-24 15:58:30,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-01-24 15:58:30,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-01-24 15:58:30,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-01-24 15:58:30,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 137 transitions. [2018-01-24 15:58:30,921 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 137 transitions. Word has length 88 [2018-01-24 15:58:30,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:58:30,921 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 137 transitions. [2018-01-24 15:58:30,921 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 15:58:30,921 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 137 transitions. [2018-01-24 15:58:30,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-01-24 15:58:30,922 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:58:30,922 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 15:58:30,923 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 15:58:30,923 INFO L82 PathProgramCache]: Analyzing trace with hash -632442982, now seen corresponding path program 2 times [2018-01-24 15:58:30,923 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:58:30,924 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:30,924 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:58:30,924 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:30,924 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:58:30,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:58:30,948 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:58:31,051 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 15:58:31,051 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:58:31,051 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:58:31,051 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:58:31,051 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:58:31,051 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:58:31,052 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 15:58:31,063 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:58:31,063 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:58:31,102 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:58:31,107 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:58:31,113 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:58:31,117 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 15:58:31,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:58:31,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-24 15:58:31,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:58:31,180 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 15:58:31,181 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 Received shutdown request... [2018-01-24 15:58:31,321 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 15:58:31,321 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 15:58:31,326 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 15:58:31,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 03:58:31 BoogieIcfgContainer [2018-01-24 15:58:31,326 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 15:58:31,327 INFO L168 Benchmark]: Toolchain (without parser) took 46266.53 ms. Allocated memory was 302.5 MB in the beginning and 1.3 GB in the end (delta: 986.2 MB). Free memory was 261.6 MB in the beginning and 544.9 MB in the end (delta: -283.4 MB). Peak memory consumption was 702.8 MB. Max. memory is 5.3 GB. [2018-01-24 15:58:31,328 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 302.5 MB. Free memory is still 268.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 15:58:31,328 INFO L168 Benchmark]: CACSL2BoogieTranslator took 250.73 ms. Allocated memory is still 302.5 MB. Free memory was 261.6 MB in the beginning and 247.5 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 5.3 GB. [2018-01-24 15:58:31,329 INFO L168 Benchmark]: Boogie Preprocessor took 48.71 ms. Allocated memory is still 302.5 MB. Free memory was 247.5 MB in the beginning and 245.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:58:31,329 INFO L168 Benchmark]: RCFGBuilder took 501.40 ms. Allocated memory is still 302.5 MB. Free memory was 245.5 MB in the beginning and 209.9 MB in the end (delta: 35.6 MB). Peak memory consumption was 35.6 MB. Max. memory is 5.3 GB. [2018-01-24 15:58:31,329 INFO L168 Benchmark]: TraceAbstraction took 45457.00 ms. Allocated memory was 302.5 MB in the beginning and 1.3 GB in the end (delta: 986.2 MB). Free memory was 209.9 MB in the beginning and 564.1 MB in the end (delta: -354.3 MB). Peak memory consumption was 631.9 MB. Max. memory is 5.3 GB. [2018-01-24 15:58:31,331 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.15 ms. Allocated memory is still 302.5 MB. Free memory is still 268.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 250.73 ms. Allocated memory is still 302.5 MB. Free memory was 261.6 MB in the beginning and 247.5 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 48.71 ms. Allocated memory is still 302.5 MB. Free memory was 247.5 MB in the beginning and 245.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 501.40 ms. Allocated memory is still 302.5 MB. Free memory was 245.5 MB in the beginning and 209.9 MB in the end (delta: 35.6 MB). Peak memory consumption was 35.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 45457.00 ms. Allocated memory was 302.5 MB in the beginning and 1.3 GB in the end (delta: 986.2 MB). Free memory was 209.9 MB in the beginning and 564.1 MB in the end (delta: -354.3 MB). Peak memory consumption was 631.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 34 LocStat_MAX_WEQGRAPH_SIZE : 3 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 259 LocStat_NO_SUPPORTING_DISEQUALITIES : 25 LocStat_NO_DISJUNCTIONS : -68 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 53 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 108 TransStat_NO_SUPPORTING_DISEQUALITIES : 9 TransStat_NO_DISJUNCTIONS : 57 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.468750 RENAME_VARIABLES(MILLISECONDS) : 0.089262 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.213186 PROJECTAWAY(MILLISECONDS) : 0.049435 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.082396 DISJOIN(MILLISECONDS) : 0.724184 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.113091 ADD_EQUALITY(MILLISECONDS) : 0.018377 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.006990 #CONJOIN_DISJUNCTIVE : 86 #RENAME_VARIABLES : 145 #UNFREEZE : 0 #CONJOIN : 178 #PROJECTAWAY : 142 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 141 #ADD_EQUALITY : 111 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 39 LocStat_MAX_WEQGRAPH_SIZE : 6 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 299 LocStat_NO_SUPPORTING_DISEQUALITIES : 30 LocStat_NO_DISJUNCTIONS : -78 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 60 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 120 TransStat_NO_SUPPORTING_DISEQUALITIES : 9 TransStat_NO_DISJUNCTIONS : 64 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.266060 RENAME_VARIABLES(MILLISECONDS) : 0.094207 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.097103 PROJECTAWAY(MILLISECONDS) : 0.025098 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.056285 DISJOIN(MILLISECONDS) : 0.418663 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.120912 ADD_EQUALITY(MILLISECONDS) : 0.020688 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.006732 #CONJOIN_DISJUNCTIVE : 96 #RENAME_VARIABLES : 160 #UNFREEZE : 0 #CONJOIN : 203 #PROJECTAWAY : 159 #ADD_WEAK_EQUALITY : 15 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 156 #ADD_EQUALITY : 128 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 60 LocStat_MAX_WEQGRAPH_SIZE : 6 LocStat_MAX_SIZEOF_WEQEDGELABEL : 3 LocStat_NO_SUPPORTING_EQUALITIES : 469 LocStat_NO_SUPPORTING_DISEQUALITIES : 51 LocStat_NO_DISJUNCTIONS : -120 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 89 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 2 TransStat_NO_SUPPORTING_EQUALITIES : 174 TransStat_NO_SUPPORTING_DISEQUALITIES : 11 TransStat_NO_DISJUNCTIONS : 94 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.369845 RENAME_VARIABLES(MILLISECONDS) : 0.076725 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.157552 PROJECTAWAY(MILLISECONDS) : 0.039019 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.056732 DISJOIN(MILLISECONDS) : 0.619452 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.097916 ADD_EQUALITY(MILLISECONDS) : 0.014514 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.005794 #CONJOIN_DISJUNCTIVE : 138 #RENAME_VARIABLES : 223 #UNFREEZE : 0 #CONJOIN : 294 #PROJECTAWAY : 230 #ADD_WEAK_EQUALITY : 27 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 218 #ADD_EQUALITY : 190 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 10 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 84 LocStat_MAX_WEQGRAPH_SIZE : 6 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 693 LocStat_NO_SUPPORTING_DISEQUALITIES : 75 LocStat_NO_DISJUNCTIONS : -168 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 121 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 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.344104 RENAME_VARIABLES(MILLISECONDS) : 0.084245 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.141424 PROJECTAWAY(MILLISECONDS) : 0.035315 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.032618 DISJOIN(MILLISECONDS) : 0.604670 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.105026 ADD_EQUALITY(MILLISECONDS) : 0.014119 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.006671 #CONJOIN_DISJUNCTIVE : 183 #RENAME_VARIABLES : 292 #UNFREEZE : 0 #CONJOIN : 399 #PROJECTAWAY : 307 #ADD_WEAK_EQUALITY : 33 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 286 #ADD_EQUALITY : 264 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 12 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1294). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1294). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 13 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1411). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 13 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1411). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1265). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1265). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1267). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1267). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1256). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1256). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1258). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1258). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1339). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1339). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 13 known predicates. - TimeoutResultAtElement [Line: 1452]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1452). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1099). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1100). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1100). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1099). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 13 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 22 procedures, 146 locations, 23 error locations. TIMEOUT Result, 45.4s OverallTime, 23 OverallIterations, 5 TraceHistogramMax, 13.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2969 SDtfs, 767 SDslu, 16733 SDs, 0 SdLazy, 5017 SolverSat, 147 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 5.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1416 GetRequests, 1104 SyntacticMatches, 14 SemanticMatches, 298 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 22.1s 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, 11.8s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 101 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 17.2s InterpolantComputationTime, 1601 NumberOfCodeBlocks, 1592 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2153 ConstructedInterpolants, 103 QuantifiedInterpolants, 370952 SizeOfPredicates, 51 NumberOfNonLiveVariables, 2802 ConjunctsInSsa, 199 ConjunctsInUnsatCore, 44 InterpolantComputations, 21 PerfectInterpolantSequences, 79/198 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.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_15-58-31-344.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.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_15-58-31-344.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.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_15-58-31-344.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.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_15-58-31-344.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.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_15-58-31-344.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.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-24_15-58-31-344.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.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-24_15-58-31-344.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.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-24_15-58-31-344.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.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-24_15-58-31-344.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.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_15-58-31-344.csv Completed graceful shutdown