java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_1_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 06:05:54,987 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 06:05:54,989 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 06:05:55,002 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 06:05:55,003 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 06:05:55,003 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 06:05:55,004 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 06:05:55,005 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 06:05:55,007 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 06:05:55,007 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 06:05:55,008 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 06:05:55,008 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 06:05:55,009 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 06:05:55,009 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 06:05:55,010 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 06:05:55,012 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 06:05:55,014 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 06:05:55,016 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 06:05:55,017 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 06:05:55,019 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 06:05:55,021 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 06:05:55,021 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 06:05:55,021 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 06:05:55,022 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 06:05:55,023 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 06:05:55,024 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 06:05:55,024 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 06:05:55,025 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 06:05:55,025 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 06:05:55,025 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 06:05:55,026 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 06:05:55,026 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf [2018-01-25 06:05:55,035 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 06:05:55,036 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 06:05:55,037 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 06:05:55,037 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 06:05:55,037 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 06:05:55,037 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 06:05:55,037 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 06:05:55,037 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 06:05:55,038 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 06:05:55,038 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 06:05:55,038 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 06:05:55,039 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 06:05:55,039 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 06:05:55,039 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 06:05:55,039 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 06:05:55,039 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 06:05:55,039 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 06:05:55,040 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 06:05:55,040 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 06:05:55,040 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 06:05:55,040 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 06:05:55,040 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 06:05:55,040 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 06:05:55,041 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 06:05:55,041 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 06:05:55,041 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 06:05:55,041 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 06:05:55,041 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 06:05:55,042 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 06:05:55,042 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 06:05:55,042 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 06:05:55,042 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 06:05:55,042 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 06:05:55,042 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 06:05:55,043 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 06:05:55,043 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 06:05:55,077 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 06:05:55,089 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 06:05:55,093 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 06:05:55,094 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 06:05:55,094 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 06:05:55,095 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_1_false-valid-memtrack_true-termination.i [2018-01-25 06:05:55,278 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 06:05:55,285 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 06:05:55,286 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 06:05:55,286 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 06:05:55,293 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 06:05:55,294 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:05:55" (1/1) ... [2018-01-25 06:05:55,297 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d434187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:05:55, skipping insertion in model container [2018-01-25 06:05:55,298 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:05:55" (1/1) ... [2018-01-25 06:05:55,316 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:05:55,367 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:05:55,491 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:05:55,517 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:05:55,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:05:55 WrapperNode [2018-01-25 06:05:55,529 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 06:05:55,530 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 06:05:55,530 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 06:05:55,530 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 06:05:55,542 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:05:55" (1/1) ... [2018-01-25 06:05:55,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:05:55" (1/1) ... [2018-01-25 06:05:55,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:05:55" (1/1) ... [2018-01-25 06:05:55,553 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:05:55" (1/1) ... [2018-01-25 06:05:55,558 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:05:55" (1/1) ... [2018-01-25 06:05:55,561 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:05:55" (1/1) ... [2018-01-25 06:05:55,562 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:05:55" (1/1) ... [2018-01-25 06:05:55,565 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 06:05:55,566 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 06:05:55,566 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 06:05:55,566 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 06:05:55,567 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:05:55" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 06:05:55,610 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 06:05:55,610 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 06:05:55,610 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-01-25 06:05:55,610 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-25 06:05:55,610 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-01-25 06:05:55,611 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2018-01-25 06:05:55,611 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-01-25 06:05:55,611 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-01-25 06:05:55,611 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-01-25 06:05:55,611 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2018-01-25 06:05:55,611 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-01-25 06:05:55,612 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-01-25 06:05:55,612 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-01-25 06:05:55,612 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-01-25 06:05:55,612 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2018-01-25 06:05:55,612 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-01-25 06:05:55,612 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-01-25 06:05:55,612 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-01-25 06:05:55,613 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-25 06:05:55,613 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 06:05:55,613 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 06:05:55,613 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 06:05:55,613 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 06:05:55,614 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 06:05:55,614 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 06:05:55,614 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 06:05:55,614 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 06:05:55,614 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-25 06:05:55,614 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-25 06:05:55,615 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 06:05:55,615 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 06:05:55,615 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 06:05:55,615 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-25 06:05:55,615 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-25 06:05:55,615 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-01-25 06:05:55,615 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2018-01-25 06:05:55,616 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-01-25 06:05:55,616 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-01-25 06:05:55,616 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-01-25 06:05:55,616 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-01-25 06:05:55,616 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2018-01-25 06:05:55,616 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-01-25 06:05:55,616 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-01-25 06:05:55,617 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-01-25 06:05:55,617 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-01-25 06:05:55,617 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2018-01-25 06:05:55,617 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-01-25 06:05:55,617 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-01-25 06:05:55,617 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-01-25 06:05:55,617 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-25 06:05:55,617 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 06:05:55,617 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 06:05:55,618 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 06:05:55,838 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-25 06:05:56,016 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 06:05:56,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:05:56 BoogieIcfgContainer [2018-01-25 06:05:56,017 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 06:05:56,017 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 06:05:56,017 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 06:05:56,019 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 06:05:56,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 06:05:55" (1/3) ... [2018-01-25 06:05:56,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26eeaef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:05:56, skipping insertion in model container [2018-01-25 06:05:56,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:05:55" (2/3) ... [2018-01-25 06:05:56,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26eeaef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:05:56, skipping insertion in model container [2018-01-25 06:05:56,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:05:56" (3/3) ... [2018-01-25 06:05:56,022 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test22_1_false-valid-memtrack_true-termination.i [2018-01-25 06:05:56,029 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 06:05:56,037 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-01-25 06:05:56,079 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 06:05:56,079 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 06:05:56,079 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 06:05:56,079 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 06:05:56,079 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 06:05:56,080 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 06:05:56,080 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 06:05:56,080 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 06:05:56,081 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 06:05:56,099 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states. [2018-01-25 06:05:56,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 06:05:56,104 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:05:56,105 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:05:56,105 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-25 06:05:56,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1956546830, now seen corresponding path program 1 times [2018-01-25 06:05:56,110 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:05:56,156 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:05:56,157 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:05:56,157 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:05:56,157 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:05:56,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:05:56,212 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:05:56,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:05:56,429 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:05:56,429 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:05:56,429 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:05:56,433 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:05:56,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:05:56,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:05:56,445 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 5 states. [2018-01-25 06:05:56,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:05:56,529 INFO L93 Difference]: Finished difference Result 272 states and 287 transitions. [2018-01-25 06:05:56,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:05:56,531 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-25 06:05:56,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:05:56,544 INFO L225 Difference]: With dead ends: 272 [2018-01-25 06:05:56,544 INFO L226 Difference]: Without dead ends: 145 [2018-01-25 06:05:56,548 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:05:56,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-01-25 06:05:56,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2018-01-25 06:05:56,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-25 06:05:56,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 151 transitions. [2018-01-25 06:05:56,585 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 151 transitions. Word has length 17 [2018-01-25 06:05:56,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:05:56,585 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 151 transitions. [2018-01-25 06:05:56,585 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:05:56,585 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 151 transitions. [2018-01-25 06:05:56,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 06:05:56,586 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:05:56,586 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:05:56,586 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-25 06:05:56,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1123892084, now seen corresponding path program 1 times [2018-01-25 06:05:56,587 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:05:56,588 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:05:56,588 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:05:56,588 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:05:56,589 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:05:56,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:05:56,603 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:05:56,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:05:56,659 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:05:56,660 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:05:56,660 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:05:56,661 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:05:56,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:05:56,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:05:56,662 INFO L87 Difference]: Start difference. First operand 143 states and 151 transitions. Second operand 6 states. [2018-01-25 06:05:56,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:05:56,833 INFO L93 Difference]: Finished difference Result 145 states and 153 transitions. [2018-01-25 06:05:56,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:05:56,833 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-25 06:05:56,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:05:56,835 INFO L225 Difference]: With dead ends: 145 [2018-01-25 06:05:56,835 INFO L226 Difference]: Without dead ends: 144 [2018-01-25 06:05:56,836 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:05:56,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-01-25 06:05:56,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2018-01-25 06:05:56,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-01-25 06:05:56,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 150 transitions. [2018-01-25 06:05:56,847 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 150 transitions. Word has length 19 [2018-01-25 06:05:56,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:05:56,847 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 150 transitions. [2018-01-25 06:05:56,847 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:05:56,847 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 150 transitions. [2018-01-25 06:05:56,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 06:05:56,848 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:05:56,848 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:05:56,848 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-25 06:05:56,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1123892085, now seen corresponding path program 1 times [2018-01-25 06:05:56,848 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:05:56,849 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:05:56,849 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:05:56,849 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:05:56,850 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:05:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:05:56,873 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:05:57,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:05:57,174 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:05:57,174 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 06:05:57,174 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:05:57,174 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 06:05:57,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 06:05:57,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:05:57,175 INFO L87 Difference]: Start difference. First operand 142 states and 150 transitions. Second operand 7 states. [2018-01-25 06:05:57,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:05:57,421 INFO L93 Difference]: Finished difference Result 144 states and 152 transitions. [2018-01-25 06:05:57,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 06:05:57,422 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-01-25 06:05:57,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:05:57,424 INFO L225 Difference]: With dead ends: 144 [2018-01-25 06:05:57,424 INFO L226 Difference]: Without dead ends: 143 [2018-01-25 06:05:57,424 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-25 06:05:57,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-25 06:05:57,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2018-01-25 06:05:57,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-01-25 06:05:57,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 149 transitions. [2018-01-25 06:05:57,439 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 149 transitions. Word has length 19 [2018-01-25 06:05:57,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:05:57,439 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 149 transitions. [2018-01-25 06:05:57,439 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 06:05:57,440 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 149 transitions. [2018-01-25 06:05:57,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 06:05:57,441 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:05:57,441 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:05:57,441 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-25 06:05:57,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1414777661, now seen corresponding path program 1 times [2018-01-25 06:05:57,441 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:05:57,443 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:05:57,443 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:05:57,443 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:05:57,443 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:05:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:05:57,461 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:05:57,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:05:57,553 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:05:57,554 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 06:05:57,554 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:05:57,554 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 06:05:57,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 06:05:57,555 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:05:57,555 INFO L87 Difference]: Start difference. First operand 141 states and 149 transitions. Second operand 7 states. [2018-01-25 06:05:57,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:05:57,629 INFO L93 Difference]: Finished difference Result 235 states and 247 transitions. [2018-01-25 06:05:57,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 06:05:57,630 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-01-25 06:05:57,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:05:57,633 INFO L225 Difference]: With dead ends: 235 [2018-01-25 06:05:57,633 INFO L226 Difference]: Without dead ends: 157 [2018-01-25 06:05:57,634 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 06:05:57,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-01-25 06:05:57,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 150. [2018-01-25 06:05:57,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-25 06:05:57,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 158 transitions. [2018-01-25 06:05:57,655 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 158 transitions. Word has length 27 [2018-01-25 06:05:57,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:05:57,655 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 158 transitions. [2018-01-25 06:05:57,656 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 06:05:57,656 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 158 transitions. [2018-01-25 06:05:57,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 06:05:57,657 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:05:57,658 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:05:57,658 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-25 06:05:57,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1439517623, now seen corresponding path program 1 times [2018-01-25 06:05:57,658 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:05:57,660 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:05:57,660 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:05:57,660 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:05:57,660 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:05:57,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:05:57,682 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:05:57,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:05:57,788 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:05:57,788 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 06:05:57,788 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:05:57,789 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 06:05:57,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 06:05:57,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:05:57,789 INFO L87 Difference]: Start difference. First operand 150 states and 158 transitions. Second operand 10 states. [2018-01-25 06:05:58,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:05:58,007 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2018-01-25 06:05:58,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 06:05:58,008 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-01-25 06:05:58,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:05:58,009 INFO L225 Difference]: With dead ends: 150 [2018-01-25 06:05:58,009 INFO L226 Difference]: Without dead ends: 149 [2018-01-25 06:05:58,010 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-01-25 06:05:58,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-01-25 06:05:58,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-01-25 06:05:58,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-01-25 06:05:58,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 157 transitions. [2018-01-25 06:05:58,018 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 157 transitions. Word has length 34 [2018-01-25 06:05:58,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:05:58,019 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 157 transitions. [2018-01-25 06:05:58,019 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 06:05:58,019 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 157 transitions. [2018-01-25 06:05:58,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 06:05:58,020 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:05:58,020 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:05:58,020 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-25 06:05:58,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1439517624, now seen corresponding path program 1 times [2018-01-25 06:05:58,020 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:05:58,021 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:05:58,021 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:05:58,021 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:05:58,022 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:05:58,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:05:58,037 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:05:58,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:05:58,085 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:05:58,085 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 06:05:58,085 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:05:58,085 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:05:58,086 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:05:58,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:05:58,086 INFO L87 Difference]: Start difference. First operand 149 states and 157 transitions. Second operand 4 states. [2018-01-25 06:05:58,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:05:58,116 INFO L93 Difference]: Finished difference Result 264 states and 278 transitions. [2018-01-25 06:05:58,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 06:05:58,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-01-25 06:05:58,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:05:58,118 INFO L225 Difference]: With dead ends: 264 [2018-01-25 06:05:58,118 INFO L226 Difference]: Without dead ends: 150 [2018-01-25 06:05:58,119 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:05:58,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-01-25 06:05:58,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-01-25 06:05:58,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-25 06:05:58,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 158 transitions. [2018-01-25 06:05:58,130 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 158 transitions. Word has length 34 [2018-01-25 06:05:58,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:05:58,130 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 158 transitions. [2018-01-25 06:05:58,130 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:05:58,130 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 158 transitions. [2018-01-25 06:05:58,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-25 06:05:58,132 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:05:58,132 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:05:58,132 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-25 06:05:58,132 INFO L82 PathProgramCache]: Analyzing trace with hash -204456797, now seen corresponding path program 1 times [2018-01-25 06:05:58,132 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:05:58,133 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:05:58,134 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:05:58,134 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:05:58,134 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:05:58,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:05:58,150 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:05:58,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:05:58,188 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:05:58,188 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:05:58,189 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-01-25 06:05:58,190 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [31], [36], [52], [59], [63], [67], [70], [72], [73], [77], [79], [80], [130], [133], [134], [135], [137], [138], [139], [157], [158], [159], [160], [161], [163], [169], [173], [179], [193], [194], [195] [2018-01-25 06:05:58,241 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:05:58,241 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:06:01,452 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 06:06:01,454 INFO L268 AbstractInterpreter]: Visited 35 different actions 43 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 21 variables. [2018-01-25 06:06:01,484 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 06:06:01,484 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:01,484 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 06:06:01,492 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:01,492 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:06:01,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:01,539 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:06:01,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:01,586 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:06:01,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:01,683 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:01,684 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 06:06:01,687 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:01,688 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:06:01,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:01,736 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:06:01,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:01,742 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:06:01,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:01,777 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 06:06:01,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5] total 9 [2018-01-25 06:06:01,777 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 06:06:01,778 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:06:01,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:06:01,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-01-25 06:06:01,778 INFO L87 Difference]: Start difference. First operand 150 states and 158 transitions. Second operand 6 states. [2018-01-25 06:06:01,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:01,806 INFO L93 Difference]: Finished difference Result 265 states and 279 transitions. [2018-01-25 06:06:01,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:06:01,807 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-25 06:06:01,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:01,809 INFO L225 Difference]: With dead ends: 265 [2018-01-25 06:06:01,809 INFO L226 Difference]: Without dead ends: 151 [2018-01-25 06:06:01,810 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 134 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:06:01,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-01-25 06:06:01,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-01-25 06:06:01,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-01-25 06:06:01,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 159 transitions. [2018-01-25 06:06:01,821 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 159 transitions. Word has length 35 [2018-01-25 06:06:01,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:01,821 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 159 transitions. [2018-01-25 06:06:01,821 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:06:01,821 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 159 transitions. [2018-01-25 06:06:01,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-25 06:06:01,823 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:01,823 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:06:01,823 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-25 06:06:01,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1829139958, now seen corresponding path program 1 times [2018-01-25 06:06:01,824 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:01,825 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:01,825 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:01,825 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:01,825 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:01,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:01,843 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:06:01,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:01,938 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:06:01,938 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 06:06:01,938 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:06:01,938 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 06:06:01,938 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 06:06:01,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:06:01,939 INFO L87 Difference]: Start difference. First operand 151 states and 159 transitions. Second operand 7 states. [2018-01-25 06:06:01,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:01,996 INFO L93 Difference]: Finished difference Result 215 states and 225 transitions. [2018-01-25 06:06:01,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 06:06:01,997 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-01-25 06:06:01,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:01,998 INFO L225 Difference]: With dead ends: 215 [2018-01-25 06:06:01,998 INFO L226 Difference]: Without dead ends: 161 [2018-01-25 06:06:01,999 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 06:06:01,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-01-25 06:06:02,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 157. [2018-01-25 06:06:02,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-01-25 06:06:02,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 165 transitions. [2018-01-25 06:06:02,011 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 165 transitions. Word has length 36 [2018-01-25 06:06:02,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:02,012 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 165 transitions. [2018-01-25 06:06:02,012 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 06:06:02,012 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 165 transitions. [2018-01-25 06:06:02,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-25 06:06:02,013 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:02,014 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:06:02,014 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-25 06:06:02,014 INFO L82 PathProgramCache]: Analyzing trace with hash 371943704, now seen corresponding path program 2 times [2018-01-25 06:06:02,014 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:02,015 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:02,015 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:02,016 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:02,016 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:02,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:02,032 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:06:02,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:02,080 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:02,080 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:06:02,081 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 06:06:02,081 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 06:06:02,081 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:02,081 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 06:06:02,091 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 06:06:02,091 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 06:06:02,115 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:06:02,119 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:06:02,124 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:06:02,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-25 06:06:02,148 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:06:02,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-25 06:06:02,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:06:02,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-25 06:06:02,173 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-25 06:06:02,728 WARN L146 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 45 DAG size of output 17 [2018-01-25 06:06:02,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-25 06:06:02,963 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:06:03,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-25 06:06:03,368 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 06:06:03,368 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14, 13] imperfect sequences [6] total 31 [2018-01-25 06:06:03,368 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:06:03,368 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-25 06:06:03,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-25 06:06:03,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=840, Unknown=0, NotChecked=0, Total=930 [2018-01-25 06:06:03,369 INFO L87 Difference]: Start difference. First operand 157 states and 165 transitions. Second operand 15 states. [2018-01-25 06:06:04,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:04,365 INFO L93 Difference]: Finished difference Result 176 states and 183 transitions. [2018-01-25 06:06:04,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-25 06:06:04,365 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2018-01-25 06:06:04,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:04,366 INFO L225 Difference]: With dead ends: 176 [2018-01-25 06:06:04,367 INFO L226 Difference]: Without dead ends: 175 [2018-01-25 06:06:04,367 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=118, Invalid=1072, Unknown=0, NotChecked=0, Total=1190 [2018-01-25 06:06:04,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-01-25 06:06:04,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 156. [2018-01-25 06:06:04,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-01-25 06:06:04,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 164 transitions. [2018-01-25 06:06:04,381 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 164 transitions. Word has length 36 [2018-01-25 06:06:04,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:04,381 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 164 transitions. [2018-01-25 06:06:04,381 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-25 06:06:04,381 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 164 transitions. [2018-01-25 06:06:04,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 06:06:04,382 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:04,383 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:06:04,383 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-25 06:06:04,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1983848104, now seen corresponding path program 1 times [2018-01-25 06:06:04,383 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:04,384 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:04,384 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 06:06:04,385 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:04,385 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:04,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:04,392 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:06:04,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:04,432 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:06:04,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 06:06:04,432 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:06:04,432 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 06:06:04,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 06:06:04,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 06:06:04,433 INFO L87 Difference]: Start difference. First operand 156 states and 164 transitions. Second operand 3 states. [2018-01-25 06:06:04,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:04,623 INFO L93 Difference]: Finished difference Result 174 states and 183 transitions. [2018-01-25 06:06:04,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 06:06:04,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-01-25 06:06:04,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:04,625 INFO L225 Difference]: With dead ends: 174 [2018-01-25 06:06:04,625 INFO L226 Difference]: Without dead ends: 160 [2018-01-25 06:06:04,626 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 06:06:04,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-01-25 06:06:04,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 152. [2018-01-25 06:06:04,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-01-25 06:06:04,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 159 transitions. [2018-01-25 06:06:04,642 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 159 transitions. Word has length 34 [2018-01-25 06:06:04,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:04,642 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 159 transitions. [2018-01-25 06:06:04,642 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 06:06:04,642 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 159 transitions. [2018-01-25 06:06:04,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-25 06:06:04,643 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:04,643 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:06:04,643 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-25 06:06:04,643 INFO L82 PathProgramCache]: Analyzing trace with hash 515535126, now seen corresponding path program 1 times [2018-01-25 06:06:04,643 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:04,644 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:04,644 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:04,644 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:04,644 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:04,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:04,651 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:06:04,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:04,736 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:06:04,736 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 06:06:04,736 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:06:04,737 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:06:04,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:06:04,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:06:04,737 INFO L87 Difference]: Start difference. First operand 152 states and 159 transitions. Second operand 6 states. [2018-01-25 06:06:04,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:04,780 INFO L93 Difference]: Finished difference Result 156 states and 162 transitions. [2018-01-25 06:06:04,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:06:04,781 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-01-25 06:06:04,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:04,781 INFO L225 Difference]: With dead ends: 156 [2018-01-25 06:06:04,782 INFO L226 Difference]: Without dead ends: 137 [2018-01-25 06:06:04,782 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:06:04,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-25 06:06:04,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-01-25 06:06:04,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-01-25 06:06:04,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 143 transitions. [2018-01-25 06:06:04,792 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 143 transitions. Word has length 36 [2018-01-25 06:06:04,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:04,792 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 143 transitions. [2018-01-25 06:06:04,792 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:06:04,792 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 143 transitions. [2018-01-25 06:06:04,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-25 06:06:04,793 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:04,793 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:06:04,793 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-25 06:06:04,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1666573044, now seen corresponding path program 1 times [2018-01-25 06:06:04,794 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:04,795 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:04,795 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:04,795 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:04,795 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:04,808 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:06:04,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-25 06:06:04,997 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:06:04,997 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 06:06:04,997 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:06:04,998 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 06:06:04,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 06:06:04,998 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:06:04,998 INFO L87 Difference]: Start difference. First operand 137 states and 143 transitions. Second operand 10 states. [2018-01-25 06:06:05,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:05,215 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2018-01-25 06:06:05,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 06:06:05,215 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2018-01-25 06:06:05,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:05,216 INFO L225 Difference]: With dead ends: 137 [2018-01-25 06:06:05,216 INFO L226 Difference]: Without dead ends: 135 [2018-01-25 06:06:05,216 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-25 06:06:05,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-25 06:06:05,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-01-25 06:06:05,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-25 06:06:05,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 141 transitions. [2018-01-25 06:06:05,230 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 141 transitions. Word has length 41 [2018-01-25 06:06:05,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:05,231 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 141 transitions. [2018-01-25 06:06:05,231 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 06:06:05,231 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 141 transitions. [2018-01-25 06:06:05,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-25 06:06:05,232 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:05,232 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:06:05,232 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-25 06:06:05,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1666573045, now seen corresponding path program 1 times [2018-01-25 06:06:05,232 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:05,234 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:05,234 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:05,234 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:05,234 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:05,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:05,249 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:06:05,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:05,291 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:05,291 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:06:05,292 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-01-25 06:06:05,292 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [31], [36], [52], [59], [63], [67], [68], [71], [72], [73], [77], [79], [80], [122], [125], [130], [133], [134], [135], [137], [138], [139], [157], [158], [159], [160], [161], [163], [169], [173], [179], [180], [181], [193], [194], [195] [2018-01-25 06:06:05,294 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:06:05,294 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:06:08,494 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 06:06:08,494 INFO L268 AbstractInterpreter]: Visited 40 different actions 48 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 21 variables. [2018-01-25 06:06:08,496 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 06:06:08,496 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:08,496 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 06:06:08,502 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:08,502 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:06:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:08,529 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:06:08,539 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:08,539 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:06:08,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:08,639 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:08,640 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 06:06:08,645 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:08,645 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:06:08,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:08,688 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:06:08,691 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:08,691 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:06:08,715 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:08,717 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 06:06:08,717 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6] total 11 [2018-01-25 06:06:08,717 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 06:06:08,718 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 06:06:08,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 06:06:08,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-01-25 06:06:08,718 INFO L87 Difference]: Start difference. First operand 135 states and 141 transitions. Second operand 7 states. [2018-01-25 06:06:08,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:08,744 INFO L93 Difference]: Finished difference Result 247 states and 259 transitions. [2018-01-25 06:06:08,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:06:08,744 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-01-25 06:06:08,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:08,745 INFO L225 Difference]: With dead ends: 247 [2018-01-25 06:06:08,745 INFO L226 Difference]: Without dead ends: 136 [2018-01-25 06:06:08,745 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2018-01-25 06:06:08,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-01-25 06:06:08,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-01-25 06:06:08,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-01-25 06:06:08,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 142 transitions. [2018-01-25 06:06:08,756 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 142 transitions. Word has length 41 [2018-01-25 06:06:08,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:08,756 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 142 transitions. [2018-01-25 06:06:08,756 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 06:06:08,756 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 142 transitions. [2018-01-25 06:06:08,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-25 06:06:08,757 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:08,757 INFO L322 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:06:08,757 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-25 06:06:08,757 INFO L82 PathProgramCache]: Analyzing trace with hash -723967062, now seen corresponding path program 2 times [2018-01-25 06:06:08,758 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:08,758 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:08,758 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:08,759 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:08,759 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:08,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:08,772 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:06:08,835 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:08,835 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:08,835 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:06:08,835 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 06:06:08,835 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 06:06:08,836 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:08,836 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 06:06:08,845 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 06:06:08,845 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 06:06:08,870 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:06:08,874 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:06:08,879 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:06:08,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-25 06:06:08,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:06:08,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-25 06:06:08,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:06:08,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-25 06:06:08,925 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-25 06:06:09,516 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-25 06:06:09,516 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:06:09,906 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-25 06:06:09,925 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 06:06:09,925 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15, 13] imperfect sequences [7] total 33 [2018-01-25 06:06:09,925 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:06:09,925 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-25 06:06:09,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-25 06:06:09,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=951, Unknown=0, NotChecked=0, Total=1056 [2018-01-25 06:06:09,926 INFO L87 Difference]: Start difference. First operand 136 states and 142 transitions. Second operand 16 states. [2018-01-25 06:06:10,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:10,693 INFO L93 Difference]: Finished difference Result 136 states and 142 transitions. [2018-01-25 06:06:10,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-25 06:06:10,693 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2018-01-25 06:06:10,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:10,694 INFO L225 Difference]: With dead ends: 136 [2018-01-25 06:06:10,694 INFO L226 Difference]: Without dead ends: 134 [2018-01-25 06:06:10,695 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-25 06:06:10,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-01-25 06:06:10,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-01-25 06:06:10,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-01-25 06:06:10,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 140 transitions. [2018-01-25 06:06:10,710 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 140 transitions. Word has length 42 [2018-01-25 06:06:10,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:10,710 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 140 transitions. [2018-01-25 06:06:10,710 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-25 06:06:10,711 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 140 transitions. [2018-01-25 06:06:10,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-25 06:06:10,711 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:10,711 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] [2018-01-25 06:06:10,711 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-25 06:06:10,711 INFO L82 PathProgramCache]: Analyzing trace with hash -2043211584, now seen corresponding path program 1 times [2018-01-25 06:06:10,711 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:10,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:10,712 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 06:06:10,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:10,712 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:10,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:10,724 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:06:10,789 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-25 06:06:10,789 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:06:10,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 06:06:10,789 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:06:10,789 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 06:06:10,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 06:06:10,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-25 06:06:10,790 INFO L87 Difference]: Start difference. First operand 134 states and 140 transitions. Second operand 8 states. [2018-01-25 06:06:10,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:10,835 INFO L93 Difference]: Finished difference Result 221 states and 230 transitions. [2018-01-25 06:06:10,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 06:06:10,835 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-01-25 06:06:10,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:10,837 INFO L225 Difference]: With dead ends: 221 [2018-01-25 06:06:10,837 INFO L226 Difference]: Without dead ends: 134 [2018-01-25 06:06:10,838 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:06:10,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-01-25 06:06:10,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-01-25 06:06:10,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-01-25 06:06:10,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 139 transitions. [2018-01-25 06:06:10,858 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 139 transitions. Word has length 45 [2018-01-25 06:06:10,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:10,858 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 139 transitions. [2018-01-25 06:06:10,858 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 06:06:10,858 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 139 transitions. [2018-01-25 06:06:10,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-25 06:06:10,859 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:10,859 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] [2018-01-25 06:06:10,859 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-25 06:06:10,860 INFO L82 PathProgramCache]: Analyzing trace with hash -647760318, now seen corresponding path program 1 times [2018-01-25 06:06:10,860 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:10,861 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:10,861 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:10,861 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:10,861 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:10,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:10,876 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:06:11,074 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-25 06:06:11,074 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:06:11,074 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-25 06:06:11,075 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:06:11,075 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 06:06:11,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 06:06:11,075 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:06:11,075 INFO L87 Difference]: Start difference. First operand 134 states and 139 transitions. Second operand 10 states. [2018-01-25 06:06:11,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:11,245 INFO L93 Difference]: Finished difference Result 223 states and 231 transitions. [2018-01-25 06:06:11,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 06:06:11,245 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2018-01-25 06:06:11,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:11,246 INFO L225 Difference]: With dead ends: 223 [2018-01-25 06:06:11,246 INFO L226 Difference]: Without dead ends: 134 [2018-01-25 06:06:11,247 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 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-25 06:06:11,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-01-25 06:06:11,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-01-25 06:06:11,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-01-25 06:06:11,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 138 transitions. [2018-01-25 06:06:11,265 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 138 transitions. Word has length 50 [2018-01-25 06:06:11,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:11,266 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 138 transitions. [2018-01-25 06:06:11,266 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 06:06:11,266 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 138 transitions. [2018-01-25 06:06:11,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-25 06:06:11,266 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:11,267 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] [2018-01-25 06:06:11,267 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-25 06:06:11,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1953733819, now seen corresponding path program 1 times [2018-01-25 06:06:11,267 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:11,268 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:11,268 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:11,268 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:11,268 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:11,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:11,285 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:06:11,388 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-25 06:06:11,389 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:06:11,389 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-25 06:06:11,389 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:06:11,389 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-25 06:06:11,389 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-25 06:06:11,389 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-01-25 06:06:11,390 INFO L87 Difference]: Start difference. First operand 134 states and 138 transitions. Second operand 13 states. [2018-01-25 06:06:11,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:11,607 INFO L93 Difference]: Finished difference Result 134 states and 138 transitions. [2018-01-25 06:06:11,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-25 06:06:11,607 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2018-01-25 06:06:11,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:11,608 INFO L225 Difference]: With dead ends: 134 [2018-01-25 06:06:11,608 INFO L226 Difference]: Without dead ends: 132 [2018-01-25 06:06:11,608 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-01-25 06:06:11,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-25 06:06:11,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-01-25 06:06:11,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-25 06:06:11,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 136 transitions. [2018-01-25 06:06:11,621 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 136 transitions. Word has length 61 [2018-01-25 06:06:11,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:11,621 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 136 transitions. [2018-01-25 06:06:11,621 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-25 06:06:11,621 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 136 transitions. [2018-01-25 06:06:11,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-25 06:06:11,622 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:11,622 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] [2018-01-25 06:06:11,622 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-25 06:06:11,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1953733820, now seen corresponding path program 1 times [2018-01-25 06:06:11,622 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:11,623 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:11,623 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:11,623 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:11,623 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:11,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:11,636 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:06:11,678 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:11,678 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:11,678 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:06:11,678 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 62 with the following transitions: [2018-01-25 06:06:11,678 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], [130], [133], [134], [135], [137], [138], [139], [144], [147], [157], [158], [159], [160], [161], [162], [163], [165], [169], [170], [173], [174], [175], [179], [180], [181], [182], [191], [193], [194], [195] [2018-01-25 06:06:11,680 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:06:11,680 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:06:14,509 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 06:06:14,509 INFO L268 AbstractInterpreter]: Visited 59 different actions 67 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 22 variables. [2018-01-25 06:06:14,526 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 06:06:14,526 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:14,526 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 06:06:14,536 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:14,537 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:06:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:14,572 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:06:14,589 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:14,589 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:06:14,674 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:14,694 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:14,694 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 06:06:14,698 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:14,698 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:06:14,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:14,759 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:06:14,764 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:14,764 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:06:14,812 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:14,813 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 06:06:14,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 13 [2018-01-25 06:06:14,814 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 06:06:14,814 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 06:06:14,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 06:06:14,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-01-25 06:06:14,814 INFO L87 Difference]: Start difference. First operand 132 states and 136 transitions. Second operand 8 states. [2018-01-25 06:06:14,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:14,840 INFO L93 Difference]: Finished difference Result 240 states and 248 transitions. [2018-01-25 06:06:14,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 06:06:14,841 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2018-01-25 06:06:14,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:14,842 INFO L225 Difference]: With dead ends: 240 [2018-01-25 06:06:14,842 INFO L226 Difference]: Without dead ends: 133 [2018-01-25 06:06:14,842 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 236 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=77, Invalid=105, Unknown=0, NotChecked=0, Total=182 [2018-01-25 06:06:14,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-25 06:06:14,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-01-25 06:06:14,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-25 06:06:14,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 137 transitions. [2018-01-25 06:06:14,854 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 137 transitions. Word has length 61 [2018-01-25 06:06:14,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:14,854 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 137 transitions. [2018-01-25 06:06:14,854 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 06:06:14,854 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2018-01-25 06:06:14,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-25 06:06:14,854 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:14,855 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] [2018-01-25 06:06:14,855 INFO L371 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-25 06:06:14,855 INFO L82 PathProgramCache]: Analyzing trace with hash 737964273, now seen corresponding path program 2 times [2018-01-25 06:06:14,855 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:14,856 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:14,856 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:14,857 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:14,857 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:14,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:14,872 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:06:14,992 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:14,992 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:14,992 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:06:14,992 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 06:06:14,993 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 06:06:14,993 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:14,993 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 06:06:15,000 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 06:06:15,000 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 06:06:15,035 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:06:15,039 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:06:15,043 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:06:15,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-25 06:06:15,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:06:15,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-25 06:06:15,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:06:15,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-25 06:06:15,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-25 06:06:15,709 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-25 06:06:15,710 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:06:18,545 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-25 06:06:18,565 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 06:06:18,565 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18, 16] imperfect sequences [8] total 40 [2018-01-25 06:06:18,565 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:06:18,566 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-25 06:06:18,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-25 06:06:18,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1427, Unknown=1, NotChecked=0, Total=1560 [2018-01-25 06:06:18,567 INFO L87 Difference]: Start difference. First operand 133 states and 137 transitions. Second operand 19 states. [2018-01-25 06:06:19,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:19,379 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2018-01-25 06:06:19,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-25 06:06:19,380 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 62 [2018-01-25 06:06:19,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:19,381 INFO L225 Difference]: With dead ends: 133 [2018-01-25 06:06:19,381 INFO L226 Difference]: Without dead ends: 131 [2018-01-25 06:06:19,381 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=173, Invalid=1806, Unknown=1, NotChecked=0, Total=1980 [2018-01-25 06:06:19,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-01-25 06:06:19,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-01-25 06:06:19,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-01-25 06:06:19,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 135 transitions. [2018-01-25 06:06:19,395 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 135 transitions. Word has length 62 [2018-01-25 06:06:19,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:19,395 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 135 transitions. [2018-01-25 06:06:19,395 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-25 06:06:19,395 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2018-01-25 06:06:19,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-01-25 06:06:19,396 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:19,396 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] [2018-01-25 06:06:19,396 INFO L371 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-25 06:06:19,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1810517891, now seen corresponding path program 1 times [2018-01-25 06:06:19,396 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:19,397 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:19,397 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 06:06:19,397 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:19,397 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:19,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:06:19,521 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-25 06:06:19,521 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:06:19,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-25 06:06:19,521 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:06:19,522 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-25 06:06:19,522 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-25 06:06:19,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-01-25 06:06:19,522 INFO L87 Difference]: Start difference. First operand 131 states and 135 transitions. Second operand 11 states. [2018-01-25 06:06:19,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:19,631 INFO L93 Difference]: Finished difference Result 192 states and 198 transitions. [2018-01-25 06:06:19,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 06:06:19,631 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2018-01-25 06:06:19,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:19,632 INFO L225 Difference]: With dead ends: 192 [2018-01-25 06:06:19,632 INFO L226 Difference]: Without dead ends: 131 [2018-01-25 06:06:19,633 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-01-25 06:06:19,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-01-25 06:06:19,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-01-25 06:06:19,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-01-25 06:06:19,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 134 transitions. [2018-01-25 06:06:19,644 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 134 transitions. Word has length 71 [2018-01-25 06:06:19,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:19,645 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 134 transitions. [2018-01-25 06:06:19,645 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-25 06:06:19,645 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 134 transitions. [2018-01-25 06:06:19,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-25 06:06:19,646 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:19,646 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] [2018-01-25 06:06:19,646 INFO L371 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-25 06:06:19,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1846676097, now seen corresponding path program 1 times [2018-01-25 06:06:19,646 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:19,647 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:19,647 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:19,647 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:19,647 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:19,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:19,663 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:06:20,525 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-25 06:06:20,525 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:06:20,526 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-01-25 06:06:20,526 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:06:20,526 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-25 06:06:20,526 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-25 06:06:20,526 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-01-25 06:06:20,526 INFO L87 Difference]: Start difference. First operand 131 states and 134 transitions. Second operand 18 states. [2018-01-25 06:06:21,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:21,378 INFO L93 Difference]: Finished difference Result 140 states and 143 transitions. [2018-01-25 06:06:21,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-25 06:06:21,378 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 84 [2018-01-25 06:06:21,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:21,379 INFO L225 Difference]: With dead ends: 140 [2018-01-25 06:06:21,379 INFO L226 Difference]: Without dead ends: 138 [2018-01-25 06:06:21,380 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2018-01-25 06:06:21,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-01-25 06:06:21,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 129. [2018-01-25 06:06:21,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-25 06:06:21,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 132 transitions. [2018-01-25 06:06:21,397 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 132 transitions. Word has length 84 [2018-01-25 06:06:21,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:21,398 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 132 transitions. [2018-01-25 06:06:21,398 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-25 06:06:21,398 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2018-01-25 06:06:21,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-25 06:06:21,399 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:21,399 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] [2018-01-25 06:06:21,399 INFO L371 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-25 06:06:21,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1846676096, now seen corresponding path program 1 times [2018-01-25 06:06:21,400 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:21,401 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:21,401 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:21,401 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:21,401 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:21,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:21,427 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:06:21,588 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:21,589 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:21,589 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:06:21,589 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 85 with the following transitions: [2018-01-25 06:06:21,589 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [12], [13], [17], [19], [20], [21], [24], [31], [36], [38], [39], [42], [52], [54], [56], [59], [63], [66], [67], [68], [71], [72], [73], [77], [79], [80], [81], [91], [92], [95], [96], [99], [100], [122], [123], [126], [129], [130], [133], [134], [135], [137], [138], [139], [140], [144], [147], [152], [153], [157], [158], [159], [160], [161], [162], [163], [165], [166], [167], [169], [170], [173], [174], [175], [176], [177], [179], [180], [181], [182], [183], [189], [191], [192], [193], [194], [195] [2018-01-25 06:06:21,592 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:06:21,592 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:06:24,093 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 06:06:24,093 INFO L268 AbstractInterpreter]: Visited 81 different actions 89 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 26 variables. [2018-01-25 06:06:24,101 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 06:06:24,101 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:24,101 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 06:06:24,120 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:24,120 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:06:24,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:24,176 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:06:24,287 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:24,288 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:06:24,458 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:24,479 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:24,479 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 06:06:24,482 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:24,483 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:06:24,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:24,569 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:06:24,575 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:24,575 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:06:24,663 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:24,665 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 06:06:24,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8] total 15 [2018-01-25 06:06:24,665 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 06:06:24,666 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 06:06:24,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 06:06:24,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-01-25 06:06:24,666 INFO L87 Difference]: Start difference. First operand 129 states and 132 transitions. Second operand 9 states. [2018-01-25 06:06:24,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:24,696 INFO L93 Difference]: Finished difference Result 233 states and 239 transitions. [2018-01-25 06:06:24,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 06:06:24,696 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2018-01-25 06:06:24,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:24,697 INFO L225 Difference]: With dead ends: 233 [2018-01-25 06:06:24,697 INFO L226 Difference]: Without dead ends: 130 [2018-01-25 06:06:24,697 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 327 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=137, Unknown=0, NotChecked=0, Total=240 [2018-01-25 06:06:24,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-01-25 06:06:24,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-01-25 06:06:24,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-01-25 06:06:24,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 133 transitions. [2018-01-25 06:06:24,718 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 133 transitions. Word has length 84 [2018-01-25 06:06:24,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:24,718 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 133 transitions. [2018-01-25 06:06:24,718 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 06:06:24,718 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 133 transitions. [2018-01-25 06:06:24,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-01-25 06:06:24,719 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:24,720 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] [2018-01-25 06:06:24,720 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-25 06:06:24,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1476998571, now seen corresponding path program 2 times [2018-01-25 06:06:24,720 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:24,721 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:24,721 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:24,721 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:24,721 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:24,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:24,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:06:24,828 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:24,829 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:24,829 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:06:24,829 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 06:06:24,829 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 06:06:24,829 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:24,829 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 06:06:24,838 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 06:06:24,839 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 06:06:24,890 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:06:24,894 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:06:24,899 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:06:24,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-25 06:06:24,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:06:24,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-25 06:06:24,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:06:24,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-25 06:06:24,928 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-25 06:06:25,753 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-25 06:06:25,754 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:06:26,721 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-25 06:06:26,741 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 06:06:26,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20, 18] imperfect sequences [9] total 45 [2018-01-25 06:06:26,742 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:06:26,742 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-25 06:06:26,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-25 06:06:26,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1827, Unknown=0, NotChecked=0, Total=1980 [2018-01-25 06:06:26,743 INFO L87 Difference]: Start difference. First operand 130 states and 133 transitions. Second operand 21 states. [2018-01-25 06:06:27,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:27,735 INFO L93 Difference]: Finished difference Result 130 states and 133 transitions. [2018-01-25 06:06:27,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-25 06:06:27,735 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 85 [2018-01-25 06:06:27,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:27,736 INFO L225 Difference]: With dead ends: 130 [2018-01-25 06:06:27,736 INFO L226 Difference]: Without dead ends: 128 [2018-01-25 06:06:27,737 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 131 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=202, Invalid=2348, Unknown=0, NotChecked=0, Total=2550 [2018-01-25 06:06:27,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-01-25 06:06:27,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-01-25 06:06:27,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-01-25 06:06:27,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 131 transitions. [2018-01-25 06:06:27,759 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 131 transitions. Word has length 85 [2018-01-25 06:06:27,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:27,759 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 131 transitions. [2018-01-25 06:06:27,759 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-25 06:06:27,759 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 131 transitions. [2018-01-25 06:06:27,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-01-25 06:06:27,760 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:27,760 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] [2018-01-25 06:06:27,760 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-25 06:06:27,760 INFO L82 PathProgramCache]: Analyzing trace with hash -939068168, now seen corresponding path program 1 times [2018-01-25 06:06:27,761 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:27,761 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:27,762 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 06:06:27,762 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:27,762 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:27,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:27,777 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:06:27,916 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-25 06:06:27,917 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:06:27,917 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-25 06:06:27,917 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:06:27,917 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-25 06:06:27,918 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-25 06:06:27,918 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-01-25 06:06:27,918 INFO L87 Difference]: Start difference. First operand 128 states and 131 transitions. Second operand 11 states. [2018-01-25 06:06:27,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:27,988 INFO L93 Difference]: Finished difference Result 134 states and 136 transitions. [2018-01-25 06:06:27,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 06:06:27,988 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2018-01-25 06:06:27,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:27,989 INFO L225 Difference]: With dead ends: 134 [2018-01-25 06:06:27,989 INFO L226 Difference]: Without dead ends: 128 [2018-01-25 06:06:27,989 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-01-25 06:06:27,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-01-25 06:06:28,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-01-25 06:06:28,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-01-25 06:06:28,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 130 transitions. [2018-01-25 06:06:28,004 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 130 transitions. Word has length 83 [2018-01-25 06:06:28,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:28,004 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 130 transitions. [2018-01-25 06:06:28,004 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-25 06:06:28,005 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 130 transitions. [2018-01-25 06:06:28,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-01-25 06:06:28,005 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:28,005 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] [2018-01-25 06:06:28,005 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-25 06:06:28,005 INFO L82 PathProgramCache]: Analyzing trace with hash 983401723, now seen corresponding path program 1 times [2018-01-25 06:06:28,005 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:28,006 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:28,006 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:28,006 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:28,006 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:28,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:28,028 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:06:28,303 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-25 06:06:28,303 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:06:28,303 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-01-25 06:06:28,303 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:06:28,304 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-25 06:06:28,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-25 06:06:28,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2018-01-25 06:06:28,304 INFO L87 Difference]: Start difference. First operand 128 states and 130 transitions. Second operand 22 states. [2018-01-25 06:06:28,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:28,649 INFO L93 Difference]: Finished difference Result 133 states and 135 transitions. [2018-01-25 06:06:28,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-25 06:06:28,650 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 99 [2018-01-25 06:06:28,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:28,651 INFO L225 Difference]: With dead ends: 133 [2018-01-25 06:06:28,651 INFO L226 Difference]: Without dead ends: 131 [2018-01-25 06:06:28,651 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2018-01-25 06:06:28,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-01-25 06:06:28,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 126. [2018-01-25 06:06:28,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-25 06:06:28,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 128 transitions. [2018-01-25 06:06:28,665 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 128 transitions. Word has length 99 [2018-01-25 06:06:28,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:28,665 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 128 transitions. [2018-01-25 06:06:28,665 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-25 06:06:28,665 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 128 transitions. [2018-01-25 06:06:28,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-01-25 06:06:28,666 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:28,666 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] [2018-01-25 06:06:28,666 INFO L371 AbstractCegarLoop]: === Iteration 26 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-25 06:06:28,666 INFO L82 PathProgramCache]: Analyzing trace with hash 983401724, now seen corresponding path program 1 times [2018-01-25 06:06:28,666 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:28,667 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:28,667 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:28,667 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:28,667 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:28,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:28,689 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:06:28,781 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:28,782 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:28,782 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:06:28,782 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 100 with the following transitions: [2018-01-25 06:06:28,782 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], [56], [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], [134], [135], [137], [138], [139], [140], [144], [147], [152], [153], [157], [158], [159], [160], [161], [162], [163], [165], [166], [167], [169], [170], [171], [173], [174], [175], [176], [177], [179], [180], [181], [182], [183], [184], [185], [187], [189], [191], [192], [193], [194], [195] [2018-01-25 06:06:28,785 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:06:28,785 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:06:32,161 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 06:06:32,161 INFO L268 AbstractInterpreter]: Visited 95 different actions 103 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 27 variables. [2018-01-25 06:06:32,166 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 06:06:32,166 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:32,166 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-25 06:06:32,171 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:32,171 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:06:32,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:32,217 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:06:32,229 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:32,229 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:06:32,352 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:32,373 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:32,373 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 06:06:32,376 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:32,376 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:06:32,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:32,474 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:06:32,481 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:32,481 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:06:32,555 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:32,556 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 06:06:32,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9] total 17 [2018-01-25 06:06:32,557 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 06:06:32,557 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 06:06:32,557 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 06:06:32,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-01-25 06:06:32,558 INFO L87 Difference]: Start difference. First operand 126 states and 128 transitions. Second operand 10 states. [2018-01-25 06:06:32,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:32,589 INFO L93 Difference]: Finished difference Result 226 states and 230 transitions. [2018-01-25 06:06:32,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 06:06:32,589 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 99 [2018-01-25 06:06:32,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:32,590 INFO L225 Difference]: With dead ends: 226 [2018-01-25 06:06:32,590 INFO L226 Difference]: Without dead ends: 127 [2018-01-25 06:06:32,590 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 386 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=133, Invalid=173, Unknown=0, NotChecked=0, Total=306 [2018-01-25 06:06:32,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-25 06:06:32,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-01-25 06:06:32,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-01-25 06:06:32,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 129 transitions. [2018-01-25 06:06:32,604 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 129 transitions. Word has length 99 [2018-01-25 06:06:32,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:32,605 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 129 transitions. [2018-01-25 06:06:32,605 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 06:06:32,605 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 129 transitions. [2018-01-25 06:06:32,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-01-25 06:06:32,606 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:32,606 INFO L322 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:06:32,606 INFO L371 AbstractCegarLoop]: === Iteration 27 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-25 06:06:32,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1981450609, now seen corresponding path program 2 times [2018-01-25 06:06:32,606 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:32,607 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:32,607 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:32,607 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:32,607 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:32,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:32,629 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:06:32,802 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:06:32,803 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:32,803 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:06:32,803 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 06:06:32,803 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 06:06:32,803 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:32,803 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 06:06:32,808 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 06:06:32,809 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 06:06:32,843 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:06:32,848 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:06:32,853 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:06:32,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-25 06:06:32,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:06:32,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-25 06:06:32,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:06:32,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-25 06:06:32,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-25 06:06:33,881 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-01-25 06:06:33,881 INFO L314 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2018-01-25 06:06:34,032 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 06:06:34,053 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 06:06:34,056 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 06:06:34,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 06:06:34 BoogieIcfgContainer [2018-01-25 06:06:34,056 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 06:06:34,057 INFO L168 Benchmark]: Toolchain (without parser) took 38778.07 ms. Allocated memory was 304.1 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 263.1 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 128.2 MB. Max. memory is 5.3 GB. [2018-01-25 06:06:34,057 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 304.1 MB. Free memory is still 270.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 06:06:34,057 INFO L168 Benchmark]: CACSL2BoogieTranslator took 244.02 ms. Allocated memory is still 304.1 MB. Free memory was 263.1 MB in the beginning and 248.8 MB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 5.3 GB. [2018-01-25 06:06:34,058 INFO L168 Benchmark]: Boogie Preprocessor took 35.71 ms. Allocated memory is still 304.1 MB. Free memory was 248.8 MB in the beginning and 246.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 06:06:34,058 INFO L168 Benchmark]: RCFGBuilder took 450.80 ms. Allocated memory is still 304.1 MB. Free memory was 246.8 MB in the beginning and 212.2 MB in the end (delta: 34.6 MB). Peak memory consumption was 34.6 MB. Max. memory is 5.3 GB. [2018-01-25 06:06:34,058 INFO L168 Benchmark]: TraceAbstraction took 38038.95 ms. Allocated memory was 304.1 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 212.2 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 77.2 MB. Max. memory is 5.3 GB. [2018-01-25 06:06:34,060 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 304.1 MB. Free memory is still 270.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 244.02 ms. Allocated memory is still 304.1 MB. Free memory was 263.1 MB in the beginning and 248.8 MB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.71 ms. Allocated memory is still 304.1 MB. Free memory was 248.8 MB in the beginning and 246.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 450.80 ms. Allocated memory is still 304.1 MB. Free memory was 246.8 MB in the beginning and 212.2 MB in the end (delta: 34.6 MB). Peak memory consumption was 34.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 38038.95 ms. Allocated memory was 304.1 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 212.2 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 77.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 34 LocStat_MAX_WEQGRAPH_SIZE : 3 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 259 LocStat_NO_SUPPORTING_DISEQUALITIES : 25 LocStat_NO_DISJUNCTIONS : -68 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 53 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 108 TransStat_NO_SUPPORTING_DISEQUALITIES : 9 TransStat_NO_DISJUNCTIONS : 57 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.419027 RENAME_VARIABLES(MILLISECONDS) : 0.086399 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.161704 PROJECTAWAY(MILLISECONDS) : 0.039914 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.106487 DISJOIN(MILLISECONDS) : 0.671962 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.110116 ADD_EQUALITY(MILLISECONDS) : 0.016809 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.006289 #CONJOIN_DISJUNCTIVE : 86 #RENAME_VARIABLES : 145 #UNFREEZE : 0 #CONJOIN : 178 #PROJECTAWAY : 142 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 141 #ADD_EQUALITY : 111 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 39 LocStat_MAX_WEQGRAPH_SIZE : 6 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 299 LocStat_NO_SUPPORTING_DISEQUALITIES : 30 LocStat_NO_DISJUNCTIONS : -78 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 60 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 120 TransStat_NO_SUPPORTING_DISEQUALITIES : 9 TransStat_NO_DISJUNCTIONS : 64 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.374575 RENAME_VARIABLES(MILLISECONDS) : 0.091928 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.156920 PROJECTAWAY(MILLISECONDS) : 0.046067 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.054335 DISJOIN(MILLISECONDS) : 0.415509 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.118223 ADD_EQUALITY(MILLISECONDS) : 0.019085 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.006678 #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 : 58 LocStat_MAX_WEQGRAPH_SIZE : 6 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 451 LocStat_NO_SUPPORTING_DISEQUALITIES : 49 LocStat_NO_DISJUNCTIONS : -116 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 85 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 164 TransStat_NO_SUPPORTING_DISEQUALITIES : 11 TransStat_NO_DISJUNCTIONS : 90 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.243301 RENAME_VARIABLES(MILLISECONDS) : 0.049518 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.104789 PROJECTAWAY(MILLISECONDS) : 0.023807 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.055151 DISJOIN(MILLISECONDS) : 0.412477 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.063323 ADD_EQUALITY(MILLISECONDS) : 0.011483 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.006644 #CONJOIN_DISJUNCTIVE : 132 #RENAME_VARIABLES : 217 #UNFREEZE : 0 #CONJOIN : 284 #PROJECTAWAY : 223 #ADD_WEAK_EQUALITY : 27 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 212 #ADD_EQUALITY : 180 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 10 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 80 LocStat_MAX_WEQGRAPH_SIZE : 6 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 659 LocStat_NO_SUPPORTING_DISEQUALITIES : 71 LocStat_NO_DISJUNCTIONS : -160 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 115 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 233 TransStat_NO_SUPPORTING_DISEQUALITIES : 13 TransStat_NO_DISJUNCTIONS : 121 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.318381 RENAME_VARIABLES(MILLISECONDS) : 0.092461 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.113270 PROJECTAWAY(MILLISECONDS) : 0.021468 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.029538 DISJOIN(MILLISECONDS) : 0.378872 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.116580 ADD_EQUALITY(MILLISECONDS) : 0.014705 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.003899 #CONJOIN_DISJUNCTIVE : 175 #RENAME_VARIABLES : 279 #UNFREEZE : 0 #CONJOIN : 383 #PROJECTAWAY : 292 #ADD_WEAK_EQUALITY : 33 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 273 #ADD_EQUALITY : 254 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 12 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 94 LocStat_MAX_WEQGRAPH_SIZE : 6 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 805 LocStat_NO_SUPPORTING_DISEQUALITIES : 85 LocStat_NO_DISJUNCTIONS : -188 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 135 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 2 TransStat_NO_SUPPORTING_EQUALITIES : 265 TransStat_NO_SUPPORTING_DISEQUALITIES : 13 TransStat_NO_DISJUNCTIONS : 141 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.168279 RENAME_VARIABLES(MILLISECONDS) : 0.048247 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.068115 PROJECTAWAY(MILLISECONDS) : 0.016433 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.040087 DISJOIN(MILLISECONDS) : 0.343802 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.061213 ADD_EQUALITY(MILLISECONDS) : 0.008622 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.003431 #CONJOIN_DISJUNCTIVE : 198 #RENAME_VARIABLES : 316 #UNFREEZE : 0 #CONJOIN : 431 #PROJECTAWAY : 333 #ADD_WEAK_EQUALITY : 39 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 310 #ADD_EQUALITY : 291 #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 101 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 38 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 101 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 38 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 101 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 38 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 101 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 38 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 101 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 38 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 101 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 38 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 101 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 38 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 101 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 38 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 101 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 38 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 101 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 38 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 101 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 38 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 101 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 38 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was analyzing trace of length 101 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 38 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was analyzing trace of length 101 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 38 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was analyzing trace of length 101 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 38 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was analyzing trace of length 101 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 38 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 101 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 38 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 101 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 38 known predicates. - TimeoutResultAtElement [Line: 1443]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1443). Cancelled while BasicCegarLoop was analyzing trace of length 101 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 38 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 101 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 38 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 101 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 38 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 101 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 38 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 101 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 38 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 142 locations, 23 error locations. TIMEOUT Result, 37.9s OverallTime, 27 OverallIterations, 6 TraceHistogramMax, 6.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3273 SDtfs, 919 SDslu, 19713 SDs, 0 SdLazy, 6199 SolverSat, 187 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2006 GetRequests, 1600 SyntacticMatches, 20 SemanticMatches, 386 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1996 ImplicationChecksByTransitivity, 11.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=157occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 15.2s AbstIntTime, 5 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 26 MinimizatonAttempts, 58 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 12.2s InterpolantComputationTime, 2200 NumberOfCodeBlocks, 2186 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 3011 ConstructedInterpolants, 173 QuantifiedInterpolants, 658084 SizeOfPredicates, 66 NumberOfNonLiveVariables, 4078 ConjunctsInSsa, 273 ConjunctsInUnsatCore, 54 InterpolantComputations, 25 PerfectInterpolantSequences, 139/348 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_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_06-06-34-072.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_06-06-34-072.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_06-06-34-072.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_06-06-34-072.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_06-06-34-072.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-25_06-06-34-072.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-25_06-06-34-072.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-25_06-06-34-072.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-25_06-06-34-072.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-4-2018-01-25_06-06-34-072.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-4-2018-01-25_06-06-34-072.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_06-06-34-072.csv Completed graceful shutdown