java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_1_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 15:56:59,312 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 15:56:59,314 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 15:56:59,327 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 15:56:59,327 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 15:56:59,328 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 15:56:59,329 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 15:56:59,331 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 15:56:59,333 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 15:56:59,334 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 15:56:59,335 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 15:56:59,335 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 15:56:59,336 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 15:56:59,337 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 15:56:59,338 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 15:56:59,341 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 15:56:59,343 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 15:56:59,345 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 15:56:59,346 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 15:56:59,347 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 15:56:59,350 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 15:56:59,350 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 15:56:59,350 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 15:56:59,351 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 15:56:59,352 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 15:56:59,353 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 15:56:59,353 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 15:56:59,354 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 15:56:59,354 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 15:56:59,354 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 15:56:59,355 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 15:56:59,355 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf [2018-01-24 15:56:59,365 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 15:56:59,365 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 15:56:59,366 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 15:56:59,366 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 15:56:59,366 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 15:56:59,367 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 15:56:59,367 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 15:56:59,367 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 15:56:59,368 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 15:56:59,368 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 15:56:59,368 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 15:56:59,368 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 15:56:59,368 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 15:56:59,368 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 15:56:59,369 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 15:56:59,369 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 15:56:59,369 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 15:56:59,369 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 15:56:59,369 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 15:56:59,370 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 15:56:59,370 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 15:56:59,370 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 15:56:59,370 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 15:56:59,370 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 15:56:59,371 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 15:56:59,371 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 15:56:59,371 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 15:56:59,371 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 15:56:59,371 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 15:56:59,371 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 15:56:59,372 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 15:56:59,372 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 15:56:59,372 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 15:56:59,373 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 15:56:59,373 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 15:56:59,410 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 15:56:59,423 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 15:56:59,427 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 15:56:59,428 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 15:56:59,429 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 15:56:59,430 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_1_false-valid-memtrack_true-termination.i [2018-01-24 15:56:59,618 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 15:56:59,624 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 15:56:59,625 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 15:56:59,625 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 15:56:59,629 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 15:56:59,630 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:56:59" (1/1) ... [2018-01-24 15:56:59,632 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@105626bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:56:59, skipping insertion in model container [2018-01-24 15:56:59,632 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:56:59" (1/1) ... [2018-01-24 15:56:59,644 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:56:59,688 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:56:59,806 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:56:59,828 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:56:59,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:56:59 WrapperNode [2018-01-24 15:56:59,841 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 15:56:59,842 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 15:56:59,842 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 15:56:59,842 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 15:56:59,859 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:56:59" (1/1) ... [2018-01-24 15:56:59,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:56:59" (1/1) ... [2018-01-24 15:56:59,873 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:56:59" (1/1) ... [2018-01-24 15:56:59,873 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:56:59" (1/1) ... [2018-01-24 15:56:59,883 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:56:59" (1/1) ... [2018-01-24 15:56:59,887 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:56:59" (1/1) ... [2018-01-24 15:56:59,888 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:56:59" (1/1) ... [2018-01-24 15:56:59,891 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 15:56:59,891 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 15:56:59,892 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 15:56:59,892 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 15:56:59,892 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:56:59" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 15:56:59,936 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 15:56:59,937 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 15:56:59,937 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-01-24 15:56:59,937 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 15:56:59,937 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-01-24 15:56:59,937 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2018-01-24 15:56:59,937 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-01-24 15:56:59,937 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-01-24 15:56:59,937 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-01-24 15:56:59,938 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2018-01-24 15:56:59,938 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-01-24 15:56:59,938 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-01-24 15:56:59,938 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-01-24 15:56:59,938 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-01-24 15:56:59,938 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2018-01-24 15:56:59,938 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-01-24 15:56:59,938 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-01-24 15:56:59,938 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-01-24 15:56:59,939 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 15:56:59,939 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 15:56:59,939 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 15:56:59,939 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 15:56:59,939 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 15:56:59,940 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 15:56:59,940 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 15:56:59,940 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 15:56:59,940 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 15:56:59,940 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-24 15:56:59,940 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-24 15:56:59,941 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 15:56:59,941 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 15:56:59,941 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 15:56:59,941 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-24 15:56:59,941 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 15:56:59,941 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-01-24 15:56:59,942 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2018-01-24 15:56:59,942 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-01-24 15:56:59,942 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-01-24 15:56:59,942 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-01-24 15:56:59,942 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-01-24 15:56:59,942 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2018-01-24 15:56:59,942 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-01-24 15:56:59,943 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-01-24 15:56:59,943 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-01-24 15:56:59,943 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-01-24 15:56:59,943 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2018-01-24 15:56:59,943 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-01-24 15:56:59,943 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-01-24 15:56:59,943 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-01-24 15:56:59,944 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 15:56:59,944 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 15:56:59,944 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 15:56:59,944 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 15:57:00,195 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-24 15:57:00,348 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 15:57:00,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:57:00 BoogieIcfgContainer [2018-01-24 15:57:00,349 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 15:57:00,351 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 15:57:00,351 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 15:57:00,353 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 15:57:00,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 03:56:59" (1/3) ... [2018-01-24 15:57:00,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4947fb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:57:00, skipping insertion in model container [2018-01-24 15:57:00,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:56:59" (2/3) ... [2018-01-24 15:57:00,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4947fb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:57:00, skipping insertion in model container [2018-01-24 15:57:00,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:57:00" (3/3) ... [2018-01-24 15:57:00,358 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test22_1_false-valid-memtrack_true-termination.i [2018-01-24 15:57:00,364 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 15:57:00,371 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-01-24 15:57:00,411 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 15:57:00,411 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 15:57:00,411 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 15:57:00,411 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 15:57:00,411 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 15:57:00,412 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 15:57:00,412 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 15:57:00,412 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 15:57:00,413 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 15:57:00,431 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states. [2018-01-24 15:57:00,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 15:57:00,436 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:57:00,437 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:57:00,437 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:57:00,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1956546830, now seen corresponding path program 1 times [2018-01-24 15:57:00,443 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:57:00,511 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:00,512 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:57:00,512 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:00,512 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:57:00,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:57:00,571 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:57:00,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:57:00,800 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:57:00,800 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:57:00,800 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:57:00,802 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:57:00,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:57:00,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:57:00,815 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 5 states. [2018-01-24 15:57:00,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:57:00,871 INFO L93 Difference]: Finished difference Result 272 states and 287 transitions. [2018-01-24 15:57:00,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:57:00,872 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-24 15:57:00,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:57:00,884 INFO L225 Difference]: With dead ends: 272 [2018-01-24 15:57:00,884 INFO L226 Difference]: Without dead ends: 145 [2018-01-24 15:57:00,887 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:57:00,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-01-24 15:57:00,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2018-01-24 15:57:00,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-24 15:57:00,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 151 transitions. [2018-01-24 15:57:00,923 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 151 transitions. Word has length 17 [2018-01-24 15:57:00,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:57:00,924 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 151 transitions. [2018-01-24 15:57:00,924 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:57:00,924 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 151 transitions. [2018-01-24 15:57:00,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 15:57:00,924 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:57:00,925 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:57:00,925 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:57:00,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1123892084, now seen corresponding path program 1 times [2018-01-24 15:57:00,925 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:57:00,926 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:00,926 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:57:00,926 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:00,926 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:57:00,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:57:00,944 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:57:00,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:57:00,998 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:57:00,998 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:57:00,998 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:57:00,999 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:57:00,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:57:00,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:57:01,000 INFO L87 Difference]: Start difference. First operand 143 states and 151 transitions. Second operand 6 states. [2018-01-24 15:57:01,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:57:01,190 INFO L93 Difference]: Finished difference Result 145 states and 153 transitions. [2018-01-24 15:57:01,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:57:01,191 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 15:57:01,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:57:01,192 INFO L225 Difference]: With dead ends: 145 [2018-01-24 15:57:01,192 INFO L226 Difference]: Without dead ends: 144 [2018-01-24 15:57:01,193 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:57:01,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-01-24 15:57:01,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2018-01-24 15:57:01,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-01-24 15:57:01,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 150 transitions. [2018-01-24 15:57:01,203 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 150 transitions. Word has length 19 [2018-01-24 15:57:01,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:57:01,203 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 150 transitions. [2018-01-24 15:57:01,203 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:57:01,204 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 150 transitions. [2018-01-24 15:57:01,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 15:57:01,204 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:57:01,204 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:57:01,204 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:57:01,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1123892085, now seen corresponding path program 1 times [2018-01-24 15:57:01,205 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:57:01,206 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:01,206 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:57:01,206 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:01,206 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:57:01,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:57:01,226 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:57:01,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:57:01,576 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:57:01,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 15:57:01,576 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:57:01,576 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 15:57:01,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 15:57:01,577 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:57:01,577 INFO L87 Difference]: Start difference. First operand 142 states and 150 transitions. Second operand 7 states. [2018-01-24 15:57:01,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:57:01,786 INFO L93 Difference]: Finished difference Result 144 states and 152 transitions. [2018-01-24 15:57:01,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 15:57:01,786 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-01-24 15:57:01,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:57:01,788 INFO L225 Difference]: With dead ends: 144 [2018-01-24 15:57:01,788 INFO L226 Difference]: Without dead ends: 143 [2018-01-24 15:57:01,789 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-24 15:57:01,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-24 15:57:01,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2018-01-24 15:57:01,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-01-24 15:57:01,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 149 transitions. [2018-01-24 15:57:01,802 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 149 transitions. Word has length 19 [2018-01-24 15:57:01,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:57:01,803 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 149 transitions. [2018-01-24 15:57:01,803 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 15:57:01,803 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 149 transitions. [2018-01-24 15:57:01,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 15:57:01,804 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:57:01,804 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:57:01,804 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:57:01,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1414777661, now seen corresponding path program 1 times [2018-01-24 15:57:01,805 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:57:01,806 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:01,806 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:57:01,806 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:01,806 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:57:01,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:57:01,823 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:57:01,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:57:01,904 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:57:01,904 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 15:57:01,904 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:57:01,905 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 15:57:01,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 15:57:01,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:57:01,905 INFO L87 Difference]: Start difference. First operand 141 states and 149 transitions. Second operand 7 states. [2018-01-24 15:57:01,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:57:01,993 INFO L93 Difference]: Finished difference Result 235 states and 247 transitions. [2018-01-24 15:57:01,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 15:57:01,994 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-01-24 15:57:01,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:57:01,996 INFO L225 Difference]: With dead ends: 235 [2018-01-24 15:57:01,996 INFO L226 Difference]: Without dead ends: 157 [2018-01-24 15:57:01,997 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:57:01,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-01-24 15:57:02,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 150. [2018-01-24 15:57:02,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-24 15:57:02,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 158 transitions. [2018-01-24 15:57:02,016 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 158 transitions. Word has length 27 [2018-01-24 15:57:02,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:57:02,016 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 158 transitions. [2018-01-24 15:57:02,016 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 15:57:02,016 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 158 transitions. [2018-01-24 15:57:02,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 15:57:02,026 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:57:02,026 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:57:02,026 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:57:02,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1439517623, now seen corresponding path program 1 times [2018-01-24 15:57:02,027 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:57:02,028 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:02,028 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:57:02,029 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:02,029 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:57:02,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:57:02,050 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:57:02,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:57:02,147 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:57:02,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 15:57:02,147 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:57:02,147 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 15:57:02,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 15:57:02,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 15:57:02,148 INFO L87 Difference]: Start difference. First operand 150 states and 158 transitions. Second operand 10 states. [2018-01-24 15:57:02,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:57:02,344 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2018-01-24 15:57:02,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 15:57:02,374 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-01-24 15:57:02,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:57:02,375 INFO L225 Difference]: With dead ends: 150 [2018-01-24 15:57:02,375 INFO L226 Difference]: Without dead ends: 149 [2018-01-24 15:57:02,375 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-01-24 15:57:02,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-01-24 15:57:02,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-01-24 15:57:02,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-01-24 15:57:02,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 157 transitions. [2018-01-24 15:57:02,384 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 157 transitions. Word has length 34 [2018-01-24 15:57:02,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:57:02,384 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 157 transitions. [2018-01-24 15:57:02,384 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 15:57:02,384 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 157 transitions. [2018-01-24 15:57:02,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 15:57:02,385 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:57:02,385 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:57:02,385 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:57:02,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1439517624, now seen corresponding path program 1 times [2018-01-24 15:57:02,386 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:57:02,387 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:02,387 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:57:02,387 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:02,387 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:57:02,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:57:02,405 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:57:02,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:57:02,440 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:57:02,440 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 15:57:02,441 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:57:02,441 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 15:57:02,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 15:57:02,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 15:57:02,442 INFO L87 Difference]: Start difference. First operand 149 states and 157 transitions. Second operand 4 states. [2018-01-24 15:57:02,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:57:02,469 INFO L93 Difference]: Finished difference Result 264 states and 278 transitions. [2018-01-24 15:57:02,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 15:57:02,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-01-24 15:57:02,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:57:02,472 INFO L225 Difference]: With dead ends: 264 [2018-01-24 15:57:02,472 INFO L226 Difference]: Without dead ends: 150 [2018-01-24 15:57:02,473 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:57:02,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-01-24 15:57:02,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-01-24 15:57:02,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-24 15:57:02,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 158 transitions. [2018-01-24 15:57:02,484 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 158 transitions. Word has length 34 [2018-01-24 15:57:02,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:57:02,484 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 158 transitions. [2018-01-24 15:57:02,484 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 15:57:02,484 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 158 transitions. [2018-01-24 15:57:02,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-24 15:57:02,486 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:57:02,486 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:57:02,486 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:57:02,486 INFO L82 PathProgramCache]: Analyzing trace with hash -204456797, now seen corresponding path program 1 times [2018-01-24 15:57:02,486 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:57:02,488 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:02,488 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:57:02,488 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:02,488 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:57:02,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:57:02,504 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:57:02,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:57:02,580 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:57:02,580 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:57:02,581 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-01-24 15:57:02,583 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [31], [36], [52], [59], [63], [67], [70], [72], [73], [77], [79], [80], [130], [133], [134], [135], [137], [138], [139], [157], [158], [159], [160], [161], [163], [169], [173], [179], [193], [194], [195] [2018-01-24 15:57:02,644 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:57:02,645 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:57:05,829 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:57:05,830 INFO L268 AbstractInterpreter]: Visited 35 different actions 43 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 21 variables. [2018-01-24 15:57:05,863 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:57:05,863 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:57:05,863 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:57:05,875 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:57:05,875 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:57:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:57:05,919 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:57:05,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:57:05,963 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:57:06,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:57:06,061 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:57:06,061 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:57:06,065 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:57:06,065 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:57:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:57:06,125 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:57:06,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:57:06,131 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:57:06,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:57:06,167 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:57:06,167 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5] total 9 [2018-01-24 15:57:06,167 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:57:06,168 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:57:06,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:57:06,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-01-24 15:57:06,168 INFO L87 Difference]: Start difference. First operand 150 states and 158 transitions. Second operand 6 states. [2018-01-24 15:57:06,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:57:06,203 INFO L93 Difference]: Finished difference Result 265 states and 279 transitions. [2018-01-24 15:57:06,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:57:06,204 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-24 15:57:06,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:57:06,205 INFO L225 Difference]: With dead ends: 265 [2018-01-24 15:57:06,205 INFO L226 Difference]: Without dead ends: 151 [2018-01-24 15:57:06,206 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 134 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-01-24 15:57:06,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-01-24 15:57:06,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-01-24 15:57:06,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-01-24 15:57:06,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 159 transitions. [2018-01-24 15:57:06,216 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 159 transitions. Word has length 35 [2018-01-24 15:57:06,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:57:06,217 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 159 transitions. [2018-01-24 15:57:06,217 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:57:06,217 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 159 transitions. [2018-01-24 15:57:06,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 15:57:06,218 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:57:06,219 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:57:06,219 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:57:06,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1829139958, now seen corresponding path program 1 times [2018-01-24 15:57:06,219 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:57:06,220 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:06,221 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:57:06,221 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:06,221 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:57:06,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:57:06,238 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:57:06,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:57:06,308 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:57:06,308 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 15:57:06,308 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:57:06,309 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 15:57:06,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 15:57:06,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:57:06,310 INFO L87 Difference]: Start difference. First operand 151 states and 159 transitions. Second operand 7 states. [2018-01-24 15:57:06,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:57:06,361 INFO L93 Difference]: Finished difference Result 215 states and 225 transitions. [2018-01-24 15:57:06,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 15:57:06,361 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-01-24 15:57:06,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:57:06,363 INFO L225 Difference]: With dead ends: 215 [2018-01-24 15:57:06,363 INFO L226 Difference]: Without dead ends: 161 [2018-01-24 15:57:06,363 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:57:06,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-01-24 15:57:06,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 157. [2018-01-24 15:57:06,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-01-24 15:57:06,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 165 transitions. [2018-01-24 15:57:06,374 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 165 transitions. Word has length 36 [2018-01-24 15:57:06,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:57:06,374 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 165 transitions. [2018-01-24 15:57:06,374 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 15:57:06,374 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 165 transitions. [2018-01-24 15:57:06,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 15:57:06,376 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:57:06,376 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:57:06,376 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:57:06,376 INFO L82 PathProgramCache]: Analyzing trace with hash 371943704, now seen corresponding path program 2 times [2018-01-24 15:57:06,376 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:57:06,378 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:06,378 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:57:06,378 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:06,378 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:57:06,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:57:06,395 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:57:06,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:57:06,435 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:57:06,436 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:57:06,436 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:57:06,436 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:57:06,436 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:57:06,436 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:57:06,444 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:57:06,444 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:57:06,472 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:57:06,475 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:57:06,480 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:57:06,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-24 15:57:06,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:57:06,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-24 15:57:06,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:57:06,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 15:57:06,578 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-24 15:57:07,285 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 45 DAG size of output 17 [2018-01-24 15:57:07,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 15:57:07,630 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:57:08,027 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 15:57:08,047 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 15:57:08,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14, 13] imperfect sequences [6] total 31 [2018-01-24 15:57:08,048 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:57:08,048 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 15:57:08,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 15:57:08,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=840, Unknown=0, NotChecked=0, Total=930 [2018-01-24 15:57:08,049 INFO L87 Difference]: Start difference. First operand 157 states and 165 transitions. Second operand 15 states. [2018-01-24 15:57:09,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:57:09,021 INFO L93 Difference]: Finished difference Result 176 states and 183 transitions. [2018-01-24 15:57:09,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 15:57:09,022 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2018-01-24 15:57:09,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:57:09,023 INFO L225 Difference]: With dead ends: 176 [2018-01-24 15:57:09,023 INFO L226 Difference]: Without dead ends: 175 [2018-01-24 15:57:09,023 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=118, Invalid=1072, Unknown=0, NotChecked=0, Total=1190 [2018-01-24 15:57:09,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-01-24 15:57:09,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 156. [2018-01-24 15:57:09,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-01-24 15:57:09,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 164 transitions. [2018-01-24 15:57:09,038 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 164 transitions. Word has length 36 [2018-01-24 15:57:09,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:57:09,039 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 164 transitions. [2018-01-24 15:57:09,039 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 15:57:09,039 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 164 transitions. [2018-01-24 15:57:09,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 15:57:09,040 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:57:09,040 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:57:09,040 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:57:09,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1983848104, now seen corresponding path program 1 times [2018-01-24 15:57:09,041 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:57:09,042 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:09,042 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 15:57:09,042 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:09,042 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:57:09,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:57:09,051 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:57:09,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:57:09,082 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:57:09,082 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 15:57:09,082 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:57:09,083 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 15:57:09,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 15:57:09,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:57:09,083 INFO L87 Difference]: Start difference. First operand 156 states and 164 transitions. Second operand 3 states. [2018-01-24 15:57:09,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:57:09,192 INFO L93 Difference]: Finished difference Result 174 states and 183 transitions. [2018-01-24 15:57:09,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 15:57:09,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-01-24 15:57:09,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:57:09,194 INFO L225 Difference]: With dead ends: 174 [2018-01-24 15:57:09,194 INFO L226 Difference]: Without dead ends: 160 [2018-01-24 15:57:09,195 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:57:09,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-01-24 15:57:09,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 152. [2018-01-24 15:57:09,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-01-24 15:57:09,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 159 transitions. [2018-01-24 15:57:09,214 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 159 transitions. Word has length 34 [2018-01-24 15:57:09,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:57:09,215 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 159 transitions. [2018-01-24 15:57:09,215 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 15:57:09,215 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 159 transitions. [2018-01-24 15:57:09,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 15:57:09,216 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:57:09,216 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:57:09,216 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:57:09,216 INFO L82 PathProgramCache]: Analyzing trace with hash 515535126, now seen corresponding path program 1 times [2018-01-24 15:57:09,216 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:57:09,217 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:09,217 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:57:09,218 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:09,218 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:57:09,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:57:09,226 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:57:09,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:57:09,257 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:57:09,257 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 15:57:09,257 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:57:09,257 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:57:09,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:57:09,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:57:09,258 INFO L87 Difference]: Start difference. First operand 152 states and 159 transitions. Second operand 6 states. [2018-01-24 15:57:09,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:57:09,287 INFO L93 Difference]: Finished difference Result 156 states and 162 transitions. [2018-01-24 15:57:09,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:57:09,288 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-01-24 15:57:09,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:57:09,288 INFO L225 Difference]: With dead ends: 156 [2018-01-24 15:57:09,288 INFO L226 Difference]: Without dead ends: 137 [2018-01-24 15:57:09,289 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:57:09,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-24 15:57:09,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-01-24 15:57:09,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-01-24 15:57:09,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 143 transitions. [2018-01-24 15:57:09,298 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 143 transitions. Word has length 36 [2018-01-24 15:57:09,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:57:09,299 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 143 transitions. [2018-01-24 15:57:09,299 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:57:09,299 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 143 transitions. [2018-01-24 15:57:09,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 15:57:09,299 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:57:09,299 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:57:09,299 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:57:09,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1666573044, now seen corresponding path program 1 times [2018-01-24 15:57:09,300 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:57:09,300 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:09,301 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:57:09,301 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:09,301 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:57:09,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:57:09,315 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:57:09,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 15:57:09,431 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:57:09,431 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 15:57:09,431 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:57:09,432 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 15:57:09,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 15:57:09,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 15:57:09,432 INFO L87 Difference]: Start difference. First operand 137 states and 143 transitions. Second operand 10 states. [2018-01-24 15:57:09,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:57:09,707 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2018-01-24 15:57:09,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 15:57:09,707 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2018-01-24 15:57:09,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:57:09,708 INFO L225 Difference]: With dead ends: 137 [2018-01-24 15:57:09,708 INFO L226 Difference]: Without dead ends: 135 [2018-01-24 15:57:09,709 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-01-24 15:57:09,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-24 15:57:09,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-01-24 15:57:09,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-24 15:57:09,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 141 transitions. [2018-01-24 15:57:09,723 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 141 transitions. Word has length 41 [2018-01-24 15:57:09,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:57:09,724 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 141 transitions. [2018-01-24 15:57:09,724 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 15:57:09,724 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 141 transitions. [2018-01-24 15:57:09,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 15:57:09,724 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:57:09,724 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:57:09,724 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:57:09,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1666573045, now seen corresponding path program 1 times [2018-01-24 15:57:09,725 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:57:09,725 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:09,726 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:57:09,726 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:09,726 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:57:09,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:57:09,740 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:57:09,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:57:09,782 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:57:09,782 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:57:09,782 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-01-24 15:57:09,783 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [31], [36], [52], [59], [63], [67], [68], [71], [72], [73], [77], [79], [80], [122], [125], [130], [133], [134], [135], [137], [138], [139], [157], [158], [159], [160], [161], [163], [169], [173], [179], [180], [181], [193], [194], [195] [2018-01-24 15:57:09,784 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:57:09,784 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:57:13,121 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:57:13,121 INFO L268 AbstractInterpreter]: Visited 40 different actions 48 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 21 variables. [2018-01-24 15:57:13,122 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:57:13,122 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:57:13,123 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:57:13,128 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:57:13,128 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:57:13,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:57:13,149 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:57:13,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:57:13,173 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:57:13,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:57:13,253 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:57:13,253 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:57:13,256 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:57:13,257 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:57:13,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:57:13,300 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:57:13,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:57:13,305 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:57:13,328 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:57:13,329 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:57:13,330 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6] total 11 [2018-01-24 15:57:13,330 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:57:13,330 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 15:57:13,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 15:57:13,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-01-24 15:57:13,330 INFO L87 Difference]: Start difference. First operand 135 states and 141 transitions. Second operand 7 states. [2018-01-24 15:57:13,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:57:13,363 INFO L93 Difference]: Finished difference Result 247 states and 259 transitions. [2018-01-24 15:57:13,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:57:13,363 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-01-24 15:57:13,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:57:13,364 INFO L225 Difference]: With dead ends: 247 [2018-01-24 15:57:13,364 INFO L226 Difference]: Without dead ends: 136 [2018-01-24 15:57:13,365 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2018-01-24 15:57:13,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-01-24 15:57:13,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-01-24 15:57:13,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-01-24 15:57:13,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 142 transitions. [2018-01-24 15:57:13,380 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 142 transitions. Word has length 41 [2018-01-24 15:57:13,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:57:13,380 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 142 transitions. [2018-01-24 15:57:13,380 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 15:57:13,380 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 142 transitions. [2018-01-24 15:57:13,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-24 15:57:13,381 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:57:13,381 INFO L322 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:57:13,381 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:57:13,381 INFO L82 PathProgramCache]: Analyzing trace with hash -723967062, now seen corresponding path program 2 times [2018-01-24 15:57:13,382 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:57:13,382 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:13,383 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:57:13,383 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:13,383 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:57:13,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:57:13,397 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:57:13,493 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:57:13,493 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:57:13,493 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:57:13,493 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:57:13,494 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:57:13,494 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:57:13,494 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:57:13,511 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:57:13,511 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:57:13,531 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:57:13,533 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:57:13,537 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:57:13,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-24 15:57:13,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:57:13,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-24 15:57:13,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:57:13,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 15:57:13,572 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-24 15:57:14,098 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 15:57:14,098 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:57:14,499 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 15:57:14,519 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 15:57:14,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15, 13] imperfect sequences [7] total 33 [2018-01-24 15:57:14,519 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:57:14,520 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 15:57:14,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 15:57:14,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=951, Unknown=0, NotChecked=0, Total=1056 [2018-01-24 15:57:14,520 INFO L87 Difference]: Start difference. First operand 136 states and 142 transitions. Second operand 16 states. [2018-01-24 15:57:15,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:57:15,239 INFO L93 Difference]: Finished difference Result 136 states and 142 transitions. [2018-01-24 15:57:15,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 15:57:15,239 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2018-01-24 15:57:15,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:57:15,240 INFO L225 Difference]: With dead ends: 136 [2018-01-24 15:57:15,240 INFO L226 Difference]: Without dead ends: 134 [2018-01-24 15:57:15,241 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=136, Invalid=1196, Unknown=0, NotChecked=0, Total=1332 [2018-01-24 15:57:15,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-01-24 15:57:15,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-01-24 15:57:15,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-01-24 15:57:15,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 140 transitions. [2018-01-24 15:57:15,255 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 140 transitions. Word has length 42 [2018-01-24 15:57:15,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:57:15,255 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 140 transitions. [2018-01-24 15:57:15,255 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 15:57:15,255 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 140 transitions. [2018-01-24 15:57:15,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-24 15:57:15,255 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:57:15,255 INFO L322 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:57:15,256 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:57:15,256 INFO L82 PathProgramCache]: Analyzing trace with hash -2043211584, now seen corresponding path program 1 times [2018-01-24 15:57:15,256 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:57:15,256 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:15,257 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 15:57:15,257 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:15,257 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:57:15,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:57:15,266 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:57:15,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 15:57:15,322 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:57:15,323 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 15:57:15,323 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:57:15,323 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 15:57:15,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 15:57:15,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:57:15,323 INFO L87 Difference]: Start difference. First operand 134 states and 140 transitions. Second operand 8 states. [2018-01-24 15:57:15,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:57:15,366 INFO L93 Difference]: Finished difference Result 221 states and 230 transitions. [2018-01-24 15:57:15,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 15:57:15,366 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-01-24 15:57:15,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:57:15,367 INFO L225 Difference]: With dead ends: 221 [2018-01-24 15:57:15,367 INFO L226 Difference]: Without dead ends: 134 [2018-01-24 15:57:15,368 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-24 15:57:15,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-01-24 15:57:15,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-01-24 15:57:15,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-01-24 15:57:15,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 139 transitions. [2018-01-24 15:57:15,385 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 139 transitions. Word has length 45 [2018-01-24 15:57:15,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:57:15,385 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 139 transitions. [2018-01-24 15:57:15,385 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 15:57:15,386 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 139 transitions. [2018-01-24 15:57:15,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-24 15:57:15,386 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:57:15,386 INFO L322 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:57:15,386 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:57:15,387 INFO L82 PathProgramCache]: Analyzing trace with hash -647760318, now seen corresponding path program 1 times [2018-01-24 15:57:15,387 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:57:15,388 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:15,388 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:57:15,388 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:15,388 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:57:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:57:15,399 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:57:15,450 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 15:57:15,450 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:57:15,451 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 15:57:15,451 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:57:15,451 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 15:57:15,451 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 15:57:15,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 15:57:15,451 INFO L87 Difference]: Start difference. First operand 134 states and 139 transitions. Second operand 10 states. [2018-01-24 15:57:15,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:57:15,512 INFO L93 Difference]: Finished difference Result 223 states and 231 transitions. [2018-01-24 15:57:15,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 15:57:15,512 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2018-01-24 15:57:15,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:57:15,514 INFO L225 Difference]: With dead ends: 223 [2018-01-24 15:57:15,514 INFO L226 Difference]: Without dead ends: 134 [2018-01-24 15:57:15,514 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-01-24 15:57:15,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-01-24 15:57:15,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-01-24 15:57:15,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-01-24 15:57:15,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 138 transitions. [2018-01-24 15:57:15,528 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 138 transitions. Word has length 50 [2018-01-24 15:57:15,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:57:15,528 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 138 transitions. [2018-01-24 15:57:15,528 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 15:57:15,528 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 138 transitions. [2018-01-24 15:57:15,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-24 15:57:15,529 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:57:15,529 INFO L322 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:57:15,529 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:57:15,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1953733819, now seen corresponding path program 1 times [2018-01-24 15:57:15,529 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:57:15,530 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:15,530 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:57:15,530 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:15,530 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:57:15,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:57:15,545 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:57:15,691 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 15:57:15,691 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:57:15,691 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-24 15:57:15,692 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:57:15,692 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 15:57:15,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 15:57:15,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-01-24 15:57:15,692 INFO L87 Difference]: Start difference. First operand 134 states and 138 transitions. Second operand 13 states. [2018-01-24 15:57:15,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:57:15,949 INFO L93 Difference]: Finished difference Result 134 states and 138 transitions. [2018-01-24 15:57:15,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 15:57:15,949 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2018-01-24 15:57:15,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:57:15,950 INFO L225 Difference]: With dead ends: 134 [2018-01-24 15:57:15,950 INFO L226 Difference]: Without dead ends: 132 [2018-01-24 15:57:15,951 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-01-24 15:57:15,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-24 15:57:15,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-01-24 15:57:15,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-24 15:57:15,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 136 transitions. [2018-01-24 15:57:15,968 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 136 transitions. Word has length 61 [2018-01-24 15:57:15,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:57:15,969 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 136 transitions. [2018-01-24 15:57:15,969 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 15:57:15,969 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 136 transitions. [2018-01-24 15:57:15,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-24 15:57:15,969 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:57:15,970 INFO L322 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:57:15,970 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:57:15,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1953733820, now seen corresponding path program 1 times [2018-01-24 15:57:15,970 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:57:15,971 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:15,971 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:57:15,971 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:15,971 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:57:15,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:57:15,989 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:57:16,060 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:57:16,060 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:57:16,060 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:57:16,060 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 62 with the following transitions: [2018-01-24 15:57:16,061 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [12], [13], [17], [31], [36], [38], [52], [54], [59], [63], [66], [67], [68], [71], [72], [73], [77], [79], [80], [91], [94], [122], [123], [126], [129], [130], [133], [134], [135], [137], [138], [139], [144], [147], [157], [158], [159], [160], [161], [162], [163], [165], [169], [170], [173], [174], [175], [179], [180], [181], [182], [191], [193], [194], [195] [2018-01-24 15:57:16,064 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:57:16,065 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:57:19,116 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:57:19,116 INFO L268 AbstractInterpreter]: Visited 59 different actions 67 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 22 variables. [2018-01-24 15:57:19,122 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:57:19,122 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:57:19,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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:57:19,135 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:57:19,135 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:57:19,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:57:19,172 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:57:19,251 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:57:19,251 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:57:19,376 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:57:19,395 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:57:19,395 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:57:19,400 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:57:19,400 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:57:19,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:57:19,461 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:57:19,467 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:57:19,467 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:57:19,520 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:57:19,522 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:57:19,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 13 [2018-01-24 15:57:19,522 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:57:19,523 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 15:57:19,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 15:57:19,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-01-24 15:57:19,523 INFO L87 Difference]: Start difference. First operand 132 states and 136 transitions. Second operand 8 states. [2018-01-24 15:57:19,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:57:19,556 INFO L93 Difference]: Finished difference Result 240 states and 248 transitions. [2018-01-24 15:57:19,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 15:57:19,557 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2018-01-24 15:57:19,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:57:19,558 INFO L225 Difference]: With dead ends: 240 [2018-01-24 15:57:19,558 INFO L226 Difference]: Without dead ends: 133 [2018-01-24 15:57:19,558 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 236 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=105, Unknown=0, NotChecked=0, Total=182 [2018-01-24 15:57:19,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-24 15:57:19,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-01-24 15:57:19,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-24 15:57:19,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 137 transitions. [2018-01-24 15:57:19,575 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 137 transitions. Word has length 61 [2018-01-24 15:57:19,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:57:19,575 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 137 transitions. [2018-01-24 15:57:19,575 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 15:57:19,575 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2018-01-24 15:57:19,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-24 15:57:19,576 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:57:19,576 INFO L322 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:57:19,576 INFO L371 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:57:19,576 INFO L82 PathProgramCache]: Analyzing trace with hash 737964273, now seen corresponding path program 2 times [2018-01-24 15:57:19,576 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:57:19,577 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:19,577 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:57:19,577 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:19,577 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:57:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:57:19,594 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:57:19,652 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:57:19,652 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:57:19,652 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:57:19,652 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:57:19,652 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:57:19,652 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:57:19,653 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:57:19,657 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:57:19,658 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:57:19,680 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:57:19,683 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:57:19,686 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:57:19,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-24 15:57:19,690 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:57:19,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-24 15:57:19,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:57:19,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 15:57:19,711 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-24 15:57:20,341 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 15:57:20,341 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:57:24,857 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 15:57:24,882 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 15:57:24,882 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18, 16] imperfect sequences [8] total 40 [2018-01-24 15:57:24,882 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:57:24,883 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 15:57:24,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 15:57:24,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1427, Unknown=1, NotChecked=0, Total=1560 [2018-01-24 15:57:24,884 INFO L87 Difference]: Start difference. First operand 133 states and 137 transitions. Second operand 19 states. [2018-01-24 15:57:26,981 WARN L143 SmtUtils]: Spent 2047ms on a formula simplification that was a NOOP. DAG size: 39 [2018-01-24 15:57:27,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:57:27,733 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2018-01-24 15:57:27,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 15:57:27,733 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 62 [2018-01-24 15:57:27,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:57:27,734 INFO L225 Difference]: With dead ends: 133 [2018-01-24 15:57:27,734 INFO L226 Difference]: Without dead ends: 131 [2018-01-24 15:57:27,735 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=173, Invalid=1806, Unknown=1, NotChecked=0, Total=1980 [2018-01-24 15:57:27,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-01-24 15:57:27,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-01-24 15:57:27,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-01-24 15:57:27,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 135 transitions. [2018-01-24 15:57:27,753 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 135 transitions. Word has length 62 [2018-01-24 15:57:27,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:57:27,753 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 135 transitions. [2018-01-24 15:57:27,753 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-24 15:57:27,753 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2018-01-24 15:57:27,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-01-24 15:57:27,754 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:57:27,754 INFO L322 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:57:27,754 INFO L371 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:57:27,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1810517891, now seen corresponding path program 1 times [2018-01-24 15:57:27,754 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:57:27,755 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:27,755 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 15:57:27,755 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:27,755 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:57:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:57:27,771 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:57:27,868 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 15:57:27,868 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:57:27,868 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-24 15:57:27,868 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:57:27,868 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 15:57:27,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 15:57:27,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-01-24 15:57:27,869 INFO L87 Difference]: Start difference. First operand 131 states and 135 transitions. Second operand 11 states. [2018-01-24 15:57:27,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:57:27,973 INFO L93 Difference]: Finished difference Result 192 states and 198 transitions. [2018-01-24 15:57:27,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 15:57:27,973 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2018-01-24 15:57:27,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:57:27,974 INFO L225 Difference]: With dead ends: 192 [2018-01-24 15:57:27,974 INFO L226 Difference]: Without dead ends: 131 [2018-01-24 15:57:27,974 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-01-24 15:57:27,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-01-24 15:57:27,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-01-24 15:57:27,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-01-24 15:57:27,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 134 transitions. [2018-01-24 15:57:27,986 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 134 transitions. Word has length 71 [2018-01-24 15:57:27,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:57:27,986 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 134 transitions. [2018-01-24 15:57:27,986 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 15:57:27,986 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 134 transitions. [2018-01-24 15:57:27,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-24 15:57:27,987 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:57:27,987 INFO L322 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:57:27,987 INFO L371 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:57:27,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1846676097, now seen corresponding path program 1 times [2018-01-24 15:57:27,988 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:57:27,988 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:27,988 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:57:27,988 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:27,988 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:57:28,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:57:28,003 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:57:28,221 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 15:57:28,221 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:57:28,221 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-01-24 15:57:28,221 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:57:28,221 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 15:57:28,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 15:57:28,222 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-01-24 15:57:28,222 INFO L87 Difference]: Start difference. First operand 131 states and 134 transitions. Second operand 18 states. [2018-01-24 15:57:29,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:57:29,108 INFO L93 Difference]: Finished difference Result 140 states and 143 transitions. [2018-01-24 15:57:29,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 15:57:29,109 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 84 [2018-01-24 15:57:29,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:57:29,110 INFO L225 Difference]: With dead ends: 140 [2018-01-24 15:57:29,110 INFO L226 Difference]: Without dead ends: 138 [2018-01-24 15:57:29,110 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2018-01-24 15:57:29,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-01-24 15:57:29,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 129. [2018-01-24 15:57:29,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-24 15:57:29,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 132 transitions. [2018-01-24 15:57:29,125 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 132 transitions. Word has length 84 [2018-01-24 15:57:29,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:57:29,125 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 132 transitions. [2018-01-24 15:57:29,126 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-24 15:57:29,126 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2018-01-24 15:57:29,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-24 15:57:29,127 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:57:29,127 INFO L322 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:57:29,127 INFO L371 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:57:29,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1846676096, now seen corresponding path program 1 times [2018-01-24 15:57:29,127 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:57:29,128 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:29,128 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:57:29,128 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:29,129 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:57:29,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:57:29,150 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:57:29,222 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:57:29,223 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:57:29,223 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:57:29,223 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 85 with the following transitions: [2018-01-24 15:57:29,224 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [12], [13], [17], [19], [20], [21], [24], [31], [36], [38], [39], [42], [52], [54], [56], [59], [63], [66], [67], [68], [71], [72], [73], [77], [79], [80], [81], [91], [92], [95], [96], [99], [100], [122], [123], [126], [129], [130], [133], [134], [135], [137], [138], [139], [140], [144], [147], [152], [153], [157], [158], [159], [160], [161], [162], [163], [165], [166], [167], [169], [170], [173], [174], [175], [176], [177], [179], [180], [181], [182], [183], [189], [191], [192], [193], [194], [195] [2018-01-24 15:57:29,227 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:57:29,227 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:57:31,745 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:57:31,745 INFO L268 AbstractInterpreter]: Visited 81 different actions 89 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 26 variables. [2018-01-24 15:57:31,747 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:57:31,747 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:57:31,747 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:57:31,752 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:57:31,752 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:57:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:57:31,790 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:57:31,800 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:57:31,800 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:57:31,962 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:57:31,982 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:57:31,982 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:57:31,985 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:57:31,985 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:57:32,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:57:32,068 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:57:32,075 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:57:32,075 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:57:32,136 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:57:32,137 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:57:32,138 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8] total 15 [2018-01-24 15:57:32,138 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:57:32,138 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 15:57:32,138 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 15:57:32,139 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-01-24 15:57:32,139 INFO L87 Difference]: Start difference. First operand 129 states and 132 transitions. Second operand 9 states. [2018-01-24 15:57:32,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:57:32,168 INFO L93 Difference]: Finished difference Result 233 states and 239 transitions. [2018-01-24 15:57:32,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 15:57:32,169 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2018-01-24 15:57:32,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:57:32,169 INFO L225 Difference]: With dead ends: 233 [2018-01-24 15:57:32,169 INFO L226 Difference]: Without dead ends: 130 [2018-01-24 15:57:32,170 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 327 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=103, Invalid=137, Unknown=0, NotChecked=0, Total=240 [2018-01-24 15:57:32,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-01-24 15:57:32,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-01-24 15:57:32,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-01-24 15:57:32,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 133 transitions. [2018-01-24 15:57:32,190 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 133 transitions. Word has length 84 [2018-01-24 15:57:32,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:57:32,190 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 133 transitions. [2018-01-24 15:57:32,190 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 15:57:32,190 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 133 transitions. [2018-01-24 15:57:32,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-01-24 15:57:32,191 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:57:32,191 INFO L322 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:57:32,191 INFO L371 AbstractCegarLoop]: === Iteration 23 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:57:32,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1476998571, now seen corresponding path program 2 times [2018-01-24 15:57:32,191 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:57:32,192 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:32,192 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:57:32,192 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:32,192 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:57:32,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:57:32,206 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:57:32,257 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:57:32,257 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:57:32,258 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:57:32,258 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:57:32,258 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:57:32,258 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:57:32,258 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:57:32,263 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:57:32,263 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:57:32,294 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:57:32,299 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:57:32,303 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:57:32,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-24 15:57:32,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:57:32,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-24 15:57:32,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:57:32,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 15:57:32,327 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-24 15:57:33,039 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-24 15:57:33,039 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:57:33,682 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-24 15:57:33,701 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 15:57:33,702 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20, 18] imperfect sequences [9] total 45 [2018-01-24 15:57:33,702 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:57:33,702 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 15:57:33,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 15:57:33,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1827, Unknown=0, NotChecked=0, Total=1980 [2018-01-24 15:57:33,703 INFO L87 Difference]: Start difference. First operand 130 states and 133 transitions. Second operand 21 states. [2018-01-24 15:57:34,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:57:34,768 INFO L93 Difference]: Finished difference Result 130 states and 133 transitions. [2018-01-24 15:57:34,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-24 15:57:34,768 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 85 [2018-01-24 15:57:34,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:57:34,769 INFO L225 Difference]: With dead ends: 130 [2018-01-24 15:57:34,769 INFO L226 Difference]: Without dead ends: 128 [2018-01-24 15:57:34,770 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 131 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=202, Invalid=2348, Unknown=0, NotChecked=0, Total=2550 [2018-01-24 15:57:34,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-01-24 15:57:34,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-01-24 15:57:34,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-01-24 15:57:34,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 131 transitions. [2018-01-24 15:57:34,783 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 131 transitions. Word has length 85 [2018-01-24 15:57:34,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:57:34,784 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 131 transitions. [2018-01-24 15:57:34,784 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-24 15:57:34,784 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 131 transitions. [2018-01-24 15:57:34,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-01-24 15:57:34,784 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:57:34,784 INFO L322 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:57:34,784 INFO L371 AbstractCegarLoop]: === Iteration 24 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:57:34,785 INFO L82 PathProgramCache]: Analyzing trace with hash -939068168, now seen corresponding path program 1 times [2018-01-24 15:57:34,785 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:57:34,785 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:34,785 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 15:57:34,786 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:34,786 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:57:34,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:57:34,801 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:57:34,917 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-24 15:57:34,918 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:57:34,918 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-24 15:57:34,918 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:57:34,918 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 15:57:34,918 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 15:57:34,919 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-01-24 15:57:34,919 INFO L87 Difference]: Start difference. First operand 128 states and 131 transitions. Second operand 11 states. [2018-01-24 15:57:35,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:57:35,062 INFO L93 Difference]: Finished difference Result 134 states and 136 transitions. [2018-01-24 15:57:35,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 15:57:35,062 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2018-01-24 15:57:35,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:57:35,063 INFO L225 Difference]: With dead ends: 134 [2018-01-24 15:57:35,063 INFO L226 Difference]: Without dead ends: 128 [2018-01-24 15:57:35,064 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-01-24 15:57:35,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-01-24 15:57:35,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-01-24 15:57:35,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-01-24 15:57:35,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 130 transitions. [2018-01-24 15:57:35,077 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 130 transitions. Word has length 83 [2018-01-24 15:57:35,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:57:35,077 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 130 transitions. [2018-01-24 15:57:35,078 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 15:57:35,078 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 130 transitions. [2018-01-24 15:57:35,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-01-24 15:57:35,078 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:57:35,078 INFO L322 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:57:35,078 INFO L371 AbstractCegarLoop]: === Iteration 25 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:57:35,078 INFO L82 PathProgramCache]: Analyzing trace with hash 983401723, now seen corresponding path program 1 times [2018-01-24 15:57:35,079 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:57:35,079 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:35,079 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:57:35,079 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:35,079 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:57:35,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:57:35,094 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:57:36,155 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-24 15:57:36,155 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:57:36,155 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-01-24 15:57:36,155 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:57:36,156 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-24 15:57:36,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-24 15:57:36,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2018-01-24 15:57:36,156 INFO L87 Difference]: Start difference. First operand 128 states and 130 transitions. Second operand 22 states. [2018-01-24 15:57:36,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:57:36,569 INFO L93 Difference]: Finished difference Result 133 states and 135 transitions. [2018-01-24 15:57:36,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-24 15:57:36,570 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 99 [2018-01-24 15:57:36,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:57:36,571 INFO L225 Difference]: With dead ends: 133 [2018-01-24 15:57:36,571 INFO L226 Difference]: Without dead ends: 131 [2018-01-24 15:57:36,571 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2018-01-24 15:57:36,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-01-24 15:57:36,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 126. [2018-01-24 15:57:36,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-24 15:57:36,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 128 transitions. [2018-01-24 15:57:36,586 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 128 transitions. Word has length 99 [2018-01-24 15:57:36,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:57:36,586 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 128 transitions. [2018-01-24 15:57:36,586 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-24 15:57:36,586 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 128 transitions. [2018-01-24 15:57:36,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-01-24 15:57:36,586 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:57:36,587 INFO L322 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:57:36,587 INFO L371 AbstractCegarLoop]: === Iteration 26 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:57:36,587 INFO L82 PathProgramCache]: Analyzing trace with hash 983401724, now seen corresponding path program 1 times [2018-01-24 15:57:36,587 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:57:36,587 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:36,588 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:57:36,588 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:36,588 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:57:36,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:57:36,603 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:57:36,797 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:57:36,797 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:57:36,797 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:57:36,797 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 100 with the following transitions: [2018-01-24 15:57:36,798 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [12], [13], [17], [19], [20], [21], [24], [31], [36], [38], [39], [40], [43], [44], [47], [48], [49], [52], [54], [56], [59], [63], [66], [67], [68], [71], [72], [73], [77], [79], [80], [81], [83], [86], [91], [92], [95], [96], [99], [100], [101], [104], [107], [122], [123], [126], [129], [130], [133], [134], [135], [137], [138], [139], [140], [144], [147], [152], [153], [157], [158], [159], [160], [161], [162], [163], [165], [166], [167], [169], [170], [171], [173], [174], [175], [176], [177], [179], [180], [181], [182], [183], [184], [185], [187], [189], [191], [192], [193], [194], [195] [2018-01-24 15:57:36,801 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:57:36,801 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:57:40,065 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:57:40,066 INFO L268 AbstractInterpreter]: Visited 95 different actions 103 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 27 variables. [2018-01-24 15:57:40,077 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:57:40,077 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:57:40,077 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:57:40,082 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:57:40,082 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:57:40,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:57:40,127 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:57:40,136 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:57:40,136 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:57:40,251 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:57:40,271 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:57:40,271 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:57:40,275 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:57:40,275 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:57:40,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:57:40,371 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:57:40,380 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:57:40,380 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:57:40,465 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:57:40,467 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:57:40,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9] total 17 [2018-01-24 15:57:40,467 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:57:40,468 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 15:57:40,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 15:57:40,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-01-24 15:57:40,468 INFO L87 Difference]: Start difference. First operand 126 states and 128 transitions. Second operand 10 states. [2018-01-24 15:57:40,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:57:40,502 INFO L93 Difference]: Finished difference Result 226 states and 230 transitions. [2018-01-24 15:57:40,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 15:57:40,503 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 99 [2018-01-24 15:57:40,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:57:40,503 INFO L225 Difference]: With dead ends: 226 [2018-01-24 15:57:40,503 INFO L226 Difference]: Without dead ends: 127 [2018-01-24 15:57:40,504 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 386 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-24 15:57:40,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-24 15:57:40,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-01-24 15:57:40,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-01-24 15:57:40,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 129 transitions. [2018-01-24 15:57:40,520 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 129 transitions. Word has length 99 [2018-01-24 15:57:40,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:57:40,521 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 129 transitions. [2018-01-24 15:57:40,521 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 15:57:40,521 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 129 transitions. [2018-01-24 15:57:40,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-01-24 15:57:40,521 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:57:40,522 INFO L322 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:57:40,522 INFO L371 AbstractCegarLoop]: === Iteration 27 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 15:57:40,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1981450609, now seen corresponding path program 2 times [2018-01-24 15:57:40,522 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:57:40,523 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:40,523 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:57:40,524 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:57:40,524 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:57:40,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:57:40,552 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:57:40,744 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:57:40,745 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:57:40,745 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:57:40,745 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:57:40,745 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:57:40,745 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:57:40,745 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:57:40,751 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:57:40,751 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:57:40,795 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:57:40,801 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:57:40,807 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:57:40,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-24 15:57:40,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:57:40,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-24 15:57:40,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:57:40,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 15:57:40,836 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-24 15:57:42,148 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-01-24 15:57:42,148 INFO L314 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2018-01-24 15:57:42,169 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 15:57:42,170 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 15:57:42,174 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 15:57:42,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 03:57:42 BoogieIcfgContainer [2018-01-24 15:57:42,174 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 15:57:42,175 INFO L168 Benchmark]: Toolchain (without parser) took 42556.08 ms. Allocated memory was 300.9 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 259.8 MB in the beginning and 952.3 MB in the end (delta: -692.5 MB). Peak memory consumption was 368.7 MB. Max. memory is 5.3 GB. [2018-01-24 15:57:42,176 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 300.9 MB. Free memory is still 266.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 15:57:42,176 INFO L168 Benchmark]: CACSL2BoogieTranslator took 216.52 ms. Allocated memory is still 300.9 MB. Free memory was 259.8 MB in the beginning and 245.6 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 5.3 GB. [2018-01-24 15:57:42,177 INFO L168 Benchmark]: Boogie Preprocessor took 49.47 ms. Allocated memory is still 300.9 MB. Free memory was 245.6 MB in the beginning and 243.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:57:42,177 INFO L168 Benchmark]: RCFGBuilder took 458.03 ms. Allocated memory is still 300.9 MB. Free memory was 243.6 MB in the beginning and 208.4 MB in the end (delta: 35.2 MB). Peak memory consumption was 35.2 MB. Max. memory is 5.3 GB. [2018-01-24 15:57:42,177 INFO L168 Benchmark]: TraceAbstraction took 41824.00 ms. Allocated memory was 300.9 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 208.4 MB in the beginning and 952.3 MB in the end (delta: -743.9 MB). Peak memory consumption was 317.3 MB. Max. memory is 5.3 GB. [2018-01-24 15:57:42,179 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 300.9 MB. Free memory is still 266.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 216.52 ms. Allocated memory is still 300.9 MB. Free memory was 259.8 MB in the beginning and 245.6 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 49.47 ms. Allocated memory is still 300.9 MB. Free memory was 245.6 MB in the beginning and 243.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 458.03 ms. Allocated memory is still 300.9 MB. Free memory was 243.6 MB in the beginning and 208.4 MB in the end (delta: 35.2 MB). Peak memory consumption was 35.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 41824.00 ms. Allocated memory was 300.9 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 208.4 MB in the beginning and 952.3 MB in the end (delta: -743.9 MB). Peak memory consumption was 317.3 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.466331 RENAME_VARIABLES(MILLISECONDS) : 0.086887 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.186546 PROJECTAWAY(MILLISECONDS) : 0.059022 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.103162 DISJOIN(MILLISECONDS) : 0.659563 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.110119 ADD_EQUALITY(MILLISECONDS) : 0.019595 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.007365 #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.221936 RENAME_VARIABLES(MILLISECONDS) : 0.052880 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.090014 PROJECTAWAY(MILLISECONDS) : 0.023480 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.037090 DISJOIN(MILLISECONDS) : 0.363657 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.067670 ADD_EQUALITY(MILLISECONDS) : 0.012409 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.004971 #CONJOIN_DISJUNCTIVE : 96 #RENAME_VARIABLES : 160 #UNFREEZE : 0 #CONJOIN : 203 #PROJECTAWAY : 159 #ADD_WEAK_EQUALITY : 15 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 156 #ADD_EQUALITY : 128 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 58 LocStat_MAX_WEQGRAPH_SIZE : 6 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 451 LocStat_NO_SUPPORTING_DISEQUALITIES : 49 LocStat_NO_DISJUNCTIONS : -116 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 85 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 164 TransStat_NO_SUPPORTING_DISEQUALITIES : 11 TransStat_NO_DISJUNCTIONS : 90 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.233153 RENAME_VARIABLES(MILLISECONDS) : 0.047062 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.099235 PROJECTAWAY(MILLISECONDS) : 0.022638 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.055389 DISJOIN(MILLISECONDS) : 0.517343 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.060199 ADD_EQUALITY(MILLISECONDS) : 0.011120 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.004638 #CONJOIN_DISJUNCTIVE : 132 #RENAME_VARIABLES : 217 #UNFREEZE : 0 #CONJOIN : 284 #PROJECTAWAY : 223 #ADD_WEAK_EQUALITY : 27 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 212 #ADD_EQUALITY : 180 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 10 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 80 LocStat_MAX_WEQGRAPH_SIZE : 6 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 659 LocStat_NO_SUPPORTING_DISEQUALITIES : 71 LocStat_NO_DISJUNCTIONS : -160 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 115 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 233 TransStat_NO_SUPPORTING_DISEQUALITIES : 13 TransStat_NO_DISJUNCTIONS : 121 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.359560 RENAME_VARIABLES(MILLISECONDS) : 0.099849 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.150635 PROJECTAWAY(MILLISECONDS) : 0.036808 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.028806 DISJOIN(MILLISECONDS) : 0.352486 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.122170 ADD_EQUALITY(MILLISECONDS) : 0.014147 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.003710 #CONJOIN_DISJUNCTIVE : 175 #RENAME_VARIABLES : 279 #UNFREEZE : 0 #CONJOIN : 383 #PROJECTAWAY : 292 #ADD_WEAK_EQUALITY : 33 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 273 #ADD_EQUALITY : 254 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 12 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 94 LocStat_MAX_WEQGRAPH_SIZE : 6 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 805 LocStat_NO_SUPPORTING_DISEQUALITIES : 85 LocStat_NO_DISJUNCTIONS : -188 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 135 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 2 TransStat_NO_SUPPORTING_EQUALITIES : 265 TransStat_NO_SUPPORTING_DISEQUALITIES : 13 TransStat_NO_DISJUNCTIONS : 141 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.168310 RENAME_VARIABLES(MILLISECONDS) : 0.048337 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.068998 PROJECTAWAY(MILLISECONDS) : 0.019090 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.028169 DISJOIN(MILLISECONDS) : 0.340424 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.059815 ADD_EQUALITY(MILLISECONDS) : 0.008506 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.003268 #CONJOIN_DISJUNCTIVE : 198 #RENAME_VARIABLES : 316 #UNFREEZE : 0 #CONJOIN : 431 #PROJECTAWAY : 333 #ADD_WEAK_EQUALITY : 39 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 310 #ADD_EQUALITY : 291 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 12 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1294). Cancelled while BasicCegarLoop was analyzing trace of length 101 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 33 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1294). Cancelled while BasicCegarLoop was analyzing trace of length 101 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 33 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1411). Cancelled while BasicCegarLoop was analyzing trace of length 101 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 33 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1411). Cancelled while BasicCegarLoop was analyzing trace of length 101 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 33 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1265). Cancelled while BasicCegarLoop was analyzing trace of length 101 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 33 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1265). Cancelled while BasicCegarLoop was analyzing trace of length 101 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 33 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1267). Cancelled while BasicCegarLoop was analyzing trace of length 101 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 33 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1267). Cancelled while BasicCegarLoop was analyzing trace of length 101 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 33 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1256). Cancelled while BasicCegarLoop was analyzing trace of length 101 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 33 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1256). Cancelled while BasicCegarLoop was analyzing trace of length 101 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 33 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1258). Cancelled while BasicCegarLoop was analyzing trace of length 101 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 33 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1258). Cancelled while BasicCegarLoop was analyzing trace of length 101 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 33 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was analyzing trace of length 101 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 33 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was analyzing trace of length 101 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 33 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was analyzing trace of length 101 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 33 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was analyzing trace of length 101 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 33 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1339). Cancelled while BasicCegarLoop was analyzing trace of length 101 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 33 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1339). Cancelled while BasicCegarLoop was analyzing trace of length 101 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 33 known predicates. - TimeoutResultAtElement [Line: 1443]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1443). Cancelled while BasicCegarLoop was analyzing trace of length 101 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 33 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1099). Cancelled while BasicCegarLoop was analyzing trace of length 101 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 33 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1100). Cancelled while BasicCegarLoop was analyzing trace of length 101 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 33 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1100). Cancelled while BasicCegarLoop was analyzing trace of length 101 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 33 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1099). Cancelled while BasicCegarLoop was analyzing trace of length 101 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 33 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 142 locations, 23 error locations. TIMEOUT Result, 41.7s OverallTime, 27 OverallIterations, 6 TraceHistogramMax, 9.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3273 SDtfs, 919 SDslu, 19713 SDs, 0 SdLazy, 6199 SolverSat, 187 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2006 GetRequests, 1600 SyntacticMatches, 20 SemanticMatches, 386 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1996 ImplicationChecksByTransitivity, 14.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=157occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 15.4s AbstIntTime, 5 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 26 MinimizatonAttempts, 58 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 13.6s InterpolantComputationTime, 2200 NumberOfCodeBlocks, 2186 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 3011 ConstructedInterpolants, 173 QuantifiedInterpolants, 658084 SizeOfPredicates, 66 NumberOfNonLiveVariables, 4078 ConjunctsInSsa, 273 ConjunctsInUnsatCore, 54 InterpolantComputations, 25 PerfectInterpolantSequences, 139/348 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_15-57-42-194.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_15-57-42-194.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_15-57-42-194.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_15-57-42-194.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_15-57-42-194.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-24_15-57-42-194.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-24_15-57-42-194.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-24_15-57-42-194.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-24_15-57-42-194.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-4-2018-01-24_15-57-42-194.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-4-2018-01-24_15-57-42-194.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_15-57-42-194.csv Completed graceful shutdown