java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_5_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 15:52:11,724 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 15:52:11,745 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 15:52:11,758 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 15:52:11,758 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 15:52:11,759 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 15:52:11,760 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 15:52:11,761 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 15:52:11,763 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 15:52:11,763 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 15:52:11,764 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 15:52:11,764 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 15:52:11,764 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 15:52:11,765 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 15:52:11,766 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 15:52:11,769 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 15:52:11,771 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 15:52:11,773 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 15:52:11,775 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 15:52:11,776 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 15:52:11,778 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 15:52:11,778 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 15:52:11,779 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 15:52:11,780 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 15:52:11,781 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 15:52:11,782 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 15:52:11,782 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 15:52:11,783 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 15:52:11,783 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 15:52:11,783 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 15:52:11,784 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 15:52:11,784 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf [2018-01-24 15:52:11,794 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 15:52:11,795 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 15:52:11,796 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 15:52:11,796 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 15:52:11,796 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 15:52:11,796 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 15:52:11,797 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 15:52:11,797 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 15:52:11,797 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 15:52:11,798 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 15:52:11,798 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 15:52:11,798 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 15:52:11,798 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 15:52:11,799 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 15:52:11,799 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 15:52:11,799 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 15:52:11,799 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 15:52:11,799 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 15:52:11,800 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 15:52:11,800 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 15:52:11,800 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 15:52:11,800 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 15:52:11,800 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 15:52:11,800 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 15:52:11,801 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 15:52:11,801 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 15:52:11,801 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 15:52:11,801 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 15:52:11,802 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 15:52:11,802 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 15:52:11,802 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 15:52:11,802 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 15:52:11,802 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 15:52:11,803 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 15:52:11,803 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 15:52:11,840 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 15:52:11,852 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 15:52:11,855 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 15:52:11,857 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 15:52:11,857 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 15:52:11,858 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_5_false-valid-deref.i [2018-01-24 15:52:12,042 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 15:52:12,048 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 15:52:12,049 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 15:52:12,050 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 15:52:12,055 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 15:52:12,056 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:52:12" (1/1) ... [2018-01-24 15:52:12,060 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@388a8c3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:52:12, skipping insertion in model container [2018-01-24 15:52:12,060 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:52:12" (1/1) ... [2018-01-24 15:52:12,080 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:52:12,134 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:52:12,255 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:52:12,277 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:52:12,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:52:12 WrapperNode [2018-01-24 15:52:12,288 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 15:52:12,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 15:52:12,290 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 15:52:12,290 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 15:52:12,307 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:52:12" (1/1) ... [2018-01-24 15:52:12,307 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:52:12" (1/1) ... [2018-01-24 15:52:12,319 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:52:12" (1/1) ... [2018-01-24 15:52:12,319 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:52:12" (1/1) ... [2018-01-24 15:52:12,328 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:52:12" (1/1) ... [2018-01-24 15:52:12,331 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:52:12" (1/1) ... [2018-01-24 15:52:12,333 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:52:12" (1/1) ... [2018-01-24 15:52:12,336 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 15:52:12,336 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 15:52:12,337 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 15:52:12,337 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 15:52:12,338 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:52:12" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 15:52:12,385 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 15:52:12,385 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 15:52:12,385 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-01-24 15:52:12,385 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 15:52:12,385 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-01-24 15:52:12,385 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-01-24 15:52:12,385 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-01-24 15:52:12,385 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-01-24 15:52:12,385 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-01-24 15:52:12,386 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-01-24 15:52:12,386 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-01-24 15:52:12,386 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-01-24 15:52:12,386 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-01-24 15:52:12,386 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-01-24 15:52:12,386 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-01-24 15:52:12,386 INFO L136 BoogieDeclarations]: Found implementation of procedure f_22_put [2018-01-24 15:52:12,386 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 15:52:12,386 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 15:52:12,387 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 15:52:12,387 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 15:52:12,387 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 15:52:12,387 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 15:52:12,387 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 15:52:12,388 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 15:52:12,388 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 15:52:12,388 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-24 15:52:12,388 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-24 15:52:12,388 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 15:52:12,388 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 15:52:12,389 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 15:52:12,389 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-24 15:52:12,389 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 15:52:12,389 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-01-24 15:52:12,389 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-01-24 15:52:12,389 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-01-24 15:52:12,390 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-01-24 15:52:12,390 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-01-24 15:52:12,390 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-01-24 15:52:12,390 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-01-24 15:52:12,390 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-01-24 15:52:12,390 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-01-24 15:52:12,390 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-01-24 15:52:12,391 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-01-24 15:52:12,391 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-01-24 15:52:12,391 INFO L128 BoogieDeclarations]: Found specification of procedure f_22_put [2018-01-24 15:52:12,391 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 15:52:12,391 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 15:52:12,391 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 15:52:12,391 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 15:52:12,651 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-24 15:52:12,794 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 15:52:12,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:52:12 BoogieIcfgContainer [2018-01-24 15:52:12,795 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 15:52:12,796 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 15:52:12,796 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 15:52:12,799 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 15:52:12,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 03:52:12" (1/3) ... [2018-01-24 15:52:12,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ac95cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:52:12, skipping insertion in model container [2018-01-24 15:52:12,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:52:12" (2/3) ... [2018-01-24 15:52:12,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ac95cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:52:12, skipping insertion in model container [2018-01-24 15:52:12,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:52:12" (3/3) ... [2018-01-24 15:52:12,803 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test22_5_false-valid-deref.i [2018-01-24 15:52:12,813 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 15:52:12,821 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-01-24 15:52:12,874 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 15:52:12,874 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 15:52:12,874 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 15:52:12,874 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 15:52:12,875 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 15:52:12,875 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 15:52:12,875 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 15:52:12,875 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 15:52:12,876 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 15:52:12,901 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states. [2018-01-24 15:52:12,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 15:52:12,909 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:52:12,911 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:52:12,911 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_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:52:12,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1211515492, now seen corresponding path program 1 times [2018-01-24 15:52:12,920 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:52:12,973 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:12,973 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:12,973 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:12,973 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:52:13,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:13,034 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:52:13,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:52:13,169 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:52:13,169 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:52:13,169 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:52:13,240 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:52:13,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:52:13,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:52:13,254 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 5 states. [2018-01-24 15:52:13,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:52:13,340 INFO L93 Difference]: Finished difference Result 234 states and 249 transitions. [2018-01-24 15:52:13,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:52:13,342 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-24 15:52:13,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:52:13,356 INFO L225 Difference]: With dead ends: 234 [2018-01-24 15:52:13,356 INFO L226 Difference]: Without dead ends: 126 [2018-01-24 15:52:13,360 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:52:13,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-24 15:52:13,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2018-01-24 15:52:13,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-24 15:52:13,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2018-01-24 15:52:13,407 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 17 [2018-01-24 15:52:13,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:52:13,408 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2018-01-24 15:52:13,408 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:52:13,408 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2018-01-24 15:52:13,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 15:52:13,409 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:52:13,409 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:52:13,409 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_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:52:13,409 INFO L82 PathProgramCache]: Analyzing trace with hash 774524518, now seen corresponding path program 1 times [2018-01-24 15:52:13,409 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:52:13,410 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:13,411 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:13,411 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:13,411 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:52:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:13,433 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:52:13,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:52:13,498 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:52:13,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:52:13,499 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:52:13,501 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:52:13,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:52:13,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:52:13,501 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand 6 states. [2018-01-24 15:52:13,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:52:13,703 INFO L93 Difference]: Finished difference Result 126 states and 134 transitions. [2018-01-24 15:52:13,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:52:13,703 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 15:52:13,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:52:13,705 INFO L225 Difference]: With dead ends: 126 [2018-01-24 15:52:13,705 INFO L226 Difference]: Without dead ends: 125 [2018-01-24 15:52:13,706 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:52:13,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-24 15:52:13,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-01-24 15:52:13,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-24 15:52:13,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2018-01-24 15:52:13,718 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 19 [2018-01-24 15:52:13,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:52:13,719 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2018-01-24 15:52:13,719 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:52:13,719 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2018-01-24 15:52:13,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 15:52:13,720 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:52:13,720 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:52:13,720 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_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:52:13,720 INFO L82 PathProgramCache]: Analyzing trace with hash 774524519, now seen corresponding path program 1 times [2018-01-24 15:52:13,720 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:52:13,722 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:13,722 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:13,722 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:13,722 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:52:13,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:13,744 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:52:13,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:52:13,962 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:52:13,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 15:52:13,962 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:52:13,963 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 15:52:13,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 15:52:13,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:52:13,963 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand 7 states. [2018-01-24 15:52:14,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:52:14,209 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2018-01-24 15:52:14,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 15:52:14,209 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-01-24 15:52:14,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:52:14,211 INFO L225 Difference]: With dead ends: 125 [2018-01-24 15:52:14,212 INFO L226 Difference]: Without dead ends: 124 [2018-01-24 15:52:14,212 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-24 15:52:14,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-24 15:52:14,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-01-24 15:52:14,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-24 15:52:14,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2018-01-24 15:52:14,227 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 19 [2018-01-24 15:52:14,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:52:14,227 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2018-01-24 15:52:14,228 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 15:52:14,228 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2018-01-24 15:52:14,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 15:52:14,229 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:52:14,229 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] [2018-01-24 15:52:14,230 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_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:52:14,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1886266821, now seen corresponding path program 1 times [2018-01-24 15:52:14,230 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:52:14,231 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:14,232 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:14,232 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:14,232 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:52:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:14,260 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:52:14,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:52:14,385 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:52:14,385 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 15:52:14,385 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:52:14,386 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 15:52:14,386 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 15:52:14,386 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-24 15:52:14,387 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand 9 states. [2018-01-24 15:52:14,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:52:14,566 INFO L93 Difference]: Finished difference Result 198 states and 213 transitions. [2018-01-24 15:52:14,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 15:52:14,567 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-01-24 15:52:14,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:52:14,568 INFO L225 Difference]: With dead ends: 198 [2018-01-24 15:52:14,569 INFO L226 Difference]: Without dead ends: 139 [2018-01-24 15:52:14,569 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-24 15:52:14,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-01-24 15:52:14,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2018-01-24 15:52:14,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-24 15:52:14,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 144 transitions. [2018-01-24 15:52:14,585 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 144 transitions. Word has length 31 [2018-01-24 15:52:14,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:52:14,586 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 144 transitions. [2018-01-24 15:52:14,586 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 15:52:14,586 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 144 transitions. [2018-01-24 15:52:14,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 15:52:14,588 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:52:14,588 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:52:14,588 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_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:52:14,588 INFO L82 PathProgramCache]: Analyzing trace with hash 107698799, now seen corresponding path program 1 times [2018-01-24 15:52:14,588 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:52:14,590 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:14,590 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:14,590 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:14,590 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:52:14,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:14,612 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:52:14,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:52:14,727 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:52:14,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 15:52:14,728 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:52:14,729 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 15:52:14,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 15:52:14,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 15:52:14,729 INFO L87 Difference]: Start difference. First operand 135 states and 144 transitions. Second operand 10 states. [2018-01-24 15:52:15,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:52:15,046 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2018-01-24 15:52:15,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 15:52:15,047 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-01-24 15:52:15,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:52:15,049 INFO L225 Difference]: With dead ends: 135 [2018-01-24 15:52:15,049 INFO L226 Difference]: Without dead ends: 134 [2018-01-24 15:52:15,049 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-01-24 15:52:15,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-01-24 15:52:15,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-01-24 15:52:15,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-01-24 15:52:15,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 143 transitions. [2018-01-24 15:52:15,063 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 143 transitions. Word has length 34 [2018-01-24 15:52:15,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:52:15,064 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 143 transitions. [2018-01-24 15:52:15,064 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 15:52:15,064 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 143 transitions. [2018-01-24 15:52:15,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 15:52:15,065 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:52:15,065 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:52:15,066 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_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:52:15,066 INFO L82 PathProgramCache]: Analyzing trace with hash 107698800, now seen corresponding path program 1 times [2018-01-24 15:52:15,066 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:52:15,068 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:15,068 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:15,068 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:15,068 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:52:15,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:15,087 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:52:15,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:52:15,122 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:52:15,122 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 15:52:15,122 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:52:15,123 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 15:52:15,123 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 15:52:15,123 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 15:52:15,123 INFO L87 Difference]: Start difference. First operand 134 states and 143 transitions. Second operand 4 states. [2018-01-24 15:52:15,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:52:15,158 INFO L93 Difference]: Finished difference Result 230 states and 245 transitions. [2018-01-24 15:52:15,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 15:52:15,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-01-24 15:52:15,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:52:15,161 INFO L225 Difference]: With dead ends: 230 [2018-01-24 15:52:15,161 INFO L226 Difference]: Without dead ends: 135 [2018-01-24 15:52:15,162 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:52:15,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-24 15:52:15,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-01-24 15:52:15,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-24 15:52:15,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 144 transitions. [2018-01-24 15:52:15,175 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 144 transitions. Word has length 34 [2018-01-24 15:52:15,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:52:15,175 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 144 transitions. [2018-01-24 15:52:15,175 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 15:52:15,175 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 144 transitions. [2018-01-24 15:52:15,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-24 15:52:15,176 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:52:15,177 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:52:15,177 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_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:52:15,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1590593736, now seen corresponding path program 1 times [2018-01-24 15:52:15,177 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:52:15,178 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:15,179 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:15,179 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:15,179 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:52:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:15,196 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:52:15,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:52:15,235 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:52:15,235 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:52:15,236 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-01-24 15:52:15,237 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [27], [32], [48], [54], [58], [62], [65], [67], [68], [72], [74], [75], [118], [121], [122], [123], [125], [126], [127], [135], [136], [137], [138], [139], [141], [145], [149], [155], [169], [170], [171] [2018-01-24 15:52:15,286 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:52:15,287 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:52:17,833 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:52:17,834 INFO L268 AbstractInterpreter]: Visited 35 different actions 43 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 21 variables. [2018-01-24 15:52:17,851 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:52:17,851 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:52:17,851 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:52:17,869 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:17,869 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:52:17,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:17,918 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:52:17,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:52:17,976 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:52:18,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:52:18,147 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:52:18,148 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:52:18,153 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:18,153 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:52:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:18,201 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:52:18,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:52:18,207 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:52:18,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:52:18,241 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:52:18,241 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5] total 9 [2018-01-24 15:52:18,242 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:52:18,242 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:52:18,242 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:52:18,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-01-24 15:52:18,243 INFO L87 Difference]: Start difference. First operand 135 states and 144 transitions. Second operand 6 states. [2018-01-24 15:52:18,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:52:18,305 INFO L93 Difference]: Finished difference Result 231 states and 246 transitions. [2018-01-24 15:52:18,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:52:18,306 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-24 15:52:18,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:52:18,308 INFO L225 Difference]: With dead ends: 231 [2018-01-24 15:52:18,308 INFO L226 Difference]: Without dead ends: 136 [2018-01-24 15:52:18,309 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 134 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-01-24 15:52:18,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-01-24 15:52:18,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-01-24 15:52:18,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-01-24 15:52:18,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 145 transitions. [2018-01-24 15:52:18,320 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 145 transitions. Word has length 35 [2018-01-24 15:52:18,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:52:18,321 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 145 transitions. [2018-01-24 15:52:18,321 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:52:18,321 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 145 transitions. [2018-01-24 15:52:18,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 15:52:18,322 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:52:18,322 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:52:18,322 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_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:52:18,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1596912496, now seen corresponding path program 2 times [2018-01-24 15:52:18,323 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:52:18,324 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:18,324 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:18,325 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:18,325 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:52:18,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:18,343 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:52:18,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:52:18,428 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:52:18,429 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:52:18,429 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:52:18,429 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:52:18,429 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:52:18,429 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:52:18,438 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:52:18,438 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:52:18,464 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:52:18,468 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:52:18,472 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:52:18,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-24 15:52:18,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:52:18,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-24 15:52:18,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:52:18,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 15:52:18,559 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-24 15:52:19,124 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 15:52:19,124 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:52:19,484 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 15:52:19,504 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 15:52:19,504 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14, 13] imperfect sequences [6] total 31 [2018-01-24 15:52:19,504 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:52:19,504 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 15:52:19,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 15:52:19,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=840, Unknown=0, NotChecked=0, Total=930 [2018-01-24 15:52:19,505 INFO L87 Difference]: Start difference. First operand 136 states and 145 transitions. Second operand 15 states. [2018-01-24 15:52:20,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:52:20,337 INFO L93 Difference]: Finished difference Result 153 states and 162 transitions. [2018-01-24 15:52:20,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 15:52:20,338 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2018-01-24 15:52:20,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:52:20,339 INFO L225 Difference]: With dead ends: 153 [2018-01-24 15:52:20,339 INFO L226 Difference]: Without dead ends: 152 [2018-01-24 15:52:20,340 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=118, Invalid=1072, Unknown=0, NotChecked=0, Total=1190 [2018-01-24 15:52:20,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-24 15:52:20,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 135. [2018-01-24 15:52:20,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-24 15:52:20,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 144 transitions. [2018-01-24 15:52:20,355 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 144 transitions. Word has length 36 [2018-01-24 15:52:20,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:52:20,356 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 144 transitions. [2018-01-24 15:52:20,356 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 15:52:20,356 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 144 transitions. [2018-01-24 15:52:20,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 15:52:20,357 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:52:20,358 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:52:20,358 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_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:52:20,358 INFO L82 PathProgramCache]: Analyzing trace with hash 2040634480, now seen corresponding path program 1 times [2018-01-24 15:52:20,358 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:52:20,359 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:20,359 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 15:52:20,360 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:20,360 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:52:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:20,369 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:52:20,410 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 15:52:20,410 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:52:20,411 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 15:52:20,411 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:52:20,411 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 15:52:20,412 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 15:52:20,412 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:52:20,412 INFO L87 Difference]: Start difference. First operand 135 states and 144 transitions. Second operand 3 states. [2018-01-24 15:52:20,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:52:20,502 INFO L93 Difference]: Finished difference Result 154 states and 165 transitions. [2018-01-24 15:52:20,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 15:52:20,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-01-24 15:52:20,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:52:20,503 INFO L225 Difference]: With dead ends: 154 [2018-01-24 15:52:20,504 INFO L226 Difference]: Without dead ends: 141 [2018-01-24 15:52:20,504 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:52:20,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-01-24 15:52:20,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 131. [2018-01-24 15:52:20,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-01-24 15:52:20,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 139 transitions. [2018-01-24 15:52:20,520 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 139 transitions. Word has length 36 [2018-01-24 15:52:20,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:52:20,520 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 139 transitions. [2018-01-24 15:52:20,520 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 15:52:20,521 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 139 transitions. [2018-01-24 15:52:20,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 15:52:20,522 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:52:20,522 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:52:20,522 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_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:52:20,522 INFO L82 PathProgramCache]: Analyzing trace with hash 746437934, now seen corresponding path program 1 times [2018-01-24 15:52:20,523 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:52:20,524 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:20,524 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:20,524 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:20,524 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:52:20,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:20,531 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:52:20,586 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 15:52:20,586 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:52:20,587 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 15:52:20,587 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:52:20,587 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:52:20,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:52:20,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:52:20,588 INFO L87 Difference]: Start difference. First operand 131 states and 139 transitions. Second operand 6 states. [2018-01-24 15:52:20,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:52:20,614 INFO L93 Difference]: Finished difference Result 135 states and 142 transitions. [2018-01-24 15:52:20,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:52:20,615 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-01-24 15:52:20,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:52:20,616 INFO L225 Difference]: With dead ends: 135 [2018-01-24 15:52:20,616 INFO L226 Difference]: Without dead ends: 118 [2018-01-24 15:52:20,616 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:52:20,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-24 15:52:20,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-01-24 15:52:20,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-24 15:52:20,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 124 transitions. [2018-01-24 15:52:20,629 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 124 transitions. Word has length 38 [2018-01-24 15:52:20,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:52:20,629 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 124 transitions. [2018-01-24 15:52:20,629 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:52:20,629 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2018-01-24 15:52:20,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 15:52:20,630 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:52:20,630 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:52:20,630 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_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:52:20,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1456559415, now seen corresponding path program 1 times [2018-01-24 15:52:20,630 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:52:20,631 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:20,631 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:20,631 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:20,631 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:52:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:20,644 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:52:20,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 15:52:20,744 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:52:20,744 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 15:52:20,744 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:52:20,745 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 15:52:20,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 15:52:20,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 15:52:20,745 INFO L87 Difference]: Start difference. First operand 118 states and 124 transitions. Second operand 10 states. [2018-01-24 15:52:20,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:52:20,968 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2018-01-24 15:52:20,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 15:52:20,968 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2018-01-24 15:52:20,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:52:20,970 INFO L225 Difference]: With dead ends: 118 [2018-01-24 15:52:20,970 INFO L226 Difference]: Without dead ends: 116 [2018-01-24 15:52:20,970 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-01-24 15:52:20,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-24 15:52:20,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-01-24 15:52:20,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-24 15:52:20,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 122 transitions. [2018-01-24 15:52:20,985 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 122 transitions. Word has length 41 [2018-01-24 15:52:20,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:52:20,985 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 122 transitions. [2018-01-24 15:52:20,985 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 15:52:20,985 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2018-01-24 15:52:20,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 15:52:20,986 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:52:20,986 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:52:20,986 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_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:52:20,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1456559416, now seen corresponding path program 1 times [2018-01-24 15:52:20,987 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:52:20,988 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:20,988 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:20,988 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:20,988 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:52:21,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:21,002 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:52:21,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:52:21,044 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:52:21,044 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:52:21,044 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-01-24 15:52:21,044 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [27], [32], [48], [54], [58], [62], [63], [66], [67], [68], [72], [74], [75], [107], [110], [118], [121], [122], [123], [125], [126], [127], [135], [136], [137], [138], [139], [141], [145], [149], [155], [156], [157], [169], [170], [171] [2018-01-24 15:52:21,046 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:52:21,047 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:52:23,973 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:52:23,973 INFO L268 AbstractInterpreter]: Visited 40 different actions 48 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 21 variables. [2018-01-24 15:52:23,988 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:52:23,988 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:52:23,988 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:52:23,995 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:23,996 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:52:24,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:24,032 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:52:24,061 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:52:24,062 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:52:24,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:52:24,177 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:52:24,177 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:52:24,185 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:24,185 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:52:24,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:24,252 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:52:24,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:52:24,257 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:52:24,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:52:24,319 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:52:24,319 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6] total 11 [2018-01-24 15:52:24,319 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:52:24,320 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 15:52:24,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 15:52:24,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-01-24 15:52:24,320 INFO L87 Difference]: Start difference. First operand 116 states and 122 transitions. Second operand 7 states. [2018-01-24 15:52:24,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:52:24,362 INFO L93 Difference]: Finished difference Result 209 states and 221 transitions. [2018-01-24 15:52:24,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:52:24,365 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-01-24 15:52:24,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:52:24,367 INFO L225 Difference]: With dead ends: 209 [2018-01-24 15:52:24,367 INFO L226 Difference]: Without dead ends: 117 [2018-01-24 15:52:24,367 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2018-01-24 15:52:24,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-24 15:52:24,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-01-24 15:52:24,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-24 15:52:24,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 123 transitions. [2018-01-24 15:52:24,384 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 123 transitions. Word has length 41 [2018-01-24 15:52:24,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:52:24,384 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 123 transitions. [2018-01-24 15:52:24,384 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 15:52:24,384 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2018-01-24 15:52:24,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-24 15:52:24,385 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:52:24,385 INFO L322 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:52:24,386 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_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:52:24,386 INFO L82 PathProgramCache]: Analyzing trace with hash -98646160, now seen corresponding path program 2 times [2018-01-24 15:52:24,386 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:52:24,387 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:24,387 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:24,387 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:24,387 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:52:24,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:24,404 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:52:24,474 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:52:24,474 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:52:24,475 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:52:24,475 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:52:24,475 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:52:24,475 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:52:24,475 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:52:24,481 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:52:24,482 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:52:24,509 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:52:24,512 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:52:24,516 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:52:24,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-24 15:52:24,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:52:24,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-24 15:52:24,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:52:24,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 15:52:24,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-24 15:52:25,140 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 15:52:25,140 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:52:26,059 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 15:52:26,080 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 15:52:26,080 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15, 13] imperfect sequences [7] total 33 [2018-01-24 15:52:26,080 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:52:26,080 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 15:52:26,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 15:52:26,081 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=951, Unknown=0, NotChecked=0, Total=1056 [2018-01-24 15:52:26,081 INFO L87 Difference]: Start difference. First operand 117 states and 123 transitions. Second operand 16 states. [2018-01-24 15:52:26,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:52:26,800 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2018-01-24 15:52:26,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 15:52:26,801 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2018-01-24 15:52:26,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:52:26,802 INFO L225 Difference]: With dead ends: 117 [2018-01-24 15:52:26,802 INFO L226 Difference]: Without dead ends: 115 [2018-01-24 15:52:26,802 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=136, Invalid=1196, Unknown=0, NotChecked=0, Total=1332 [2018-01-24 15:52:26,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-24 15:52:26,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-01-24 15:52:26,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-24 15:52:26,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2018-01-24 15:52:26,817 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 42 [2018-01-24 15:52:26,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:52:26,817 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2018-01-24 15:52:26,817 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 15:52:26,818 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2018-01-24 15:52:26,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-24 15:52:26,818 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:52:26,819 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] [2018-01-24 15:52:26,819 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_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:52:26,819 INFO L82 PathProgramCache]: Analyzing trace with hash 293114675, now seen corresponding path program 1 times [2018-01-24 15:52:26,819 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:52:26,820 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:26,820 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 15:52:26,821 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:26,821 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:52:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:26,836 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:52:26,912 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 15:52:26,912 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:52:26,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 15:52:26,913 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:52:26,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 15:52:26,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 15:52:26,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:52:26,914 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand 8 states. [2018-01-24 15:52:26,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:52:26,975 INFO L93 Difference]: Finished difference Result 183 states and 192 transitions. [2018-01-24 15:52:26,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 15:52:26,976 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-01-24 15:52:26,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:52:26,977 INFO L225 Difference]: With dead ends: 183 [2018-01-24 15:52:26,977 INFO L226 Difference]: Without dead ends: 115 [2018-01-24 15:52:26,978 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-24 15:52:26,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-24 15:52:26,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-01-24 15:52:26,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-24 15:52:26,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 120 transitions. [2018-01-24 15:52:26,990 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 120 transitions. Word has length 49 [2018-01-24 15:52:26,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:52:26,990 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 120 transitions. [2018-01-24 15:52:26,990 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 15:52:26,990 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 120 transitions. [2018-01-24 15:52:26,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-24 15:52:26,991 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:52:26,991 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] [2018-01-24 15:52:26,991 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_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:52:26,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1097015104, now seen corresponding path program 1 times [2018-01-24 15:52:26,991 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:52:26,992 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:26,992 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:26,992 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:26,992 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:52:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:27,003 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:52:27,096 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 15:52:27,097 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:52:27,097 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 15:52:27,097 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:52:27,097 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 15:52:27,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 15:52:27,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 15:52:27,098 INFO L87 Difference]: Start difference. First operand 115 states and 120 transitions. Second operand 10 states. [2018-01-24 15:52:27,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:52:27,171 INFO L93 Difference]: Finished difference Result 185 states and 193 transitions. [2018-01-24 15:52:27,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 15:52:27,171 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-01-24 15:52:27,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:52:27,172 INFO L225 Difference]: With dead ends: 185 [2018-01-24 15:52:27,172 INFO L226 Difference]: Without dead ends: 115 [2018-01-24 15:52:27,173 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-01-24 15:52:27,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-24 15:52:27,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-01-24 15:52:27,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-24 15:52:27,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 119 transitions. [2018-01-24 15:52:27,191 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 119 transitions. Word has length 54 [2018-01-24 15:52:27,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:52:27,191 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 119 transitions. [2018-01-24 15:52:27,192 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 15:52:27,192 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2018-01-24 15:52:27,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-24 15:52:27,193 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:52:27,193 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, 1, 1] [2018-01-24 15:52:27,193 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_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:52:27,193 INFO L82 PathProgramCache]: Analyzing trace with hash -399143288, now seen corresponding path program 1 times [2018-01-24 15:52:27,193 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:52:27,194 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:27,194 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:27,195 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:27,195 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:52:27,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:27,218 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:52:27,506 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 15:52:27,507 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:52:27,507 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-01-24 15:52:27,507 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:52:27,507 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-24 15:52:27,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-24 15:52:27,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2018-01-24 15:52:27,508 INFO L87 Difference]: Start difference. First operand 115 states and 119 transitions. Second operand 23 states. [2018-01-24 15:52:28,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:52:28,125 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2018-01-24 15:52:28,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-24 15:52:28,126 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 65 [2018-01-24 15:52:28,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:52:28,127 INFO L225 Difference]: With dead ends: 144 [2018-01-24 15:52:28,127 INFO L226 Difference]: Without dead ends: 142 [2018-01-24 15:52:28,127 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=853, Unknown=0, NotChecked=0, Total=930 [2018-01-24 15:52:28,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-01-24 15:52:28,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 137. [2018-01-24 15:52:28,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-01-24 15:52:28,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 147 transitions. [2018-01-24 15:52:28,144 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 147 transitions. Word has length 65 [2018-01-24 15:52:28,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:52:28,145 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 147 transitions. [2018-01-24 15:52:28,145 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-24 15:52:28,145 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 147 transitions. [2018-01-24 15:52:28,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-24 15:52:28,146 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:52:28,146 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, 1, 1] [2018-01-24 15:52:28,146 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_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:52:28,146 INFO L82 PathProgramCache]: Analyzing trace with hash -399143287, now seen corresponding path program 1 times [2018-01-24 15:52:28,147 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:52:28,148 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:28,148 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:28,148 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:28,148 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:52:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:28,171 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:52:28,240 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:52:28,240 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:52:28,241 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:52:28,241 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-01-24 15:52:28,241 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [12], [13], [17], [20], [27], [32], [34], [35], [38], [48], [50], [54], [58], [61], [62], [63], [66], [67], [68], [72], [74], [75], [76], [107], [108], [111], [114], [115], [118], [121], [122], [123], [125], [126], [127], [128], [135], [136], [137], [138], [139], [140], [141], [143], [145], [146], [149], [150], [151], [155], [156], [157], [158], [159], [165], [167], [169], [170], [171] [2018-01-24 15:52:28,244 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:52:28,244 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:52:30,996 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:52:30,996 INFO L268 AbstractInterpreter]: Visited 63 different actions 71 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 26 variables. [2018-01-24 15:52:31,005 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:52:31,006 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:52:31,006 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:52:31,025 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:31,025 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:52:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:31,080 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:52:31,119 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:52:31,119 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:52:31,223 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:52:31,244 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:52:31,244 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:52:31,247 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:31,247 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:52:31,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:31,319 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:52:31,326 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:52:31,326 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:52:31,396 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:52:31,398 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:52:31,398 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 13 [2018-01-24 15:52:31,398 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:52:31,399 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 15:52:31,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 15:52:31,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-01-24 15:52:31,399 INFO L87 Difference]: Start difference. First operand 137 states and 147 transitions. Second operand 8 states. [2018-01-24 15:52:31,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:52:31,435 INFO L93 Difference]: Finished difference Result 250 states and 270 transitions. [2018-01-24 15:52:31,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 15:52:31,436 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2018-01-24 15:52:31,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:52:31,437 INFO L225 Difference]: With dead ends: 250 [2018-01-24 15:52:31,437 INFO L226 Difference]: Without dead ends: 138 [2018-01-24 15:52:31,438 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 252 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=105, Unknown=0, NotChecked=0, Total=182 [2018-01-24 15:52:31,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-01-24 15:52:31,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-01-24 15:52:31,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-01-24 15:52:31,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 148 transitions. [2018-01-24 15:52:31,459 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 148 transitions. Word has length 65 [2018-01-24 15:52:31,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:52:31,460 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 148 transitions. [2018-01-24 15:52:31,460 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 15:52:31,460 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 148 transitions. [2018-01-24 15:52:31,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-24 15:52:31,461 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:52:31,461 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] [2018-01-24 15:52:31,461 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_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:52:31,461 INFO L82 PathProgramCache]: Analyzing trace with hash 559798465, now seen corresponding path program 2 times [2018-01-24 15:52:31,461 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:52:31,462 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:31,462 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:31,462 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:31,463 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:52:31,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:31,484 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:52:31,555 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:52:31,556 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:52:31,556 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:52:31,556 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:52:31,556 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:52:31,556 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:52:31,556 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:52:31,567 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:52:31,568 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:52:31,612 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:52:31,619 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:52:31,624 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:52:31,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-24 15:52:31,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:52:31,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-24 15:52:31,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:52:31,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 15:52:31,665 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-24 15:52:32,500 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 15:52:32,500 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:52:35,459 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 15:52:35,484 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 15:52:35,484 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22, 20] imperfect sequences [8] total 48 [2018-01-24 15:52:35,484 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:52:35,484 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-24 15:52:35,484 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-24 15:52:35,485 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2095, Unknown=1, NotChecked=0, Total=2256 [2018-01-24 15:52:35,485 INFO L87 Difference]: Start difference. First operand 138 states and 148 transitions. Second operand 23 states. [2018-01-24 15:52:36,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:52:36,541 INFO L93 Difference]: Finished difference Result 138 states and 148 transitions. [2018-01-24 15:52:36,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-24 15:52:36,541 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 66 [2018-01-24 15:52:36,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:52:36,543 INFO L225 Difference]: With dead ends: 138 [2018-01-24 15:52:36,543 INFO L226 Difference]: Without dead ends: 136 [2018-01-24 15:52:36,544 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=217, Invalid=2752, Unknown=1, NotChecked=0, Total=2970 [2018-01-24 15:52:36,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-01-24 15:52:36,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-01-24 15:52:36,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-01-24 15:52:36,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 144 transitions. [2018-01-24 15:52:36,568 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 144 transitions. Word has length 66 [2018-01-24 15:52:36,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:52:36,569 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 144 transitions. [2018-01-24 15:52:36,569 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-24 15:52:36,569 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 144 transitions. [2018-01-24 15:52:36,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-24 15:52:36,570 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:52:36,570 INFO L322 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:52:36,570 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_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:52:36,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1638383027, now seen corresponding path program 1 times [2018-01-24 15:52:36,571 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:52:36,572 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:36,572 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 15:52:36,572 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:36,572 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:52:36,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:36,593 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:52:36,721 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 15:52:36,721 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:52:36,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-24 15:52:36,721 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:52:36,721 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 15:52:36,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 15:52:36,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-01-24 15:52:36,722 INFO L87 Difference]: Start difference. First operand 136 states and 144 transitions. Second operand 13 states. [2018-01-24 15:52:36,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:52:36,851 INFO L93 Difference]: Finished difference Result 194 states and 204 transitions. [2018-01-24 15:52:36,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 15:52:36,852 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 73 [2018-01-24 15:52:36,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:52:36,853 INFO L225 Difference]: With dead ends: 194 [2018-01-24 15:52:36,853 INFO L226 Difference]: Without dead ends: 134 [2018-01-24 15:52:36,854 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-01-24 15:52:36,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-01-24 15:52:36,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-01-24 15:52:36,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-01-24 15:52:36,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 140 transitions. [2018-01-24 15:52:36,906 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 140 transitions. Word has length 73 [2018-01-24 15:52:36,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:52:36,906 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 140 transitions. [2018-01-24 15:52:36,907 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 15:52:36,907 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 140 transitions. [2018-01-24 15:52:36,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-24 15:52:36,907 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:52:36,908 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] [2018-01-24 15:52:36,908 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_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:52:36,908 INFO L82 PathProgramCache]: Analyzing trace with hash 154562580, now seen corresponding path program 1 times [2018-01-24 15:52:36,908 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:52:36,909 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:36,909 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:36,909 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:36,909 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:52:36,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:36,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:52:37,282 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 15:52:37,282 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:52:37,283 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2018-01-24 15:52:37,283 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:52:37,283 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-24 15:52:37,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-24 15:52:37,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2018-01-24 15:52:37,283 INFO L87 Difference]: Start difference. First operand 134 states and 140 transitions. Second operand 27 states. [2018-01-24 15:52:37,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:52:37,809 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2018-01-24 15:52:37,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-24 15:52:37,810 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 80 [2018-01-24 15:52:37,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:52:37,810 INFO L225 Difference]: With dead ends: 146 [2018-01-24 15:52:37,811 INFO L226 Difference]: Without dead ends: 144 [2018-01-24 15:52:37,811 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=1239, Unknown=0, NotChecked=0, Total=1332 [2018-01-24 15:52:37,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-01-24 15:52:37,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 140. [2018-01-24 15:52:37,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-24 15:52:37,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 150 transitions. [2018-01-24 15:52:37,829 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 150 transitions. Word has length 80 [2018-01-24 15:52:37,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:52:37,829 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 150 transitions. [2018-01-24 15:52:37,829 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-24 15:52:37,829 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 150 transitions. [2018-01-24 15:52:37,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-24 15:52:37,829 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:52:37,830 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] [2018-01-24 15:52:37,830 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_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:52:37,830 INFO L82 PathProgramCache]: Analyzing trace with hash 154562581, now seen corresponding path program 1 times [2018-01-24 15:52:37,830 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:52:37,831 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:37,831 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:37,831 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:37,831 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:52:37,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:37,845 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:52:37,998 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:52:37,999 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:52:37,999 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:52:37,999 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 81 with the following transitions: [2018-01-24 15:52:37,999 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [12], [13], [17], [20], [27], [32], [34], [35], [36], [39], [40], [43], [44], [45], [48], [50], [54], [58], [61], [62], [63], [66], [67], [68], [72], [74], [75], [76], [78], [81], [86], [89], [92], [107], [108], [111], [114], [115], [118], [121], [122], [123], [125], [126], [127], [128], [135], [136], [137], [138], [139], [140], [141], [143], [145], [146], [147], [149], [150], [151], [155], [156], [157], [158], [159], [160], [161], [163], [165], [167], [169], [170], [171] [2018-01-24 15:52:38,001 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:52:38,002 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:52:40,988 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:52:40,988 INFO L268 AbstractInterpreter]: Visited 77 different actions 85 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 27 variables. [2018-01-24 15:52:40,995 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:52:40,995 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:52:40,995 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:52:41,008 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:41,008 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:52:41,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:41,065 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:52:41,155 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:52:41,155 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:52:41,372 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:52:41,393 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:52:41,393 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:52:41,396 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:41,397 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:52:41,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:41,494 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:52:41,500 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:52:41,500 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:52:41,636 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:52:41,638 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:52:41,638 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8] total 15 [2018-01-24 15:52:41,638 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:52:41,639 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 15:52:41,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 15:52:41,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-01-24 15:52:41,639 INFO L87 Difference]: Start difference. First operand 140 states and 150 transitions. Second operand 9 states. [2018-01-24 15:52:41,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:52:41,693 INFO L93 Difference]: Finished difference Result 255 states and 275 transitions. [2018-01-24 15:52:41,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 15:52:41,694 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2018-01-24 15:52:41,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:52:41,695 INFO L225 Difference]: With dead ends: 255 [2018-01-24 15:52:41,695 INFO L226 Difference]: Without dead ends: 141 [2018-01-24 15:52:41,695 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 311 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=137, Unknown=0, NotChecked=0, Total=240 [2018-01-24 15:52:41,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-01-24 15:52:41,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-01-24 15:52:41,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-01-24 15:52:41,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 151 transitions. [2018-01-24 15:52:41,712 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 151 transitions. Word has length 80 [2018-01-24 15:52:41,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:52:41,712 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 151 transitions. [2018-01-24 15:52:41,712 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 15:52:41,712 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 151 transitions. [2018-01-24 15:52:41,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-24 15:52:41,713 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:52:41,713 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] [2018-01-24 15:52:41,713 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_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:52:41,714 INFO L82 PathProgramCache]: Analyzing trace with hash -585535779, now seen corresponding path program 2 times [2018-01-24 15:52:41,714 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:52:41,715 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:41,715 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:41,715 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:41,715 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:52:41,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:41,732 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:52:41,903 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:52:41,903 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:52:41,903 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:52:41,903 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:52:41,903 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:52:41,903 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:52:41,903 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:52:41,921 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:52:41,921 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:52:41,961 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:52:41,972 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:52:41,977 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:52:41,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-24 15:52:41,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:52:42,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-24 15:52:42,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:52:42,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 15:52:42,088 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-24 15:52:45,067 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-24 15:52:45,067 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:52:48,087 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-24 15:52:48,107 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 15:52:48,107 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [26, 24] imperfect sequences [9] total 57 [2018-01-24 15:52:48,107 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:52:48,108 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-24 15:52:48,108 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-24 15:52:48,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2995, Unknown=2, NotChecked=0, Total=3192 [2018-01-24 15:52:48,109 INFO L87 Difference]: Start difference. First operand 141 states and 151 transitions. Second operand 27 states. [2018-01-24 15:52:49,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:52:49,439 INFO L93 Difference]: Finished difference Result 141 states and 151 transitions. [2018-01-24 15:52:49,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-24 15:52:49,474 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 81 [2018-01-24 15:52:49,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:52:49,475 INFO L225 Difference]: With dead ends: 141 [2018-01-24 15:52:49,475 INFO L226 Difference]: Without dead ends: 139 [2018-01-24 15:52:49,476 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 111 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1151 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=268, Invalid=4020, Unknown=2, NotChecked=0, Total=4290 [2018-01-24 15:52:49,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-01-24 15:52:49,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-01-24 15:52:49,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-01-24 15:52:49,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 148 transitions. [2018-01-24 15:52:49,498 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 148 transitions. Word has length 81 [2018-01-24 15:52:49,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:52:49,499 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 148 transitions. [2018-01-24 15:52:49,499 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-24 15:52:49,499 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 148 transitions. [2018-01-24 15:52:49,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-01-24 15:52:49,500 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:52:49,500 INFO L322 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:52:49,500 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_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:52:49,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1024705250, now seen corresponding path program 1 times [2018-01-24 15:52:49,501 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:52:49,502 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:49,502 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 15:52:49,502 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:49,502 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:52:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:49,525 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:52:49,604 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:52:49,605 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:52:49,605 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:52:49,605 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 86 with the following transitions: [2018-01-24 15:52:49,605 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [12], [13], [17], [20], [27], [32], [34], [35], [36], [39], [40], [43], [44], [45], [48], [50], [54], [58], [61], [62], [63], [66], [67], [68], [72], [74], [75], [76], [78], [81], [86], [89], [90], [93], [94], [99], [101], [107], [108], [111], [114], [115], [118], [121], [122], [123], [125], [126], [127], [128], [135], [136], [137], [138], [139], [140], [141], [143], [145], [146], [147], [149], [150], [151], [155], [156], [157], [158], [159], [160], [161], [163], [165], [167], [169], [170], [171] [2018-01-24 15:52:49,609 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:52:49,609 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:52:52,778 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:52:52,778 INFO L268 AbstractInterpreter]: Visited 81 different actions 89 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 27 variables. [2018-01-24 15:52:52,782 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:52:52,782 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:52:52,782 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:52:52,789 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:52,790 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:52:52,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:52,851 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:52:52,862 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:52:52,862 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:52:52,991 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:52:53,024 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:52:53,024 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:52:53,029 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:53,029 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:52:53,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:53,130 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:52:53,138 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:52:53,138 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:52:53,221 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:52:53,222 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:52:53,222 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9] total 17 [2018-01-24 15:52:53,223 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:52:53,223 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 15:52:53,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 15:52:53,223 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-01-24 15:52:53,223 INFO L87 Difference]: Start difference. First operand 139 states and 148 transitions. Second operand 10 states. [2018-01-24 15:52:53,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:52:53,282 INFO L93 Difference]: Finished difference Result 252 states and 270 transitions. [2018-01-24 15:52:53,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 15:52:53,282 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 85 [2018-01-24 15:52:53,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:52:53,283 INFO L225 Difference]: With dead ends: 252 [2018-01-24 15:52:53,283 INFO L226 Difference]: Without dead ends: 140 [2018-01-24 15:52:53,283 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 330 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=133, Invalid=173, Unknown=0, NotChecked=0, Total=306 [2018-01-24 15:52:53,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-24 15:52:53,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-01-24 15:52:53,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-24 15:52:53,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 149 transitions. [2018-01-24 15:52:53,302 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 149 transitions. Word has length 85 [2018-01-24 15:52:53,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:52:53,302 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 149 transitions. [2018-01-24 15:52:53,302 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 15:52:53,302 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 149 transitions. [2018-01-24 15:52:53,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-01-24 15:52:53,303 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:52:53,303 INFO L322 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:52:53,303 INFO L371 AbstractCegarLoop]: === Iteration 24 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:52:53,303 INFO L82 PathProgramCache]: Analyzing trace with hash -796837034, now seen corresponding path program 2 times [2018-01-24 15:52:53,303 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:52:53,304 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:53,304 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:53,304 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:53,304 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:52:53,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:53,323 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:52:53,535 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:52:53,536 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:52:53,536 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:52:53,536 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:52:53,536 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:52:53,536 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:52:53,536 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:52:53,546 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:52:53,546 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:52:53,588 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:52:53,602 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:52:53,615 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:52:53,618 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:52:53,691 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:52:53,692 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:52:54,352 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:52:54,374 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:52:54,374 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 17 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 17 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:52:54,389 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:52:54,389 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:52:54,451 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:52:54,567 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:52:54,602 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:52:54,611 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:52:54,626 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:52:54,627 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:52:54,739 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:52:54,741 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:52:54,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 10, 10] total 19 [2018-01-24 15:52:54,742 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:52:54,742 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 15:52:54,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 15:52:54,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-01-24 15:52:54,742 INFO L87 Difference]: Start difference. First operand 140 states and 149 transitions. Second operand 11 states. [2018-01-24 15:52:54,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:52:54,809 INFO L93 Difference]: Finished difference Result 253 states and 271 transitions. [2018-01-24 15:52:54,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 15:52:54,809 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 86 [2018-01-24 15:52:54,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:52:54,810 INFO L225 Difference]: With dead ends: 253 [2018-01-24 15:52:54,810 INFO L226 Difference]: Without dead ends: 141 [2018-01-24 15:52:54,810 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 333 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=213, Unknown=0, NotChecked=0, Total=380 [2018-01-24 15:52:54,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-01-24 15:52:54,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-01-24 15:52:54,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-01-24 15:52:54,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 150 transitions. [2018-01-24 15:52:54,839 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 150 transitions. Word has length 86 [2018-01-24 15:52:54,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:52:54,839 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 150 transitions. [2018-01-24 15:52:54,839 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 15:52:54,839 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 150 transitions. [2018-01-24 15:52:54,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-24 15:52:54,840 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:52:54,840 INFO L322 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:52:54,840 INFO L371 AbstractCegarLoop]: === Iteration 25 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:52:54,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1972110366, now seen corresponding path program 3 times [2018-01-24 15:52:54,840 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:52:54,841 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:54,841 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 15:52:54,841 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:54,841 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:52:54,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:54,860 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:52:54,955 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:52:54,955 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:52:54,955 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:52:54,956 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:52:54,956 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:52:54,956 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:52:54,956 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:52:54,963 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 15:52:54,964 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-24 15:52:55,003 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 15:52:55,018 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command Received shutdown request... [2018-01-24 15:52:55,051 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 15:52:55,292 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 15:52:55,424 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 15:52:55,425 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:52:55,429 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:52:55,432 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 15:52:55,432 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 15:52:55,435 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 15:52:55,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 03:52:55 BoogieIcfgContainer [2018-01-24 15:52:55,436 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 15:52:55,436 INFO L168 Benchmark]: Toolchain (without parser) took 43394.06 ms. Allocated memory was 304.1 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 263.1 MB in the beginning and 1.3 GB in the end (delta: -1.0 GB). Peak memory consumption was 177.6 MB. Max. memory is 5.3 GB. [2018-01-24 15:52:55,437 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 304.1 MB. Free memory is still 270.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 15:52:55,437 INFO L168 Benchmark]: CACSL2BoogieTranslator took 239.47 ms. Allocated memory is still 304.1 MB. Free memory was 263.1 MB in the beginning and 249.0 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 5.3 GB. [2018-01-24 15:52:55,437 INFO L168 Benchmark]: Boogie Preprocessor took 46.66 ms. Allocated memory is still 304.1 MB. Free memory was 249.0 MB in the beginning and 247.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:52:55,437 INFO L168 Benchmark]: RCFGBuilder took 459.04 ms. Allocated memory is still 304.1 MB. Free memory was 247.0 MB in the beginning and 216.3 MB in the end (delta: 30.7 MB). Peak memory consumption was 30.7 MB. Max. memory is 5.3 GB. [2018-01-24 15:52:55,437 INFO L168 Benchmark]: TraceAbstraction took 42639.37 ms. Allocated memory was 304.1 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 216.3 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 130.8 MB. Max. memory is 5.3 GB. [2018-01-24 15:52:55,439 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 304.1 MB. Free memory is still 270.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 239.47 ms. Allocated memory is still 304.1 MB. Free memory was 263.1 MB in the beginning and 249.0 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 46.66 ms. Allocated memory is still 304.1 MB. Free memory was 249.0 MB in the beginning and 247.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 459.04 ms. Allocated memory is still 304.1 MB. Free memory was 247.0 MB in the beginning and 216.3 MB in the end (delta: 30.7 MB). Peak memory consumption was 30.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 42639.37 ms. Allocated memory was 304.1 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 216.3 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 130.8 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.361661 RENAME_VARIABLES(MILLISECONDS) : 0.068962 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.129700 PROJECTAWAY(MILLISECONDS) : 0.029442 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.167045 DISJOIN(MILLISECONDS) : 0.491692 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.087318 ADD_EQUALITY(MILLISECONDS) : 0.016136 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.008569 #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.396628 RENAME_VARIABLES(MILLISECONDS) : 0.085998 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.154376 PROJECTAWAY(MILLISECONDS) : 0.048502 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.034645 DISJOIN(MILLISECONDS) : 0.602079 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.110321 ADD_EQUALITY(MILLISECONDS) : 0.016743 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.007008 #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 : 62 LocStat_MAX_WEQGRAPH_SIZE : 6 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 506 LocStat_NO_SUPPORTING_DISEQUALITIES : 53 LocStat_NO_DISJUNCTIONS : -124 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 93 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 202 TransStat_NO_SUPPORTING_DISEQUALITIES : 11 TransStat_NO_DISJUNCTIONS : 98 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.283647 RENAME_VARIABLES(MILLISECONDS) : 0.077544 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.117582 PROJECTAWAY(MILLISECONDS) : 0.029022 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.038796 DISJOIN(MILLISECONDS) : 0.631336 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.092067 ADD_EQUALITY(MILLISECONDS) : 0.013086 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.006157 #CONJOIN_DISJUNCTIVE : 144 #RENAME_VARIABLES : 229 #UNFREEZE : 0 #CONJOIN : 322 #PROJECTAWAY : 237 #ADD_WEAK_EQUALITY : 27 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 224 #ADD_EQUALITY : 218 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 10 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 76 LocStat_MAX_WEQGRAPH_SIZE : 6 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 646 LocStat_NO_SUPPORTING_DISEQUALITIES : 67 LocStat_NO_DISJUNCTIONS : -152 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 113 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 2 TransStat_NO_SUPPORTING_EQUALITIES : 234 TransStat_NO_SUPPORTING_DISEQUALITIES : 11 TransStat_NO_DISJUNCTIONS : 118 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.202678 RENAME_VARIABLES(MILLISECONDS) : 0.055449 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.082158 PROJECTAWAY(MILLISECONDS) : 0.021021 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.050381 DISJOIN(MILLISECONDS) : 0.398256 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.068347 ADD_EQUALITY(MILLISECONDS) : 0.012270 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.005612 #CONJOIN_DISJUNCTIVE : 167 #RENAME_VARIABLES : 266 #UNFREEZE : 0 #CONJOIN : 370 #PROJECTAWAY : 278 #ADD_WEAK_EQUALITY : 33 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 261 #ADD_EQUALITY : 255 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 10 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 80 LocStat_MAX_WEQGRAPH_SIZE : 6 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 695 LocStat_NO_SUPPORTING_DISEQUALITIES : 76 LocStat_NO_DISJUNCTIONS : -160 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 117 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 2 TransStat_NO_SUPPORTING_EQUALITIES : 251 TransStat_NO_SUPPORTING_DISEQUALITIES : 16 TransStat_NO_DISJUNCTIONS : 125 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.650990 RENAME_VARIABLES(MILLISECONDS) : 0.417195 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.602248 PROJECTAWAY(MILLISECONDS) : 0.105545 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.042362 DISJOIN(MILLISECONDS) : 0.397111 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.432586 ADD_EQUALITY(MILLISECONDS) : 0.008538 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.008768 #CONJOIN_DISJUNCTIVE : 175 #RENAME_VARIABLES : 279 #UNFREEZE : 0 #CONJOIN : 407 #PROJECTAWAY : 290 #ADD_WEAK_EQUALITY : 34 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 271 #ADD_EQUALITY : 264 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 14 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1294). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1294). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1411). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1411). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1265). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1265). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1267). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1267). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1339). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1339). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1452]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1452). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1099). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1100). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1100). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1099). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 19 procedures, 123 locations, 19 error locations. TIMEOUT Result, 42.5s OverallTime, 25 OverallIterations, 7 TraceHistogramMax, 7.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2602 SDtfs, 753 SDslu, 16401 SDs, 0 SdLazy, 6418 SolverSat, 192 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2294 GetRequests, 1857 SyntacticMatches, 21 SemanticMatches, 416 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2808 ImplicationChecksByTransitivity, 15.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 14.4s AbstIntTime, 5 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 24 MinimizatonAttempts, 46 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 17.5s InterpolantComputationTime, 2216 NumberOfCodeBlocks, 2202 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 3169 ConstructedInterpolants, 173 QuantifiedInterpolants, 669494 SizeOfPredicates, 82 NumberOfNonLiveVariables, 5037 ConjunctsInSsa, 339 ConjunctsInUnsatCore, 56 InterpolantComputations, 22 PerfectInterpolantSequences, 119/433 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_5_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_15-52-55-447.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_5_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_15-52-55-447.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_5_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_15-52-55-447.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_5_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_15-52-55-447.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_5_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_15-52-55-447.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_5_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-24_15-52-55-447.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_5_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-24_15-52-55-447.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_5_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-24_15-52-55-447.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_5_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-24_15-52-55-447.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_5_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-4-2018-01-24_15-52-55-447.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_5_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-4-2018-01-24_15-52-55-447.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_5_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_15-52-55-447.csv Completed graceful shutdown