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_3_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:02:12,726 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:02:12,727 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:02:12,742 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:02:12,742 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:02:12,743 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:02:12,743 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:02:12,745 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:02:12,746 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:02:12,747 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:02:12,748 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:02:12,748 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:02:12,749 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:02:12,750 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:02:12,751 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:02:12,753 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:02:12,756 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:02:12,758 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:02:12,759 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:02:12,761 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:02:12,763 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:02:12,763 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:02:12,763 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:02:12,765 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:02:12,765 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:02:12,767 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:02:12,767 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:02:12,768 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:02:12,768 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:02:12,768 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:02:12,769 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:02:12,769 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 16:02:12,779 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:02:12,779 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:02:12,780 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:02:12,780 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:02:12,781 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:02:12,781 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:02:12,781 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:02:12,782 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:02:12,782 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:02:12,782 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:02:12,782 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:02:12,783 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:02:12,783 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:02:12,783 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:02:12,783 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:02:12,783 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:02:12,784 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:02:12,784 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:02:12,784 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:02:12,784 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:02:12,785 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:02:12,785 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:02:12,785 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:02:12,785 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:02:12,785 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:02:12,786 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:02:12,786 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:02:12,786 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:02:12,786 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 16:02:12,786 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:02:12,787 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:02:12,787 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:02:12,787 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 16:02:12,788 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:02:12,788 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:02:12,826 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:02:12,839 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:02:12,844 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:02:12,845 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:02:12,846 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:02:12,846 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_3_true-valid-memsafety_true-termination.i [2018-01-24 16:02:13,045 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:02:13,052 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:02:13,053 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:02:13,053 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:02:13,059 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:02:13,060 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:02:13" (1/1) ... [2018-01-24 16:02:13,062 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4be9a57f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:02:13, skipping insertion in model container [2018-01-24 16:02:13,062 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:02:13" (1/1) ... [2018-01-24 16:02:13,076 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:02:13,125 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:02:13,260 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:02:13,288 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:02:13,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:02:13 WrapperNode [2018-01-24 16:02:13,303 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:02:13,303 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:02:13,304 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:02:13,304 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:02:13,315 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:02:13" (1/1) ... [2018-01-24 16:02:13,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:02:13" (1/1) ... [2018-01-24 16:02:13,327 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:02:13" (1/1) ... [2018-01-24 16:02:13,328 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:02:13" (1/1) ... [2018-01-24 16:02:13,339 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:02:13" (1/1) ... [2018-01-24 16:02:13,344 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:02:13" (1/1) ... [2018-01-24 16:02:13,346 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:02:13" (1/1) ... [2018-01-24 16:02:13,351 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:02:13,351 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:02:13,352 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:02:13,352 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:02:13,353 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:02:13" (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 16:02:13,411 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:02:13,411 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:02:13,411 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-01-24 16:02:13,411 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 16:02:13,412 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-01-24 16:02:13,412 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2018-01-24 16:02:13,412 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-01-24 16:02:13,412 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-01-24 16:02:13,412 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-01-24 16:02:13,412 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2018-01-24 16:02:13,412 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-01-24 16:02:13,412 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-01-24 16:02:13,412 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-01-24 16:02:13,412 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-01-24 16:02:13,413 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2018-01-24 16:02:13,413 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-01-24 16:02:13,413 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-01-24 16:02:13,413 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-01-24 16:02:13,413 INFO L136 BoogieDeclarations]: Found implementation of procedure f_22_get [2018-01-24 16:02:13,413 INFO L136 BoogieDeclarations]: Found implementation of procedure f_22_put [2018-01-24 16:02:13,413 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 16:02:13,414 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:02:13,414 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 16:02:13,414 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 16:02:13,414 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:02:13,414 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:02:13,415 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:02:13,415 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:02:13,415 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:02:13,415 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-24 16:02:13,415 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-24 16:02:13,416 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 16:02:13,416 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 16:02:13,416 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:02:13,416 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-24 16:02:13,416 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 16:02:13,416 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-01-24 16:02:13,416 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2018-01-24 16:02:13,417 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-01-24 16:02:13,417 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-01-24 16:02:13,417 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-01-24 16:02:13,417 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-01-24 16:02:13,417 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2018-01-24 16:02:13,417 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-01-24 16:02:13,418 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-01-24 16:02:13,418 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-01-24 16:02:13,418 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-01-24 16:02:13,418 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2018-01-24 16:02:13,418 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-01-24 16:02:13,418 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-01-24 16:02:13,418 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-01-24 16:02:13,419 INFO L128 BoogieDeclarations]: Found specification of procedure f_22_get [2018-01-24 16:02:13,419 INFO L128 BoogieDeclarations]: Found specification of procedure f_22_put [2018-01-24 16:02:13,419 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 16:02:13,419 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:02:13,419 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:02:13,419 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:02:13,688 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-24 16:02:13,897 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:02:13,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:02:13 BoogieIcfgContainer [2018-01-24 16:02:13,898 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:02:13,899 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 16:02:13,899 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 16:02:13,901 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 16:02:13,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 04:02:13" (1/3) ... [2018-01-24 16:02:13,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b08e97f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:02:13, skipping insertion in model container [2018-01-24 16:02:13,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:02:13" (2/3) ... [2018-01-24 16:02:13,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b08e97f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:02:13, skipping insertion in model container [2018-01-24 16:02:13,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:02:13" (3/3) ... [2018-01-24 16:02:13,906 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test22_3_true-valid-memsafety_true-termination.i [2018-01-24 16:02:13,915 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 16:02:13,922 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-01-24 16:02:13,968 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 16:02:13,968 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 16:02:13,969 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 16:02:13,969 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 16:02:13,969 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 16:02:13,969 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 16:02:13,969 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 16:02:13,969 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 16:02:13,970 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 16:02:13,990 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2018-01-24 16:02:13,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 16:02:13,996 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:02:13,997 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 16:02:13,998 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 16:02:14,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1245228870, now seen corresponding path program 1 times [2018-01-24 16:02:14,005 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:02:14,053 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:14,054 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:02:14,054 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:14,054 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:02:14,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:14,122 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:02:14,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 16:02:14,324 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:02:14,324 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:02:14,325 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:02:14,328 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:02:14,343 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:02:14,344 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:02:14,346 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 5 states. [2018-01-24 16:02:14,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:02:14,415 INFO L93 Difference]: Finished difference Result 290 states and 307 transitions. [2018-01-24 16:02:14,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:02:14,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-24 16:02:14,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:02:14,428 INFO L225 Difference]: With dead ends: 290 [2018-01-24 16:02:14,428 INFO L226 Difference]: Without dead ends: 154 [2018-01-24 16:02:14,432 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:02:14,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-24 16:02:14,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2018-01-24 16:02:14,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-01-24 16:02:14,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 161 transitions. [2018-01-24 16:02:14,471 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 161 transitions. Word has length 17 [2018-01-24 16:02:14,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:02:14,472 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 161 transitions. [2018-01-24 16:02:14,472 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:02:14,472 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 161 transitions. [2018-01-24 16:02:14,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 16:02:14,472 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:02:14,472 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 16:02:14,473 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 16:02:14,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1572748952, now seen corresponding path program 1 times [2018-01-24 16:02:14,473 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:02:14,474 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:14,474 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:02:14,475 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:14,475 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:02:14,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:14,499 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:02:14,580 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 16:02:14,581 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:02:14,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:02:14,581 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:02:14,583 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:02:14,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:02:14,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:02:14,584 INFO L87 Difference]: Start difference. First operand 152 states and 161 transitions. Second operand 6 states. [2018-01-24 16:02:14,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:02:14,817 INFO L93 Difference]: Finished difference Result 154 states and 163 transitions. [2018-01-24 16:02:14,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:02:14,818 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 16:02:14,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:02:14,821 INFO L225 Difference]: With dead ends: 154 [2018-01-24 16:02:14,821 INFO L226 Difference]: Without dead ends: 153 [2018-01-24 16:02:14,822 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 16:02:14,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-01-24 16:02:14,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2018-01-24 16:02:14,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-01-24 16:02:14,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2018-01-24 16:02:14,838 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 19 [2018-01-24 16:02:14,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:02:14,839 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2018-01-24 16:02:14,839 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:02:14,839 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2018-01-24 16:02:14,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 16:02:14,840 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:02:14,840 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 16:02:14,840 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 16:02:14,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1572748951, now seen corresponding path program 1 times [2018-01-24 16:02:14,840 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:02:14,842 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:14,842 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:02:14,842 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:14,842 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:02:14,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:14,867 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:02:15,102 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 16:02:15,102 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:02:15,102 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 16:02:15,102 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:02:15,103 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 16:02:15,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 16:02:15,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:02:15,103 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand 7 states. [2018-01-24 16:02:15,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:02:15,353 INFO L93 Difference]: Finished difference Result 153 states and 162 transitions. [2018-01-24 16:02:15,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 16:02:15,353 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-01-24 16:02:15,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:02:15,355 INFO L225 Difference]: With dead ends: 153 [2018-01-24 16:02:15,355 INFO L226 Difference]: Without dead ends: 152 [2018-01-24 16:02:15,355 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 16:02:15,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-24 16:02:15,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2018-01-24 16:02:15,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-24 16:02:15,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 159 transitions. [2018-01-24 16:02:15,369 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 159 transitions. Word has length 19 [2018-01-24 16:02:15,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:02:15,370 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 159 transitions. [2018-01-24 16:02:15,370 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 16:02:15,370 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 159 transitions. [2018-01-24 16:02:15,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 16:02:15,371 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:02:15,371 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 16:02:15,372 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 16:02:15,372 INFO L82 PathProgramCache]: Analyzing trace with hash -336004596, now seen corresponding path program 1 times [2018-01-24 16:02:15,373 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:02:15,374 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:15,374 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:02:15,374 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:15,375 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:02:15,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:15,394 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:02:15,506 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 16:02:15,506 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:02:15,506 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 16:02:15,507 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:02:15,507 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 16:02:15,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 16:02:15,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:02:15,508 INFO L87 Difference]: Start difference. First operand 150 states and 159 transitions. Second operand 9 states. [2018-01-24 16:02:15,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:02:15,647 INFO L93 Difference]: Finished difference Result 256 states and 271 transitions. [2018-01-24 16:02:15,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 16:02:15,648 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-01-24 16:02:15,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:02:15,650 INFO L225 Difference]: With dead ends: 256 [2018-01-24 16:02:15,650 INFO L226 Difference]: Without dead ends: 171 [2018-01-24 16:02:15,651 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 16:02:15,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-01-24 16:02:15,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 164. [2018-01-24 16:02:15,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-01-24 16:02:15,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 173 transitions. [2018-01-24 16:02:15,667 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 173 transitions. Word has length 29 [2018-01-24 16:02:15,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:02:15,667 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 173 transitions. [2018-01-24 16:02:15,668 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 16:02:15,668 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 173 transitions. [2018-01-24 16:02:15,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 16:02:15,669 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:02:15,669 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 16:02:15,669 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 16:02:15,669 INFO L82 PathProgramCache]: Analyzing trace with hash 610577100, now seen corresponding path program 1 times [2018-01-24 16:02:15,669 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:02:15,671 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:15,671 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:02:15,671 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:15,671 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:02:15,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:15,689 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:02:15,770 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 16:02:15,770 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:02:15,770 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 16:02:15,770 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:02:15,771 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 16:02:15,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 16:02:15,771 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 16:02:15,771 INFO L87 Difference]: Start difference. First operand 164 states and 173 transitions. Second operand 10 states. [2018-01-24 16:02:15,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:02:15,978 INFO L93 Difference]: Finished difference Result 164 states and 173 transitions. [2018-01-24 16:02:15,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 16:02:15,979 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-01-24 16:02:15,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:02:15,981 INFO L225 Difference]: With dead ends: 164 [2018-01-24 16:02:15,981 INFO L226 Difference]: Without dead ends: 163 [2018-01-24 16:02:15,982 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 16:02:15,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-01-24 16:02:15,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-01-24 16:02:15,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-01-24 16:02:15,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 172 transitions. [2018-01-24 16:02:15,995 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 172 transitions. Word has length 34 [2018-01-24 16:02:15,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:02:15,996 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 172 transitions. [2018-01-24 16:02:15,996 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 16:02:15,996 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 172 transitions. [2018-01-24 16:02:15,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 16:02:15,997 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:02:15,997 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 16:02:15,998 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 16:02:15,998 INFO L82 PathProgramCache]: Analyzing trace with hash 610577101, now seen corresponding path program 1 times [2018-01-24 16:02:15,998 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:02:15,999 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:15,999 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:02:16,000 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:16,000 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:02:16,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:16,016 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:02:16,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:02:16,045 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:02:16,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:02:16,045 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:02:16,045 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:02:16,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:02:16,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:02:16,046 INFO L87 Difference]: Start difference. First operand 163 states and 172 transitions. Second operand 4 states. [2018-01-24 16:02:16,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:02:16,064 INFO L93 Difference]: Finished difference Result 287 states and 303 transitions. [2018-01-24 16:02:16,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:02:16,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-01-24 16:02:16,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:02:16,065 INFO L225 Difference]: With dead ends: 287 [2018-01-24 16:02:16,065 INFO L226 Difference]: Without dead ends: 164 [2018-01-24 16:02:16,066 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 16:02:16,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-01-24 16:02:16,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-01-24 16:02:16,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-01-24 16:02:16,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 173 transitions. [2018-01-24 16:02:16,079 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 173 transitions. Word has length 34 [2018-01-24 16:02:16,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:02:16,080 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 173 transitions. [2018-01-24 16:02:16,080 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:02:16,080 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 173 transitions. [2018-01-24 16:02:16,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-24 16:02:16,081 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:02:16,081 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 16:02:16,081 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 16:02:16,082 INFO L82 PathProgramCache]: Analyzing trace with hash -838244594, now seen corresponding path program 1 times [2018-01-24 16:02:16,082 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:02:16,083 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:16,083 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:02:16,083 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:16,083 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:02:16,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:16,098 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:02:16,158 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 16:02:16,159 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:02:16,159 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:02:16,159 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-01-24 16:02:16,161 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [31], [36], [52], [59], [63], [67], [70], [72], [73], [77], [79], [80], [133], [136], [137], [138], [140], [141], [142], [164], [165], [166], [167], [168], [170], [176], [180], [188], [206], [207], [208] [2018-01-24 16:02:16,207 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:02:16,207 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:02:18,734 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:02:18,736 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 16:02:18,764 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:02:18,764 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:02:18,764 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 16:02:18,774 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:02:18,775 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:02:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:18,820 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:02:18,839 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 16:02:18,839 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:02:18,946 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 16:02:18,982 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:02:18,982 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 16:02:18,989 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:02:18,989 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:02:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:19,055 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:02:19,062 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 16:02:19,063 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:02:19,117 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 16:02:19,118 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:02:19,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5] total 9 [2018-01-24 16:02:19,119 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:02:19,119 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:02:19,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:02:19,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:02:19,120 INFO L87 Difference]: Start difference. First operand 164 states and 173 transitions. Second operand 6 states. [2018-01-24 16:02:19,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:02:19,154 INFO L93 Difference]: Finished difference Result 288 states and 304 transitions. [2018-01-24 16:02:19,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:02:19,155 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-24 16:02:19,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:02:19,157 INFO L225 Difference]: With dead ends: 288 [2018-01-24 16:02:19,157 INFO L226 Difference]: Without dead ends: 165 [2018-01-24 16:02:19,158 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 134 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-01-24 16:02:19,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-01-24 16:02:19,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-01-24 16:02:19,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-01-24 16:02:19,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 174 transitions. [2018-01-24 16:02:19,170 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 174 transitions. Word has length 35 [2018-01-24 16:02:19,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:02:19,170 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 174 transitions. [2018-01-24 16:02:19,170 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:02:19,171 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 174 transitions. [2018-01-24 16:02:19,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 16:02:19,172 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:02:19,172 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 16:02:19,172 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 16:02:19,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1492923117, now seen corresponding path program 2 times [2018-01-24 16:02:19,173 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:02:19,174 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:19,174 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:02:19,174 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:19,175 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:02:19,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:19,193 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:02:19,280 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 16:02:19,281 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:02:19,308 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:02:19,308 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 16:02:19,308 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 16:02:19,309 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:02:19,309 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 16:02:19,317 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:02:19,317 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:02:19,345 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:02:19,349 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:02:19,353 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:02:19,381 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 16:02:19,383 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:02:19,423 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 16:02:19,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:02:19,440 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 16:02:19,440 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-24 16:02:20,029 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 16:02:20,029 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:02:20,749 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 16:02:20,768 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 16:02:20,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14, 13] imperfect sequences [6] total 31 [2018-01-24 16:02:20,768 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:02:20,768 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 16:02:20,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 16:02:20,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=840, Unknown=0, NotChecked=0, Total=930 [2018-01-24 16:02:20,769 INFO L87 Difference]: Start difference. First operand 165 states and 174 transitions. Second operand 15 states. [2018-01-24 16:02:25,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:02:25,945 INFO L93 Difference]: Finished difference Result 241 states and 253 transitions. [2018-01-24 16:02:25,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 16:02:25,945 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2018-01-24 16:02:25,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:02:25,948 INFO L225 Difference]: With dead ends: 241 [2018-01-24 16:02:25,948 INFO L226 Difference]: Without dead ends: 240 [2018-01-24 16:02:25,949 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=118, Invalid=1072, Unknown=0, NotChecked=0, Total=1190 [2018-01-24 16:02:25,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-01-24 16:02:25,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 164. [2018-01-24 16:02:25,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-01-24 16:02:25,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 173 transitions. [2018-01-24 16:02:25,963 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 173 transitions. Word has length 36 [2018-01-24 16:02:25,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:02:25,963 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 173 transitions. [2018-01-24 16:02:25,963 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 16:02:25,963 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 173 transitions. [2018-01-24 16:02:25,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-24 16:02:25,964 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:02:25,965 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:02:25,965 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 16:02:25,965 INFO L82 PathProgramCache]: Analyzing trace with hash 278126369, now seen corresponding path program 1 times [2018-01-24 16:02:25,965 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:02:25,966 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:25,966 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 16:02:25,967 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:25,967 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:02:25,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:25,980 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:02:26,248 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 16:02:26,248 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:02:26,248 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 16:02:26,248 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:02:26,249 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 16:02:26,249 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 16:02:26,249 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:02:26,249 INFO L87 Difference]: Start difference. First operand 164 states and 173 transitions. Second operand 9 states. [2018-01-24 16:02:26,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:02:26,490 INFO L93 Difference]: Finished difference Result 237 states and 253 transitions. [2018-01-24 16:02:26,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 16:02:26,490 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-01-24 16:02:26,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:02:26,492 INFO L225 Difference]: With dead ends: 237 [2018-01-24 16:02:26,492 INFO L226 Difference]: Without dead ends: 178 [2018-01-24 16:02:26,493 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-24 16:02:26,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-01-24 16:02:26,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 174. [2018-01-24 16:02:26,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-01-24 16:02:26,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 184 transitions. [2018-01-24 16:02:26,510 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 184 transitions. Word has length 42 [2018-01-24 16:02:26,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:02:26,510 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 184 transitions. [2018-01-24 16:02:26,511 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 16:02:26,511 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 184 transitions. [2018-01-24 16:02:26,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 16:02:26,512 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:02:26,512 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 16:02:26,512 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 16:02:26,512 INFO L82 PathProgramCache]: Analyzing trace with hash -870895777, now seen corresponding path program 1 times [2018-01-24 16:02:26,513 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:02:26,514 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:26,514 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:02:26,514 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:26,514 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:02:26,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:26,529 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:02:26,705 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 16:02:26,705 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:02:26,705 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 16:02:26,705 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:02:26,706 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 16:02:26,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 16:02:26,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 16:02:26,706 INFO L87 Difference]: Start difference. First operand 174 states and 184 transitions. Second operand 10 states. [2018-01-24 16:02:27,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:02:27,000 INFO L93 Difference]: Finished difference Result 174 states and 184 transitions. [2018-01-24 16:02:27,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 16:02:27,001 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2018-01-24 16:02:27,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:02:27,002 INFO L225 Difference]: With dead ends: 174 [2018-01-24 16:02:27,003 INFO L226 Difference]: Without dead ends: 172 [2018-01-24 16:02:27,003 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 16:02:27,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-01-24 16:02:27,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-01-24 16:02:27,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-01-24 16:02:27,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 182 transitions. [2018-01-24 16:02:27,015 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 182 transitions. Word has length 41 [2018-01-24 16:02:27,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:02:27,015 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 182 transitions. [2018-01-24 16:02:27,016 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 16:02:27,016 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 182 transitions. [2018-01-24 16:02:27,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 16:02:27,016 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:02:27,016 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 16:02:27,017 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 16:02:27,017 INFO L82 PathProgramCache]: Analyzing trace with hash -870895776, now seen corresponding path program 1 times [2018-01-24 16:02:27,017 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:02:27,018 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:27,018 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:02:27,018 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:27,018 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:02:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:27,031 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:02:27,081 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 16:02:27,082 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:02:27,082 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:02:27,082 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-01-24 16:02:27,082 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [31], [36], [52], [59], [63], [67], [68], [71], [72], [73], [77], [79], [80], [122], [125], [133], [136], [137], [138], [140], [141], [142], [164], [165], [166], [167], [168], [170], [176], [180], [188], [189], [190], [206], [207], [208] [2018-01-24 16:02:27,084 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:02:27,084 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:02:30,202 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:02:30,203 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 16:02:30,212 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:02:30,212 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:02:30,212 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 16:02:30,223 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:02:30,224 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:02:30,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:30,254 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:02:30,351 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 16:02:30,351 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:02:30,516 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 16:02:30,536 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:02:30,537 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 16:02:30,540 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:02:30,540 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:02:30,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:30,585 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:02:30,589 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 16:02:30,589 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:02:30,614 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 16:02:30,616 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:02:30,616 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6] total 11 [2018-01-24 16:02:30,616 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:02:30,616 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 16:02:30,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 16:02:30,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-01-24 16:02:30,617 INFO L87 Difference]: Start difference. First operand 172 states and 182 transitions. Second operand 7 states. [2018-01-24 16:02:30,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:02:30,652 INFO L93 Difference]: Finished difference Result 293 states and 310 transitions. [2018-01-24 16:02:30,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:02:30,653 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-01-24 16:02:30,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:02:30,655 INFO L225 Difference]: With dead ends: 293 [2018-01-24 16:02:30,655 INFO L226 Difference]: Without dead ends: 173 [2018-01-24 16:02:30,656 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2018-01-24 16:02:30,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-01-24 16:02:30,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-01-24 16:02:30,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-01-24 16:02:30,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 183 transitions. [2018-01-24 16:02:30,672 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 183 transitions. Word has length 41 [2018-01-24 16:02:30,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:02:30,672 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 183 transitions. [2018-01-24 16:02:30,672 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 16:02:30,672 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 183 transitions. [2018-01-24 16:02:30,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-24 16:02:30,673 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:02:30,673 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 16:02:30,674 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 16:02:30,674 INFO L82 PathProgramCache]: Analyzing trace with hash 2131974143, now seen corresponding path program 2 times [2018-01-24 16:02:30,674 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:02:30,675 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:30,675 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:02:30,675 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:30,676 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:02:30,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:30,692 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:02:30,760 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 16:02:30,761 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:02:30,761 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:02:30,761 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 16:02:30,761 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 16:02:30,761 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:02:30,761 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 16:02:30,769 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:02:30,769 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:02:30,787 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:02:30,790 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:02:30,793 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:02:30,798 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 16:02:30,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:02:30,814 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 16:02:30,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:02:30,826 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 16:02:30,826 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-24 16:02:31,320 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 16:02:31,320 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:02:31,738 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 16:02:31,760 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 16:02:31,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15, 13] imperfect sequences [7] total 33 [2018-01-24 16:02:31,760 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:02:31,760 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 16:02:31,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 16:02:31,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=951, Unknown=0, NotChecked=0, Total=1056 [2018-01-24 16:02:31,761 INFO L87 Difference]: Start difference. First operand 173 states and 183 transitions. Second operand 16 states. [2018-01-24 16:02:32,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:02:32,909 INFO L93 Difference]: Finished difference Result 205 states and 214 transitions. [2018-01-24 16:02:32,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 16:02:32,910 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2018-01-24 16:02:32,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:02:32,911 INFO L225 Difference]: With dead ends: 205 [2018-01-24 16:02:32,911 INFO L226 Difference]: Without dead ends: 203 [2018-01-24 16:02:32,911 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=136, Invalid=1196, Unknown=0, NotChecked=0, Total=1332 [2018-01-24 16:02:32,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-01-24 16:02:32,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 171. [2018-01-24 16:02:32,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-01-24 16:02:32,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 181 transitions. [2018-01-24 16:02:32,925 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 181 transitions. Word has length 42 [2018-01-24 16:02:32,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:02:32,925 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 181 transitions. [2018-01-24 16:02:32,925 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 16:02:32,925 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 181 transitions. [2018-01-24 16:02:32,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-24 16:02:32,926 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:02:32,926 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 16:02:32,926 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 16:02:32,927 INFO L82 PathProgramCache]: Analyzing trace with hash 799197829, now seen corresponding path program 1 times [2018-01-24 16:02:32,927 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:02:32,928 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:32,928 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 16:02:32,928 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:32,928 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:02:32,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:32,940 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:02:33,018 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 16:02:33,018 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:02:33,018 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 16:02:33,018 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:02:33,018 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 16:02:33,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 16:02:33,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:02:33,019 INFO L87 Difference]: Start difference. First operand 171 states and 181 transitions. Second operand 8 states. [2018-01-24 16:02:33,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:02:33,073 INFO L93 Difference]: Finished difference Result 291 states and 306 transitions. [2018-01-24 16:02:33,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:02:33,076 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-01-24 16:02:33,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:02:33,078 INFO L225 Difference]: With dead ends: 291 [2018-01-24 16:02:33,078 INFO L226 Difference]: Without dead ends: 171 [2018-01-24 16:02:33,079 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 16:02:33,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-01-24 16:02:33,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-01-24 16:02:33,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-01-24 16:02:33,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 179 transitions. [2018-01-24 16:02:33,100 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 179 transitions. Word has length 47 [2018-01-24 16:02:33,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:02:33,101 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 179 transitions. [2018-01-24 16:02:33,101 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 16:02:33,101 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 179 transitions. [2018-01-24 16:02:33,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-24 16:02:33,102 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:02:33,102 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:02:33,102 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 16:02:33,102 INFO L82 PathProgramCache]: Analyzing trace with hash 689381786, now seen corresponding path program 1 times [2018-01-24 16:02:33,102 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:02:33,103 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:33,103 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:02:33,104 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:33,104 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:02:33,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:33,114 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:02:33,155 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 16:02:33,156 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:02:33,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 16:02:33,156 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:02:33,156 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 16:02:33,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 16:02:33,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 16:02:33,157 INFO L87 Difference]: Start difference. First operand 171 states and 179 transitions. Second operand 3 states. [2018-01-24 16:02:33,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:02:33,250 INFO L93 Difference]: Finished difference Result 185 states and 193 transitions. [2018-01-24 16:02:33,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 16:02:33,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-01-24 16:02:33,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:02:33,251 INFO L225 Difference]: With dead ends: 185 [2018-01-24 16:02:33,251 INFO L226 Difference]: Without dead ends: 153 [2018-01-24 16:02:33,251 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 16:02:33,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-01-24 16:02:33,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 143. [2018-01-24 16:02:33,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-24 16:02:33,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 149 transitions. [2018-01-24 16:02:33,264 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 149 transitions. Word has length 47 [2018-01-24 16:02:33,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:02:33,264 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 149 transitions. [2018-01-24 16:02:33,264 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 16:02:33,264 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 149 transitions. [2018-01-24 16:02:33,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-24 16:02:33,265 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:02:33,265 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 16:02:33,265 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 16:02:33,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1696219427, now seen corresponding path program 1 times [2018-01-24 16:02:33,265 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:02:33,266 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:33,266 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:02:33,266 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:33,266 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:02:33,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:33,275 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:02:33,342 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 16:02:33,342 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:02:33,342 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 16:02:33,342 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:02:33,342 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 16:02:33,343 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 16:02:33,343 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 16:02:33,343 INFO L87 Difference]: Start difference. First operand 143 states and 149 transitions. Second operand 10 states. [2018-01-24 16:02:33,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:02:33,447 INFO L93 Difference]: Finished difference Result 241 states and 251 transitions. [2018-01-24 16:02:33,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 16:02:33,447 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2018-01-24 16:02:33,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:02:33,449 INFO L225 Difference]: With dead ends: 241 [2018-01-24 16:02:33,449 INFO L226 Difference]: Without dead ends: 143 [2018-01-24 16:02:33,449 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 16:02:33,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-24 16:02:33,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-01-24 16:02:33,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-24 16:02:33,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 148 transitions. [2018-01-24 16:02:33,468 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 148 transitions. Word has length 52 [2018-01-24 16:02:33,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:02:33,468 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 148 transitions. [2018-01-24 16:02:33,468 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 16:02:33,468 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 148 transitions. [2018-01-24 16:02:33,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-24 16:02:33,469 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:02:33,469 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 16:02:33,469 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 16:02:33,469 INFO L82 PathProgramCache]: Analyzing trace with hash 381457938, now seen corresponding path program 1 times [2018-01-24 16:02:33,470 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:02:33,470 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:33,471 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:02:33,471 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:33,471 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:02:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:33,489 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:02:33,815 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 16:02:33,816 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:02:33,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-24 16:02:33,816 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:02:33,816 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 16:02:33,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 16:02:33,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-01-24 16:02:33,817 INFO L87 Difference]: Start difference. First operand 143 states and 148 transitions. Second operand 15 states. [2018-01-24 16:02:34,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:02:34,281 INFO L93 Difference]: Finished difference Result 143 states and 148 transitions. [2018-01-24 16:02:34,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 16:02:34,281 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 63 [2018-01-24 16:02:34,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:02:34,282 INFO L225 Difference]: With dead ends: 143 [2018-01-24 16:02:34,283 INFO L226 Difference]: Without dead ends: 141 [2018-01-24 16:02:34,283 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-01-24 16:02:34,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-01-24 16:02:34,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-01-24 16:02:34,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-01-24 16:02:34,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 146 transitions. [2018-01-24 16:02:34,295 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 146 transitions. Word has length 63 [2018-01-24 16:02:34,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:02:34,296 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 146 transitions. [2018-01-24 16:02:34,296 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 16:02:34,296 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 146 transitions. [2018-01-24 16:02:34,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-24 16:02:34,296 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:02:34,296 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 16:02:34,296 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 16:02:34,297 INFO L82 PathProgramCache]: Analyzing trace with hash 381457939, now seen corresponding path program 1 times [2018-01-24 16:02:34,297 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:02:34,298 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:34,298 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:02:34,298 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:34,298 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:02:34,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:34,312 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:02:34,367 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 16:02:34,367 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:02:34,367 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:02:34,367 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 64 with the following transitions: [2018-01-24 16:02:34,367 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [12], [13], [17], [31], [36], [38], [52], [54], [59], [63], [66], [67], [68], [71], [72], [73], [77], [79], [80], [91], [94], [122], [123], [126], [129], [133], [136], [137], [138], [140], [141], [142], [147], [150], [157], [164], [165], [166], [167], [168], [169], [170], [172], [176], [177], [180], [181], [182], [188], [189], [190], [191], [202], [204], [206], [207], [208] [2018-01-24 16:02:34,369 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:02:34,370 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:02:37,764 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:02:37,764 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 16:02:37,771 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:02:37,772 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:02:37,772 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 16:02:37,785 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:02:37,785 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:02:37,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:37,836 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:02:37,861 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 16:02:37,861 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:02:38,001 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 16:02:38,034 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:02:38,034 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 16:02:38,037 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:02:38,038 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:02:38,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:38,113 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:02:38,118 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 16:02:38,118 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:02:38,193 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 16:02:38,195 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:02:38,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 13 [2018-01-24 16:02:38,195 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:02:38,196 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 16:02:38,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 16:02:38,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-01-24 16:02:38,196 INFO L87 Difference]: Start difference. First operand 141 states and 146 transitions. Second operand 8 states. [2018-01-24 16:02:38,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:02:38,235 INFO L93 Difference]: Finished difference Result 258 states and 268 transitions. [2018-01-24 16:02:38,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 16:02:38,236 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2018-01-24 16:02:38,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:02:38,237 INFO L225 Difference]: With dead ends: 258 [2018-01-24 16:02:38,237 INFO L226 Difference]: Without dead ends: 142 [2018-01-24 16:02:38,237 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 16:02:38,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-01-24 16:02:38,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-01-24 16:02:38,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-01-24 16:02:38,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 147 transitions. [2018-01-24 16:02:38,249 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 147 transitions. Word has length 63 [2018-01-24 16:02:38,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:02:38,249 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 147 transitions. [2018-01-24 16:02:38,249 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 16:02:38,249 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 147 transitions. [2018-01-24 16:02:38,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-24 16:02:38,250 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:02:38,250 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 16:02:38,250 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 16:02:38,250 INFO L82 PathProgramCache]: Analyzing trace with hash -109515406, now seen corresponding path program 2 times [2018-01-24 16:02:38,251 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:02:38,252 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:38,252 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:02:38,252 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:38,252 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:02:38,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:38,269 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:02:38,396 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 16:02:38,397 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:02:38,397 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:02:38,397 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 16:02:38,397 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 16:02:38,397 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:02:38,397 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 16:02:38,408 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:02:38,408 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:02:38,439 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:02:38,445 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:02:38,449 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:02:38,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-24 16:02:38,463 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:02:38,568 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 16:02:38,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:02:38,660 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 16:02:38,660 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-24 16:02:39,411 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 16:02:39,412 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:02:40,563 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 16:02:40,589 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 16:02:40,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20, 18] imperfect sequences [8] total 44 [2018-01-24 16:02:40,589 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:02:40,589 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 16:02:40,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 16:02:40,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1746, Unknown=0, NotChecked=0, Total=1892 [2018-01-24 16:02:40,590 INFO L87 Difference]: Start difference. First operand 142 states and 147 transitions. Second operand 21 states. [2018-01-24 16:02:41,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:02:41,817 INFO L93 Difference]: Finished difference Result 142 states and 147 transitions. [2018-01-24 16:02:41,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-24 16:02:41,817 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-01-24 16:02:41,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:02:41,819 INFO L225 Difference]: With dead ends: 142 [2018-01-24 16:02:41,819 INFO L226 Difference]: Without dead ends: 140 [2018-01-24 16:02:41,820 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=195, Invalid=2255, Unknown=0, NotChecked=0, Total=2450 [2018-01-24 16:02:41,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-24 16:02:41,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-01-24 16:02:41,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-24 16:02:41,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 145 transitions. [2018-01-24 16:02:41,834 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 145 transitions. Word has length 64 [2018-01-24 16:02:41,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:02:41,834 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 145 transitions. [2018-01-24 16:02:41,834 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-24 16:02:41,834 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 145 transitions. [2018-01-24 16:02:41,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-01-24 16:02:41,835 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:02:41,835 INFO L322 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:02:41,835 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 16:02:41,836 INFO L82 PathProgramCache]: Analyzing trace with hash -866691108, now seen corresponding path program 1 times [2018-01-24 16:02:41,836 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:02:41,837 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:41,837 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 16:02:41,837 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:41,837 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:02:41,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:41,851 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:02:42,063 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 16:02:42,064 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:02:42,064 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-24 16:02:42,064 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:02:42,064 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 16:02:42,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 16:02:42,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-01-24 16:02:42,065 INFO L87 Difference]: Start difference. First operand 140 states and 145 transitions. Second operand 13 states. [2018-01-24 16:02:42,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:02:42,164 INFO L93 Difference]: Finished difference Result 208 states and 216 transitions. [2018-01-24 16:02:42,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 16:02:42,164 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 77 [2018-01-24 16:02:42,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:02:42,165 INFO L225 Difference]: With dead ends: 208 [2018-01-24 16:02:42,165 INFO L226 Difference]: Without dead ends: 140 [2018-01-24 16:02:42,166 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-01-24 16:02:42,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-24 16:02:42,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-01-24 16:02:42,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-24 16:02:42,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 144 transitions. [2018-01-24 16:02:42,182 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 144 transitions. Word has length 77 [2018-01-24 16:02:42,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:02:42,182 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 144 transitions. [2018-01-24 16:02:42,182 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 16:02:42,182 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 144 transitions. [2018-01-24 16:02:42,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-01-24 16:02:42,183 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:02:42,184 INFO L322 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:02:42,184 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 16:02:42,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1579109870, now seen corresponding path program 1 times [2018-01-24 16:02:42,184 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:02:42,185 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:42,185 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:02:42,185 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:42,185 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:02:42,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:42,209 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:02:42,840 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 16:02:42,840 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:02:42,840 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-01-24 16:02:42,840 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:02:42,840 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-24 16:02:42,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-24 16:02:42,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2018-01-24 16:02:42,841 INFO L87 Difference]: Start difference. First operand 140 states and 144 transitions. Second operand 22 states. [2018-01-24 16:02:43,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:02:43,948 INFO L93 Difference]: Finished difference Result 169 states and 179 transitions. [2018-01-24 16:02:43,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-24 16:02:43,948 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 90 [2018-01-24 16:02:43,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:02:43,949 INFO L225 Difference]: With dead ends: 169 [2018-01-24 16:02:43,950 INFO L226 Difference]: Without dead ends: 167 [2018-01-24 16:02:43,950 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2018-01-24 16:02:43,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-01-24 16:02:43,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 162. [2018-01-24 16:02:43,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-01-24 16:02:43,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 172 transitions. [2018-01-24 16:02:43,965 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 172 transitions. Word has length 90 [2018-01-24 16:02:43,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:02:43,965 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 172 transitions. [2018-01-24 16:02:43,965 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-24 16:02:43,965 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 172 transitions. [2018-01-24 16:02:43,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-01-24 16:02:43,966 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:02:43,966 INFO L322 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:02:43,966 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 16:02:43,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1579109869, now seen corresponding path program 1 times [2018-01-24 16:02:43,966 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:02:43,967 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:43,967 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:02:43,967 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:43,968 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:02:43,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:43,985 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:02:44,119 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 16:02:44,119 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:02:44,119 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:02:44,119 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 91 with the following transitions: [2018-01-24 16:02:44,120 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [12], [13], [17], [19], [20], [21], [24], [31], [36], [38], [39], [42], [52], [54], [59], [63], [66], [67], [68], [71], [72], [73], [77], [79], [80], [81], [91], [92], [95], [96], [99], [100], [122], [123], [126], [129], [130], [133], [136], [137], [138], [140], [141], [142], [143], [147], [150], [155], [156], [157], [159], [160], [164], [165], [166], [167], [168], [169], [170], [172], [173], [174], [176], [177], [180], [181], [182], [183], [184], [188], [189], [190], [191], [192], [198], [200], [202], [203], [204], [205], [206], [207], [208] [2018-01-24 16:02:44,122 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:02:44,123 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:02:46,998 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:02:46,998 INFO L268 AbstractInterpreter]: Visited 87 different actions 95 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 26 variables. [2018-01-24 16:02:47,003 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:02:47,003 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:02:47,003 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 16:02:47,011 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:02:47,011 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:02:47,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:47,064 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:02:47,081 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 16:02:47,081 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:02:47,307 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 16:02:47,328 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:02:47,328 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 16:02:47,332 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:02:47,332 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:02:47,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:47,481 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:02:47,490 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 16:02:47,491 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:02:47,689 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 16:02:47,692 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:02:47,692 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8] total 15 [2018-01-24 16:02:47,692 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:02:47,692 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 16:02:47,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 16:02:47,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-01-24 16:02:47,693 INFO L87 Difference]: Start difference. First operand 162 states and 172 transitions. Second operand 9 states. [2018-01-24 16:02:47,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:02:47,763 INFO L93 Difference]: Finished difference Result 299 states and 319 transitions. [2018-01-24 16:02:47,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:02:47,764 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 90 [2018-01-24 16:02:47,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:02:47,765 INFO L225 Difference]: With dead ends: 299 [2018-01-24 16:02:47,765 INFO L226 Difference]: Without dead ends: 163 [2018-01-24 16:02:47,766 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 351 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=137, Unknown=0, NotChecked=0, Total=240 [2018-01-24 16:02:47,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-01-24 16:02:47,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-01-24 16:02:47,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-01-24 16:02:47,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 173 transitions. [2018-01-24 16:02:47,790 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 173 transitions. Word has length 90 [2018-01-24 16:02:47,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:02:47,791 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 173 transitions. [2018-01-24 16:02:47,791 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 16:02:47,791 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 173 transitions. [2018-01-24 16:02:47,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-01-24 16:02:47,792 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:02:47,792 INFO L322 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:02:47,792 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 16:02:47,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1354217300, now seen corresponding path program 2 times [2018-01-24 16:02:47,793 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:02:47,794 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:47,794 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:02:47,794 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:47,794 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:02:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:47,818 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:02:47,925 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 16:02:47,925 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:02:47,925 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:02:47,925 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 16:02:47,925 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 16:02:47,925 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:02:47,926 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 16:02:47,936 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:02:47,936 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:02:47,992 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:02:48,001 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:02:48,008 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:02:48,012 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 16:02:48,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:02:48,028 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 16:02:48,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:02:48,040 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 16:02:48,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-24 16:02:48,932 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-24 16:02:48,932 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:02:51,764 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-24 16:02:51,784 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 16:02:51,785 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22, 20] imperfect sequences [9] total 49 [2018-01-24 16:02:51,785 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:02:51,785 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-24 16:02:51,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-24 16:02:51,786 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=2184, Unknown=1, NotChecked=0, Total=2352 [2018-01-24 16:02:51,786 INFO L87 Difference]: Start difference. First operand 163 states and 173 transitions. Second operand 23 states. [2018-01-24 16:02:53,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:02:53,076 INFO L93 Difference]: Finished difference Result 163 states and 173 transitions. [2018-01-24 16:02:53,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-24 16:02:53,077 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 91 [2018-01-24 16:02:53,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:02:53,078 INFO L225 Difference]: With dead ends: 163 [2018-01-24 16:02:53,078 INFO L226 Difference]: Without dead ends: 161 [2018-01-24 16:02:53,079 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 139 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=224, Invalid=2855, Unknown=1, NotChecked=0, Total=3080 [2018-01-24 16:02:53,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-01-24 16:02:53,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-01-24 16:02:53,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-01-24 16:02:53,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 169 transitions. [2018-01-24 16:02:53,096 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 169 transitions. Word has length 91 [2018-01-24 16:02:53,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:02:53,096 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 169 transitions. [2018-01-24 16:02:53,096 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-24 16:02:53,096 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 169 transitions. [2018-01-24 16:02:53,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-01-24 16:02:53,097 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:02:53,097 INFO L322 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:02:53,097 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 16:02:53,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1220226594, now seen corresponding path program 1 times [2018-01-24 16:02:53,097 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:02:53,098 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:53,098 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 16:02:53,098 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:53,098 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:02:53,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:53,112 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:02:53,264 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-24 16:02:53,264 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:02:53,264 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-24 16:02:53,264 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:02:53,264 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 16:02:53,264 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 16:02:53,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-01-24 16:02:53,265 INFO L87 Difference]: Start difference. First operand 161 states and 169 transitions. Second operand 13 states. [2018-01-24 16:02:53,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:02:53,388 INFO L93 Difference]: Finished difference Result 219 states and 229 transitions. [2018-01-24 16:02:53,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 16:02:53,389 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 98 [2018-01-24 16:02:53,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:02:53,389 INFO L225 Difference]: With dead ends: 219 [2018-01-24 16:02:53,389 INFO L226 Difference]: Without dead ends: 159 [2018-01-24 16:02:53,390 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 16:02:53,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-01-24 16:02:53,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-01-24 16:02:53,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-01-24 16:02:53,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 165 transitions. [2018-01-24 16:02:53,406 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 165 transitions. Word has length 98 [2018-01-24 16:02:53,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:02:53,407 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 165 transitions. [2018-01-24 16:02:53,407 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 16:02:53,407 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 165 transitions. [2018-01-24 16:02:53,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-01-24 16:02:53,408 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:02:53,408 INFO L322 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:02:53,408 INFO L371 AbstractCegarLoop]: === Iteration 24 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 16:02:53,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1069596524, now seen corresponding path program 1 times [2018-01-24 16:02:53,409 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:02:53,410 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:53,410 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:02:53,410 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:53,410 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:02:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:53,432 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:02:53,844 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-24 16:02:53,845 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:02:53,845 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-01-24 16:02:53,845 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:02:53,845 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-24 16:02:53,845 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-24 16:02:53,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-01-24 16:02:53,846 INFO L87 Difference]: Start difference. First operand 159 states and 165 transitions. Second operand 25 states. [2018-01-24 16:02:54,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:02:54,383 INFO L93 Difference]: Finished difference Result 171 states and 181 transitions. [2018-01-24 16:02:54,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-24 16:02:54,384 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 105 [2018-01-24 16:02:54,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:02:54,385 INFO L225 Difference]: With dead ends: 171 [2018-01-24 16:02:54,385 INFO L226 Difference]: Without dead ends: 169 [2018-01-24 16:02:54,385 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=1169, Unknown=0, NotChecked=0, Total=1260 [2018-01-24 16:02:54,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-01-24 16:02:54,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2018-01-24 16:02:54,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-01-24 16:02:54,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 175 transitions. [2018-01-24 16:02:54,408 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 175 transitions. Word has length 105 [2018-01-24 16:02:54,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:02:54,408 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 175 transitions. [2018-01-24 16:02:54,408 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-24 16:02:54,408 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 175 transitions. [2018-01-24 16:02:54,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-01-24 16:02:54,409 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:02:54,409 INFO L322 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:02:54,409 INFO L371 AbstractCegarLoop]: === Iteration 25 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 16:02:54,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1069596523, now seen corresponding path program 1 times [2018-01-24 16:02:54,409 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:02:54,410 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:54,410 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:02:54,410 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:54,410 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:02:54,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:54,432 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:02:54,515 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 16:02:54,515 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:02:54,516 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:02:54,516 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 106 with the following transitions: [2018-01-24 16:02:54,516 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [12], [13], [17], [19], [20], [21], [24], [31], [36], [38], [39], [40], [43], [44], [47], [48], [49], [52], [54], [59], [63], [66], [67], [68], [71], [72], [73], [77], [79], [80], [81], [83], [86], [91], [92], [95], [96], [99], [100], [101], [104], [107], [122], [123], [126], [129], [130], [133], [136], [137], [138], [140], [141], [142], [143], [147], [150], [155], [156], [157], [159], [160], [164], [165], [166], [167], [168], [169], [170], [172], [173], [174], [176], [177], [178], [180], [181], [182], [183], [184], [188], [189], [190], [191], [192], [193], [194], [196], [198], [200], [202], [203], [204], [205], [206], [207], [208] [2018-01-24 16:02:54,519 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:02:54,519 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-24 16:02:56,438 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-24 16:02:56,438 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-24 16:02:56,438 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 16:02:56,438 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:02:56,438 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:02:56,444 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:02:56,444 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:02:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:56,496 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:02:56,501 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 16:02:56,501 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 16:02:56,504 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 16:02:56,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 04:02:56 BoogieIcfgContainer [2018-01-24 16:02:56,505 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 16:02:56,506 INFO L168 Benchmark]: Toolchain (without parser) took 43460.26 ms. Allocated memory was 300.9 MB in the beginning and 1.3 GB in the end (delta: 1.0 GB). Free memory was 260.0 MB in the beginning and 1.0 GB in the end (delta: -755.6 MB). Peak memory consumption was 264.6 MB. Max. memory is 5.3 GB. [2018-01-24 16:02:56,506 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 300.9 MB. Free memory is still 267.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:02:56,507 INFO L168 Benchmark]: CACSL2BoogieTranslator took 250.41 ms. Allocated memory is still 300.9 MB. Free memory was 260.0 MB in the beginning and 245.7 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 5.3 GB. [2018-01-24 16:02:56,507 INFO L168 Benchmark]: Boogie Preprocessor took 47.49 ms. Allocated memory is still 300.9 MB. Free memory was 245.7 MB in the beginning and 243.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:02:56,507 INFO L168 Benchmark]: RCFGBuilder took 546.36 ms. Allocated memory is still 300.9 MB. Free memory was 243.7 MB in the beginning and 207.9 MB in the end (delta: 35.8 MB). Peak memory consumption was 35.8 MB. Max. memory is 5.3 GB. [2018-01-24 16:02:56,508 INFO L168 Benchmark]: TraceAbstraction took 42606.24 ms. Allocated memory was 300.9 MB in the beginning and 1.3 GB in the end (delta: 1.0 GB). Free memory was 207.9 MB in the beginning and 1.0 GB in the end (delta: -807.7 MB). Peak memory consumption was 212.5 MB. Max. memory is 5.3 GB. [2018-01-24 16:02:56,509 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.18 ms. Allocated memory is still 300.9 MB. Free memory is still 267.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 250.41 ms. Allocated memory is still 300.9 MB. Free memory was 260.0 MB in the beginning and 245.7 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 47.49 ms. Allocated memory is still 300.9 MB. Free memory was 245.7 MB in the beginning and 243.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 546.36 ms. Allocated memory is still 300.9 MB. Free memory was 243.7 MB in the beginning and 207.9 MB in the end (delta: 35.8 MB). Peak memory consumption was 35.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 42606.24 ms. Allocated memory was 300.9 MB in the beginning and 1.3 GB in the end (delta: 1.0 GB). Free memory was 207.9 MB in the beginning and 1.0 GB in the end (delta: -807.7 MB). Peak memory consumption was 212.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 34 LocStat_MAX_WEQGRAPH_SIZE : 3 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 256 LocStat_NO_SUPPORTING_DISEQUALITIES : 25 LocStat_NO_DISJUNCTIONS : -68 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 53 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 108 TransStat_NO_SUPPORTING_DISEQUALITIES : 9 TransStat_NO_DISJUNCTIONS : 57 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.478364 RENAME_VARIABLES(MILLISECONDS) : 0.109808 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.195115 PROJECTAWAY(MILLISECONDS) : 0.069399 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.114187 DISJOIN(MILLISECONDS) : 0.677678 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.138349 ADD_EQUALITY(MILLISECONDS) : 0.020437 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.006611 #CONJOIN_DISJUNCTIVE : 86 #RENAME_VARIABLES : 145 #UNFREEZE : 0 #CONJOIN : 178 #PROJECTAWAY : 142 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 141 #ADD_EQUALITY : 111 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 39 LocStat_MAX_WEQGRAPH_SIZE : 6 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 296 LocStat_NO_SUPPORTING_DISEQUALITIES : 30 LocStat_NO_DISJUNCTIONS : -78 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 60 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 120 TransStat_NO_SUPPORTING_DISEQUALITIES : 9 TransStat_NO_DISJUNCTIONS : 64 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.322989 RENAME_VARIABLES(MILLISECONDS) : 0.100046 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.108264 PROJECTAWAY(MILLISECONDS) : 0.026020 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.039902 DISJOIN(MILLISECONDS) : 0.578225 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.124355 ADD_EQUALITY(MILLISECONDS) : 0.015558 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.006900 #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.451392 RENAME_VARIABLES(MILLISECONDS) : 0.091875 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.196093 PROJECTAWAY(MILLISECONDS) : 0.050495 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.059282 DISJOIN(MILLISECONDS) : 0.741241 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.116565 ADD_EQUALITY(MILLISECONDS) : 0.016577 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.003599 #CONJOIN_DISJUNCTIVE : 138 #RENAME_VARIABLES : 223 #UNFREEZE : 0 #CONJOIN : 294 #PROJECTAWAY : 230 #ADD_WEAK_EQUALITY : 27 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 218 #ADD_EQUALITY : 190 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 10 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 86 LocStat_MAX_WEQGRAPH_SIZE : 6 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 716 LocStat_NO_SUPPORTING_DISEQUALITIES : 77 LocStat_NO_DISJUNCTIONS : -172 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 125 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 255 TransStat_NO_SUPPORTING_DISEQUALITIES : 13 TransStat_NO_DISJUNCTIONS : 131 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.265360 RENAME_VARIABLES(MILLISECONDS) : 0.094216 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.097058 PROJECTAWAY(MILLISECONDS) : 0.024817 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.033955 DISJOIN(MILLISECONDS) : 0.419555 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.116717 ADD_EQUALITY(MILLISECONDS) : 0.015134 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.003498 #CONJOIN_DISJUNCTIVE : 189 #RENAME_VARIABLES : 298 #UNFREEZE : 0 #CONJOIN : 411 #PROJECTAWAY : 314 #ADD_WEAK_EQUALITY : 33 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 292 #ADD_EQUALITY : 276 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 12 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1294). Cancelled while BasicCegarLoop was analyzing trace of length 106 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 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 106 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 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 106 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 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 106 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 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 106 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 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 106 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 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 106 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 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 106 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 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 106 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 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 106 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 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 106 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 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 106 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was analyzing trace of length 106 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was analyzing trace of length 106 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was analyzing trace of length 106 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was analyzing trace of length 106 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 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 106 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 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 106 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 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 106 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 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 106 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 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 106 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 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 106 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 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 106 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 23 procedures, 151 locations, 23 error locations. TIMEOUT Result, 42.5s OverallTime, 25 OverallIterations, 5 TraceHistogramMax, 13.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3383 SDtfs, 1015 SDslu, 23502 SDs, 0 SdLazy, 7920 SolverSat, 238 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 9.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1676 GetRequests, 1256 SyntacticMatches, 18 SemanticMatches, 402 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2247 ImplicationChecksByTransitivity, 12.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=174occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 13.9s AbstIntTime, 5 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 24 MinimizatonAttempts, 144 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 13.2s InterpolantComputationTime, 1967 NumberOfCodeBlocks, 1953 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2610 ConstructedInterpolants, 181 QuantifiedInterpolants, 654448 SizeOfPredicates, 68 NumberOfNonLiveVariables, 3252 ConjunctsInSsa, 273 ConjunctsInUnsatCore, 48 InterpolantComputations, 24 PerfectInterpolantSequences, 145/279 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_16-02-56-521.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_16-02-56-521.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_16-02-56-521.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_16-02-56-521.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_16-02-56-521.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-24_16-02-56-521.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-24_16-02-56-521.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-24_16-02-56-521.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-24_16-02-56-521.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_16-02-56-521.csv Completed graceful shutdown