java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_3_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 15:52:09,562 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 15:52:09,563 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 15:52:09,578 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 15:52:09,578 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 15:52:09,579 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 15:52:09,580 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 15:52:09,582 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 15:52:09,583 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 15:52:09,584 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 15:52:09,585 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 15:52:09,585 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 15:52:09,585 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 15:52:09,586 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 15:52:09,587 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 15:52:09,590 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 15:52:09,592 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 15:52:09,594 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 15:52:09,596 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 15:52:09,597 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 15:52:09,599 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 15:52:09,599 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 15:52:09,600 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 15:52:09,601 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 15:52:09,602 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 15:52:09,603 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 15:52:09,603 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 15:52:09,604 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 15:52:09,604 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 15:52:09,605 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 15:52:09,605 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 15:52:09,606 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:09,616 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 15:52:09,616 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 15:52:09,617 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 15:52:09,617 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 15:52:09,617 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 15:52:09,617 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 15:52:09,618 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 15:52:09,618 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 15:52:09,618 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 15:52:09,619 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 15:52:09,619 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 15:52:09,619 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 15:52:09,619 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 15:52:09,619 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 15:52:09,620 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 15:52:09,620 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 15:52:09,620 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 15:52:09,620 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 15:52:09,620 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 15:52:09,620 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 15:52:09,621 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 15:52:09,621 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 15:52:09,621 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 15:52:09,621 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 15:52:09,621 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 15:52:09,622 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 15:52:09,622 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 15:52:09,622 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 15:52:09,622 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 15:52:09,622 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 15:52:09,623 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 15:52:09,623 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 15:52:09,623 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 15:52:09,624 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 15:52:09,624 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 15:52:09,655 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 15:52:09,669 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 15:52:09,673 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 15:52:09,674 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 15:52:09,675 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 15:52:09,675 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_3_false-valid-deref.i [2018-01-24 15:52:09,857 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 15:52:09,863 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 15:52:09,865 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 15:52:09,865 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 15:52:09,872 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 15:52:09,873 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:52:09" (1/1) ... [2018-01-24 15:52:09,877 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:09, skipping insertion in model container [2018-01-24 15:52:09,877 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:52:09" (1/1) ... [2018-01-24 15:52:09,898 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:52:09,948 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:52:10,076 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:52:10,098 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:52:10,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:52:10 WrapperNode [2018-01-24 15:52:10,110 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 15:52:10,111 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 15:52:10,111 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 15:52:10,111 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 15:52:10,125 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:10" (1/1) ... [2018-01-24 15:52:10,125 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:10" (1/1) ... [2018-01-24 15:52:10,137 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:10" (1/1) ... [2018-01-24 15:52:10,137 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:10" (1/1) ... [2018-01-24 15:52:10,145 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:10" (1/1) ... [2018-01-24 15:52:10,149 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:10" (1/1) ... [2018-01-24 15:52:10,150 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:10" (1/1) ... [2018-01-24 15:52:10,152 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 15:52:10,153 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 15:52:10,153 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 15:52:10,153 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 15:52:10,153 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:52:10" (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:10,199 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 15:52:10,199 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 15:52:10,199 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-01-24 15:52:10,199 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 15:52:10,199 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-01-24 15:52:10,199 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-01-24 15:52:10,199 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-01-24 15:52:10,200 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-01-24 15:52:10,200 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-01-24 15:52:10,200 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-01-24 15:52:10,200 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-01-24 15:52:10,200 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-01-24 15:52:10,200 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-01-24 15:52:10,200 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-01-24 15:52:10,200 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-01-24 15:52:10,200 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 15:52:10,200 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 15:52:10,201 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 15:52:10,201 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 15:52:10,201 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 15:52:10,201 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 15:52:10,201 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 15:52:10,201 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 15:52:10,202 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 15:52:10,202 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-24 15:52:10,202 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-24 15:52:10,202 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 15:52:10,202 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 15:52:10,202 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 15:52:10,203 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-24 15:52:10,203 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 15:52:10,203 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-01-24 15:52:10,203 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-01-24 15:52:10,203 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-01-24 15:52:10,203 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-01-24 15:52:10,204 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-01-24 15:52:10,204 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-01-24 15:52:10,204 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-01-24 15:52:10,204 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-01-24 15:52:10,204 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-01-24 15:52:10,204 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-01-24 15:52:10,204 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-01-24 15:52:10,205 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-01-24 15:52:10,205 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 15:52:10,205 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 15:52:10,205 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 15:52:10,205 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 15:52:10,450 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-24 15:52:10,617 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 15:52:10,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:52:10 BoogieIcfgContainer [2018-01-24 15:52:10,618 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 15:52:10,619 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 15:52:10,619 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 15:52:10,621 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 15:52:10,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 03:52:09" (1/3) ... [2018-01-24 15:52:10,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c06a003 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:52:10, skipping insertion in model container [2018-01-24 15:52:10,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:52:10" (2/3) ... [2018-01-24 15:52:10,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c06a003 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:52:10, skipping insertion in model container [2018-01-24 15:52:10,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:52:10" (3/3) ... [2018-01-24 15:52:10,625 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test22_3_false-valid-deref.i [2018-01-24 15:52:10,632 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 15:52:10,639 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-01-24 15:52:10,680 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 15:52:10,680 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 15:52:10,680 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 15:52:10,680 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 15:52:10,681 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 15:52:10,681 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 15:52:10,681 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 15:52:10,681 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 15:52:10,682 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 15:52:10,700 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states. [2018-01-24 15:52:10,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 15:52:10,706 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:52:10,707 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:10,707 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:10,711 INFO L82 PathProgramCache]: Analyzing trace with hash 556227080, now seen corresponding path program 1 times [2018-01-24 15:52:10,713 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:52:10,759 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:10,759 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:10,760 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:10,760 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:52:10,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:10,813 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:10,960 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:10,962 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:52:10,963 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:52:10,963 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:52:11,054 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:52:11,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:52:11,070 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:52:11,073 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 5 states. [2018-01-24 15:52:11,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:52:11,151 INFO L93 Difference]: Finished difference Result 226 states and 241 transitions. [2018-01-24 15:52:11,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:52:11,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-24 15:52:11,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:52:11,167 INFO L225 Difference]: With dead ends: 226 [2018-01-24 15:52:11,167 INFO L226 Difference]: Without dead ends: 122 [2018-01-24 15:52:11,172 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:11,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-01-24 15:52:11,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2018-01-24 15:52:11,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-24 15:52:11,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-01-24 15:52:11,218 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 17 [2018-01-24 15:52:11,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:52:11,219 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-01-24 15:52:11,219 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:52:11,219 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-01-24 15:52:11,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 15:52:11,220 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:52:11,220 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:11,220 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:11,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1895274134, now seen corresponding path program 1 times [2018-01-24 15:52:11,220 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:52:11,221 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:11,222 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:11,222 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:11,222 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:52:11,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:11,244 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:11,318 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:11,319 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:52:11,319 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:52:11,319 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:52:11,321 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:52:11,321 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:52:11,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:52:11,322 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 6 states. [2018-01-24 15:52:11,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:52:11,528 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2018-01-24 15:52:11,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:52:11,528 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 15:52:11,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:52:11,530 INFO L225 Difference]: With dead ends: 122 [2018-01-24 15:52:11,530 INFO L226 Difference]: Without dead ends: 121 [2018-01-24 15:52:11,531 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:11,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-24 15:52:11,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-01-24 15:52:11,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-24 15:52:11,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2018-01-24 15:52:11,541 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 19 [2018-01-24 15:52:11,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:52:11,542 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2018-01-24 15:52:11,542 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:52:11,542 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2018-01-24 15:52:11,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 15:52:11,542 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:52:11,543 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:11,543 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:11,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1895274133, now seen corresponding path program 1 times [2018-01-24 15:52:11,543 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:52:11,545 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:11,545 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:11,545 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:11,545 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:52:11,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:11,567 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:11,779 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:11,780 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:52:11,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 15:52:11,780 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:52:11,781 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 15:52:11,781 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 15:52:11,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:52:11,781 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 7 states. [2018-01-24 15:52:12,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:52:12,025 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2018-01-24 15:52:12,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 15:52:12,026 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-01-24 15:52:12,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:52:12,027 INFO L225 Difference]: With dead ends: 121 [2018-01-24 15:52:12,028 INFO L226 Difference]: Without dead ends: 120 [2018-01-24 15:52:12,028 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:12,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-24 15:52:12,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-01-24 15:52:12,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-24 15:52:12,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2018-01-24 15:52:12,039 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 19 [2018-01-24 15:52:12,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:52:12,039 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2018-01-24 15:52:12,040 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 15:52:12,040 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2018-01-24 15:52:12,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 15:52:12,041 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:52:12,041 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:52:12,041 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:12,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1715794329, now seen corresponding path program 1 times [2018-01-24 15:52:12,042 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:52:12,043 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:12,043 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:12,043 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:12,044 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:52:12,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:12,068 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:12,183 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:12,184 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:52:12,184 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 15:52:12,184 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:52:12,184 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 15:52:12,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 15:52:12,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:52:12,185 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand 7 states. [2018-01-24 15:52:12,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:52:12,267 INFO L93 Difference]: Finished difference Result 188 states and 203 transitions. [2018-01-24 15:52:12,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 15:52:12,268 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-01-24 15:52:12,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:52:12,270 INFO L225 Difference]: With dead ends: 188 [2018-01-24 15:52:12,270 INFO L226 Difference]: Without dead ends: 131 [2018-01-24 15:52:12,271 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:52:12,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-01-24 15:52:12,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2018-01-24 15:52:12,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-01-24 15:52:12,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 136 transitions. [2018-01-24 15:52:12,285 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 136 transitions. Word has length 29 [2018-01-24 15:52:12,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:52:12,286 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 136 transitions. [2018-01-24 15:52:12,286 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 15:52:12,286 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 136 transitions. [2018-01-24 15:52:12,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 15:52:12,287 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:52:12,287 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:12,288 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:12,288 INFO L82 PathProgramCache]: Analyzing trace with hash -785661208, now seen corresponding path program 1 times [2018-01-24 15:52:12,289 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:52:12,290 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:12,290 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:12,290 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:12,290 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:52:12,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:12,311 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:12,431 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:12,431 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:52:12,431 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 15:52:12,431 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:52:12,431 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 15:52:12,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 15:52:12,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 15:52:12,432 INFO L87 Difference]: Start difference. First operand 127 states and 136 transitions. Second operand 10 states. [2018-01-24 15:52:12,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:52:12,645 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2018-01-24 15:52:12,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 15:52:12,646 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-01-24 15:52:12,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:52:12,648 INFO L225 Difference]: With dead ends: 127 [2018-01-24 15:52:12,648 INFO L226 Difference]: Without dead ends: 126 [2018-01-24 15:52:12,649 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:12,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-24 15:52:12,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-01-24 15:52:12,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-24 15:52:12,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2018-01-24 15:52:12,660 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 34 [2018-01-24 15:52:12,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:52:12,661 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2018-01-24 15:52:12,661 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 15:52:12,661 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2018-01-24 15:52:12,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 15:52:12,662 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:52:12,662 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:12,662 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:12,662 INFO L82 PathProgramCache]: Analyzing trace with hash -785661207, now seen corresponding path program 1 times [2018-01-24 15:52:12,662 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:52:12,663 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:12,663 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:12,663 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:12,663 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:52:12,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:12,681 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:12,721 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:12,721 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:52:12,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 15:52:12,721 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:52:12,721 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 15:52:12,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 15:52:12,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 15:52:12,722 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand 4 states. [2018-01-24 15:52:12,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:52:12,743 INFO L93 Difference]: Finished difference Result 218 states and 233 transitions. [2018-01-24 15:52:12,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 15:52:12,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-01-24 15:52:12,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:52:12,746 INFO L225 Difference]: With dead ends: 218 [2018-01-24 15:52:12,746 INFO L226 Difference]: Without dead ends: 127 [2018-01-24 15:52:12,747 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:12,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-24 15:52:12,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-01-24 15:52:12,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-01-24 15:52:12,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 136 transitions. [2018-01-24 15:52:12,760 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 136 transitions. Word has length 34 [2018-01-24 15:52:12,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:52:12,760 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 136 transitions. [2018-01-24 15:52:12,761 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 15:52:12,761 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 136 transitions. [2018-01-24 15:52:12,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 15:52:12,762 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:52:12,762 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] [2018-01-24 15:52:12,762 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:12,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1322241719, now seen corresponding path program 1 times [2018-01-24 15:52:12,763 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:52:12,764 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:12,764 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:12,764 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:12,764 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:52:12,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:12,775 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:12,803 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:12,804 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:52:12,804 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 15:52:12,804 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:52:12,804 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 15:52:12,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 15:52:12,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:52:12,805 INFO L87 Difference]: Start difference. First operand 127 states and 136 transitions. Second operand 3 states. [2018-01-24 15:52:12,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:52:12,938 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2018-01-24 15:52:12,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 15:52:12,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-01-24 15:52:12,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:52:12,940 INFO L225 Difference]: With dead ends: 144 [2018-01-24 15:52:12,940 INFO L226 Difference]: Without dead ends: 131 [2018-01-24 15:52:12,941 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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:12,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-01-24 15:52:12,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2018-01-24 15:52:12,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-24 15:52:12,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2018-01-24 15:52:12,954 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 32 [2018-01-24 15:52:12,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:52:12,954 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2018-01-24 15:52:12,954 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 15:52:12,954 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2018-01-24 15:52:12,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-24 15:52:12,955 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:52:12,956 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:12,956 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:12,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1082750419, now seen corresponding path program 1 times [2018-01-24 15:52:12,956 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:52:12,957 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:12,957 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:12,957 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:12,958 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:52:12,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:12,972 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,034 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:13,034 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:52:13,034 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:52:13,035 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-01-24 15:52:13,037 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [27], [32], [48], [54], [58], [62], [65], [67], [68], [72], [74], [75], [115], [118], [119], [120], [122], [123], [124], [132], [133], [134], [135], [136], [138], [142], [146], [152], [164], [165], [166] [2018-01-24 15:52:13,103 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:52:13,103 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:52:16,343 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:52:16,345 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:16,376 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:52:16,377 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:52:16,377 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:16,390 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:16,390 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:52:16,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:16,440 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:52:16,477 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:16,478 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:52:16,546 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:16,569 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:52:16,569 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:16,574 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:16,574 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:52:16,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:16,639 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:52:16,645 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:16,645 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:52:16,675 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:16,677 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:52:16,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5] total 9 [2018-01-24 15:52:16,677 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:52:16,677 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:52:16,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:52:16,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-01-24 15:52:16,678 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand 6 states. [2018-01-24 15:52:16,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:52:16,706 INFO L93 Difference]: Finished difference Result 215 states and 229 transitions. [2018-01-24 15:52:16,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:52:16,706 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-24 15:52:16,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:52:16,708 INFO L225 Difference]: With dead ends: 215 [2018-01-24 15:52:16,708 INFO L226 Difference]: Without dead ends: 124 [2018-01-24 15:52:16,709 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:16,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-24 15:52:16,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-01-24 15:52:16,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-24 15:52:16,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2018-01-24 15:52:16,720 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 35 [2018-01-24 15:52:16,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:52:16,721 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2018-01-24 15:52:16,721 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:52:16,721 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2018-01-24 15:52:16,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 15:52:16,722 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:52:16,722 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] [2018-01-24 15:52:16,722 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:16,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1962528345, now seen corresponding path program 1 times [2018-01-24 15:52:16,723 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:52:16,724 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:16,724 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:16,724 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:16,724 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:52:16,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:16,735 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:16,873 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:16,874 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:52:16,874 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 15:52:16,874 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:52:16,875 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:52:16,884 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:52:16,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:52:16,885 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand 6 states. [2018-01-24 15:52:16,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:52:16,924 INFO L93 Difference]: Finished difference Result 128 states and 135 transitions. [2018-01-24 15:52:16,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:52:16,925 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-01-24 15:52:16,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:52:16,926 INFO L225 Difference]: With dead ends: 128 [2018-01-24 15:52:16,927 INFO L226 Difference]: Without dead ends: 115 [2018-01-24 15:52:16,927 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:16,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-24 15:52:16,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-01-24 15:52:16,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-24 15:52:16,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2018-01-24 15:52:16,938 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 34 [2018-01-24 15:52:16,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:52:16,938 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2018-01-24 15:52:16,938 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:52:16,939 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2018-01-24 15:52:16,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 15:52:16,939 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:52:16,940 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:16,940 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:16,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1126031319, now seen corresponding path program 2 times [2018-01-24 15:52:16,940 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:52:16,941 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:16,942 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:16,942 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:16,942 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:52:16,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:16,962 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:17,033 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:17,034 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:52:17,034 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:52:17,034 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:52:17,034 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:17,035 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:52:17,035 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:17,049 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:52:17,049 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:52:17,080 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:52:17,086 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:52:17,091 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:52:17,120 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:17,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:52:17,138 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:17,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:52:17,159 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:17,160 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-24 15:52:17,690 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 45 DAG size of output 17 [2018-01-24 15:52:17,957 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:17,958 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:52:22,372 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:22,393 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 15:52:22,394 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14, 13] imperfect sequences [6] total 31 [2018-01-24 15:52:22,394 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:52:22,394 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 15:52:22,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 15:52:22,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=838, Unknown=2, NotChecked=0, Total=930 [2018-01-24 15:52:22,395 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand 15 states. [2018-01-24 15:52:23,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:52:23,334 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2018-01-24 15:52:23,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 15:52:23,334 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2018-01-24 15:52:23,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:52:23,335 INFO L225 Difference]: With dead ends: 115 [2018-01-24 15:52:23,335 INFO L226 Difference]: Without dead ends: 114 [2018-01-24 15:52:23,336 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=118, Invalid=1070, Unknown=2, NotChecked=0, Total=1190 [2018-01-24 15:52:23,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-24 15:52:23,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-01-24 15:52:23,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-24 15:52:23,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 120 transitions. [2018-01-24 15:52:23,349 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 120 transitions. Word has length 36 [2018-01-24 15:52:23,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:52:23,350 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 120 transitions. [2018-01-24 15:52:23,350 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 15:52:23,350 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions. [2018-01-24 15:52:23,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 15:52:23,351 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:52:23,351 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:23,351 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:23,352 INFO L82 PathProgramCache]: Analyzing trace with hash -504837186, now seen corresponding path program 1 times [2018-01-24 15:52:23,352 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:52:23,353 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:23,353 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 15:52:23,353 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:23,354 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:52:23,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:23,370 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:23,481 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:23,481 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:52:23,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 15:52:23,482 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:52:23,482 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 15:52:23,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 15:52:23,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 15:52:23,482 INFO L87 Difference]: Start difference. First operand 114 states and 120 transitions. Second operand 10 states. [2018-01-24 15:52:23,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:52:23,780 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2018-01-24 15:52:23,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 15:52:23,780 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2018-01-24 15:52:23,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:52:23,781 INFO L225 Difference]: With dead ends: 114 [2018-01-24 15:52:23,781 INFO L226 Difference]: Without dead ends: 112 [2018-01-24 15:52:23,781 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:23,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-24 15:52:23,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-01-24 15:52:23,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-24 15:52:23,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 118 transitions. [2018-01-24 15:52:23,794 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 118 transitions. Word has length 41 [2018-01-24 15:52:23,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:52:23,794 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 118 transitions. [2018-01-24 15:52:23,794 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 15:52:23,794 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2018-01-24 15:52:23,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 15:52:23,795 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:52:23,795 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:23,796 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:23,796 INFO L82 PathProgramCache]: Analyzing trace with hash -504837185, now seen corresponding path program 1 times [2018-01-24 15:52:23,796 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:52:23,797 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:23,797 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:23,797 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:23,797 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:52:23,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:23,811 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:23,893 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:23,893 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:52:23,893 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:52:23,894 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-01-24 15:52:23,894 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [27], [32], [48], [54], [58], [62], [63], [66], [67], [68], [72], [74], [75], [107], [110], [115], [118], [119], [120], [122], [123], [124], [132], [133], [134], [135], [136], [138], [142], [146], [152], [153], [154], [164], [165], [166] [2018-01-24 15:52:23,896 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:52:23,896 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:52:27,000 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:52:27,000 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:27,021 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:52:27,021 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:52:27,022 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:27,033 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:27,033 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:52:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:27,070 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:52:27,092 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:27,092 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:52:27,209 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:27,245 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:52:27,245 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:27,264 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:27,264 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:52:27,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:27,344 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:52:27,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:52:27,351 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:52:27,410 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:27,412 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:52:27,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6] total 11 [2018-01-24 15:52:27,456 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:52:27,456 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 15:52:27,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 15:52:27,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-01-24 15:52:27,456 INFO L87 Difference]: Start difference. First operand 112 states and 118 transitions. Second operand 7 states. [2018-01-24 15:52:27,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:52:27,492 INFO L93 Difference]: Finished difference Result 201 states and 213 transitions. [2018-01-24 15:52:27,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:52:27,493 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-01-24 15:52:27,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:52:27,494 INFO L225 Difference]: With dead ends: 201 [2018-01-24 15:52:27,494 INFO L226 Difference]: Without dead ends: 113 [2018-01-24 15:52:27,495 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2018-01-24 15:52:27,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-24 15:52:27,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-01-24 15:52:27,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-24 15:52:27,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2018-01-24 15:52:27,509 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 41 [2018-01-24 15:52:27,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:52:27,509 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2018-01-24 15:52:27,509 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 15:52:27,510 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-01-24 15:52:27,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-24 15:52:27,510 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:52:27,511 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:27,511 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:27,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1693572501, now seen corresponding path program 2 times [2018-01-24 15:52:27,511 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:52:27,512 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:27,512 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:27,512 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:27,512 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:52:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:27,528 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,599 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:27,599 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:52:27,599 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:52:27,599 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:52:27,600 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:27,600 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:52:27,600 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:27,608 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:52:27,609 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:52:27,639 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:52:27,643 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:52:27,648 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:52:27,658 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:27,659 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:52:27,678 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:27,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:52:27,701 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:27,701 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-24 15:52:28,268 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:28,269 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:52:30,770 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:30,801 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 15:52:30,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15, 13] imperfect sequences [7] total 33 [2018-01-24 15:52:30,802 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:52:30,802 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 15:52:30,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 15:52:30,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=950, Unknown=1, NotChecked=0, Total=1056 [2018-01-24 15:52:30,803 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand 16 states. [2018-01-24 15:52:31,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:52:31,497 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2018-01-24 15:52:31,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 15:52:31,498 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2018-01-24 15:52:31,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:52:31,498 INFO L225 Difference]: With dead ends: 113 [2018-01-24 15:52:31,499 INFO L226 Difference]: Without dead ends: 111 [2018-01-24 15:52:31,499 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=136, Invalid=1195, Unknown=1, NotChecked=0, Total=1332 [2018-01-24 15:52:31,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-24 15:52:31,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-01-24 15:52:31,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-24 15:52:31,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 117 transitions. [2018-01-24 15:52:31,512 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 117 transitions. Word has length 42 [2018-01-24 15:52:31,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:52:31,512 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 117 transitions. [2018-01-24 15:52:31,512 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 15:52:31,512 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2018-01-24 15:52:31,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-24 15:52:31,513 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:52:31,513 INFO L322 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:52:31,513 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:31,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1966889947, now seen corresponding path program 1 times [2018-01-24 15:52:31,513 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:52:31,514 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:31,514 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 15:52:31,514 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:31,514 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:52:31,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:31,529 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,595 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:31,595 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:52:31,596 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 15:52:31,596 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:52:31,596 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 15:52:31,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 15:52:31,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:52:31,597 INFO L87 Difference]: Start difference. First operand 111 states and 117 transitions. Second operand 8 states. [2018-01-24 15:52:31,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:52:31,666 INFO L93 Difference]: Finished difference Result 175 states and 184 transitions. [2018-01-24 15:52:31,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 15:52:31,667 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-01-24 15:52:31,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:52:31,668 INFO L225 Difference]: With dead ends: 175 [2018-01-24 15:52:31,668 INFO L226 Difference]: Without dead ends: 111 [2018-01-24 15:52:31,669 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:31,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-24 15:52:31,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-01-24 15:52:31,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-24 15:52:31,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 116 transitions. [2018-01-24 15:52:31,686 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 116 transitions. Word has length 47 [2018-01-24 15:52:31,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:52:31,687 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 116 transitions. [2018-01-24 15:52:31,687 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 15:52:31,687 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 116 transitions. [2018-01-24 15:52:31,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-24 15:52:31,688 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:52:31,688 INFO L322 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:52:31,688 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:31,688 INFO L82 PathProgramCache]: Analyzing trace with hash 2136929804, now seen corresponding path program 1 times [2018-01-24 15:52:31,688 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:52:31,689 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:31,690 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:31,690 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:31,690 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:52:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:31,704 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,782 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 15:52:31,782 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:52:31,782 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 15:52:31,782 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:52:31,783 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 15:52:31,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 15:52:31,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 15:52:31,783 INFO L87 Difference]: Start difference. First operand 111 states and 116 transitions. Second operand 10 states. [2018-01-24 15:52:31,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:52:31,847 INFO L93 Difference]: Finished difference Result 177 states and 185 transitions. [2018-01-24 15:52:31,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 15:52:31,847 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2018-01-24 15:52:31,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:52:31,848 INFO L225 Difference]: With dead ends: 177 [2018-01-24 15:52:31,848 INFO L226 Difference]: Without dead ends: 111 [2018-01-24 15:52:31,849 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:31,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-24 15:52:31,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-01-24 15:52:31,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-24 15:52:31,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2018-01-24 15:52:31,861 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 52 [2018-01-24 15:52:31,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:52:31,861 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2018-01-24 15:52:31,861 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 15:52:31,861 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2018-01-24 15:52:31,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-24 15:52:31,862 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:52:31,862 INFO L322 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:52:31,862 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:31,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1070951830, now seen corresponding path program 1 times [2018-01-24 15:52:31,862 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:52:31,863 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:31,863 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:31,863 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:31,863 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:52:31,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:31,879 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:32,073 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:32,073 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:52:32,073 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-01-24 15:52:32,073 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:52:32,073 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 15:52:32,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 15:52:32,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-01-24 15:52:32,074 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand 21 states. [2018-01-24 15:52:32,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:52:32,540 INFO L93 Difference]: Finished difference Result 141 states and 153 transitions. [2018-01-24 15:52:32,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-24 15:52:32,540 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 63 [2018-01-24 15:52:32,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:52:32,541 INFO L225 Difference]: With dead ends: 141 [2018-01-24 15:52:32,541 INFO L226 Difference]: Without dead ends: 139 [2018-01-24 15:52:32,542 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2018-01-24 15:52:32,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-01-24 15:52:32,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 134. [2018-01-24 15:52:32,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-01-24 15:52:32,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2018-01-24 15:52:32,562 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 63 [2018-01-24 15:52:32,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:52:32,563 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2018-01-24 15:52:32,563 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-24 15:52:32,563 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2018-01-24 15:52:32,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-24 15:52:32,564 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:52:32,564 INFO L322 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:52:32,564 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:32,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1070951829, now seen corresponding path program 1 times [2018-01-24 15:52:32,565 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:52:32,565 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:32,566 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:32,566 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:32,566 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:52:32,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:32,588 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:32,659 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:32,659 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:52:32,659 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:52:32,660 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 64 with the following transitions: [2018-01-24 15:52:32,660 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], [119], [120], [122], [123], [124], [125], [132], [133], [134], [135], [136], [137], [138], [140], [142], [143], [146], [147], [148], [152], [153], [154], [155], [156], [162], [164], [165], [166] [2018-01-24 15:52:32,663 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:52:32,663 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:52:36,019 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:52:36,019 INFO L268 AbstractInterpreter]: Visited 61 different actions 69 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 26 variables. [2018-01-24 15:52:36,032 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:52:36,032 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:52:36,032 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:36,038 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:36,038 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:52:36,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:36,074 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:52:36,091 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:36,091 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:52:36,192 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:36,212 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:52:36,212 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:36,218 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:36,219 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:52:36,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:36,289 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:52:36,295 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:36,295 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:52:36,349 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:36,351 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:52:36,351 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 13 [2018-01-24 15:52:36,351 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:52:36,352 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 15:52:36,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 15:52:36,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-01-24 15:52:36,352 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand 8 states. [2018-01-24 15:52:36,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:52:36,380 INFO L93 Difference]: Finished difference Result 244 states and 268 transitions. [2018-01-24 15:52:36,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 15:52:36,380 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2018-01-24 15:52:36,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:52:36,382 INFO L225 Difference]: With dead ends: 244 [2018-01-24 15:52:36,382 INFO L226 Difference]: Without dead ends: 135 [2018-01-24 15:52:36,382 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 244 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=77, Invalid=105, Unknown=0, NotChecked=0, Total=182 [2018-01-24 15:52:36,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-24 15:52:36,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-01-24 15:52:36,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-24 15:52:36,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2018-01-24 15:52:36,404 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 63 [2018-01-24 15:52:36,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:52:36,404 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2018-01-24 15:52:36,404 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 15:52:36,404 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2018-01-24 15:52:36,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-24 15:52:36,405 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:52:36,405 INFO L322 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:52:36,405 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:36,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1223229503, now seen corresponding path program 2 times [2018-01-24 15:52:36,406 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:52:36,407 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:36,407 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:52:36,407 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:36,407 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:52:36,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:36,429 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,514 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:36,515 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:52:36,515 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:52:36,515 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:52:36,515 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:36,515 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:52:36,515 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:36,520 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:52:36,521 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:52:36,554 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:52:36,567 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:52:36,572 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:52:36,583 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:36,583 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:52:36,624 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:36,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:52:36,637 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:36,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-24 15:52:37,438 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,438 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:52:40,277 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:40,297 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 15:52:40,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20, 18] imperfect sequences [8] total 44 [2018-01-24 15:52:40,298 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:52:40,298 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 15:52:40,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 15:52:40,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1745, Unknown=1, NotChecked=0, Total=1892 [2018-01-24 15:52:40,299 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand 21 states. [2018-01-24 15:52:41,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:52:41,294 INFO L93 Difference]: Finished difference Result 135 states and 147 transitions. [2018-01-24 15:52:41,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-24 15:52:41,294 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-01-24 15:52:41,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:52:41,295 INFO L225 Difference]: With dead ends: 135 [2018-01-24 15:52:41,296 INFO L226 Difference]: Without dead ends: 133 [2018-01-24 15:52:41,296 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=195, Invalid=2254, Unknown=1, NotChecked=0, Total=2450 [2018-01-24 15:52:41,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-24 15:52:41,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-01-24 15:52:41,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-24 15:52:41,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 143 transitions. [2018-01-24 15:52:41,318 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 143 transitions. Word has length 64 [2018-01-24 15:52:41,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:52:41,318 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 143 transitions. [2018-01-24 15:52:41,318 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-24 15:52:41,318 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 143 transitions. [2018-01-24 15:52:41,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-24 15:52:41,319 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:52:41,319 INFO L322 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:52:41,319 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:41,319 INFO L82 PathProgramCache]: Analyzing trace with hash -577954366, now seen corresponding path program 1 times [2018-01-24 15:52:41,319 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:52:41,320 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:41,320 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 15:52:41,320 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:52:41,320 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:52:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:52:41,335 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,470 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-01-24 15:52:41,471 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:52:41,471 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:52:41,471 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 68 with the following transitions: [2018-01-24 15:52:41,471 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [12], [13], [16], [17], [24], [26], [27], [32], [34], [48], [50], [53], [54], [58], [61], [62], [63], [66], [67], [68], [72], [74], [75], [107], [108], [111], [114], [115], [118], [119], [120], [122], [123], [124], [132], [133], [134], [135], [136], [137], [138], [139], [142], [143], [146], [147], [148], [149], [150], [151], [152], [153], [154], [155], [164], [165], [166] [2018-01-24 15:52:41,474 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:52:41,474 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:52:44,250 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-24 15:52:44,250 INFO L268 AbstractInterpreter]: Visited 54 different actions 62 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 22 variables. [2018-01-24 15:52:44,254 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-24 15:52:45,188 INFO L232 lantSequenceWeakener]: Weakened 32 states. On average, predicates are now at 67.72% of their original sizes. [2018-01-24 15:52:45,188 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-24 15:52:46,384 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-24 15:52:46,385 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 15:52:46,385 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [33] imperfect sequences [11] total 43 [2018-01-24 15:52:46,385 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:52:46,385 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-24 15:52:46,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-24 15:52:46,386 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1002, Unknown=0, NotChecked=0, Total=1122 [2018-01-24 15:52:46,386 INFO L87 Difference]: Start difference. First operand 133 states and 143 transitions. Second operand 34 states. Received shutdown request... [2018-01-24 15:52:53,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 15:52:53,977 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 15:52:53,981 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 15:52:53,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 03:52:53 BoogieIcfgContainer [2018-01-24 15:52:53,982 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 15:52:53,983 INFO L168 Benchmark]: Toolchain (without parser) took 44125.86 ms. Allocated memory was 296.2 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 255.1 MB in the beginning and 1.2 GB in the end (delta: -936.9 MB). Peak memory consumption was 190.8 MB. Max. memory is 5.3 GB. [2018-01-24 15:52:53,984 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 296.2 MB. Free memory is still 262.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 15:52:53,984 INFO L168 Benchmark]: CACSL2BoogieTranslator took 245.65 ms. Allocated memory is still 296.2 MB. Free memory was 255.1 MB in the beginning and 241.0 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 5.3 GB. [2018-01-24 15:52:53,984 INFO L168 Benchmark]: Boogie Preprocessor took 41.70 ms. Allocated memory is still 296.2 MB. Free memory was 241.0 MB in the beginning and 239.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:53,985 INFO L168 Benchmark]: RCFGBuilder took 465.55 ms. Allocated memory is still 296.2 MB. Free memory was 239.0 MB in the beginning and 208.0 MB in the end (delta: 31.0 MB). Peak memory consumption was 31.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:52:53,985 INFO L168 Benchmark]: TraceAbstraction took 43363.03 ms. Allocated memory was 296.2 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 208.0 MB in the beginning and 1.2 GB in the end (delta: -984.1 MB). Peak memory consumption was 143.7 MB. Max. memory is 5.3 GB. [2018-01-24 15:52:53,987 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 296.2 MB. Free memory is still 262.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 245.65 ms. Allocated memory is still 296.2 MB. Free memory was 255.1 MB in the beginning and 241.0 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.70 ms. Allocated memory is still 296.2 MB. Free memory was 241.0 MB in the beginning and 239.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 465.55 ms. Allocated memory is still 296.2 MB. Free memory was 239.0 MB in the beginning and 208.0 MB in the end (delta: 31.0 MB). Peak memory consumption was 31.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 43363.03 ms. Allocated memory was 296.2 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 208.0 MB in the beginning and 1.2 GB in the end (delta: -984.1 MB). Peak memory consumption was 143.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 34 LocStat_MAX_WEQGRAPH_SIZE : 3 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 259 LocStat_NO_SUPPORTING_DISEQUALITIES : 25 LocStat_NO_DISJUNCTIONS : -68 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 53 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 108 TransStat_NO_SUPPORTING_DISEQUALITIES : 9 TransStat_NO_DISJUNCTIONS : 57 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.582485 RENAME_VARIABLES(MILLISECONDS) : 0.129248 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.203556 PROJECTAWAY(MILLISECONDS) : 0.069221 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.148664 DISJOIN(MILLISECONDS) : 0.789946 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.160348 ADD_EQUALITY(MILLISECONDS) : 0.029713 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.007183 #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.453878 RENAME_VARIABLES(MILLISECONDS) : 0.107837 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.181506 PROJECTAWAY(MILLISECONDS) : 0.041069 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.063734 DISJOIN(MILLISECONDS) : 0.686597 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.135194 ADD_EQUALITY(MILLISECONDS) : 0.021772 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.010113 #CONJOIN_DISJUNCTIVE : 96 #RENAME_VARIABLES : 160 #UNFREEZE : 0 #CONJOIN : 203 #PROJECTAWAY : 159 #ADD_WEAK_EQUALITY : 15 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 156 #ADD_EQUALITY : 128 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 60 LocStat_MAX_WEQGRAPH_SIZE : 6 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 486 LocStat_NO_SUPPORTING_DISEQUALITIES : 51 LocStat_NO_DISJUNCTIONS : -120 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 89 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 190 TransStat_NO_SUPPORTING_DISEQUALITIES : 11 TransStat_NO_DISJUNCTIONS : 94 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.267408 RENAME_VARIABLES(MILLISECONDS) : 0.056594 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.098240 PROJECTAWAY(MILLISECONDS) : 0.022875 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.039563 DISJOIN(MILLISECONDS) : 0.379095 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.070988 ADD_EQUALITY(MILLISECONDS) : 0.016675 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.004806 #CONJOIN_DISJUNCTIVE : 138 #RENAME_VARIABLES : 223 #UNFREEZE : 0 #CONJOIN : 310 #PROJECTAWAY : 230 #ADD_WEAK_EQUALITY : 27 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 218 #ADD_EQUALITY : 206 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 10 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 52 LocStat_MAX_WEQGRAPH_SIZE : 6 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 397 LocStat_NO_SUPPORTING_DISEQUALITIES : 43 LocStat_NO_DISJUNCTIONS : -104 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 76 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 2 TransStat_NO_SUPPORTING_EQUALITIES : 144 TransStat_NO_SUPPORTING_DISEQUALITIES : 9 TransStat_NO_DISJUNCTIONS : 79 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.332292 RENAME_VARIABLES(MILLISECONDS) : 0.045652 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.313944 PROJECTAWAY(MILLISECONDS) : 0.007866 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.028715 DISJOIN(MILLISECONDS) : 0.378202 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.058536 ADD_EQUALITY(MILLISECONDS) : 0.008488 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.006743 #CONJOIN_DISJUNCTIVE : 120 #RENAME_VARIABLES : 201 #UNFREEZE : 0 #CONJOIN : 262 #PROJECTAWAY : 203 #ADD_WEAK_EQUALITY : 27 #DISJOIN : 3 #RENAME_VARIABLES_DISJUNCTIVE : 198 #ADD_EQUALITY : 160 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1294). Cancelled while BasicCegarLoop was constructing difference of abstraction (133states) and interpolant automaton (currently 15 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1294). Cancelled while BasicCegarLoop was constructing difference of abstraction (133states) and interpolant automaton (currently 15 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 39 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1411). Cancelled while BasicCegarLoop was constructing difference of abstraction (133states) and interpolant automaton (currently 15 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 39 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1411). Cancelled while BasicCegarLoop was constructing difference of abstraction (133states) and interpolant automaton (currently 15 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1265). Cancelled while BasicCegarLoop was constructing difference of abstraction (133states) and interpolant automaton (currently 15 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1265). Cancelled while BasicCegarLoop was constructing difference of abstraction (133states) and interpolant automaton (currently 15 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1267). Cancelled while BasicCegarLoop was constructing difference of abstraction (133states) and interpolant automaton (currently 15 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1267). Cancelled while BasicCegarLoop was constructing difference of abstraction (133states) and interpolant automaton (currently 15 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was constructing difference of abstraction (133states) and interpolant automaton (currently 15 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was constructing difference of abstraction (133states) and interpolant automaton (currently 15 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was constructing difference of abstraction (133states) and interpolant automaton (currently 15 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was constructing difference of abstraction (133states) and interpolant automaton (currently 15 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1339). Cancelled while BasicCegarLoop was constructing difference of abstraction (133states) and interpolant automaton (currently 15 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1339). Cancelled while BasicCegarLoop was constructing difference of abstraction (133states) and interpolant automaton (currently 15 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 39 known predicates. - TimeoutResultAtElement [Line: 1443]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1443). Cancelled while BasicCegarLoop was constructing difference of abstraction (133states) and interpolant automaton (currently 15 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1099). Cancelled while BasicCegarLoop was constructing difference of abstraction (133states) and interpolant automaton (currently 15 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1100). Cancelled while BasicCegarLoop was constructing difference of abstraction (133states) and interpolant automaton (currently 15 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1100). Cancelled while BasicCegarLoop was constructing difference of abstraction (133states) and interpolant automaton (currently 15 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1099). Cancelled while BasicCegarLoop was constructing difference of abstraction (133states) and interpolant automaton (currently 15 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 39 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 18 procedures, 119 locations, 19 error locations. TIMEOUT Result, 43.3s OverallTime, 19 OverallIterations, 4 TraceHistogramMax, 12.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1932 SDtfs, 607 SDslu, 9758 SDs, 0 SdLazy, 3903 SolverSat, 144 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.2s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 1085 GetRequests, 792 SyntacticMatches, 12 SemanticMatches, 280 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1570 ImplicationChecksByTransitivity, 14.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=135occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 12.6s AbstIntTime, 4 AbstIntIterations, 1 AbstIntStrong, 0.9285559014168642 AbsIntWeakeningRatio, 0.8333333333333334 AbsIntAvgWeakeningVarsNumRemoved, 4.2272727272727275 AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 23 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 14.5s InterpolantComputationTime, 1189 NumberOfCodeBlocks, 1180 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1572 ConstructedInterpolants, 103 QuantifiedInterpolants, 297869 SizeOfPredicates, 49 NumberOfNonLiveVariables, 2028 ConjunctsInSsa, 185 ConjunctsInUnsatCore, 37 InterpolantComputations, 18 PerfectInterpolantSequences, 78/150 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_15-52-54-000.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_15-52-54-000.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_15-52-54-000.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_15-52-54-000.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_15-52-54-000.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-24_15-52-54-000.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-24_15-52-54-000.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-24_15-52-54-000.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-24_15-52-54-000.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_15-52-54-000.csv Completed graceful shutdown