java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_5_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 06:01:04,049 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 06:01:04,050 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 06:01:04,066 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 06:01:04,066 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 06:01:04,067 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 06:01:04,068 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 06:01:04,070 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 06:01:04,073 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 06:01:04,074 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 06:01:04,074 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 06:01:04,075 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 06:01:04,076 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 06:01:04,077 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 06:01:04,078 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 06:01:04,080 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 06:01:04,082 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 06:01:04,084 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 06:01:04,086 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 06:01:04,087 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 06:01:04,089 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 06:01:04,090 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 06:01:04,090 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 06:01:04,091 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 06:01:04,091 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 06:01:04,092 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 06:01:04,092 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 06:01:04,093 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 06:01:04,093 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 06:01:04,093 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 06:01:04,094 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 06:01:04,094 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf [2018-01-25 06:01:04,103 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 06:01:04,103 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 06:01:04,103 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 06:01:04,103 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 06:01:04,104 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 06:01:04,104 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 06:01:04,104 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 06:01:04,104 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 06:01:04,104 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 06:01:04,105 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 06:01:04,105 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 06:01:04,105 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 06:01:04,105 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 06:01:04,105 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 06:01:04,105 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 06:01:04,105 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 06:01:04,105 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 06:01:04,106 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 06:01:04,106 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 06:01:04,106 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 06:01:04,106 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 06:01:04,106 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 06:01:04,106 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 06:01:04,107 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 06:01:04,107 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 06:01:04,107 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 06:01:04,107 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 06:01:04,107 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 06:01:04,108 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 06:01:04,108 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 06:01:04,108 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 06:01:04,108 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 06:01:04,108 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 06:01:04,108 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 06:01:04,109 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 06:01:04,109 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 06:01:04,142 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 06:01:04,153 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 06:01:04,156 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 06:01:04,157 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 06:01:04,157 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 06:01:04,158 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_5_false-valid-deref.i [2018-01-25 06:01:04,342 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 06:01:04,348 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 06:01:04,349 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 06:01:04,349 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 06:01:04,354 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 06:01:04,355 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:01:04" (1/1) ... [2018-01-25 06:01:04,359 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d434187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:01:04, skipping insertion in model container [2018-01-25 06:01:04,360 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:01:04" (1/1) ... [2018-01-25 06:01:04,381 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:01:04,438 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:01:04,573 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:01:04,598 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:01:04,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:01:04 WrapperNode [2018-01-25 06:01:04,611 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 06:01:04,611 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 06:01:04,612 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 06:01:04,612 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 06:01:04,623 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:01:04" (1/1) ... [2018-01-25 06:01:04,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:01:04" (1/1) ... [2018-01-25 06:01:04,635 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:01:04" (1/1) ... [2018-01-25 06:01:04,635 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:01:04" (1/1) ... [2018-01-25 06:01:04,645 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:01:04" (1/1) ... [2018-01-25 06:01:04,650 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:01:04" (1/1) ... [2018-01-25 06:01:04,652 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:01:04" (1/1) ... [2018-01-25 06:01:04,656 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 06:01:04,657 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 06:01:04,657 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 06:01:04,657 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 06:01:04,658 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:01:04" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 06:01:04,708 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 06:01:04,708 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 06:01:04,709 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-01-25 06:01:04,709 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-25 06:01:04,709 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-01-25 06:01:04,709 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-01-25 06:01:04,709 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-01-25 06:01:04,709 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-01-25 06:01:04,709 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-01-25 06:01:04,709 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-01-25 06:01:04,709 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-01-25 06:01:04,709 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-01-25 06:01:04,710 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-01-25 06:01:04,710 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-01-25 06:01:04,710 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-01-25 06:01:04,710 INFO L136 BoogieDeclarations]: Found implementation of procedure f_22_put [2018-01-25 06:01:04,710 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-25 06:01:04,710 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 06:01:04,710 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 06:01:04,710 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 06:01:04,710 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 06:01:04,711 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 06:01:04,711 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 06:01:04,711 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 06:01:04,711 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 06:01:04,711 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-25 06:01:04,711 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-25 06:01:04,711 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 06:01:04,711 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 06:01:04,711 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 06:01:04,712 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-25 06:01:04,712 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-25 06:01:04,712 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-01-25 06:01:04,712 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-01-25 06:01:04,712 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-01-25 06:01:04,712 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-01-25 06:01:04,712 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-01-25 06:01:04,712 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-01-25 06:01:04,712 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-01-25 06:01:04,712 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-01-25 06:01:04,712 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-01-25 06:01:04,713 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-01-25 06:01:04,713 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-01-25 06:01:04,713 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-01-25 06:01:04,713 INFO L128 BoogieDeclarations]: Found specification of procedure f_22_put [2018-01-25 06:01:04,713 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-25 06:01:04,713 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 06:01:04,713 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 06:01:04,713 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 06:01:04,944 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-25 06:01:05,095 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 06:01:05,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:01:05 BoogieIcfgContainer [2018-01-25 06:01:05,096 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 06:01:05,097 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 06:01:05,097 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 06:01:05,100 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 06:01:05,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 06:01:04" (1/3) ... [2018-01-25 06:01:05,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ee74cfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:01:05, skipping insertion in model container [2018-01-25 06:01:05,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:01:04" (2/3) ... [2018-01-25 06:01:05,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ee74cfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:01:05, skipping insertion in model container [2018-01-25 06:01:05,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:01:05" (3/3) ... [2018-01-25 06:01:05,104 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test22_5_false-valid-deref.i [2018-01-25 06:01:05,114 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 06:01:05,123 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-01-25 06:01:05,176 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 06:01:05,176 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 06:01:05,176 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 06:01:05,176 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 06:01:05,177 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 06:01:05,177 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 06:01:05,177 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 06:01:05,177 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 06:01:05,178 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 06:01:05,202 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states. [2018-01-25 06:01:05,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 06:01:05,210 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:05,211 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:01:05,211 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-25 06:01:05,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1211515492, now seen corresponding path program 1 times [2018-01-25 06:01:05,220 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:05,271 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:05,271 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:05,272 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:05,272 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:05,338 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:05,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:01:05,484 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:01:05,484 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:01:05,485 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:01:05,555 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:01:05,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:01:05,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:01:05,572 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 5 states. [2018-01-25 06:01:05,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:05,644 INFO L93 Difference]: Finished difference Result 234 states and 249 transitions. [2018-01-25 06:01:05,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:01:05,646 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-25 06:01:05,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:05,662 INFO L225 Difference]: With dead ends: 234 [2018-01-25 06:01:05,662 INFO L226 Difference]: Without dead ends: 126 [2018-01-25 06:01:05,667 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:01:05,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-25 06:01:05,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2018-01-25 06:01:05,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-25 06:01:05,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2018-01-25 06:01:05,716 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 17 [2018-01-25 06:01:05,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:05,716 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2018-01-25 06:01:05,716 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:01:05,716 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2018-01-25 06:01:05,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 06:01:05,717 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:05,717 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:01:05,717 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-25 06:01:05,717 INFO L82 PathProgramCache]: Analyzing trace with hash 774524518, now seen corresponding path program 1 times [2018-01-25 06:01:05,717 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:05,719 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:05,719 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:05,720 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:05,720 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:05,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:05,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:05,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:01:05,815 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:01:05,815 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:01:05,815 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:01:05,817 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:01:05,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:01:05,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:01:05,817 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand 6 states. [2018-01-25 06:01:06,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:06,040 INFO L93 Difference]: Finished difference Result 126 states and 134 transitions. [2018-01-25 06:01:06,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:01:06,040 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-25 06:01:06,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:06,042 INFO L225 Difference]: With dead ends: 126 [2018-01-25 06:01:06,042 INFO L226 Difference]: Without dead ends: 125 [2018-01-25 06:01:06,043 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:01:06,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-25 06:01:06,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-01-25 06:01:06,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-25 06:01:06,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2018-01-25 06:01:06,053 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 19 [2018-01-25 06:01:06,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:06,054 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2018-01-25 06:01:06,054 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:01:06,054 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2018-01-25 06:01:06,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 06:01:06,054 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:06,054 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:01:06,055 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-25 06:01:06,055 INFO L82 PathProgramCache]: Analyzing trace with hash 774524519, now seen corresponding path program 1 times [2018-01-25 06:01:06,055 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:06,056 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:06,056 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:06,056 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:06,056 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:06,078 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:06,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:01:06,371 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:01:06,371 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 06:01:06,371 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:01:06,372 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 06:01:06,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 06:01:06,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:01:06,372 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand 7 states. [2018-01-25 06:01:06,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:06,582 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2018-01-25 06:01:06,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 06:01:06,582 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-01-25 06:01:06,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:06,584 INFO L225 Difference]: With dead ends: 125 [2018-01-25 06:01:06,584 INFO L226 Difference]: Without dead ends: 124 [2018-01-25 06:01:06,585 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-25 06:01:06,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-25 06:01:06,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-01-25 06:01:06,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-25 06:01:06,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2018-01-25 06:01:06,601 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 19 [2018-01-25 06:01:06,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:06,602 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2018-01-25 06:01:06,602 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 06:01:06,602 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2018-01-25 06:01:06,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 06:01:06,604 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:06,604 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:01:06,604 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-25 06:01:06,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1886266821, now seen corresponding path program 1 times [2018-01-25 06:01:06,605 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:06,606 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:06,607 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:06,607 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:06,607 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:06,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:06,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:06,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:01:06,761 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:01:06,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 06:01:06,761 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:01:06,761 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 06:01:06,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 06:01:06,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-25 06:01:06,762 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand 9 states. [2018-01-25 06:01:06,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:06,903 INFO L93 Difference]: Finished difference Result 198 states and 213 transitions. [2018-01-25 06:01:06,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 06:01:06,909 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-01-25 06:01:06,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:06,911 INFO L225 Difference]: With dead ends: 198 [2018-01-25 06:01:06,911 INFO L226 Difference]: Without dead ends: 139 [2018-01-25 06:01:06,912 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-25 06:01:06,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-01-25 06:01:06,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2018-01-25 06:01:06,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-25 06:01:06,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 144 transitions. [2018-01-25 06:01:06,925 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 144 transitions. Word has length 31 [2018-01-25 06:01:06,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:06,926 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 144 transitions. [2018-01-25 06:01:06,926 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 06:01:06,926 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 144 transitions. [2018-01-25 06:01:06,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 06:01:06,928 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:06,928 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:01:06,928 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-25 06:01:06,928 INFO L82 PathProgramCache]: Analyzing trace with hash 107698799, now seen corresponding path program 1 times [2018-01-25 06:01:06,928 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:06,930 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:06,933 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:06,933 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:06,933 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:06,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:06,953 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:07,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:01:07,037 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:01:07,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 06:01:07,037 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:01:07,038 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 06:01:07,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 06:01:07,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:01:07,038 INFO L87 Difference]: Start difference. First operand 135 states and 144 transitions. Second operand 10 states. [2018-01-25 06:01:07,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:07,253 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2018-01-25 06:01:07,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 06:01:07,253 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-01-25 06:01:07,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:07,255 INFO L225 Difference]: With dead ends: 135 [2018-01-25 06:01:07,255 INFO L226 Difference]: Without dead ends: 134 [2018-01-25 06:01:07,256 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-01-25 06:01:07,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-01-25 06:01:07,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-01-25 06:01:07,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-01-25 06:01:07,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 143 transitions. [2018-01-25 06:01:07,271 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 143 transitions. Word has length 34 [2018-01-25 06:01:07,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:07,271 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 143 transitions. [2018-01-25 06:01:07,271 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 06:01:07,271 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 143 transitions. [2018-01-25 06:01:07,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 06:01:07,272 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:07,273 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:01:07,273 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-25 06:01:07,273 INFO L82 PathProgramCache]: Analyzing trace with hash 107698800, now seen corresponding path program 1 times [2018-01-25 06:01:07,273 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:07,274 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:07,274 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:07,274 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:07,274 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:07,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:07,291 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:07,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:01:07,342 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:01:07,342 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 06:01:07,342 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:01:07,343 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:01:07,343 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:01:07,343 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:01:07,343 INFO L87 Difference]: Start difference. First operand 134 states and 143 transitions. Second operand 4 states. [2018-01-25 06:01:07,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:07,386 INFO L93 Difference]: Finished difference Result 230 states and 245 transitions. [2018-01-25 06:01:07,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 06:01:07,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-01-25 06:01:07,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:07,388 INFO L225 Difference]: With dead ends: 230 [2018-01-25 06:01:07,388 INFO L226 Difference]: Without dead ends: 135 [2018-01-25 06:01:07,389 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:01:07,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-25 06:01:07,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-01-25 06:01:07,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-25 06:01:07,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 144 transitions. [2018-01-25 06:01:07,401 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 144 transitions. Word has length 34 [2018-01-25 06:01:07,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:07,402 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 144 transitions. [2018-01-25 06:01:07,402 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:01:07,402 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 144 transitions. [2018-01-25 06:01:07,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-25 06:01:07,403 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:07,403 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:01:07,403 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-25 06:01:07,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1590593736, now seen corresponding path program 1 times [2018-01-25 06:01:07,404 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:07,405 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:07,405 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:07,405 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:07,405 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:07,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:07,422 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:07,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:01:07,498 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:01:07,498 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:01:07,499 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-01-25 06:01:07,501 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [27], [32], [48], [54], [58], [62], [65], [67], [68], [72], [74], [75], [118], [121], [122], [123], [125], [126], [127], [135], [136], [137], [138], [139], [141], [145], [149], [155], [169], [170], [171] [2018-01-25 06:01:07,569 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:01:07,569 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:01:09,845 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 06:01:09,846 INFO L268 AbstractInterpreter]: Visited 35 different actions 43 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 21 variables. [2018-01-25 06:01:09,859 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 06:01:09,860 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:01:09,860 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 06:01:09,881 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:09,881 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:01:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:09,932 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:01:10,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:01:10,003 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:01:10,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:01:10,119 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:01:10,119 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 06:01:10,128 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:10,128 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:01:10,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:10,184 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:01:10,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:01:10,190 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:01:10,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (3)] Exception during sending of exit command (exit): Broken pipe [2018-01-25 06:01:10,262 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 06:01:10,262 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5] total 9 [2018-01-25 06:01:10,262 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 06:01:10,263 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:01:10,264 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:01:10,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-01-25 06:01:10,264 INFO L87 Difference]: Start difference. First operand 135 states and 144 transitions. Second operand 6 states. [2018-01-25 06:01:10,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:10,321 INFO L93 Difference]: Finished difference Result 231 states and 246 transitions. [2018-01-25 06:01:10,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:01:10,322 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-25 06:01:10,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:10,324 INFO L225 Difference]: With dead ends: 231 [2018-01-25 06:01:10,324 INFO L226 Difference]: Without dead ends: 136 [2018-01-25 06:01:10,325 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 134 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:01:10,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-01-25 06:01:10,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-01-25 06:01:10,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-01-25 06:01:10,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 145 transitions. [2018-01-25 06:01:10,337 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 145 transitions. Word has length 35 [2018-01-25 06:01:10,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:10,338 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 145 transitions. [2018-01-25 06:01:10,338 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:01:10,338 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 145 transitions. [2018-01-25 06:01:10,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-25 06:01:10,339 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:10,340 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:01:10,340 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-25 06:01:10,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1596912496, now seen corresponding path program 2 times [2018-01-25 06:01:10,340 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:10,341 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:10,342 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:10,342 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:10,342 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:10,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:10,361 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:10,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:01:10,434 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:01:10,434 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:01:10,434 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 06:01:10,435 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 06:01:10,435 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:01:10,435 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 06:01:10,461 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 06:01:10,461 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 06:01:10,484 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:01:10,489 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:01:10,493 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:01:10,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-25 06:01:10,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:01:10,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-25 06:01:10,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:01:10,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-25 06:01:10,609 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-25 06:01:11,137 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 45 DAG size of output 17 [2018-01-25 06:01:11,350 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-25 06:01:11,350 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:01:11,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-25 06:01:11,748 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 06:01:11,748 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14, 13] imperfect sequences [6] total 31 [2018-01-25 06:01:11,748 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:01:11,748 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-25 06:01:11,749 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-25 06:01:11,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=840, Unknown=0, NotChecked=0, Total=930 [2018-01-25 06:01:11,749 INFO L87 Difference]: Start difference. First operand 136 states and 145 transitions. Second operand 15 states. [2018-01-25 06:01:12,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:12,595 INFO L93 Difference]: Finished difference Result 153 states and 162 transitions. [2018-01-25 06:01:12,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-25 06:01:12,595 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2018-01-25 06:01:12,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:12,597 INFO L225 Difference]: With dead ends: 153 [2018-01-25 06:01:12,597 INFO L226 Difference]: Without dead ends: 152 [2018-01-25 06:01:12,598 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=118, Invalid=1072, Unknown=0, NotChecked=0, Total=1190 [2018-01-25 06:01:12,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-25 06:01:12,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 135. [2018-01-25 06:01:12,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-25 06:01:12,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 144 transitions. [2018-01-25 06:01:12,614 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 144 transitions. Word has length 36 [2018-01-25 06:01:12,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:12,614 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 144 transitions. [2018-01-25 06:01:12,614 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-25 06:01:12,614 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 144 transitions. [2018-01-25 06:01:12,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-25 06:01:12,615 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:12,616 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:01:12,616 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-25 06:01:12,616 INFO L82 PathProgramCache]: Analyzing trace with hash 2040634480, now seen corresponding path program 1 times [2018-01-25 06:01:12,616 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:12,617 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:12,617 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 06:01:12,618 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:12,618 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:12,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:12,624 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:12,668 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-25 06:01:12,668 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:01:12,668 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 06:01:12,668 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:01:12,669 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 06:01:12,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 06:01:12,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 06:01:12,669 INFO L87 Difference]: Start difference. First operand 135 states and 144 transitions. Second operand 3 states. [2018-01-25 06:01:12,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:12,784 INFO L93 Difference]: Finished difference Result 154 states and 165 transitions. [2018-01-25 06:01:12,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 06:01:12,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-01-25 06:01:12,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:12,785 INFO L225 Difference]: With dead ends: 154 [2018-01-25 06:01:12,785 INFO L226 Difference]: Without dead ends: 141 [2018-01-25 06:01:12,786 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 06:01:12,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-01-25 06:01:12,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 131. [2018-01-25 06:01:12,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-01-25 06:01:12,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 139 transitions. [2018-01-25 06:01:12,801 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 139 transitions. Word has length 36 [2018-01-25 06:01:12,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:12,801 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 139 transitions. [2018-01-25 06:01:12,801 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 06:01:12,801 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 139 transitions. [2018-01-25 06:01:12,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-25 06:01:12,803 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:12,803 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:01:12,803 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-25 06:01:12,803 INFO L82 PathProgramCache]: Analyzing trace with hash 746437934, now seen corresponding path program 1 times [2018-01-25 06:01:12,803 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:12,804 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:12,804 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:12,805 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:12,805 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:12,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:12,812 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:12,860 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-25 06:01:12,860 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:01:12,860 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 06:01:12,860 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:01:12,861 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:01:12,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:01:12,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:01:12,861 INFO L87 Difference]: Start difference. First operand 131 states and 139 transitions. Second operand 6 states. [2018-01-25 06:01:12,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:12,889 INFO L93 Difference]: Finished difference Result 135 states and 142 transitions. [2018-01-25 06:01:12,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:01:12,889 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-01-25 06:01:12,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:12,890 INFO L225 Difference]: With dead ends: 135 [2018-01-25 06:01:12,890 INFO L226 Difference]: Without dead ends: 118 [2018-01-25 06:01:12,891 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:01:12,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-25 06:01:12,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-01-25 06:01:12,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-25 06:01:12,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 124 transitions. [2018-01-25 06:01:12,908 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 124 transitions. Word has length 38 [2018-01-25 06:01:12,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:12,908 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 124 transitions. [2018-01-25 06:01:12,908 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:01:12,908 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2018-01-25 06:01:12,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-25 06:01:12,909 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:12,909 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:01:12,909 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-25 06:01:12,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1456559415, now seen corresponding path program 1 times [2018-01-25 06:01:12,910 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:12,911 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:12,911 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:12,911 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:12,911 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:12,928 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:13,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-25 06:01:13,015 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:01:13,015 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 06:01:13,016 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:01:13,016 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 06:01:13,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 06:01:13,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:01:13,017 INFO L87 Difference]: Start difference. First operand 118 states and 124 transitions. Second operand 10 states. [2018-01-25 06:01:13,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:13,289 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2018-01-25 06:01:13,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 06:01:13,290 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2018-01-25 06:01:13,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:13,291 INFO L225 Difference]: With dead ends: 118 [2018-01-25 06:01:13,291 INFO L226 Difference]: Without dead ends: 116 [2018-01-25 06:01:13,291 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-01-25 06:01:13,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-25 06:01:13,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-01-25 06:01:13,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-25 06:01:13,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 122 transitions. [2018-01-25 06:01:13,303 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 122 transitions. Word has length 41 [2018-01-25 06:01:13,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:13,303 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 122 transitions. [2018-01-25 06:01:13,303 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 06:01:13,303 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2018-01-25 06:01:13,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-25 06:01:13,304 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:13,304 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:01:13,304 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-25 06:01:13,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1456559416, now seen corresponding path program 1 times [2018-01-25 06:01:13,304 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:13,305 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:13,305 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:13,305 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:13,305 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:13,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:13,320 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:13,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:01:13,427 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:01:13,428 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:01:13,428 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-01-25 06:01:13,428 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [27], [32], [48], [54], [58], [62], [63], [66], [67], [68], [72], [74], [75], [107], [110], [118], [121], [122], [123], [125], [126], [127], [135], [136], [137], [138], [139], [141], [145], [149], [155], [156], [157], [169], [170], [171] [2018-01-25 06:01:13,430 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:01:13,430 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:01:16,568 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 06:01:16,568 INFO L268 AbstractInterpreter]: Visited 40 different actions 48 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 21 variables. [2018-01-25 06:01:16,579 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 06:01:16,579 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:01:16,580 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 06:01:16,587 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:16,588 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:01:16,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:16,615 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:01:16,636 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:01:16,636 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:01:16,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:01:16,834 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:01:16,835 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 06:01:16,839 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:16,839 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:01:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:16,905 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:01:16,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:01:16,912 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:01:16,955 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:01:16,957 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 06:01:16,957 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6] total 11 [2018-01-25 06:01:16,957 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 06:01:16,958 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 06:01:16,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 06:01:16,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-01-25 06:01:16,958 INFO L87 Difference]: Start difference. First operand 116 states and 122 transitions. Second operand 7 states. [2018-01-25 06:01:16,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:16,995 INFO L93 Difference]: Finished difference Result 209 states and 221 transitions. [2018-01-25 06:01:16,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:01:16,996 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-01-25 06:01:16,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:16,997 INFO L225 Difference]: With dead ends: 209 [2018-01-25 06:01:16,997 INFO L226 Difference]: Without dead ends: 117 [2018-01-25 06:01:16,998 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2018-01-25 06:01:16,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-25 06:01:17,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-01-25 06:01:17,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-25 06:01:17,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 123 transitions. [2018-01-25 06:01:17,010 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 123 transitions. Word has length 41 [2018-01-25 06:01:17,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:17,011 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 123 transitions. [2018-01-25 06:01:17,011 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 06:01:17,011 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2018-01-25 06:01:17,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-25 06:01:17,012 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:17,012 INFO L322 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:01:17,012 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-25 06:01:17,013 INFO L82 PathProgramCache]: Analyzing trace with hash -98646160, now seen corresponding path program 2 times [2018-01-25 06:01:17,013 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:17,014 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:17,014 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:17,014 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:17,014 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:17,035 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:17,121 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:01:17,122 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:01:17,122 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:01:17,122 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 06:01:17,122 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 06:01:17,122 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:01:17,122 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 06:01:17,130 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 06:01:17,130 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 06:01:17,147 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:01:17,149 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:01:17,153 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:01:17,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-25 06:01:17,159 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:01:17,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-25 06:01:17,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:01:17,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-25 06:01:17,182 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-25 06:01:17,706 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-25 06:01:17,706 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:01:18,603 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-25 06:01:18,658 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 06:01:18,659 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15, 13] imperfect sequences [7] total 33 [2018-01-25 06:01:18,659 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:01:18,659 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-25 06:01:18,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-25 06:01:18,660 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=951, Unknown=0, NotChecked=0, Total=1056 [2018-01-25 06:01:18,660 INFO L87 Difference]: Start difference. First operand 117 states and 123 transitions. Second operand 16 states. [2018-01-25 06:01:19,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:19,327 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2018-01-25 06:01:19,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-25 06:01:19,327 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2018-01-25 06:01:19,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:19,328 INFO L225 Difference]: With dead ends: 117 [2018-01-25 06:01:19,328 INFO L226 Difference]: Without dead ends: 115 [2018-01-25 06:01:19,328 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=136, Invalid=1196, Unknown=0, NotChecked=0, Total=1332 [2018-01-25 06:01:19,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-25 06:01:19,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-01-25 06:01:19,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-25 06:01:19,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2018-01-25 06:01:19,343 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 42 [2018-01-25 06:01:19,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:19,343 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2018-01-25 06:01:19,344 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-25 06:01:19,344 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2018-01-25 06:01:19,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-25 06:01:19,345 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:19,345 INFO L322 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:01:19,345 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-25 06:01:19,345 INFO L82 PathProgramCache]: Analyzing trace with hash 293114675, now seen corresponding path program 1 times [2018-01-25 06:01:19,345 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:19,346 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:19,346 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 06:01:19,347 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:19,347 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:19,361 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:19,429 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-25 06:01:19,430 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:01:19,430 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 06:01:19,430 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:01:19,430 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 06:01:19,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 06:01:19,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-25 06:01:19,431 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand 8 states. [2018-01-25 06:01:19,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:19,491 INFO L93 Difference]: Finished difference Result 183 states and 192 transitions. [2018-01-25 06:01:19,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 06:01:19,491 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-01-25 06:01:19,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:19,492 INFO L225 Difference]: With dead ends: 183 [2018-01-25 06:01:19,492 INFO L226 Difference]: Without dead ends: 115 [2018-01-25 06:01:19,493 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:01:19,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-25 06:01:19,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-01-25 06:01:19,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-25 06:01:19,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 120 transitions. [2018-01-25 06:01:19,506 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 120 transitions. Word has length 49 [2018-01-25 06:01:19,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:19,506 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 120 transitions. [2018-01-25 06:01:19,506 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 06:01:19,506 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 120 transitions. [2018-01-25 06:01:19,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-25 06:01:19,507 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:19,507 INFO L322 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:01:19,508 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-25 06:01:19,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1097015104, now seen corresponding path program 1 times [2018-01-25 06:01:19,508 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:19,509 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:19,509 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:19,509 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:19,509 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:19,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:19,523 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:19,610 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-25 06:01:19,610 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:01:19,610 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-25 06:01:19,610 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:01:19,610 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 06:01:19,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 06:01:19,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:01:19,611 INFO L87 Difference]: Start difference. First operand 115 states and 120 transitions. Second operand 10 states. [2018-01-25 06:01:19,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:19,708 INFO L93 Difference]: Finished difference Result 185 states and 193 transitions. [2018-01-25 06:01:19,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 06:01:19,708 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-01-25 06:01:19,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:19,709 INFO L225 Difference]: With dead ends: 185 [2018-01-25 06:01:19,709 INFO L226 Difference]: Without dead ends: 115 [2018-01-25 06:01:19,710 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-25 06:01:19,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-25 06:01:19,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-01-25 06:01:19,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-25 06:01:19,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 119 transitions. [2018-01-25 06:01:19,723 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 119 transitions. Word has length 54 [2018-01-25 06:01:19,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:19,723 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 119 transitions. [2018-01-25 06:01:19,723 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 06:01:19,723 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2018-01-25 06:01:19,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-25 06:01:19,724 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:19,724 INFO L322 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:01:19,724 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-25 06:01:19,724 INFO L82 PathProgramCache]: Analyzing trace with hash -399143288, now seen corresponding path program 1 times [2018-01-25 06:01:19,724 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:19,725 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:19,725 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:19,725 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:19,725 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:19,744 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:20,014 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-25 06:01:20,015 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:01:20,015 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-01-25 06:01:20,015 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:01:20,015 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-25 06:01:20,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-25 06:01:20,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2018-01-25 06:01:20,015 INFO L87 Difference]: Start difference. First operand 115 states and 119 transitions. Second operand 23 states. [2018-01-25 06:01:20,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:20,551 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2018-01-25 06:01:20,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-25 06:01:20,551 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 65 [2018-01-25 06:01:20,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:20,552 INFO L225 Difference]: With dead ends: 144 [2018-01-25 06:01:20,552 INFO L226 Difference]: Without dead ends: 142 [2018-01-25 06:01:20,553 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=853, Unknown=0, NotChecked=0, Total=930 [2018-01-25 06:01:20,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-01-25 06:01:20,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 137. [2018-01-25 06:01:20,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-01-25 06:01:20,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 147 transitions. [2018-01-25 06:01:20,569 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 147 transitions. Word has length 65 [2018-01-25 06:01:20,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:20,570 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 147 transitions. [2018-01-25 06:01:20,570 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-25 06:01:20,570 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 147 transitions. [2018-01-25 06:01:20,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-25 06:01:20,571 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:20,571 INFO L322 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:01:20,571 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-25 06:01:20,572 INFO L82 PathProgramCache]: Analyzing trace with hash -399143287, now seen corresponding path program 1 times [2018-01-25 06:01:20,572 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:20,573 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:20,573 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:20,573 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:20,573 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:20,595 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:20,652 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:01:20,652 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:01:20,652 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:01:20,652 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-01-25 06:01:20,653 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [12], [13], [17], [20], [27], [32], [34], [35], [38], [48], [50], [54], [58], [61], [62], [63], [66], [67], [68], [72], [74], [75], [76], [107], [108], [111], [114], [115], [118], [121], [122], [123], [125], [126], [127], [128], [135], [136], [137], [138], [139], [140], [141], [143], [145], [146], [149], [150], [151], [155], [156], [157], [158], [159], [165], [167], [169], [170], [171] [2018-01-25 06:01:20,655 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:01:20,655 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:01:23,405 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 06:01:23,405 INFO L268 AbstractInterpreter]: Visited 63 different actions 71 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 26 variables. [2018-01-25 06:01:23,420 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 06:01:23,420 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:01:23,420 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 06:01:23,431 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:23,431 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:01:23,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:23,485 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:01:23,502 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:01:23,502 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:01:23,598 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:01:23,619 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:01:23,619 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 06:01:23,652 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:23,652 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:01:23,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:23,725 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:01:23,732 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:01:23,732 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:01:23,809 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:01:23,811 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 06:01:23,811 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 13 [2018-01-25 06:01:23,811 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 06:01:23,812 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 06:01:23,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 06:01:23,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-01-25 06:01:23,812 INFO L87 Difference]: Start difference. First operand 137 states and 147 transitions. Second operand 8 states. [2018-01-25 06:01:23,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:23,848 INFO L93 Difference]: Finished difference Result 250 states and 270 transitions. [2018-01-25 06:01:23,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 06:01:23,848 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2018-01-25 06:01:23,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:23,849 INFO L225 Difference]: With dead ends: 250 [2018-01-25 06:01:23,850 INFO L226 Difference]: Without dead ends: 138 [2018-01-25 06:01:23,850 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 252 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=77, Invalid=105, Unknown=0, NotChecked=0, Total=182 [2018-01-25 06:01:23,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-01-25 06:01:23,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-01-25 06:01:23,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-01-25 06:01:23,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 148 transitions. [2018-01-25 06:01:23,871 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 148 transitions. Word has length 65 [2018-01-25 06:01:23,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:23,872 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 148 transitions. [2018-01-25 06:01:23,872 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 06:01:23,872 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 148 transitions. [2018-01-25 06:01:23,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-25 06:01:23,873 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:23,873 INFO L322 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:01:23,873 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-25 06:01:23,873 INFO L82 PathProgramCache]: Analyzing trace with hash 559798465, now seen corresponding path program 2 times [2018-01-25 06:01:23,873 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:23,874 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:23,874 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:23,875 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:23,875 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:23,896 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:23,984 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:01:23,984 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:01:23,984 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:01:23,985 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 06:01:23,985 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 06:01:23,985 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:01:23,985 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 06:01:23,997 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 06:01:23,997 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 06:01:24,039 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:01:24,046 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:01:24,051 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:01:24,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-25 06:01:24,064 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:01:24,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-25 06:01:24,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:01:24,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-25 06:01:24,091 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-25 06:01:25,029 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-25 06:01:25,030 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:01:27,850 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-25 06:01:27,874 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 06:01:27,874 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22, 20] imperfect sequences [8] total 48 [2018-01-25 06:01:27,874 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:01:27,874 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-25 06:01:27,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-25 06:01:27,875 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2095, Unknown=1, NotChecked=0, Total=2256 [2018-01-25 06:01:27,875 INFO L87 Difference]: Start difference. First operand 138 states and 148 transitions. Second operand 23 states. [2018-01-25 06:01:28,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:28,949 INFO L93 Difference]: Finished difference Result 138 states and 148 transitions. [2018-01-25 06:01:28,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-25 06:01:28,950 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 66 [2018-01-25 06:01:28,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:28,951 INFO L225 Difference]: With dead ends: 138 [2018-01-25 06:01:28,951 INFO L226 Difference]: Without dead ends: 136 [2018-01-25 06:01:28,952 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=217, Invalid=2752, Unknown=1, NotChecked=0, Total=2970 [2018-01-25 06:01:28,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-01-25 06:01:28,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-01-25 06:01:28,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-01-25 06:01:28,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 144 transitions. [2018-01-25 06:01:28,975 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 144 transitions. Word has length 66 [2018-01-25 06:01:28,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:28,975 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 144 transitions. [2018-01-25 06:01:28,976 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-25 06:01:28,976 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 144 transitions. [2018-01-25 06:01:28,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-25 06:01:28,977 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:28,977 INFO L322 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:01:28,977 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-25 06:01:28,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1638383027, now seen corresponding path program 1 times [2018-01-25 06:01:28,977 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:28,978 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:28,978 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 06:01:28,978 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:28,979 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:28,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:28,998 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:29,112 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-25 06:01:29,112 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:01:29,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-25 06:01:29,113 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:01:29,113 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-25 06:01:29,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-25 06:01:29,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-01-25 06:01:29,113 INFO L87 Difference]: Start difference. First operand 136 states and 144 transitions. Second operand 13 states. [2018-01-25 06:01:29,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:29,214 INFO L93 Difference]: Finished difference Result 194 states and 204 transitions. [2018-01-25 06:01:29,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-25 06:01:29,214 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 73 [2018-01-25 06:01:29,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:29,215 INFO L225 Difference]: With dead ends: 194 [2018-01-25 06:01:29,215 INFO L226 Difference]: Without dead ends: 134 [2018-01-25 06:01:29,216 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-01-25 06:01:29,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-01-25 06:01:29,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-01-25 06:01:29,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-01-25 06:01:29,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 140 transitions. [2018-01-25 06:01:29,240 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 140 transitions. Word has length 73 [2018-01-25 06:01:29,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:29,240 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 140 transitions. [2018-01-25 06:01:29,240 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-25 06:01:29,240 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 140 transitions. [2018-01-25 06:01:29,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-25 06:01:29,241 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:29,241 INFO L322 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:01:29,241 INFO L371 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-25 06:01:29,242 INFO L82 PathProgramCache]: Analyzing trace with hash 154562580, now seen corresponding path program 1 times [2018-01-25 06:01:29,242 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:29,242 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:29,243 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:29,243 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:29,243 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:29,263 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:29,659 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-25 06:01:29,659 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:01:29,659 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2018-01-25 06:01:29,659 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:01:29,659 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-25 06:01:29,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-25 06:01:29,660 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2018-01-25 06:01:29,660 INFO L87 Difference]: Start difference. First operand 134 states and 140 transitions. Second operand 27 states. [2018-01-25 06:01:30,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:30,224 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2018-01-25 06:01:30,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-25 06:01:30,224 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 80 [2018-01-25 06:01:30,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:30,225 INFO L225 Difference]: With dead ends: 146 [2018-01-25 06:01:30,225 INFO L226 Difference]: Without dead ends: 144 [2018-01-25 06:01:30,225 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=1239, Unknown=0, NotChecked=0, Total=1332 [2018-01-25 06:01:30,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-01-25 06:01:30,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 140. [2018-01-25 06:01:30,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-25 06:01:30,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 150 transitions. [2018-01-25 06:01:30,247 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 150 transitions. Word has length 80 [2018-01-25 06:01:30,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:30,247 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 150 transitions. [2018-01-25 06:01:30,247 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-25 06:01:30,247 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 150 transitions. [2018-01-25 06:01:30,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-25 06:01:30,248 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:30,248 INFO L322 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:01:30,248 INFO L371 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-25 06:01:30,249 INFO L82 PathProgramCache]: Analyzing trace with hash 154562581, now seen corresponding path program 1 times [2018-01-25 06:01:30,249 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:30,250 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:30,250 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:30,250 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:30,250 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:30,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:30,271 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:30,350 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:01:30,350 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:01:30,350 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:01:30,351 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 81 with the following transitions: [2018-01-25 06:01:30,351 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [12], [13], [17], [20], [27], [32], [34], [35], [36], [39], [40], [43], [44], [45], [48], [50], [54], [58], [61], [62], [63], [66], [67], [68], [72], [74], [75], [76], [78], [81], [86], [89], [92], [107], [108], [111], [114], [115], [118], [121], [122], [123], [125], [126], [127], [128], [135], [136], [137], [138], [139], [140], [141], [143], [145], [146], [147], [149], [150], [151], [155], [156], [157], [158], [159], [160], [161], [163], [165], [167], [169], [170], [171] [2018-01-25 06:01:30,354 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:01:30,354 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:01:33,327 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 06:01:33,328 INFO L268 AbstractInterpreter]: Visited 77 different actions 85 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 27 variables. [2018-01-25 06:01:33,336 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 06:01:33,336 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:01:33,336 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 06:01:33,354 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:33,354 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:01:33,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:33,402 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:01:33,411 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:01:33,412 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:01:33,571 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:01:33,591 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:01:33,592 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 06:01:33,595 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:33,595 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:01:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:33,731 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:01:33,739 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:01:33,739 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:01:33,824 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:01:33,826 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 06:01:33,826 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8] total 15 [2018-01-25 06:01:33,826 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 06:01:33,827 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 06:01:33,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 06:01:33,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-01-25 06:01:33,828 INFO L87 Difference]: Start difference. First operand 140 states and 150 transitions. Second operand 9 states. [2018-01-25 06:01:33,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:33,874 INFO L93 Difference]: Finished difference Result 255 states and 275 transitions. [2018-01-25 06:01:33,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 06:01:33,874 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2018-01-25 06:01:33,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:33,875 INFO L225 Difference]: With dead ends: 255 [2018-01-25 06:01:33,875 INFO L226 Difference]: Without dead ends: 141 [2018-01-25 06:01:33,876 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 311 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=137, Unknown=0, NotChecked=0, Total=240 [2018-01-25 06:01:33,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-01-25 06:01:33,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-01-25 06:01:33,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-01-25 06:01:33,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 151 transitions. [2018-01-25 06:01:33,899 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 151 transitions. Word has length 80 [2018-01-25 06:01:33,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:33,899 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 151 transitions. [2018-01-25 06:01:33,899 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 06:01:33,899 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 151 transitions. [2018-01-25 06:01:33,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-25 06:01:33,899 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:33,900 INFO L322 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:01:33,900 INFO L371 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-25 06:01:33,900 INFO L82 PathProgramCache]: Analyzing trace with hash -585535779, now seen corresponding path program 2 times [2018-01-25 06:01:33,900 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:33,901 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:33,901 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:33,901 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:33,901 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:33,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:33,923 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:33,990 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:01:33,990 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:01:34,022 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:01:34,022 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 06:01:34,022 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 06:01:34,023 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:01:34,023 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 06:01:34,030 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 06:01:34,030 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 06:01:34,078 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:01:34,086 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:01:34,093 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:01:34,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-25 06:01:34,098 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:01:34,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-25 06:01:34,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:01:34,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-25 06:01:34,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-25 06:01:36,334 WARN L143 SmtUtils]: Spent 2019ms on a formula simplification that was a NOOP. DAG size: 31 [2018-01-25 06:01:37,183 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-25 06:01:37,183 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:01:42,246 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-25 06:01:42,266 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 06:01:42,266 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [26, 24] imperfect sequences [9] total 57 [2018-01-25 06:01:42,266 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:01:42,267 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-25 06:01:42,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-25 06:01:42,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2995, Unknown=2, NotChecked=0, Total=3192 [2018-01-25 06:01:42,268 INFO L87 Difference]: Start difference. First operand 141 states and 151 transitions. Second operand 27 states. [2018-01-25 06:01:43,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:43,748 INFO L93 Difference]: Finished difference Result 141 states and 151 transitions. [2018-01-25 06:01:43,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-25 06:01:43,749 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 81 [2018-01-25 06:01:43,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:43,750 INFO L225 Difference]: With dead ends: 141 [2018-01-25 06:01:43,750 INFO L226 Difference]: Without dead ends: 139 [2018-01-25 06:01:43,751 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 111 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1149 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=268, Invalid=4020, Unknown=2, NotChecked=0, Total=4290 [2018-01-25 06:01:43,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-01-25 06:01:43,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-01-25 06:01:43,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-01-25 06:01:43,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 148 transitions. [2018-01-25 06:01:43,774 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 148 transitions. Word has length 81 [2018-01-25 06:01:43,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:43,774 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 148 transitions. [2018-01-25 06:01:43,775 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-25 06:01:43,775 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 148 transitions. [2018-01-25 06:01:43,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-01-25 06:01:43,775 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:43,775 INFO L322 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:01:43,775 INFO L371 AbstractCegarLoop]: === Iteration 23 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-25 06:01:43,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1024705250, now seen corresponding path program 1 times [2018-01-25 06:01:43,775 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:43,776 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:43,776 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 06:01:43,776 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:43,776 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:43,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:43,793 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:44,002 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:01:44,002 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:01:44,002 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:01:44,002 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 86 with the following transitions: [2018-01-25 06:01:44,003 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [12], [13], [17], [20], [27], [32], [34], [35], [36], [39], [40], [43], [44], [45], [48], [50], [54], [58], [61], [62], [63], [66], [67], [68], [72], [74], [75], [76], [78], [81], [86], [89], [90], [93], [94], [99], [101], [107], [108], [111], [114], [115], [118], [121], [122], [123], [125], [126], [127], [128], [135], [136], [137], [138], [139], [140], [141], [143], [145], [146], [147], [149], [150], [151], [155], [156], [157], [158], [159], [160], [161], [163], [165], [167], [169], [170], [171] [2018-01-25 06:01:44,005 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:01:44,005 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:01:47,045 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 06:01:47,045 INFO L268 AbstractInterpreter]: Visited 81 different actions 89 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 27 variables. [2018-01-25 06:01:47,053 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 06:01:47,053 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:01:47,054 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 06:01:47,065 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:47,065 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:01:47,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:47,125 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:01:47,134 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:01:47,135 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:01:47,328 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:01:47,347 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:01:47,347 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 06:01:47,353 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:47,353 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:01:47,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:47,447 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:01:47,453 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:01:47,453 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:01:47,548 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:01:47,550 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 06:01:47,550 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9] total 17 [2018-01-25 06:01:47,550 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 06:01:47,551 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 06:01:47,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 06:01:47,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-01-25 06:01:47,551 INFO L87 Difference]: Start difference. First operand 139 states and 148 transitions. Second operand 10 states. [2018-01-25 06:01:47,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:47,596 INFO L93 Difference]: Finished difference Result 252 states and 270 transitions. [2018-01-25 06:01:47,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 06:01:47,596 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 85 [2018-01-25 06:01:47,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:47,597 INFO L225 Difference]: With dead ends: 252 [2018-01-25 06:01:47,597 INFO L226 Difference]: Without dead ends: 140 [2018-01-25 06:01:47,598 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 330 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=173, Unknown=0, NotChecked=0, Total=306 [2018-01-25 06:01:47,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-25 06:01:47,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-01-25 06:01:47,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-25 06:01:47,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 149 transitions. [2018-01-25 06:01:47,615 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 149 transitions. Word has length 85 [2018-01-25 06:01:47,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:47,615 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 149 transitions. [2018-01-25 06:01:47,615 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 06:01:47,615 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 149 transitions. [2018-01-25 06:01:47,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-01-25 06:01:47,616 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:47,616 INFO L322 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:01:47,616 INFO L371 AbstractCegarLoop]: === Iteration 24 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-25 06:01:47,616 INFO L82 PathProgramCache]: Analyzing trace with hash -796837034, now seen corresponding path program 2 times [2018-01-25 06:01:47,616 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:47,617 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:47,617 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:47,617 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:47,617 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:47,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:47,632 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:47,794 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:01:47,794 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:01:47,794 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:01:47,794 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 06:01:47,794 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 06:01:47,794 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:01:47,794 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 06:01:47,801 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 06:01:47,801 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 06:01:47,836 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:01:47,855 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:01:47,857 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:01:47,860 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:01:47,869 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:01:47,869 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:01:48,079 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:01:48,110 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:01:48,111 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 17 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 06:01:48,115 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 06:01:48,116 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 06:01:48,181 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command Received shutdown request... [2018-01-25 06:01:48,325 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:01:48,363 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:01:48,371 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:01:48,372 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 06:01:48,372 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 06:01:48,375 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 06:01:48,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 06:01:48 BoogieIcfgContainer [2018-01-25 06:01:48,376 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 06:01:48,376 INFO L168 Benchmark]: Toolchain (without parser) took 44034.01 ms. Allocated memory was 299.9 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 257.2 MB in the beginning and 432.0 MB in the end (delta: -174.8 MB). Peak memory consumption was 1.0 GB. Max. memory is 5.3 GB. [2018-01-25 06:01:48,377 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 299.9 MB. Free memory is still 264.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 06:01:48,377 INFO L168 Benchmark]: CACSL2BoogieTranslator took 262.49 ms. Allocated memory is still 299.9 MB. Free memory was 257.2 MB in the beginning and 242.9 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 5.3 GB. [2018-01-25 06:01:48,377 INFO L168 Benchmark]: Boogie Preprocessor took 44.73 ms. Allocated memory is still 299.9 MB. Free memory was 242.9 MB in the beginning and 240.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 06:01:48,377 INFO L168 Benchmark]: RCFGBuilder took 439.49 ms. Allocated memory is still 299.9 MB. Free memory was 240.9 MB in the beginning and 210.3 MB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 5.3 GB. [2018-01-25 06:01:48,377 INFO L168 Benchmark]: TraceAbstraction took 43278.55 ms. Allocated memory was 299.9 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 210.3 MB in the beginning and 432.0 MB in the end (delta: -221.8 MB). Peak memory consumption was 961.0 MB. Max. memory is 5.3 GB. [2018-01-25 06:01:48,379 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.14 ms. Allocated memory is still 299.9 MB. Free memory is still 264.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 262.49 ms. Allocated memory is still 299.9 MB. Free memory was 257.2 MB in the beginning and 242.9 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 44.73 ms. Allocated memory is still 299.9 MB. Free memory was 242.9 MB in the beginning and 240.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 439.49 ms. Allocated memory is still 299.9 MB. Free memory was 240.9 MB in the beginning and 210.3 MB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 43278.55 ms. Allocated memory was 299.9 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 210.3 MB in the beginning and 432.0 MB in the end (delta: -221.8 MB). Peak memory consumption was 961.0 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.472110 RENAME_VARIABLES(MILLISECONDS) : 0.092777 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.132685 PROJECTAWAY(MILLISECONDS) : 0.033690 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.144135 DISJOIN(MILLISECONDS) : 0.555249 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.114625 ADD_EQUALITY(MILLISECONDS) : 0.030584 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.005288 #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.386286 RENAME_VARIABLES(MILLISECONDS) : 0.097115 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.152854 PROJECTAWAY(MILLISECONDS) : 0.050208 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.051551 DISJOIN(MILLISECONDS) : 0.401486 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.123010 ADD_EQUALITY(MILLISECONDS) : 0.019287 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.007140 #CONJOIN_DISJUNCTIVE : 96 #RENAME_VARIABLES : 160 #UNFREEZE : 0 #CONJOIN : 203 #PROJECTAWAY : 159 #ADD_WEAK_EQUALITY : 15 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 156 #ADD_EQUALITY : 128 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 62 LocStat_MAX_WEQGRAPH_SIZE : 6 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 506 LocStat_NO_SUPPORTING_DISEQUALITIES : 53 LocStat_NO_DISJUNCTIONS : -124 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 93 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 202 TransStat_NO_SUPPORTING_DISEQUALITIES : 11 TransStat_NO_DISJUNCTIONS : 98 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.238894 RENAME_VARIABLES(MILLISECONDS) : 0.072859 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.098102 PROJECTAWAY(MILLISECONDS) : 0.024749 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.041690 DISJOIN(MILLISECONDS) : 0.438715 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.090274 ADD_EQUALITY(MILLISECONDS) : 0.015200 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.004530 #CONJOIN_DISJUNCTIVE : 144 #RENAME_VARIABLES : 229 #UNFREEZE : 0 #CONJOIN : 322 #PROJECTAWAY : 237 #ADD_WEAK_EQUALITY : 27 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 224 #ADD_EQUALITY : 218 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 10 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 76 LocStat_MAX_WEQGRAPH_SIZE : 6 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 646 LocStat_NO_SUPPORTING_DISEQUALITIES : 67 LocStat_NO_DISJUNCTIONS : -152 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 113 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 2 TransStat_NO_SUPPORTING_EQUALITIES : 234 TransStat_NO_SUPPORTING_DISEQUALITIES : 11 TransStat_NO_DISJUNCTIONS : 118 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.201416 RENAME_VARIABLES(MILLISECONDS) : 0.054392 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.082392 PROJECTAWAY(MILLISECONDS) : 0.020586 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.048008 DISJOIN(MILLISECONDS) : 0.435877 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.067890 ADD_EQUALITY(MILLISECONDS) : 0.012122 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.005816 #CONJOIN_DISJUNCTIVE : 167 #RENAME_VARIABLES : 266 #UNFREEZE : 0 #CONJOIN : 370 #PROJECTAWAY : 278 #ADD_WEAK_EQUALITY : 33 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 261 #ADD_EQUALITY : 255 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 10 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 80 LocStat_MAX_WEQGRAPH_SIZE : 6 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 695 LocStat_NO_SUPPORTING_DISEQUALITIES : 76 LocStat_NO_DISJUNCTIONS : -160 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 117 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 2 TransStat_NO_SUPPORTING_EQUALITIES : 251 TransStat_NO_SUPPORTING_DISEQUALITIES : 16 TransStat_NO_DISJUNCTIONS : 125 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 2.630731 RENAME_VARIABLES(MILLISECONDS) : 0.751455 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 2.564840 PROJECTAWAY(MILLISECONDS) : 0.166631 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.039666 DISJOIN(MILLISECONDS) : 0.657280 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.785550 ADD_EQUALITY(MILLISECONDS) : 0.007507 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.012905 #CONJOIN_DISJUNCTIVE : 175 #RENAME_VARIABLES : 279 #UNFREEZE : 0 #CONJOIN : 407 #PROJECTAWAY : 290 #ADD_WEAK_EQUALITY : 34 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 271 #ADD_EQUALITY : 264 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 14 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1294). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 6, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1294). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 6, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1411). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 6, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1411). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 6, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1265). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 6, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1265). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 6, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1267). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 6, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1267). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 6, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 6, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 6, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 6, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 6, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1339). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 6, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1339). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 6, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1452]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1452). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 6, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1099). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 6, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1100). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 6, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1100). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 6, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1099). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 6, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 19 procedures, 123 locations, 19 error locations. TIMEOUT Result, 43.2s OverallTime, 24 OverallIterations, 6 TraceHistogramMax, 7.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2495 SDtfs, 751 SDslu, 15554 SDs, 0 SdLazy, 6397 SolverSat, 191 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1941 GetRequests, 1524 SyntacticMatches, 19 SemanticMatches, 398 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2767 ImplicationChecksByTransitivity, 17.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 14.3s AbstIntTime, 5 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 46 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 18.6s InterpolantComputationTime, 1958 NumberOfCodeBlocks, 1944 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 2744 ConstructedInterpolants, 173 QuantifiedInterpolants, 618919 SizeOfPredicates, 80 NumberOfNonLiveVariables, 4155 ConjunctsInSsa, 321 ConjunctsInUnsatCore, 51 InterpolantComputations, 22 PerfectInterpolantSequences, 119/328 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_5_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_06-01-48-388.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_5_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_06-01-48-388.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_5_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_06-01-48-388.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_5_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_06-01-48-388.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_5_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_06-01-48-388.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_5_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-25_06-01-48-388.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_5_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-25_06-01-48-388.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_5_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-25_06-01-48-388.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_5_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-25_06-01-48-388.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_5_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-4-2018-01-25_06-01-48-388.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_5_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-4-2018-01-25_06-01-48-388.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_5_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_06-01-48-388.csv Completed graceful shutdown