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_4_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 06:06:41,443 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 06:06:41,444 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 06:06:41,460 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 06:06:41,460 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 06:06:41,461 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 06:06:41,462 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 06:06:41,464 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 06:06:41,466 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 06:06:41,467 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 06:06:41,468 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 06:06:41,468 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 06:06:41,469 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 06:06:41,470 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 06:06:41,471 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 06:06:41,474 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 06:06:41,476 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 06:06:41,478 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 06:06:41,480 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 06:06:41,481 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 06:06:41,484 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 06:06:41,484 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 06:06:41,484 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 06:06:41,486 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 06:06:41,486 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 06:06:41,488 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 06:06:41,488 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 06:06:41,489 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 06:06:41,489 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 06:06:41,489 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 06:06:41,490 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 06:06:41,490 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:06:41,499 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 06:06:41,500 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 06:06:41,500 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 06:06:41,501 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 06:06:41,501 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 06:06:41,501 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 06:06:41,501 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 06:06:41,501 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 06:06:41,502 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 06:06:41,502 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 06:06:41,502 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 06:06:41,502 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 06:06:41,502 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 06:06:41,502 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 06:06:41,503 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 06:06:41,503 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 06:06:41,503 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 06:06:41,503 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 06:06:41,503 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 06:06:41,503 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 06:06:41,503 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 06:06:41,504 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 06:06:41,504 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 06:06:41,504 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 06:06:41,504 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 06:06:41,504 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 06:06:41,505 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 06:06:41,505 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 06:06:41,505 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 06:06:41,505 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 06:06:41,505 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 06:06:41,505 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 06:06:41,505 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 06:06:41,506 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 06:06:41,506 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 06:06:41,506 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 06:06:41,542 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 06:06:41,555 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 06:06:41,559 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 06:06:41,561 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 06:06:41,561 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 06:06:41,562 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_4_false-valid-memtrack_true-termination.i [2018-01-25 06:06:41,779 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 06:06:41,785 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 06:06:41,786 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 06:06:41,786 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 06:06:41,791 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 06:06:41,792 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:06:41" (1/1) ... [2018-01-25 06:06:41,796 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@730062df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:06:41, skipping insertion in model container [2018-01-25 06:06:41,796 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:06:41" (1/1) ... [2018-01-25 06:06:41,816 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:06:41,870 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:06:42,006 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:06:42,033 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:06:42,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:06:42 WrapperNode [2018-01-25 06:06:42,046 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 06:06:42,047 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 06:06:42,047 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 06:06:42,047 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 06:06:42,059 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:06:42" (1/1) ... [2018-01-25 06:06:42,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:06:42" (1/1) ... [2018-01-25 06:06:42,070 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:06:42" (1/1) ... [2018-01-25 06:06:42,070 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:06:42" (1/1) ... [2018-01-25 06:06:42,078 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:06:42" (1/1) ... [2018-01-25 06:06:42,082 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:06:42" (1/1) ... [2018-01-25 06:06:42,083 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:06:42" (1/1) ... [2018-01-25 06:06:42,088 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 06:06:42,088 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 06:06:42,088 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 06:06:42,089 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 06:06:42,090 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:06:42" (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:06:42,137 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 06:06:42,137 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 06:06:42,137 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-01-25 06:06:42,137 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-25 06:06:42,137 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-01-25 06:06:42,137 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2018-01-25 06:06:42,137 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-01-25 06:06:42,137 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-01-25 06:06:42,137 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-01-25 06:06:42,138 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2018-01-25 06:06:42,138 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-01-25 06:06:42,138 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-01-25 06:06:42,138 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-01-25 06:06:42,138 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-01-25 06:06:42,138 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2018-01-25 06:06:42,138 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-01-25 06:06:42,138 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-01-25 06:06:42,138 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-01-25 06:06:42,138 INFO L136 BoogieDeclarations]: Found implementation of procedure f_22_get [2018-01-25 06:06:42,139 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-25 06:06:42,139 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 06:06:42,139 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 06:06:42,139 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 06:06:42,139 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 06:06:42,139 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 06:06:42,139 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 06:06:42,139 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 06:06:42,140 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 06:06:42,140 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-25 06:06:42,140 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-25 06:06:42,140 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 06:06:42,140 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 06:06:42,140 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 06:06:42,140 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-25 06:06:42,140 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-25 06:06:42,140 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-01-25 06:06:42,140 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2018-01-25 06:06:42,140 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-01-25 06:06:42,141 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-01-25 06:06:42,141 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-01-25 06:06:42,141 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-01-25 06:06:42,141 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2018-01-25 06:06:42,141 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-01-25 06:06:42,141 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-01-25 06:06:42,141 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-01-25 06:06:42,141 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-01-25 06:06:42,141 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2018-01-25 06:06:42,141 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-01-25 06:06:42,142 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-01-25 06:06:42,142 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-01-25 06:06:42,142 INFO L128 BoogieDeclarations]: Found specification of procedure f_22_get [2018-01-25 06:06:42,142 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-25 06:06:42,142 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 06:06:42,142 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 06:06:42,142 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 06:06:42,408 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-25 06:06:42,607 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 06:06:42,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:06:42 BoogieIcfgContainer [2018-01-25 06:06:42,608 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 06:06:42,608 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 06:06:42,609 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 06:06:42,610 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 06:06:42,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 06:06:41" (1/3) ... [2018-01-25 06:06:42,612 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1576730a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:06:42, skipping insertion in model container [2018-01-25 06:06:42,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:06:42" (2/3) ... [2018-01-25 06:06:42,612 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1576730a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:06:42, skipping insertion in model container [2018-01-25 06:06:42,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:06:42" (3/3) ... [2018-01-25 06:06:42,614 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test22_4_false-valid-memtrack_true-termination.i [2018-01-25 06:06:42,620 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 06:06:42,629 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-01-25 06:06:42,677 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 06:06:42,677 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 06:06:42,677 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 06:06:42,677 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 06:06:42,678 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 06:06:42,678 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 06:06:42,678 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 06:06:42,678 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 06:06:42,679 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 06:06:42,700 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states. [2018-01-25 06:06:42,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 06:06:42,705 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:42,706 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:06:42,706 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:06:42,711 INFO L82 PathProgramCache]: Analyzing trace with hash -367619766, now seen corresponding path program 1 times [2018-01-25 06:06:42,713 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:42,761 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:42,761 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:42,761 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:42,761 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:42,829 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:43,048 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:43,050 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:06:43,050 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:06:43,050 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:06:43,054 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:06:43,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:06:43,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:06:43,067 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 5 states. [2018-01-25 06:06:43,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:43,129 INFO L93 Difference]: Finished difference Result 280 states and 295 transitions. [2018-01-25 06:06:43,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:06:43,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-25 06:06:43,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:43,145 INFO L225 Difference]: With dead ends: 280 [2018-01-25 06:06:43,145 INFO L226 Difference]: Without dead ends: 149 [2018-01-25 06:06:43,150 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:06:43,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-01-25 06:06:43,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2018-01-25 06:06:43,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-01-25 06:06:43,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 155 transitions. [2018-01-25 06:06:43,198 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 155 transitions. Word has length 17 [2018-01-25 06:06:43,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:43,198 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 155 transitions. [2018-01-25 06:06:43,199 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:06:43,199 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 155 transitions. [2018-01-25 06:06:43,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 06:06:43,200 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:43,200 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:06:43,200 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:06:43,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1040907540, now seen corresponding path program 1 times [2018-01-25 06:06:43,201 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:43,203 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:43,203 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:43,203 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:43,203 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:43,228 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:43,309 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:43,310 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:06:43,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:06:43,310 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:06:43,311 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:06:43,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:06:43,312 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:06:43,312 INFO L87 Difference]: Start difference. First operand 147 states and 155 transitions. Second operand 6 states. [2018-01-25 06:06:43,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:43,517 INFO L93 Difference]: Finished difference Result 149 states and 157 transitions. [2018-01-25 06:06:43,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:06:43,517 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-25 06:06:43,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:43,520 INFO L225 Difference]: With dead ends: 149 [2018-01-25 06:06:43,520 INFO L226 Difference]: Without dead ends: 148 [2018-01-25 06:06:43,521 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:06:43,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-01-25 06:06:43,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2018-01-25 06:06:43,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-01-25 06:06:43,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 154 transitions. [2018-01-25 06:06:43,537 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 154 transitions. Word has length 19 [2018-01-25 06:06:43,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:43,537 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 154 transitions. [2018-01-25 06:06:43,538 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:06:43,538 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 154 transitions. [2018-01-25 06:06:43,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 06:06:43,538 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:43,538 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:06:43,538 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:06:43,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1040907539, now seen corresponding path program 1 times [2018-01-25 06:06:43,539 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:43,540 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:43,540 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:43,540 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:43,540 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:43,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:43,562 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:43,851 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:43,851 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:06:43,851 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 06:06:43,851 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:06:43,852 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 06:06:43,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 06:06:43,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:06:43,853 INFO L87 Difference]: Start difference. First operand 146 states and 154 transitions. Second operand 7 states. [2018-01-25 06:06:44,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:44,114 INFO L93 Difference]: Finished difference Result 148 states and 156 transitions. [2018-01-25 06:06:44,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 06:06:44,115 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-01-25 06:06:44,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:44,117 INFO L225 Difference]: With dead ends: 148 [2018-01-25 06:06:44,117 INFO L226 Difference]: Without dead ends: 147 [2018-01-25 06:06:44,118 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:06:44,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-01-25 06:06:44,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2018-01-25 06:06:44,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-01-25 06:06:44,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 153 transitions. [2018-01-25 06:06:44,131 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 153 transitions. Word has length 19 [2018-01-25 06:06:44,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:44,131 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 153 transitions. [2018-01-25 06:06:44,132 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 06:06:44,132 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 153 transitions. [2018-01-25 06:06:44,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 06:06:44,133 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:44,133 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:06:44,133 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:06:44,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1287954832, now seen corresponding path program 1 times [2018-01-25 06:06:44,134 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:44,135 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:44,135 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:44,136 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:44,136 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:44,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:44,153 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:44,255 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:44,256 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:06:44,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 06:06:44,276 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:06:44,276 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 06:06:44,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 06:06:44,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-25 06:06:44,277 INFO L87 Difference]: Start difference. First operand 145 states and 153 transitions. Second operand 9 states. [2018-01-25 06:06:44,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:44,440 INFO L93 Difference]: Finished difference Result 245 states and 257 transitions. [2018-01-25 06:06:44,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 06:06:44,441 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-01-25 06:06:44,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:44,444 INFO L225 Difference]: With dead ends: 245 [2018-01-25 06:06:44,444 INFO L226 Difference]: Without dead ends: 165 [2018-01-25 06:06:44,445 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-25 06:06:44,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-01-25 06:06:44,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 159. [2018-01-25 06:06:44,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-01-25 06:06:44,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 167 transitions. [2018-01-25 06:06:44,464 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 167 transitions. Word has length 29 [2018-01-25 06:06:44,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:44,464 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 167 transitions. [2018-01-25 06:06:44,464 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 06:06:44,465 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 167 transitions. [2018-01-25 06:06:44,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 06:06:44,466 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:44,466 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:44,466 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:06:44,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1025625474, now seen corresponding path program 1 times [2018-01-25 06:06:44,467 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:44,468 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:44,468 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:44,468 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:44,468 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:44,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:44,487 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:44,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:06:44,553 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:06:44,553 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 06:06:44,553 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:06:44,553 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 06:06:44,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 06:06:44,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:06:44,554 INFO L87 Difference]: Start difference. First operand 159 states and 167 transitions. Second operand 10 states. [2018-01-25 06:06:44,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:44,754 INFO L93 Difference]: Finished difference Result 159 states and 167 transitions. [2018-01-25 06:06:44,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 06:06:44,754 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-01-25 06:06:44,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:44,755 INFO L225 Difference]: With dead ends: 159 [2018-01-25 06:06:44,756 INFO L226 Difference]: Without dead ends: 158 [2018-01-25 06:06:44,756 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:06:44,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-01-25 06:06:44,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-01-25 06:06:44,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-01-25 06:06:44,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 166 transitions. [2018-01-25 06:06:44,768 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 166 transitions. Word has length 34 [2018-01-25 06:06:44,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:44,768 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 166 transitions. [2018-01-25 06:06:44,768 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 06:06:44,768 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 166 transitions. [2018-01-25 06:06:44,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 06:06:44,769 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:44,770 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:44,770 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:06:44,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1025625475, now seen corresponding path program 1 times [2018-01-25 06:06:44,770 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:44,771 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:44,772 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:44,772 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:44,772 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:44,789 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:44,812 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:44,812 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:06:44,812 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 06:06:44,813 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:06:44,813 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:06:44,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:06:44,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:06:44,813 INFO L87 Difference]: Start difference. First operand 158 states and 166 transitions. Second operand 4 states. [2018-01-25 06:06:44,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:44,839 INFO L93 Difference]: Finished difference Result 277 states and 291 transitions. [2018-01-25 06:06:44,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 06:06:44,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-01-25 06:06:44,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:44,846 INFO L225 Difference]: With dead ends: 277 [2018-01-25 06:06:44,846 INFO L226 Difference]: Without dead ends: 159 [2018-01-25 06:06:44,847 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:06:44,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-01-25 06:06:44,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-01-25 06:06:44,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-01-25 06:06:44,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 167 transitions. [2018-01-25 06:06:44,857 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 167 transitions. Word has length 34 [2018-01-25 06:06:44,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:44,857 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 167 transitions. [2018-01-25 06:06:44,857 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:06:44,857 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 167 transitions. [2018-01-25 06:06:44,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-25 06:06:44,859 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:44,859 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:06:44,859 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:06:44,859 INFO L82 PathProgramCache]: Analyzing trace with hash -553427227, now seen corresponding path program 1 times [2018-01-25 06:06:44,859 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:44,860 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:44,861 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:44,861 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:44,861 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:44,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:44,878 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:44,926 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:44,926 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:44,926 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:06:44,927 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-01-25 06:06:44,929 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [31], [36], [52], [58], [62], [66], [69], [71], [72], [76], [78], [79], [129], [132], [133], [134], [136], [137], [138], [160], [161], [162], [163], [164], [166], [172], [176], [182], [198], [199], [200] [2018-01-25 06:06:44,975 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:06:44,975 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:06:47,430 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 06:06:47,432 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:47,455 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 06:06:47,456 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:47,456 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:47,468 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:47,468 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:06:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:47,516 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:06:47,567 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:47,568 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:06:47,685 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:47,721 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:47,721 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:47,745 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:47,745 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:06:47,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:47,815 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:06:47,821 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:47,821 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:06:47,850 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:47,853 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 06:06:47,853 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5] total 9 [2018-01-25 06:06:47,853 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 06:06:47,854 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:06:47,854 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:06:47,854 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-01-25 06:06:47,854 INFO L87 Difference]: Start difference. First operand 159 states and 167 transitions. Second operand 6 states. [2018-01-25 06:06:47,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:47,912 INFO L93 Difference]: Finished difference Result 278 states and 292 transitions. [2018-01-25 06:06:47,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:06:47,913 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-25 06:06:47,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:47,914 INFO L225 Difference]: With dead ends: 278 [2018-01-25 06:06:47,915 INFO L226 Difference]: Without dead ends: 160 [2018-01-25 06:06:47,916 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 134 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:06:47,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-01-25 06:06:47,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-01-25 06:06:47,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-01-25 06:06:47,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 168 transitions. [2018-01-25 06:06:47,928 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 168 transitions. Word has length 35 [2018-01-25 06:06:47,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:47,928 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 168 transitions. [2018-01-25 06:06:47,928 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:06:47,928 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 168 transitions. [2018-01-25 06:06:47,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-25 06:06:47,930 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:47,930 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:47,930 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:47,930 INFO L82 PathProgramCache]: Analyzing trace with hash 2035546563, now seen corresponding path program 2 times [2018-01-25 06:06:47,931 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:47,932 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:47,932 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:47,932 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:47,933 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:47,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:47,953 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:48,014 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:48,015 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:48,015 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:06:48,015 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 06:06:48,015 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:48,015 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:48,016 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:48,030 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 06:06:48,031 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 06:06:48,062 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:06:48,065 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:06:48,070 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:06:48,095 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:48,096 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:06:48,135 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:48,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:06:48,156 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:48,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-25 06:06:48,529 WARN L143 SmtUtils]: Spent 104ms on a formula simplification that was a NOOP. DAG size: 27 [2018-01-25 06:06:48,927 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:48,927 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:06:51,416 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:51,436 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 06:06:51,436 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14, 13] imperfect sequences [6] total 31 [2018-01-25 06:06:51,436 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:06:51,437 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-25 06:06:51,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-25 06:06:51,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=839, Unknown=1, NotChecked=0, Total=930 [2018-01-25 06:06:51,438 INFO L87 Difference]: Start difference. First operand 160 states and 168 transitions. Second operand 15 states. [2018-01-25 06:06:56,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:56,501 INFO L93 Difference]: Finished difference Result 224 states and 235 transitions. [2018-01-25 06:06:56,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-25 06:06:56,503 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2018-01-25 06:06:56,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:56,505 INFO L225 Difference]: With dead ends: 224 [2018-01-25 06:06:56,505 INFO L226 Difference]: Without dead ends: 223 [2018-01-25 06:06:56,506 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=118, Invalid=1071, Unknown=1, NotChecked=0, Total=1190 [2018-01-25 06:06:56,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-01-25 06:06:56,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 159. [2018-01-25 06:06:56,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-01-25 06:06:56,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 167 transitions. [2018-01-25 06:06:56,524 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 167 transitions. Word has length 36 [2018-01-25 06:06:56,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:56,524 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 167 transitions. [2018-01-25 06:06:56,524 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-25 06:06:56,524 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 167 transitions. [2018-01-25 06:06:56,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-25 06:06:56,526 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:56,526 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:06:56,526 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:56,526 INFO L82 PathProgramCache]: Analyzing trace with hash -2073429328, now seen corresponding path program 1 times [2018-01-25 06:06:56,527 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:56,528 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:56,528 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 06:06:56,528 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:56,528 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:56,543 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:56,637 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:56,637 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:06:56,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 06:06:56,637 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:06:56,638 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 06:06:56,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 06:06:56,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:06:56,638 INFO L87 Difference]: Start difference. First operand 159 states and 167 transitions. Second operand 7 states. [2018-01-25 06:06:56,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:56,750 INFO L93 Difference]: Finished difference Result 222 states and 232 transitions. [2018-01-25 06:06:56,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 06:06:56,751 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2018-01-25 06:06:56,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:56,752 INFO L225 Difference]: With dead ends: 222 [2018-01-25 06:06:56,753 INFO L226 Difference]: Without dead ends: 168 [2018-01-25 06:06:56,753 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:56,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-01-25 06:06:56,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 164. [2018-01-25 06:06:56,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-01-25 06:06:56,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 172 transitions. [2018-01-25 06:06:56,769 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 172 transitions. Word has length 40 [2018-01-25 06:06:56,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:56,770 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 172 transitions. [2018-01-25 06:06:56,770 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 06:06:56,770 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 172 transitions. [2018-01-25 06:06:56,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-25 06:06:56,771 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:56,772 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:06:56,772 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:56,772 INFO L82 PathProgramCache]: Analyzing trace with hash 2040053740, now seen corresponding path program 1 times [2018-01-25 06:06:56,772 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:56,773 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:56,773 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:56,773 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:56,774 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:56,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:56,784 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:56,814 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:56,814 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:06:56,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 06:06:56,814 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:06:56,815 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 06:06:56,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 06:06:56,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 06:06:56,816 INFO L87 Difference]: Start difference. First operand 164 states and 172 transitions. Second operand 3 states. [2018-01-25 06:06:56,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:56,967 INFO L93 Difference]: Finished difference Result 181 states and 190 transitions. [2018-01-25 06:06:56,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 06:06:56,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-01-25 06:06:56,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:56,969 INFO L225 Difference]: With dead ends: 181 [2018-01-25 06:06:56,969 INFO L226 Difference]: Without dead ends: 168 [2018-01-25 06:06:56,970 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:56,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-01-25 06:06:56,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 160. [2018-01-25 06:06:56,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-01-25 06:06:56,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 167 transitions. [2018-01-25 06:06:56,984 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 167 transitions. Word has length 38 [2018-01-25 06:06:56,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:56,984 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 167 transitions. [2018-01-25 06:06:56,984 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 06:06:56,984 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 167 transitions. [2018-01-25 06:06:56,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-25 06:06:56,985 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:56,985 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:56,985 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:56,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1765321240, now seen corresponding path program 1 times [2018-01-25 06:06:56,985 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:56,987 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:56,987 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:56,987 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:56,987 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:56,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:56,999 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:57,093 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:57,093 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:06:57,093 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 06:06:57,093 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:06:57,093 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 06:06:57,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 06:06:57,094 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:06:57,094 INFO L87 Difference]: Start difference. First operand 160 states and 167 transitions. Second operand 10 states. [2018-01-25 06:06:57,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:06:57,397 INFO L93 Difference]: Finished difference Result 160 states and 167 transitions. [2018-01-25 06:06:57,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 06:06:57,397 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2018-01-25 06:06:57,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:06:57,398 INFO L225 Difference]: With dead ends: 160 [2018-01-25 06:06:57,399 INFO L226 Difference]: Without dead ends: 158 [2018-01-25 06:06:57,399 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:06:57,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-01-25 06:06:57,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-01-25 06:06:57,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-01-25 06:06:57,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 165 transitions. [2018-01-25 06:06:57,412 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 165 transitions. Word has length 41 [2018-01-25 06:06:57,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:06:57,412 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 165 transitions. [2018-01-25 06:06:57,412 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 06:06:57,412 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 165 transitions. [2018-01-25 06:06:57,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-25 06:06:57,413 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:06:57,413 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:57,413 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:57,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1765321239, now seen corresponding path program 1 times [2018-01-25 06:06:57,413 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:06:57,414 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:57,415 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:57,415 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:06:57,415 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:06:57,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:57,429 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:57,513 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:57,514 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:57,514 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:06:57,514 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-01-25 06:06:57,514 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [31], [36], [52], [58], [62], [66], [67], [70], [71], [72], [76], [78], [79], [121], [124], [129], [132], [133], [134], [136], [137], [138], [160], [161], [162], [163], [164], [166], [172], [176], [182], [183], [184], [198], [199], [200] [2018-01-25 06:06:57,516 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:06:57,516 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:06:59,974 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 06:06:59,974 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:59,977 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 06:06:59,977 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:59,977 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:59,989 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:59,989 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:07:00,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:07:00,024 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:07:00,051 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:07:00,051 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:07:00,171 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:07:00,207 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:07:00,207 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:07:00,218 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:07:00,218 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:07:00,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:07:00,272 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:07:00,277 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:07:00,277 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:07:00,424 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:07:00,426 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 06:07:00,426 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6] total 11 [2018-01-25 06:07:00,426 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 06:07:00,426 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 06:07:00,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 06:07:00,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-01-25 06:07:00,427 INFO L87 Difference]: Start difference. First operand 158 states and 165 transitions. Second operand 7 states. [2018-01-25 06:07:00,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:07:00,469 INFO L93 Difference]: Finished difference Result 274 states and 287 transitions. [2018-01-25 06:07:00,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:07:00,469 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-01-25 06:07:00,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:07:00,470 INFO L225 Difference]: With dead ends: 274 [2018-01-25 06:07:00,470 INFO L226 Difference]: Without dead ends: 159 [2018-01-25 06:07:00,470 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2018-01-25 06:07:00,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-01-25 06:07:00,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-01-25 06:07:00,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-01-25 06:07:00,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 166 transitions. [2018-01-25 06:07:00,483 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 166 transitions. Word has length 41 [2018-01-25 06:07:00,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:07:00,483 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 166 transitions. [2018-01-25 06:07:00,484 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 06:07:00,484 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 166 transitions. [2018-01-25 06:07:00,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-25 06:07:00,484 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:07:00,485 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:07:00,485 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:07:00,485 INFO L82 PathProgramCache]: Analyzing trace with hash 8062858, now seen corresponding path program 1 times [2018-01-25 06:07:00,485 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:07:00,486 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:07:00,486 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:07:00,486 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:07:00,487 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:07:00,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:07:00,495 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:07:00,529 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:07:00,529 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:07:00,530 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 06:07:00,530 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:07:00,530 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:07:00,530 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:07:00,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:07:00,531 INFO L87 Difference]: Start difference. First operand 159 states and 166 transitions. Second operand 6 states. [2018-01-25 06:07:00,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:07:00,561 INFO L93 Difference]: Finished difference Result 163 states and 169 transitions. [2018-01-25 06:07:00,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:07:00,562 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-01-25 06:07:00,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:07:00,563 INFO L225 Difference]: With dead ends: 163 [2018-01-25 06:07:00,563 INFO L226 Difference]: Without dead ends: 140 [2018-01-25 06:07:00,564 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:07:00,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-25 06:07:00,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-01-25 06:07:00,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-25 06:07:00,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 146 transitions. [2018-01-25 06:07:00,577 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 146 transitions. Word has length 40 [2018-01-25 06:07:00,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:07:00,577 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 146 transitions. [2018-01-25 06:07:00,577 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:07:00,577 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 146 transitions. [2018-01-25 06:07:00,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-25 06:07:00,578 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:07:00,578 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:07:00,578 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:07:00,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1805397433, now seen corresponding path program 2 times [2018-01-25 06:07:00,579 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:07:00,580 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:07:00,580 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:07:00,580 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:07:00,580 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:07:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:07:00,597 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:07:00,686 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:07:00,686 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:07:00,686 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:07:00,686 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 06:07:00,687 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:07:00,687 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:07:00,687 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:07:00,697 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 06:07:00,697 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 06:07:00,723 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:07:00,729 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:07:00,733 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:07:00,741 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:07:00,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:07:00,770 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:07:00,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:07:00,785 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:07:00,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-25 06:07:01,233 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:07:01,233 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:07:01,873 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:07:01,894 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 06:07:01,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15, 13] imperfect sequences [7] total 33 [2018-01-25 06:07:01,894 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:07:01,894 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-25 06:07:01,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-25 06:07:01,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=951, Unknown=0, NotChecked=0, Total=1056 [2018-01-25 06:07:01,895 INFO L87 Difference]: Start difference. First operand 140 states and 146 transitions. Second operand 16 states. [2018-01-25 06:07:02,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:07:02,808 INFO L93 Difference]: Finished difference Result 140 states and 146 transitions. [2018-01-25 06:07:02,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-25 06:07:02,808 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2018-01-25 06:07:02,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:07:02,809 INFO L225 Difference]: With dead ends: 140 [2018-01-25 06:07:02,809 INFO L226 Difference]: Without dead ends: 138 [2018-01-25 06:07:02,810 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=136, Invalid=1196, Unknown=0, NotChecked=0, Total=1332 [2018-01-25 06:07:02,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-01-25 06:07:02,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-01-25 06:07:02,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-01-25 06:07:02,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 144 transitions. [2018-01-25 06:07:02,826 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 144 transitions. Word has length 42 [2018-01-25 06:07:02,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:07:02,826 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 144 transitions. [2018-01-25 06:07:02,826 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-25 06:07:02,826 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 144 transitions. [2018-01-25 06:07:02,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-25 06:07:02,827 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:07:02,827 INFO L322 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:07:02,827 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:07:02,827 INFO L82 PathProgramCache]: Analyzing trace with hash -578251942, now seen corresponding path program 1 times [2018-01-25 06:07:02,827 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:07:02,828 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:07:02,828 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 06:07:02,828 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:07:02,828 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:07:02,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:07:02,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:07:02,912 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-25 06:07:02,913 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:07:02,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 06:07:02,913 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:07:02,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 06:07:02,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 06:07:02,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-25 06:07:02,914 INFO L87 Difference]: Start difference. First operand 138 states and 144 transitions. Second operand 8 states. [2018-01-25 06:07:02,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:07:02,960 INFO L93 Difference]: Finished difference Result 229 states and 238 transitions. [2018-01-25 06:07:02,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 06:07:02,961 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-01-25 06:07:02,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:07:02,962 INFO L225 Difference]: With dead ends: 229 [2018-01-25 06:07:02,962 INFO L226 Difference]: Without dead ends: 138 [2018-01-25 06:07:02,962 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:07:02,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-01-25 06:07:02,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-01-25 06:07:02,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-01-25 06:07:02,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 143 transitions. [2018-01-25 06:07:02,976 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 143 transitions. Word has length 47 [2018-01-25 06:07:02,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:07:02,976 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 143 transitions. [2018-01-25 06:07:02,976 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 06:07:02,976 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2018-01-25 06:07:02,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-25 06:07:02,977 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:07:02,977 INFO L322 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:07:02,977 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:07:02,977 INFO L82 PathProgramCache]: Analyzing trace with hash -792817057, now seen corresponding path program 1 times [2018-01-25 06:07:02,977 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:07:02,978 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:07:02,978 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:07:02,978 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:07:02,978 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:07:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:07:02,987 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:07:03,103 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:07:03,103 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:07:03,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-25 06:07:03,103 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:07:03,103 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 06:07:03,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 06:07:03,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:07:03,104 INFO L87 Difference]: Start difference. First operand 138 states and 143 transitions. Second operand 10 states. [2018-01-25 06:07:03,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:07:03,196 INFO L93 Difference]: Finished difference Result 231 states and 239 transitions. [2018-01-25 06:07:03,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 06:07:03,197 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2018-01-25 06:07:03,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:07:03,199 INFO L225 Difference]: With dead ends: 231 [2018-01-25 06:07:03,199 INFO L226 Difference]: Without dead ends: 138 [2018-01-25 06:07:03,199 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:07:03,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-01-25 06:07:03,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-01-25 06:07:03,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-01-25 06:07:03,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 142 transitions. [2018-01-25 06:07:03,218 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 142 transitions. Word has length 52 [2018-01-25 06:07:03,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:07:03,218 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 142 transitions. [2018-01-25 06:07:03,218 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 06:07:03,218 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 142 transitions. [2018-01-25 06:07:03,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-25 06:07:03,219 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:07:03,219 INFO L322 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:07:03,219 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:07:03,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1949575069, now seen corresponding path program 1 times [2018-01-25 06:07:03,220 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:07:03,221 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:07:03,221 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:07:03,221 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:07:03,221 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:07:03,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:07:03,240 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:07:03,454 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:07:03,454 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:07:03,454 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-25 06:07:03,454 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:07:03,455 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-25 06:07:03,455 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-25 06:07:03,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-01-25 06:07:03,455 INFO L87 Difference]: Start difference. First operand 138 states and 142 transitions. Second operand 15 states. [2018-01-25 06:07:03,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:07:03,824 INFO L93 Difference]: Finished difference Result 138 states and 142 transitions. [2018-01-25 06:07:03,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-25 06:07:03,824 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 63 [2018-01-25 06:07:03,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:07:03,825 INFO L225 Difference]: With dead ends: 138 [2018-01-25 06:07:03,825 INFO L226 Difference]: Without dead ends: 136 [2018-01-25 06:07:03,826 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-01-25 06:07:03,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-01-25 06:07:03,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-01-25 06:07:03,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-01-25 06:07:03,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 140 transitions. [2018-01-25 06:07:03,838 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 140 transitions. Word has length 63 [2018-01-25 06:07:03,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:07:03,838 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 140 transitions. [2018-01-25 06:07:03,838 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-25 06:07:03,838 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 140 transitions. [2018-01-25 06:07:03,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-25 06:07:03,839 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:07:03,839 INFO L322 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:07:03,839 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:07:03,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1949575070, now seen corresponding path program 1 times [2018-01-25 06:07:03,839 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:07:03,840 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:07:03,840 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:07:03,841 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:07:03,841 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:07:03,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:07:03,860 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:07:03,938 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:07:03,938 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:07:03,938 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:07:03,939 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 64 with the following transitions: [2018-01-25 06:07:03,939 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [12], [13], [17], [31], [36], [38], [52], [54], [58], [62], [65], [66], [67], [70], [71], [72], [76], [78], [79], [90], [93], [121], [122], [125], [128], [129], [132], [133], [134], [136], [137], [138], [143], [146], [153], [160], [161], [162], [163], [164], [165], [166], [168], [172], [173], [176], [177], [178], [182], [183], [184], [185], [194], [196], [198], [199], [200] [2018-01-25 06:07:03,941 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:07:03,941 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:07:07,716 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 06:07:07,716 INFO L268 AbstractInterpreter]: Visited 61 different actions 69 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 22 variables. [2018-01-25 06:07:07,723 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 06:07:07,724 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:07:07,724 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:07:07,733 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:07:07,733 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:07:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:07:07,771 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:07:07,781 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:07:07,781 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:07:07,861 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:07:07,881 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:07:07,882 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:07:07,885 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:07:07,885 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:07:07,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:07:07,948 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:07:07,953 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:07:07,953 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:07:08,021 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:07:08,023 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 06:07:08,023 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 13 [2018-01-25 06:07:08,023 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 06:07:08,023 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 06:07:08,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 06:07:08,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-01-25 06:07:08,024 INFO L87 Difference]: Start difference. First operand 136 states and 140 transitions. Second operand 8 states. [2018-01-25 06:07:08,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:07:08,051 INFO L93 Difference]: Finished difference Result 248 states and 256 transitions. [2018-01-25 06:07:08,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 06:07:08,051 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2018-01-25 06:07:08,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:07:08,052 INFO L225 Difference]: With dead ends: 248 [2018-01-25 06:07:08,052 INFO L226 Difference]: Without dead ends: 137 [2018-01-25 06:07:08,052 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 244 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:07:08,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-25 06:07:08,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-01-25 06:07:08,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-01-25 06:07:08,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 141 transitions. [2018-01-25 06:07:08,066 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 141 transitions. Word has length 63 [2018-01-25 06:07:08,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:07:08,067 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 141 transitions. [2018-01-25 06:07:08,067 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 06:07:08,067 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2018-01-25 06:07:08,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-25 06:07:08,067 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:07:08,067 INFO L322 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:07:08,068 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:07:08,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1497491836, now seen corresponding path program 2 times [2018-01-25 06:07:08,068 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:07:08,069 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:07:08,069 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:07:08,069 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:07:08,069 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:07:08,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:07:08,085 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:07:08,147 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:07:08,148 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:07:08,148 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:07:08,148 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 06:07:08,148 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:07:08,148 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:07:08,148 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:07:08,154 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 06:07:08,154 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 06:07:08,190 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:07:08,196 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:07:08,200 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:07:08,210 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:07:08,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:07:08,232 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:07:08,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:07:08,242 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:07:08,243 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-25 06:07:08,942 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:07:08,942 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:07:09,917 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:07:09,938 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 06:07:09,938 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20, 18] imperfect sequences [8] total 44 [2018-01-25 06:07:09,938 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:07:09,938 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-25 06:07:09,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-25 06:07:09,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1746, Unknown=0, NotChecked=0, Total=1892 [2018-01-25 06:07:09,939 INFO L87 Difference]: Start difference. First operand 137 states and 141 transitions. Second operand 21 states. [2018-01-25 06:07:11,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:07:11,447 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2018-01-25 06:07:11,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-25 06:07:11,447 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-01-25 06:07:11,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:07:11,448 INFO L225 Difference]: With dead ends: 137 [2018-01-25 06:07:11,448 INFO L226 Difference]: Without dead ends: 135 [2018-01-25 06:07:11,449 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=195, Invalid=2255, Unknown=0, NotChecked=0, Total=2450 [2018-01-25 06:07:11,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-25 06:07:11,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-01-25 06:07:11,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-25 06:07:11,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2018-01-25 06:07:11,466 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 64 [2018-01-25 06:07:11,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:07:11,467 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2018-01-25 06:07:11,467 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-25 06:07:11,467 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2018-01-25 06:07:11,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-25 06:07:11,468 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:07:11,468 INFO L322 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:07:11,468 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:07:11,468 INFO L82 PathProgramCache]: Analyzing trace with hash -938431803, now seen corresponding path program 1 times [2018-01-25 06:07:11,468 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:07:11,469 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:07:11,469 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 06:07:11,470 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:07:11,470 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:07:11,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:07:11,490 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:07:11,635 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:07:11,636 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:07:11,636 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-25 06:07:11,636 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:07:11,636 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-25 06:07:11,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-25 06:07:11,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-01-25 06:07:11,637 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand 13 states. [2018-01-25 06:07:11,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:07:11,787 INFO L93 Difference]: Finished difference Result 198 states and 204 transitions. [2018-01-25 06:07:11,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-25 06:07:11,787 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 75 [2018-01-25 06:07:11,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:07:11,788 INFO L225 Difference]: With dead ends: 198 [2018-01-25 06:07:11,789 INFO L226 Difference]: Without dead ends: 135 [2018-01-25 06:07:11,789 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-01-25 06:07:11,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-25 06:07:11,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-01-25 06:07:11,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-25 06:07:11,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 138 transitions. [2018-01-25 06:07:11,807 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 138 transitions. Word has length 75 [2018-01-25 06:07:11,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:07:11,807 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 138 transitions. [2018-01-25 06:07:11,807 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-25 06:07:11,807 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 138 transitions. [2018-01-25 06:07:11,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-01-25 06:07:11,809 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:07:11,809 INFO L322 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:07:11,809 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:07:11,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1956264887, now seen corresponding path program 1 times [2018-01-25 06:07:11,809 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:07:11,810 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:07:11,810 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:07:11,810 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:07:11,811 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:07:11,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:07:11,834 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:07:12,171 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:07:12,171 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:07:12,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-01-25 06:07:12,171 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:07:12,172 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-25 06:07:12,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-25 06:07:12,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2018-01-25 06:07:12,172 INFO L87 Difference]: Start difference. First operand 135 states and 138 transitions. Second operand 20 states. [2018-01-25 06:07:12,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:07:12,586 INFO L93 Difference]: Finished difference Result 144 states and 147 transitions. [2018-01-25 06:07:12,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-25 06:07:12,586 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 88 [2018-01-25 06:07:12,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:07:12,587 INFO L225 Difference]: With dead ends: 144 [2018-01-25 06:07:12,587 INFO L226 Difference]: Without dead ends: 142 [2018-01-25 06:07:12,588 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2018-01-25 06:07:12,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-01-25 06:07:12,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 133. [2018-01-25 06:07:12,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-25 06:07:12,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 136 transitions. [2018-01-25 06:07:12,601 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 136 transitions. Word has length 88 [2018-01-25 06:07:12,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:07:12,601 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 136 transitions. [2018-01-25 06:07:12,601 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-25 06:07:12,601 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2018-01-25 06:07:12,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-01-25 06:07:12,602 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:07:12,602 INFO L322 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:07:12,603 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:07:12,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1956264888, now seen corresponding path program 1 times [2018-01-25 06:07:12,603 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:07:12,604 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:07:12,604 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:07:12,604 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:07:12,604 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:07:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:07:12,628 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:07:12,707 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:07:12,707 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:07:12,707 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:07:12,708 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 89 with the following transitions: [2018-01-25 06:07:12,708 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [12], [13], [17], [19], [20], [21], [24], [31], [36], [38], [39], [42], [52], [54], [58], [62], [65], [66], [67], [70], [71], [72], [76], [78], [79], [80], [90], [91], [94], [95], [98], [99], [121], [122], [125], [128], [129], [132], [133], [134], [136], [137], [138], [139], [143], [146], [151], [152], [153], [155], [156], [160], [161], [162], [163], [164], [165], [166], [168], [169], [170], [172], [173], [176], [177], [178], [179], [180], [182], [183], [184], [185], [186], [192], [194], [195], [196], [197], [198], [199], [200] [2018-01-25 06:07:12,711 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:07:12,711 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:07:15,770 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 06:07:15,770 INFO L268 AbstractInterpreter]: Visited 85 different actions 93 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 26 variables. [2018-01-25 06:07:15,774 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 06:07:15,774 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:07:15,774 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:07:15,791 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:07:15,791 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:07:15,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:07:15,849 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:07:15,956 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:07:15,956 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:07:16,428 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:07:16,450 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:07:16,450 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:07:16,466 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:07:16,466 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:07:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:07:16,566 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:07:16,574 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:07:16,575 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:07:16,718 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:07:16,721 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 06:07:16,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8] total 15 [2018-01-25 06:07:16,722 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 06:07:16,722 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 06:07:16,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 06:07:16,723 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-01-25 06:07:16,723 INFO L87 Difference]: Start difference. First operand 133 states and 136 transitions. Second operand 9 states. [2018-01-25 06:07:16,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:07:16,805 INFO L93 Difference]: Finished difference Result 241 states and 247 transitions. [2018-01-25 06:07:16,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 06:07:16,805 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2018-01-25 06:07:16,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:07:16,806 INFO L225 Difference]: With dead ends: 241 [2018-01-25 06:07:16,806 INFO L226 Difference]: Without dead ends: 134 [2018-01-25 06:07:16,807 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 343 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=137, Unknown=0, NotChecked=0, Total=240 [2018-01-25 06:07:16,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-01-25 06:07:16,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-01-25 06:07:16,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-01-25 06:07:16,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 137 transitions. [2018-01-25 06:07:16,826 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 137 transitions. Word has length 88 [2018-01-25 06:07:16,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:07:16,827 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 137 transitions. [2018-01-25 06:07:16,827 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 06:07:16,827 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 137 transitions. [2018-01-25 06:07:16,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-01-25 06:07:16,828 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:07:16,828 INFO L322 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:07:16,828 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:07:16,828 INFO L82 PathProgramCache]: Analyzing trace with hash -632442982, now seen corresponding path program 2 times [2018-01-25 06:07:16,828 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:07:16,829 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:07:16,829 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:07:16,829 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:07:16,830 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:07:16,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:07:16,853 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:07:16,924 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:07:16,925 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:07:16,925 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:07:16,925 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 06:07:16,925 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:07:16,925 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:07:16,925 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:07:16,934 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 06:07:16,934 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 06:07:16,979 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:07:16,988 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:07:16,993 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:07:16,998 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:07:16,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:07:17,015 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:07:17,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:07:17,058 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:07:17,058 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-25 06:07:17,983 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:07:17,983 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:07:22,627 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:07:22,647 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 06:07:22,648 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20, 18] imperfect sequences [9] total 45 [2018-01-25 06:07:22,648 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:07:22,648 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-25 06:07:22,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-25 06:07:22,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1825, Unknown=2, NotChecked=0, Total=1980 [2018-01-25 06:07:22,649 INFO L87 Difference]: Start difference. First operand 134 states and 137 transitions. Second operand 21 states. Received shutdown request... [2018-01-25 06:07:24,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 06:07:24,713 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 06:07:24,717 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 06:07:24,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 06:07:24 BoogieIcfgContainer [2018-01-25 06:07:24,718 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 06:07:24,719 INFO L168 Benchmark]: Toolchain (without parser) took 42938.53 ms. Allocated memory was 298.3 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 257.4 MB in the beginning and 435.0 MB in the end (delta: -177.6 MB). Peak memory consumption was 910.3 MB. Max. memory is 5.3 GB. [2018-01-25 06:07:24,719 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 298.3 MB. Free memory is still 263.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 06:07:24,720 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.65 ms. Allocated memory is still 298.3 MB. Free memory was 257.4 MB in the beginning and 243.3 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 5.3 GB. [2018-01-25 06:07:24,720 INFO L168 Benchmark]: Boogie Preprocessor took 40.70 ms. Allocated memory is still 298.3 MB. Free memory was 243.3 MB in the beginning and 241.3 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:07:24,720 INFO L168 Benchmark]: RCFGBuilder took 519.52 ms. Allocated memory is still 298.3 MB. Free memory was 241.3 MB in the beginning and 204.8 MB in the end (delta: 36.5 MB). Peak memory consumption was 36.5 MB. Max. memory is 5.3 GB. [2018-01-25 06:07:24,720 INFO L168 Benchmark]: TraceAbstraction took 42109.49 ms. Allocated memory was 298.3 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 204.8 MB in the beginning and 435.0 MB in the end (delta: -230.2 MB). Peak memory consumption was 857.7 MB. Max. memory is 5.3 GB. [2018-01-25 06:07:24,722 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 298.3 MB. Free memory is still 263.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 260.65 ms. Allocated memory is still 298.3 MB. Free memory was 257.4 MB in the beginning and 243.3 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.70 ms. Allocated memory is still 298.3 MB. Free memory was 243.3 MB in the beginning and 241.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 519.52 ms. Allocated memory is still 298.3 MB. Free memory was 241.3 MB in the beginning and 204.8 MB in the end (delta: 36.5 MB). Peak memory consumption was 36.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 42109.49 ms. Allocated memory was 298.3 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 204.8 MB in the beginning and 435.0 MB in the end (delta: -230.2 MB). Peak memory consumption was 857.7 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.554487 RENAME_VARIABLES(MILLISECONDS) : 0.104860 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.225083 PROJECTAWAY(MILLISECONDS) : 0.061627 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.098823 DISJOIN(MILLISECONDS) : 0.751178 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.132159 ADD_EQUALITY(MILLISECONDS) : 0.022033 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.007594 #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.499886 RENAME_VARIABLES(MILLISECONDS) : 0.103597 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.204483 PROJECTAWAY(MILLISECONDS) : 0.043351 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.048766 DISJOIN(MILLISECONDS) : 0.670609 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.130831 ADD_EQUALITY(MILLISECONDS) : 0.021317 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.005535 #CONJOIN_DISJUNCTIVE : 96 #RENAME_VARIABLES : 160 #UNFREEZE : 0 #CONJOIN : 203 #PROJECTAWAY : 159 #ADD_WEAK_EQUALITY : 15 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 156 #ADD_EQUALITY : 128 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 60 LocStat_MAX_WEQGRAPH_SIZE : 6 LocStat_MAX_SIZEOF_WEQEDGELABEL : 3 LocStat_NO_SUPPORTING_EQUALITIES : 469 LocStat_NO_SUPPORTING_DISEQUALITIES : 51 LocStat_NO_DISJUNCTIONS : -120 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 89 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 2 TransStat_NO_SUPPORTING_EQUALITIES : 174 TransStat_NO_SUPPORTING_DISEQUALITIES : 11 TransStat_NO_DISJUNCTIONS : 94 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.397846 RENAME_VARIABLES(MILLISECONDS) : 0.077632 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.167426 PROJECTAWAY(MILLISECONDS) : 0.034227 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.040017 DISJOIN(MILLISECONDS) : 0.766743 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.098313 ADD_EQUALITY(MILLISECONDS) : 0.015587 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.007152 #CONJOIN_DISJUNCTIVE : 138 #RENAME_VARIABLES : 223 #UNFREEZE : 0 #CONJOIN : 294 #PROJECTAWAY : 230 #ADD_WEAK_EQUALITY : 27 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 218 #ADD_EQUALITY : 190 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 10 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 84 LocStat_MAX_WEQGRAPH_SIZE : 6 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 693 LocStat_NO_SUPPORTING_DISEQUALITIES : 75 LocStat_NO_DISJUNCTIONS : -168 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 121 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 243 TransStat_NO_SUPPORTING_DISEQUALITIES : 13 TransStat_NO_DISJUNCTIONS : 127 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.225678 RENAME_VARIABLES(MILLISECONDS) : 0.050172 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.094891 PROJECTAWAY(MILLISECONDS) : 0.020761 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.034538 DISJOIN(MILLISECONDS) : 0.379219 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.063033 ADD_EQUALITY(MILLISECONDS) : 0.011450 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.003748 #CONJOIN_DISJUNCTIVE : 183 #RENAME_VARIABLES : 292 #UNFREEZE : 0 #CONJOIN : 399 #PROJECTAWAY : 307 #ADD_WEAK_EQUALITY : 33 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 286 #ADD_EQUALITY : 264 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 12 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1294). Cancelled while BasicCegarLoop was constructing difference of abstraction (134states) and interpolant automaton (currently 3 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1294). Cancelled while BasicCegarLoop was constructing difference of abstraction (134states) and interpolant automaton (currently 3 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1411). Cancelled while BasicCegarLoop was constructing difference of abstraction (134states) and interpolant automaton (currently 3 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1411). Cancelled while BasicCegarLoop was constructing difference of abstraction (134states) and interpolant automaton (currently 3 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1265). Cancelled while BasicCegarLoop was constructing difference of abstraction (134states) and interpolant automaton (currently 3 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1265). Cancelled while BasicCegarLoop was constructing difference of abstraction (134states) and interpolant automaton (currently 3 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1267). Cancelled while BasicCegarLoop was constructing difference of abstraction (134states) and interpolant automaton (currently 3 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1267). Cancelled while BasicCegarLoop was constructing difference of abstraction (134states) and interpolant automaton (currently 3 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1256). Cancelled while BasicCegarLoop was constructing difference of abstraction (134states) and interpolant automaton (currently 3 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1256). Cancelled while BasicCegarLoop was constructing difference of abstraction (134states) and interpolant automaton (currently 3 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1258). Cancelled while BasicCegarLoop was constructing difference of abstraction (134states) and interpolant automaton (currently 3 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1258). Cancelled while BasicCegarLoop was constructing difference of abstraction (134states) and interpolant automaton (currently 3 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was constructing difference of abstraction (134states) and interpolant automaton (currently 3 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was constructing difference of abstraction (134states) and interpolant automaton (currently 3 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was constructing difference of abstraction (134states) and interpolant automaton (currently 3 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was constructing difference of abstraction (134states) and interpolant automaton (currently 3 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1339). Cancelled while BasicCegarLoop was constructing difference of abstraction (134states) and interpolant automaton (currently 3 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1339). Cancelled while BasicCegarLoop was constructing difference of abstraction (134states) and interpolant automaton (currently 3 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1452]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (134states) and interpolant automaton (currently 3 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1099). Cancelled while BasicCegarLoop was constructing difference of abstraction (134states) and interpolant automaton (currently 3 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1100). Cancelled while BasicCegarLoop was constructing difference of abstraction (134states) and interpolant automaton (currently 3 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1100). Cancelled while BasicCegarLoop was constructing difference of abstraction (134states) and interpolant automaton (currently 3 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1099). Cancelled while BasicCegarLoop was constructing difference of abstraction (134states) and interpolant automaton (currently 3 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - StatisticsResult: Ultimate Automizer benchmark data CFG has 22 procedures, 146 locations, 23 error locations. TIMEOUT Result, 42.0s OverallTime, 23 OverallIterations, 5 TraceHistogramMax, 12.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2980 SDtfs, 773 SDslu, 16819 SDs, 0 SdLazy, 5060 SolverSat, 150 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 8.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1603 GetRequests, 1243 SyntacticMatches, 18 SemanticMatches, 341 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2005 ImplicationChecksByTransitivity, 13.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=164occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 11.8s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 97 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 15.7s InterpolantComputationTime, 1779 NumberOfCodeBlocks, 1765 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2417 ConstructedInterpolants, 179 QuantifiedInterpolants, 597992 SizeOfPredicates, 66 NumberOfNonLiveVariables, 3204 ConjunctsInSsa, 265 ConjunctsInUnsatCore, 47 InterpolantComputations, 23 PerfectInterpolantSequences, 109/243 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_4_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_06-07-24-734.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_4_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_06-07-24-734.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_4_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_06-07-24-734.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_4_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_06-07-24-734.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_4_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_06-07-24-734.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_4_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-25_06-07-24-734.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_4_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-25_06-07-24-734.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_4_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-25_06-07-24-734.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_4_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-25_06-07-24-734.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_4_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_06-07-24-734.csv Completed graceful shutdown