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_imprecise.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_2_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 17:27:04,363 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 17:27:04,364 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 17:27:04,376 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 17:27:04,377 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 17:27:04,378 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 17:27:04,379 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 17:27:04,380 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 17:27:04,383 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 17:27:04,384 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 17:27:04,384 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 17:27:04,385 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 17:27:04,386 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 17:27:04,387 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 17:27:04,387 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 17:27:04,390 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 17:27:04,392 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 17:27:04,394 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 17:27:04,395 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 17:27:04,396 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 17:27:04,398 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 17:27:04,399 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 17:27:04,399 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 17:27:04,400 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 17:27:04,400 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 17:27:04,402 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 17:27:04,402 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 17:27:04,403 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 17:27:04,403 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 17:27:04,403 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 17:27:04,404 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 17:27:04,404 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_imprecise.epf [2018-01-24 17:27:04,414 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 17:27:04,414 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 17:27:04,415 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 17:27:04,415 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 17:27:04,415 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 17:27:04,415 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 17:27:04,416 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 17:27:04,416 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 17:27:04,416 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 17:27:04,417 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 17:27:04,417 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 17:27:04,417 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 17:27:04,417 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 17:27:04,417 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 17:27:04,418 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 17:27:04,418 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 17:27:04,418 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 17:27:04,418 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 17:27:04,418 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 17:27:04,419 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 17:27:04,419 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 17:27:04,419 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 17:27:04,419 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 17:27:04,419 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 17:27:04,420 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 17:27:04,420 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 17:27:04,420 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 17:27:04,420 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 17:27:04,420 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 17:27:04,421 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 17:27:04,421 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 17:27:04,421 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 17:27:04,421 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 17:27:04,421 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 17:27:04,422 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 17:27:04,422 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 17:27:04,455 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 17:27:04,465 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 17:27:04,469 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 17:27:04,471 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 17:27:04,471 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 17:27:04,472 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_2_true-valid-memsafety_true-termination.i [2018-01-24 17:27:04,642 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 17:27:04,649 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 17:27:04,650 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 17:27:04,650 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 17:27:04,656 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 17:27:04,657 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:27:04" (1/1) ... [2018-01-24 17:27:04,661 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@388a8c3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:27:04, skipping insertion in model container [2018-01-24 17:27:04,661 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:27:04" (1/1) ... [2018-01-24 17:27:04,674 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:27:04,722 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:27:04,846 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:27:04,872 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:27:04,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:27:04 WrapperNode [2018-01-24 17:27:04,884 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 17:27:04,885 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 17:27:04,885 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 17:27:04,885 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 17:27:04,897 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:27:04" (1/1) ... [2018-01-24 17:27:04,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:27:04" (1/1) ... [2018-01-24 17:27:04,908 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:27:04" (1/1) ... [2018-01-24 17:27:04,908 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:27:04" (1/1) ... [2018-01-24 17:27:04,916 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:27:04" (1/1) ... [2018-01-24 17:27:04,919 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:27:04" (1/1) ... [2018-01-24 17:27:04,920 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:27:04" (1/1) ... [2018-01-24 17:27:04,923 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 17:27:04,924 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 17:27:04,924 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 17:27:04,924 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 17:27:04,925 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:27:04" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 17:27:04,970 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 17:27:04,970 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 17:27:04,970 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-01-24 17:27:04,970 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 17:27:04,970 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-01-24 17:27:04,970 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2018-01-24 17:27:04,970 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-01-24 17:27:04,971 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-01-24 17:27:04,971 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-01-24 17:27:04,971 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2018-01-24 17:27:04,971 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-01-24 17:27:04,971 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-01-24 17:27:04,971 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-01-24 17:27:04,972 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-01-24 17:27:04,972 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2018-01-24 17:27:04,972 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-01-24 17:27:04,972 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-01-24 17:27:04,972 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-01-24 17:27:04,972 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 17:27:04,973 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 17:27:04,973 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 17:27:04,973 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 17:27:04,973 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 17:27:04,973 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 17:27:04,974 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 17:27:04,974 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 17:27:04,974 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 17:27:04,974 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-24 17:27:04,974 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-24 17:27:04,974 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 17:27:04,974 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 17:27:04,975 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 17:27:04,975 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-24 17:27:04,975 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 17:27:04,975 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-01-24 17:27:04,975 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2018-01-24 17:27:04,975 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-01-24 17:27:04,976 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-01-24 17:27:04,976 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-01-24 17:27:04,976 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-01-24 17:27:04,976 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2018-01-24 17:27:04,976 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-01-24 17:27:04,976 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-01-24 17:27:04,976 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-01-24 17:27:04,977 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-01-24 17:27:04,977 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2018-01-24 17:27:04,977 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-01-24 17:27:04,977 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-01-24 17:27:04,977 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-01-24 17:27:04,977 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 17:27:04,977 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 17:27:04,977 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 17:27:04,978 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 17:27:05,264 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-24 17:27:05,412 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 17:27:05,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:27:05 BoogieIcfgContainer [2018-01-24 17:27:05,413 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 17:27:05,414 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 17:27:05,414 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 17:27:05,415 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 17:27:05,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 05:27:04" (1/3) ... [2018-01-24 17:27:05,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b80a28d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:27:05, skipping insertion in model container [2018-01-24 17:27:05,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:27:04" (2/3) ... [2018-01-24 17:27:05,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b80a28d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:27:05, skipping insertion in model container [2018-01-24 17:27:05,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:27:05" (3/3) ... [2018-01-24 17:27:05,418 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test22_2_true-valid-memsafety_true-termination.i [2018-01-24 17:27:05,424 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 17:27:05,432 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-01-24 17:27:05,475 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 17:27:05,475 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 17:27:05,475 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 17:27:05,475 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 17:27:05,476 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 17:27:05,476 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 17:27:05,476 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 17:27:05,476 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 17:27:05,477 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 17:27:05,495 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2018-01-24 17:27:05,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 17:27:05,500 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:27:05,501 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 17:27:05,501 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 17:27:05,504 INFO L82 PathProgramCache]: Analyzing trace with hash -998986606, now seen corresponding path program 1 times [2018-01-24 17:27:05,506 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:27:05,552 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:05,552 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:27:05,552 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:05,553 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:27:05,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:27:05,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:27:05,813 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 17:27:05,815 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:27:05,815 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:27:05,816 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:27:05,819 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:27:05,833 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:27:05,834 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:27:05,836 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 5 states. [2018-01-24 17:27:05,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:27:05,906 INFO L93 Difference]: Finished difference Result 274 states and 291 transitions. [2018-01-24 17:27:05,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:27:05,908 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-24 17:27:05,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:27:05,918 INFO L225 Difference]: With dead ends: 274 [2018-01-24 17:27:05,918 INFO L226 Difference]: Without dead ends: 146 [2018-01-24 17:27:05,921 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 17:27:05,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-01-24 17:27:05,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2018-01-24 17:27:05,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-01-24 17:27:05,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 153 transitions. [2018-01-24 17:27:05,963 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 153 transitions. Word has length 17 [2018-01-24 17:27:05,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:27:05,963 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 153 transitions. [2018-01-24 17:27:05,963 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:27:05,963 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2018-01-24 17:27:05,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 17:27:05,964 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:27:05,964 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 17:27:05,964 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 17:27:05,964 INFO L82 PathProgramCache]: Analyzing trace with hash -2077747980, now seen corresponding path program 1 times [2018-01-24 17:27:05,964 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:27:05,966 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:05,966 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:27:05,966 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:05,966 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:27:05,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:27:05,987 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:27:06,060 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 17:27:06,061 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:27:06,061 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:27:06,061 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:27:06,062 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:27:06,063 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:27:06,063 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:27:06,063 INFO L87 Difference]: Start difference. First operand 144 states and 153 transitions. Second operand 6 states. [2018-01-24 17:27:06,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:27:06,279 INFO L93 Difference]: Finished difference Result 146 states and 155 transitions. [2018-01-24 17:27:06,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:27:06,280 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 17:27:06,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:27:06,282 INFO L225 Difference]: With dead ends: 146 [2018-01-24 17:27:06,282 INFO L226 Difference]: Without dead ends: 145 [2018-01-24 17:27:06,283 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 17:27:06,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-01-24 17:27:06,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2018-01-24 17:27:06,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-24 17:27:06,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 152 transitions. [2018-01-24 17:27:06,295 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 152 transitions. Word has length 19 [2018-01-24 17:27:06,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:27:06,296 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 152 transitions. [2018-01-24 17:27:06,296 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:27:06,296 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 152 transitions. [2018-01-24 17:27:06,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 17:27:06,296 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:27:06,296 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 17:27:06,296 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 17:27:06,297 INFO L82 PathProgramCache]: Analyzing trace with hash -2077747979, now seen corresponding path program 1 times [2018-01-24 17:27:06,297 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:27:06,298 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:06,298 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:27:06,298 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:06,298 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:27:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:27:06,319 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:27:06,674 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 17:27:06,675 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:27:06,675 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 17:27:06,675 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:27:06,675 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 17:27:06,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 17:27:06,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:27:06,676 INFO L87 Difference]: Start difference. First operand 143 states and 152 transitions. Second operand 7 states. [2018-01-24 17:27:06,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:27:06,850 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2018-01-24 17:27:06,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 17:27:06,873 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-01-24 17:27:06,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:27:06,875 INFO L225 Difference]: With dead ends: 145 [2018-01-24 17:27:06,875 INFO L226 Difference]: Without dead ends: 144 [2018-01-24 17:27:06,875 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 17:27:06,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-01-24 17:27:06,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2018-01-24 17:27:06,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-01-24 17:27:06,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 151 transitions. [2018-01-24 17:27:06,889 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 151 transitions. Word has length 19 [2018-01-24 17:27:06,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:27:06,889 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 151 transitions. [2018-01-24 17:27:06,889 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 17:27:06,889 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2018-01-24 17:27:06,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 17:27:06,890 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:27:06,891 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 17:27:06,891 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 17:27:06,891 INFO L82 PathProgramCache]: Analyzing trace with hash -471802203, now seen corresponding path program 1 times [2018-01-24 17:27:06,891 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:27:06,893 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:06,893 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:27:06,893 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:06,893 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:27:06,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:27:06,911 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:27:06,988 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 17:27:06,988 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:27:06,989 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 17:27:06,989 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:27:06,989 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 17:27:06,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 17:27:06,990 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:27:06,990 INFO L87 Difference]: Start difference. First operand 142 states and 151 transitions. Second operand 7 states. [2018-01-24 17:27:07,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:27:07,050 INFO L93 Difference]: Finished difference Result 238 states and 253 transitions. [2018-01-24 17:27:07,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 17:27:07,051 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-01-24 17:27:07,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:27:07,053 INFO L225 Difference]: With dead ends: 238 [2018-01-24 17:27:07,053 INFO L226 Difference]: Without dead ends: 159 [2018-01-24 17:27:07,054 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 17:27:07,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-01-24 17:27:07,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 151. [2018-01-24 17:27:07,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-01-24 17:27:07,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2018-01-24 17:27:07,074 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 27 [2018-01-24 17:27:07,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:27:07,075 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2018-01-24 17:27:07,075 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 17:27:07,075 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2018-01-24 17:27:07,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 17:27:07,077 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:27:07,077 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 17:27:07,077 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 17:27:07,078 INFO L82 PathProgramCache]: Analyzing trace with hash 131109242, now seen corresponding path program 1 times [2018-01-24 17:27:07,078 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:27:07,079 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:07,079 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:27:07,080 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:07,080 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:27:07,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:27:07,100 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:27:07,223 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 17:27:07,223 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:27:07,223 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 17:27:07,224 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:27:07,224 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 17:27:07,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 17:27:07,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 17:27:07,225 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand 10 states. [2018-01-24 17:27:07,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:27:07,431 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2018-01-24 17:27:07,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 17:27:07,431 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-01-24 17:27:07,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:27:07,433 INFO L225 Difference]: With dead ends: 151 [2018-01-24 17:27:07,433 INFO L226 Difference]: Without dead ends: 150 [2018-01-24 17:27:07,433 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 17:27:07,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-01-24 17:27:07,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-01-24 17:27:07,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-24 17:27:07,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 159 transitions. [2018-01-24 17:27:07,445 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 159 transitions. Word has length 34 [2018-01-24 17:27:07,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:27:07,446 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 159 transitions. [2018-01-24 17:27:07,446 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 17:27:07,446 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 159 transitions. [2018-01-24 17:27:07,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 17:27:07,447 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:27:07,447 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 17:27:07,447 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 17:27:07,448 INFO L82 PathProgramCache]: Analyzing trace with hash 131109243, now seen corresponding path program 1 times [2018-01-24 17:27:07,448 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:27:07,449 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:07,449 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:27:07,449 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:07,449 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:27:07,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:27:07,467 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:27:07,509 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 17:27:07,510 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:27:07,510 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:27:07,510 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:27:07,510 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:27:07,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:27:07,511 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:27:07,511 INFO L87 Difference]: Start difference. First operand 150 states and 159 transitions. Second operand 4 states. [2018-01-24 17:27:07,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:27:07,537 INFO L93 Difference]: Finished difference Result 266 states and 282 transitions. [2018-01-24 17:27:07,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 17:27:07,538 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-01-24 17:27:07,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:27:07,539 INFO L225 Difference]: With dead ends: 266 [2018-01-24 17:27:07,539 INFO L226 Difference]: Without dead ends: 151 [2018-01-24 17:27:07,541 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 17:27:07,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-01-24 17:27:07,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-01-24 17:27:07,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-01-24 17:27:07,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2018-01-24 17:27:07,552 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 34 [2018-01-24 17:27:07,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:27:07,552 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2018-01-24 17:27:07,553 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:27:07,553 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2018-01-24 17:27:07,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-24 17:27:07,554 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:27:07,554 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 17:27:07,554 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 17:27:07,555 INFO L82 PathProgramCache]: Analyzing trace with hash -2110897305, now seen corresponding path program 1 times [2018-01-24 17:27:07,555 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:27:07,556 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:07,556 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:27:07,556 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:07,556 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:27:07,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:27:07,573 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:27:07,627 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 17:27:07,627 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:27:07,628 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:27:07,629 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-01-24 17:27:07,630 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [31], [36], [52], [60], [64], [68], [71], [73], [74], [78], [80], [81], [131], [134], [135], [136], [138], [139], [140], [158], [159], [160], [161], [162], [164], [170], [174], [182], [196], [197], [198] [2018-01-24 17:27:07,686 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:27:07,686 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:27:07,889 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:27:07,891 INFO L268 AbstractInterpreter]: Visited 35 different actions 39 times. Merged at 3 different actions 3 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 21 variables. [2018-01-24 17:27:07,905 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:27:07,905 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:27:07,905 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 17:27:07,916 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:27:07,916 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:27:07,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:27:07,962 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:27:08,030 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 17:27:08,030 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:27:08,087 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 17:27:08,120 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:27:08,120 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 17:27:08,124 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:27:08,124 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:27:08,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:27:08,175 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:27:08,182 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 17:27:08,182 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:27:08,242 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 17:27:08,243 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:27:08,244 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5] total 9 [2018-01-24 17:27:08,244 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:27:08,244 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:27:08,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:27:08,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-01-24 17:27:08,245 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand 6 states. [2018-01-24 17:27:08,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:27:08,328 INFO L93 Difference]: Finished difference Result 267 states and 283 transitions. [2018-01-24 17:27:08,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:27:08,329 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-24 17:27:08,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:27:08,331 INFO L225 Difference]: With dead ends: 267 [2018-01-24 17:27:08,331 INFO L226 Difference]: Without dead ends: 152 [2018-01-24 17:27:08,332 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 17:27:08,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-24 17:27:08,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-01-24 17:27:08,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-01-24 17:27:08,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 161 transitions. [2018-01-24 17:27:08,344 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 161 transitions. Word has length 35 [2018-01-24 17:27:08,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:27:08,345 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 161 transitions. [2018-01-24 17:27:08,345 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:27:08,345 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 161 transitions. [2018-01-24 17:27:08,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 17:27:08,347 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:27:08,347 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 17:27:08,347 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 17:27:08,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1181841647, now seen corresponding path program 1 times [2018-01-24 17:27:08,347 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:27:08,349 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:08,349 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:27:08,349 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:08,349 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:27:08,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:27:08,368 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:27:08,502 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 17:27:08,503 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:27:08,503 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 17:27:08,503 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:27:08,503 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 17:27:08,503 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 17:27:08,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:27:08,504 INFO L87 Difference]: Start difference. First operand 152 states and 161 transitions. Second operand 7 states. [2018-01-24 17:27:08,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:27:08,577 INFO L93 Difference]: Finished difference Result 220 states and 236 transitions. [2018-01-24 17:27:08,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 17:27:08,577 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-01-24 17:27:08,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:27:08,579 INFO L225 Difference]: With dead ends: 220 [2018-01-24 17:27:08,579 INFO L226 Difference]: Without dead ends: 163 [2018-01-24 17:27:08,580 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 17:27:08,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-01-24 17:27:08,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2018-01-24 17:27:08,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-01-24 17:27:08,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 169 transitions. [2018-01-24 17:27:08,591 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 169 transitions. Word has length 36 [2018-01-24 17:27:08,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:27:08,591 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 169 transitions. [2018-01-24 17:27:08,591 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 17:27:08,592 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 169 transitions. [2018-01-24 17:27:08,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 17:27:08,593 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:27:08,593 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 17:27:08,593 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 17:27:08,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1401343739, now seen corresponding path program 2 times [2018-01-24 17:27:08,593 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:27:08,595 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:08,595 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:27:08,595 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:08,595 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:27:08,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:27:08,611 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:27:08,654 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 17:27:08,654 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:27:08,654 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:27:08,655 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 17:27:08,655 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 17:27:08,655 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:27:08,655 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 17:27:08,667 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 17:27:08,667 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 17:27:08,693 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 17:27:08,696 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 17:27:08,701 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:27:08,728 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 17:27:08,730 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:27:08,751 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 17:27:08,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:27:08,769 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 17:27:08,769 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-24 17:27:11,424 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 17:27:11,424 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:27:13,811 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 17:27:13,831 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 17:27:13,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14, 13] imperfect sequences [6] total 31 [2018-01-24 17:27:13,831 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:27:13,832 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 17:27:13,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 17:27:13,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=838, Unknown=2, NotChecked=0, Total=930 [2018-01-24 17:27:13,832 INFO L87 Difference]: Start difference. First operand 159 states and 169 transitions. Second operand 15 states. [2018-01-24 17:27:14,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:27:14,828 INFO L93 Difference]: Finished difference Result 179 states and 189 transitions. [2018-01-24 17:27:14,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 17:27:14,829 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2018-01-24 17:27:14,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:27:14,830 INFO L225 Difference]: With dead ends: 179 [2018-01-24 17:27:14,830 INFO L226 Difference]: Without dead ends: 178 [2018-01-24 17:27:14,831 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=118, Invalid=1070, Unknown=2, NotChecked=0, Total=1190 [2018-01-24 17:27:14,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-01-24 17:27:14,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 158. [2018-01-24 17:27:14,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-01-24 17:27:14,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 168 transitions. [2018-01-24 17:27:14,844 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 168 transitions. Word has length 36 [2018-01-24 17:27:14,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:27:14,845 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 168 transitions. [2018-01-24 17:27:14,845 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 17:27:14,845 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 168 transitions. [2018-01-24 17:27:14,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 17:27:14,846 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:27:14,846 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 17:27:14,846 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 17:27:14,846 INFO L82 PathProgramCache]: Analyzing trace with hash 599601906, now seen corresponding path program 1 times [2018-01-24 17:27:14,846 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:27:14,848 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:14,848 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 17:27:14,848 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:14,848 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:27:14,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:27:14,861 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:27:15,011 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 17:27:15,011 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:27:15,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 17:27:15,011 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:27:15,012 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 17:27:15,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 17:27:15,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 17:27:15,012 INFO L87 Difference]: Start difference. First operand 158 states and 168 transitions. Second operand 10 states. [2018-01-24 17:27:15,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:27:15,423 INFO L93 Difference]: Finished difference Result 158 states and 168 transitions. [2018-01-24 17:27:15,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 17:27:15,423 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2018-01-24 17:27:15,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:27:15,425 INFO L225 Difference]: With dead ends: 158 [2018-01-24 17:27:15,425 INFO L226 Difference]: Without dead ends: 156 [2018-01-24 17:27:15,425 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 17:27:15,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-24 17:27:15,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-01-24 17:27:15,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-01-24 17:27:15,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 166 transitions. [2018-01-24 17:27:15,442 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 166 transitions. Word has length 41 [2018-01-24 17:27:15,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:27:15,443 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 166 transitions. [2018-01-24 17:27:15,443 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 17:27:15,443 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 166 transitions. [2018-01-24 17:27:15,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 17:27:15,445 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:27:15,445 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 17:27:15,445 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 17:27:15,445 INFO L82 PathProgramCache]: Analyzing trace with hash 599601907, now seen corresponding path program 1 times [2018-01-24 17:27:15,445 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:27:15,447 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:15,447 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:27:15,447 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:15,447 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:27:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:27:15,464 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:27:15,523 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 17:27:15,523 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:27:15,523 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:27:15,523 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-01-24 17:27:15,524 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [31], [36], [52], [60], [64], [68], [69], [72], [73], [74], [78], [80], [81], [123], [126], [131], [134], [135], [136], [138], [139], [140], [158], [159], [160], [161], [162], [164], [170], [174], [182], [183], [184], [196], [197], [198] [2018-01-24 17:27:15,527 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:27:15,527 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:27:15,654 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:27:15,654 INFO L268 AbstractInterpreter]: Visited 40 different actions 44 times. Merged at 3 different actions 3 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 21 variables. [2018-01-24 17:27:15,665 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:27:15,666 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:27:15,666 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 17:27:15,673 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:27:15,673 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:27:15,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:27:15,700 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:27:15,709 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 17:27:15,709 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:27:15,801 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 17:27:15,820 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:27:15,821 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 17:27:15,824 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:27:15,824 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:27:15,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:27:15,867 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:27:15,870 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 17:27:15,871 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:27:15,894 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 17:27:15,896 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:27:15,896 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6] total 11 [2018-01-24 17:27:15,896 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:27:15,897 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 17:27:15,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 17:27:15,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-01-24 17:27:15,897 INFO L87 Difference]: Start difference. First operand 156 states and 166 transitions. Second operand 7 states. [2018-01-24 17:27:15,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:27:15,932 INFO L93 Difference]: Finished difference Result 269 states and 286 transitions. [2018-01-24 17:27:15,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:27:15,932 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-01-24 17:27:15,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:27:15,933 INFO L225 Difference]: With dead ends: 269 [2018-01-24 17:27:15,933 INFO L226 Difference]: Without dead ends: 157 [2018-01-24 17:27:15,934 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 17:27:15,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-01-24 17:27:15,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-01-24 17:27:15,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-01-24 17:27:15,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 167 transitions. [2018-01-24 17:27:15,946 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 167 transitions. Word has length 41 [2018-01-24 17:27:15,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:27:15,946 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 167 transitions. [2018-01-24 17:27:15,946 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 17:27:15,946 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 167 transitions. [2018-01-24 17:27:15,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-24 17:27:15,947 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:27:15,947 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:27:15,948 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 17:27:15,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1379512829, now seen corresponding path program 1 times [2018-01-24 17:27:15,948 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:27:15,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:15,949 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:27:15,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:15,949 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:27:15,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:27:15,958 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:27:15,985 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 17:27:15,985 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:27:15,985 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 17:27:15,986 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:27:15,986 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 17:27:15,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 17:27:15,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 17:27:15,986 INFO L87 Difference]: Start difference. First operand 157 states and 167 transitions. Second operand 3 states. [2018-01-24 17:27:16,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:27:16,126 INFO L93 Difference]: Finished difference Result 176 states and 189 transitions. [2018-01-24 17:27:16,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 17:27:16,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-01-24 17:27:16,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:27:16,128 INFO L225 Difference]: With dead ends: 176 [2018-01-24 17:27:16,128 INFO L226 Difference]: Without dead ends: 161 [2018-01-24 17:27:16,129 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 17:27:16,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-01-24 17:27:16,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 153. [2018-01-24 17:27:16,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-01-24 17:27:16,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 162 transitions. [2018-01-24 17:27:16,147 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 162 transitions. Word has length 39 [2018-01-24 17:27:16,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:27:16,148 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 162 transitions. [2018-01-24 17:27:16,148 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 17:27:16,148 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 162 transitions. [2018-01-24 17:27:16,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-24 17:27:16,149 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:27:16,149 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 17:27:16,149 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 17:27:16,149 INFO L82 PathProgramCache]: Analyzing trace with hash 710655879, now seen corresponding path program 2 times [2018-01-24 17:27:16,149 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:27:16,150 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:16,150 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:27:16,150 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:16,151 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:27:16,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:27:16,166 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:27:16,219 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 17:27:16,219 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:27:16,219 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:27:16,219 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 17:27:16,219 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 17:27:16,219 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:27:16,219 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 17:27:16,225 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 17:27:16,225 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 17:27:16,244 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 17:27:16,248 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 17:27:16,252 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:27:16,259 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 17:27:16,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:27:16,271 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 17:27:16,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:27:16,282 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 17:27:16,282 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-24 17:27:16,782 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 17:27:16,782 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:27:17,165 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 17:27:17,185 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 17:27:17,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15, 13] imperfect sequences [7] total 33 [2018-01-24 17:27:17,195 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:27:17,195 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 17:27:17,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 17:27:17,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=951, Unknown=0, NotChecked=0, Total=1056 [2018-01-24 17:27:17,196 INFO L87 Difference]: Start difference. First operand 153 states and 162 transitions. Second operand 16 states. [2018-01-24 17:27:18,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:27:18,101 INFO L93 Difference]: Finished difference Result 157 states and 165 transitions. [2018-01-24 17:27:18,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 17:27:18,101 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2018-01-24 17:27:18,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:27:18,102 INFO L225 Difference]: With dead ends: 157 [2018-01-24 17:27:18,102 INFO L226 Difference]: Without dead ends: 155 [2018-01-24 17:27:18,103 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=136, Invalid=1196, Unknown=0, NotChecked=0, Total=1332 [2018-01-24 17:27:18,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-01-24 17:27:18,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2018-01-24 17:27:18,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-01-24 17:27:18,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2018-01-24 17:27:18,118 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 42 [2018-01-24 17:27:18,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:27:18,118 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2018-01-24 17:27:18,118 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 17:27:18,119 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2018-01-24 17:27:18,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 17:27:18,119 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:27:18,120 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:27:18,120 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 17:27:18,120 INFO L82 PathProgramCache]: Analyzing trace with hash -495427355, now seen corresponding path program 1 times [2018-01-24 17:27:18,120 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:27:18,121 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:18,121 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 17:27:18,121 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:18,122 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:27:18,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:27:18,129 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:27:18,163 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 17:27:18,164 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:27:18,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 17:27:18,164 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:27:18,165 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:27:18,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:27:18,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:27:18,165 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand 6 states. [2018-01-24 17:27:18,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:27:18,192 INFO L93 Difference]: Finished difference Result 155 states and 163 transitions. [2018-01-24 17:27:18,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:27:18,193 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-01-24 17:27:18,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:27:18,194 INFO L225 Difference]: With dead ends: 155 [2018-01-24 17:27:18,194 INFO L226 Difference]: Without dead ends: 135 [2018-01-24 17:27:18,194 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 17:27:18,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-24 17:27:18,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-01-24 17:27:18,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-24 17:27:18,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 142 transitions. [2018-01-24 17:27:18,206 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 142 transitions. Word has length 41 [2018-01-24 17:27:18,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:27:18,206 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 142 transitions. [2018-01-24 17:27:18,206 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:27:18,206 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 142 transitions. [2018-01-24 17:27:18,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-24 17:27:18,207 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:27:18,207 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 17:27:18,207 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 17:27:18,207 INFO L82 PathProgramCache]: Analyzing trace with hash -961369019, now seen corresponding path program 1 times [2018-01-24 17:27:18,207 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:27:18,208 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:18,208 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:27:18,208 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:18,208 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:27:18,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:27:18,217 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:27:18,268 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 17:27:18,269 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:27:18,269 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 17:27:18,269 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:27:18,269 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 17:27:18,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 17:27:18,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 17:27:18,269 INFO L87 Difference]: Start difference. First operand 135 states and 142 transitions. Second operand 8 states. [2018-01-24 17:27:18,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:27:18,314 INFO L93 Difference]: Finished difference Result 223 states and 234 transitions. [2018-01-24 17:27:18,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 17:27:18,314 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-01-24 17:27:18,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:27:18,315 INFO L225 Difference]: With dead ends: 223 [2018-01-24 17:27:18,315 INFO L226 Difference]: Without dead ends: 135 [2018-01-24 17:27:18,316 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 17:27:18,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-24 17:27:18,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-01-24 17:27:18,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-24 17:27:18,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 141 transitions. [2018-01-24 17:27:18,330 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 141 transitions. Word has length 45 [2018-01-24 17:27:18,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:27:18,330 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 141 transitions. [2018-01-24 17:27:18,330 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 17:27:18,330 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 141 transitions. [2018-01-24 17:27:18,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-24 17:27:18,331 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:27:18,331 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 17:27:18,331 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 17:27:18,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1966279804, now seen corresponding path program 1 times [2018-01-24 17:27:18,331 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:27:18,332 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:18,332 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:27:18,332 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:18,332 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:27:18,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:27:18,342 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:27:18,430 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 17:27:18,430 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:27:18,430 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 17:27:18,430 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:27:18,431 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 17:27:18,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 17:27:18,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 17:27:18,431 INFO L87 Difference]: Start difference. First operand 135 states and 141 transitions. Second operand 10 states. [2018-01-24 17:27:18,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:27:18,536 INFO L93 Difference]: Finished difference Result 225 states and 235 transitions. [2018-01-24 17:27:18,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 17:27:18,536 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2018-01-24 17:27:18,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:27:18,537 INFO L225 Difference]: With dead ends: 225 [2018-01-24 17:27:18,537 INFO L226 Difference]: Without dead ends: 135 [2018-01-24 17:27:18,537 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 17:27:18,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-24 17:27:18,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-01-24 17:27:18,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-24 17:27:18,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 140 transitions. [2018-01-24 17:27:18,549 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 140 transitions. Word has length 50 [2018-01-24 17:27:18,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:27:18,549 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 140 transitions. [2018-01-24 17:27:18,549 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 17:27:18,549 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 140 transitions. [2018-01-24 17:27:18,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-24 17:27:18,550 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:27:18,550 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 17:27:18,550 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 17:27:18,550 INFO L82 PathProgramCache]: Analyzing trace with hash 273504900, now seen corresponding path program 1 times [2018-01-24 17:27:18,550 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:27:18,551 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:18,551 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:27:18,551 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:18,551 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:27:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:27:18,565 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:27:18,850 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 17:27:18,851 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:27:18,851 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-24 17:27:18,851 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:27:18,851 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 17:27:18,851 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 17:27:18,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-01-24 17:27:18,851 INFO L87 Difference]: Start difference. First operand 135 states and 140 transitions. Second operand 13 states. [2018-01-24 17:27:19,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:27:19,223 INFO L93 Difference]: Finished difference Result 135 states and 140 transitions. [2018-01-24 17:27:19,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 17:27:19,223 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2018-01-24 17:27:19,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:27:19,224 INFO L225 Difference]: With dead ends: 135 [2018-01-24 17:27:19,225 INFO L226 Difference]: Without dead ends: 133 [2018-01-24 17:27:19,225 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-01-24 17:27:19,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-24 17:27:19,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-01-24 17:27:19,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-24 17:27:19,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2018-01-24 17:27:19,246 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 61 [2018-01-24 17:27:19,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:27:19,246 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2018-01-24 17:27:19,247 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 17:27:19,247 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2018-01-24 17:27:19,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-24 17:27:19,248 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:27:19,248 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 17:27:19,248 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 17:27:19,248 INFO L82 PathProgramCache]: Analyzing trace with hash 273504901, now seen corresponding path program 1 times [2018-01-24 17:27:19,248 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:27:19,249 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:19,250 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:27:19,250 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:19,250 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:27:19,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:27:19,269 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:27:19,347 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 17:27:19,348 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:27:19,348 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:27:19,348 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 62 with the following transitions: [2018-01-24 17:27:19,348 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [12], [13], [17], [31], [36], [38], [52], [54], [60], [64], [67], [68], [69], [72], [73], [74], [78], [80], [81], [92], [95], [123], [124], [127], [130], [131], [134], [135], [136], [138], [139], [140], [145], [148], [158], [159], [160], [161], [162], [163], [164], [166], [170], [171], [174], [175], [176], [182], [183], [184], [185], [194], [196], [197], [198] [2018-01-24 17:27:19,351 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:27:19,351 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:27:19,504 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:27:19,505 INFO L268 AbstractInterpreter]: Visited 59 different actions 63 times. Merged at 3 different actions 3 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 22 variables. [2018-01-24 17:27:19,506 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:27:19,506 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:27:19,506 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 17:27:19,520 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:27:19,520 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:27:19,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:27:19,565 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:27:19,575 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 17:27:19,575 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:27:19,700 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 17:27:19,734 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:27:19,734 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 17:27:19,739 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:27:19,739 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:27:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:27:19,801 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:27:19,805 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 17:27:19,805 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:27:19,860 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 17:27:19,862 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:27:19,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 13 [2018-01-24 17:27:19,862 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:27:19,862 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 17:27:19,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 17:27:19,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-01-24 17:27:19,863 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand 8 states. [2018-01-24 17:27:19,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:27:19,891 INFO L93 Difference]: Finished difference Result 242 states and 252 transitions. [2018-01-24 17:27:19,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 17:27:19,892 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2018-01-24 17:27:19,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:27:19,893 INFO L225 Difference]: With dead ends: 242 [2018-01-24 17:27:19,893 INFO L226 Difference]: Without dead ends: 134 [2018-01-24 17:27:19,894 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 236 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=77, Invalid=105, Unknown=0, NotChecked=0, Total=182 [2018-01-24 17:27:19,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-01-24 17:27:19,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-01-24 17:27:19,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-01-24 17:27:19,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 139 transitions. [2018-01-24 17:27:19,906 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 139 transitions. Word has length 61 [2018-01-24 17:27:19,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:27:19,906 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 139 transitions. [2018-01-24 17:27:19,906 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 17:27:19,906 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 139 transitions. [2018-01-24 17:27:19,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-24 17:27:19,907 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:27:19,907 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 17:27:19,907 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 17:27:19,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1969498855, now seen corresponding path program 2 times [2018-01-24 17:27:19,907 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:27:19,908 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:19,908 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:27:19,908 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:19,908 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:27:19,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:27:19,926 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:27:19,991 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 17:27:19,992 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:27:19,992 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:27:19,992 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 17:27:19,992 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 17:27:19,992 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:27:19,992 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 17:27:19,999 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 17:27:19,999 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 17:27:20,024 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 17:27:20,028 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 17:27:20,031 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:27:20,038 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 17:27:20,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:27:20,059 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 17:27:20,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:27:20,078 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 17:27:20,079 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-24 17:27:22,286 WARN L143 SmtUtils]: Spent 2018ms on a formula simplification that was a NOOP. DAG size: 27 [2018-01-24 17:27:22,769 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 17:27:22,769 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:27:25,393 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 17:27:25,412 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 17:27:25,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18, 16] imperfect sequences [8] total 40 [2018-01-24 17:27:25,413 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:27:25,413 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 17:27:25,413 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 17:27:25,414 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1427, Unknown=1, NotChecked=0, Total=1560 [2018-01-24 17:27:25,414 INFO L87 Difference]: Start difference. First operand 134 states and 139 transitions. Second operand 19 states. [2018-01-24 17:27:26,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:27:26,337 INFO L93 Difference]: Finished difference Result 134 states and 139 transitions. [2018-01-24 17:27:26,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 17:27:26,338 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 62 [2018-01-24 17:27:26,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:27:26,339 INFO L225 Difference]: With dead ends: 134 [2018-01-24 17:27:26,339 INFO L226 Difference]: Without dead ends: 132 [2018-01-24 17:27:26,340 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=173, Invalid=1806, Unknown=1, NotChecked=0, Total=1980 [2018-01-24 17:27:26,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-24 17:27:26,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-01-24 17:27:26,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-24 17:27:26,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 137 transitions. [2018-01-24 17:27:26,360 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 137 transitions. Word has length 62 [2018-01-24 17:27:26,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:27:26,361 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 137 transitions. [2018-01-24 17:27:26,361 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-24 17:27:26,361 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 137 transitions. [2018-01-24 17:27:26,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-01-24 17:27:26,362 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:27:26,362 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 17:27:26,362 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 17:27:26,363 INFO L82 PathProgramCache]: Analyzing trace with hash -525790244, now seen corresponding path program 1 times [2018-01-24 17:27:26,363 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:27:26,364 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:26,364 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 17:27:26,364 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:26,364 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:27:26,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:27:26,382 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:27:26,527 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 17:27:26,528 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:27:26,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-24 17:27:26,528 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:27:26,528 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 17:27:26,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 17:27:26,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-01-24 17:27:26,529 INFO L87 Difference]: Start difference. First operand 132 states and 137 transitions. Second operand 11 states. [2018-01-24 17:27:26,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:27:26,663 INFO L93 Difference]: Finished difference Result 194 states and 202 transitions. [2018-01-24 17:27:26,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 17:27:26,664 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2018-01-24 17:27:26,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:27:26,665 INFO L225 Difference]: With dead ends: 194 [2018-01-24 17:27:26,665 INFO L226 Difference]: Without dead ends: 132 [2018-01-24 17:27:26,665 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-01-24 17:27:26,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-24 17:27:26,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-01-24 17:27:26,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-24 17:27:26,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 136 transitions. [2018-01-24 17:27:26,678 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 136 transitions. Word has length 71 [2018-01-24 17:27:26,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:27:26,678 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 136 transitions. [2018-01-24 17:27:26,678 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 17:27:26,678 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 136 transitions. [2018-01-24 17:27:26,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-24 17:27:26,679 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:27:26,679 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 17:27:26,679 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 17:27:26,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1264904852, now seen corresponding path program 1 times [2018-01-24 17:27:26,679 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:27:26,680 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:26,680 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:27:26,680 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:26,680 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:27:26,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:27:26,696 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:27:27,269 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 17:27:27,269 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:27:27,270 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-01-24 17:27:27,270 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:27:27,270 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 17:27:27,270 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 17:27:27,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-01-24 17:27:27,271 INFO L87 Difference]: Start difference. First operand 132 states and 136 transitions. Second operand 18 states. [2018-01-24 17:27:27,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:27:27,694 INFO L93 Difference]: Finished difference Result 162 states and 174 transitions. [2018-01-24 17:27:27,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 17:27:27,694 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 84 [2018-01-24 17:27:27,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:27:27,695 INFO L225 Difference]: With dead ends: 162 [2018-01-24 17:27:27,695 INFO L226 Difference]: Without dead ends: 160 [2018-01-24 17:27:27,696 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2018-01-24 17:27:27,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-01-24 17:27:27,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 155. [2018-01-24 17:27:27,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-01-24 17:27:27,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 167 transitions. [2018-01-24 17:27:27,721 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 167 transitions. Word has length 84 [2018-01-24 17:27:27,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:27:27,721 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 167 transitions. [2018-01-24 17:27:27,722 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-24 17:27:27,722 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 167 transitions. [2018-01-24 17:27:27,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-24 17:27:27,723 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:27:27,723 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 17:27:27,723 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 17:27:27,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1264904851, now seen corresponding path program 1 times [2018-01-24 17:27:27,723 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:27:27,724 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:27,724 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:27:27,724 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:27,724 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:27:27,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:27:27,747 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:27:27,833 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 17:27:27,833 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:27:27,833 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:27:27,833 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 85 with the following transitions: [2018-01-24 17:27:27,833 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [12], [13], [17], [19], [20], [21], [24], [31], [36], [38], [39], [42], [52], [54], [56], [60], [64], [67], [68], [69], [72], [73], [74], [78], [80], [81], [82], [92], [93], [96], [97], [100], [101], [123], [124], [127], [130], [131], [134], [135], [136], [138], [139], [140], [141], [145], [148], [153], [154], [158], [159], [160], [161], [162], [163], [164], [166], [167], [168], [170], [171], [174], [175], [176], [177], [178], [182], [183], [184], [185], [186], [192], [194], [195], [196], [197], [198] [2018-01-24 17:27:27,836 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:27:27,837 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:27:27,980 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:27:27,980 INFO L268 AbstractInterpreter]: Visited 81 different actions 85 times. Merged at 3 different actions 3 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 26 variables. [2018-01-24 17:27:27,985 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:27:27,985 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:27:27,985 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:27:28,000 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:27:28,000 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:27:28,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:27:28,047 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:27:28,070 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 17:27:28,070 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:27:28,293 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 17:27:28,314 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:27:28,314 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 17:27:28,318 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:27:28,318 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:27:28,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:27:28,409 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:27:28,418 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 17:27:28,418 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:27:28,487 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 17:27:28,489 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:27:28,490 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8] total 15 [2018-01-24 17:27:28,490 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:27:28,490 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 17:27:28,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 17:27:28,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-01-24 17:27:28,490 INFO L87 Difference]: Start difference. First operand 155 states and 167 transitions. Second operand 9 states. [2018-01-24 17:27:28,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:27:28,528 INFO L93 Difference]: Finished difference Result 285 states and 309 transitions. [2018-01-24 17:27:28,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 17:27:28,528 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2018-01-24 17:27:28,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:27:28,529 INFO L225 Difference]: With dead ends: 285 [2018-01-24 17:27:28,529 INFO L226 Difference]: Without dead ends: 156 [2018-01-24 17:27:28,530 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 327 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=137, Unknown=0, NotChecked=0, Total=240 [2018-01-24 17:27:28,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-24 17:27:28,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-01-24 17:27:28,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-01-24 17:27:28,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 168 transitions. [2018-01-24 17:27:28,546 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 168 transitions. Word has length 84 [2018-01-24 17:27:28,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:27:28,547 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 168 transitions. [2018-01-24 17:27:28,547 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 17:27:28,547 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 168 transitions. [2018-01-24 17:27:28,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-01-24 17:27:28,548 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:27:28,548 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 17:27:28,548 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 17:27:28,548 INFO L82 PathProgramCache]: Analyzing trace with hash -242617255, now seen corresponding path program 2 times [2018-01-24 17:27:28,548 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:27:28,549 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:28,549 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:27:28,549 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:28,549 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:27:28,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:27:28,575 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:27:28,667 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 17:27:28,667 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:27:28,667 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:27:28,667 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 17:27:28,667 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 17:27:28,668 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:27:28,668 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 17:27:28,674 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 17:27:28,674 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 17:27:28,713 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 17:27:28,719 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 17:27:28,723 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:27:28,727 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 17:27:28,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:27:28,753 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 17:27:28,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:27:28,766 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 17:27:28,766 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-24 17:27:29,546 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 17:27:29,547 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:27:30,271 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 17:27:30,292 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 17:27:30,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20, 18] imperfect sequences [9] total 45 [2018-01-24 17:27:30,292 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:27:30,293 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 17:27:30,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 17:27:30,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1827, Unknown=0, NotChecked=0, Total=1980 [2018-01-24 17:27:30,294 INFO L87 Difference]: Start difference. First operand 156 states and 168 transitions. Second operand 21 states. [2018-01-24 17:27:31,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:27:31,601 INFO L93 Difference]: Finished difference Result 156 states and 168 transitions. [2018-01-24 17:27:31,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-24 17:27:31,601 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 85 [2018-01-24 17:27:31,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:27:31,602 INFO L225 Difference]: With dead ends: 156 [2018-01-24 17:27:31,602 INFO L226 Difference]: Without dead ends: 154 [2018-01-24 17:27:31,603 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 131 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=202, Invalid=2348, Unknown=0, NotChecked=0, Total=2550 [2018-01-24 17:27:31,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-24 17:27:31,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-01-24 17:27:31,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-01-24 17:27:31,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 164 transitions. [2018-01-24 17:27:31,623 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 164 transitions. Word has length 85 [2018-01-24 17:27:31,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:27:31,624 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 164 transitions. [2018-01-24 17:27:31,624 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-24 17:27:31,624 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 164 transitions. [2018-01-24 17:27:31,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-01-24 17:27:31,625 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:27:31,625 INFO L322 BasicCegarLoop]: trace histogram [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:27:31,625 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 17:27:31,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1137159674, now seen corresponding path program 1 times [2018-01-24 17:27:31,626 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:27:31,627 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:31,627 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 17:27:31,627 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:31,627 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:27:31,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:27:31,646 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:27:31,777 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-24 17:27:31,777 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:27:31,778 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:27:31,778 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 89 with the following transitions: [2018-01-24 17:27:31,778 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [12], [13], [16], [17], [19], [20], [21], [28], [30], [31], [36], [38], [52], [54], [56], [59], [60], [64], [67], [68], [69], [72], [73], [74], [78], [80], [81], [92], [93], [96], [97], [100], [101], [123], [124], [127], [130], [131], [134], [135], [136], [138], [139], [140], [145], [148], [153], [154], [158], [159], [160], [161], [162], [163], [164], [165], [166], [167], [170], [171], [174], [175], [176], [177], [178], [179], [180], [181], [182], [183], [184], [185], [194], [195], [196], [197], [198] [2018-01-24 17:27:31,781 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:27:31,781 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:27:31,898 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-24 17:27:31,898 INFO L268 AbstractInterpreter]: Visited 74 different actions 78 times. Merged at 3 different actions 3 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 23 variables. [2018-01-24 17:27:31,904 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-24 17:27:32,078 INFO L232 lantSequenceWeakener]: Weakened 52 states. On average, predicates are now at 74.24% of their original sizes. [2018-01-24 17:27:32,079 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-24 17:27:32,750 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-24 17:27:32,751 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 17:27:32,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [42] imperfect sequences [11] total 51 [2018-01-24 17:27:32,751 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:27:32,752 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-01-24 17:27:32,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-01-24 17:27:32,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1617, Unknown=0, NotChecked=0, Total=1722 [2018-01-24 17:27:32,752 INFO L87 Difference]: Start difference. First operand 154 states and 164 transitions. Second operand 42 states. [2018-01-24 17:27:43,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:27:43,860 INFO L93 Difference]: Finished difference Result 228 states and 245 transitions. [2018-01-24 17:27:43,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-01-24 17:27:43,860 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 88 [2018-01-24 17:27:43,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:27:43,861 INFO L225 Difference]: With dead ends: 228 [2018-01-24 17:27:43,861 INFO L226 Difference]: Without dead ends: 168 [2018-01-24 17:27:43,862 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 124 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1159 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=341, Invalid=5359, Unknown=0, NotChecked=0, Total=5700 [2018-01-24 17:27:43,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-01-24 17:27:43,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 166. [2018-01-24 17:27:43,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-01-24 17:27:43,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 177 transitions. [2018-01-24 17:27:43,885 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 177 transitions. Word has length 88 [2018-01-24 17:27:43,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:27:43,885 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 177 transitions. [2018-01-24 17:27:43,885 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-01-24 17:27:43,885 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 177 transitions. [2018-01-24 17:27:43,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-01-24 17:27:43,886 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:27:43,886 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 17:27:43,886 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 17:27:43,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1746979988, now seen corresponding path program 1 times [2018-01-24 17:27:43,886 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:27:43,887 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:43,887 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:27:43,887 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:43,888 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:27:43,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:27:43,909 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:27:44,312 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 17:27:44,313 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:27:44,313 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-01-24 17:27:44,313 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:27:44,313 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 17:27:44,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 17:27:44,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-01-24 17:27:44,314 INFO L87 Difference]: Start difference. First operand 166 states and 177 transitions. Second operand 21 states. [2018-01-24 17:27:44,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:27:44,780 INFO L93 Difference]: Finished difference Result 178 states and 193 transitions. [2018-01-24 17:27:44,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-24 17:27:44,815 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 99 [2018-01-24 17:27:44,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:27:44,816 INFO L225 Difference]: With dead ends: 178 [2018-01-24 17:27:44,816 INFO L226 Difference]: Without dead ends: 176 [2018-01-24 17:27:44,817 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2018-01-24 17:27:44,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-01-24 17:27:44,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 172. [2018-01-24 17:27:44,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-01-24 17:27:44,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 187 transitions. [2018-01-24 17:27:44,839 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 187 transitions. Word has length 99 [2018-01-24 17:27:44,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:27:44,840 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 187 transitions. [2018-01-24 17:27:44,840 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-24 17:27:44,840 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 187 transitions. [2018-01-24 17:27:44,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-01-24 17:27:44,841 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:27:44,841 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 17:27:44,841 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 17:27:44,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1746979987, now seen corresponding path program 1 times [2018-01-24 17:27:44,841 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:27:44,842 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:44,842 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:27:44,842 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:27:44,842 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:27:44,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:27:44,857 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:27:44,993 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 17:27:44,993 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:27:44,993 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:27:44,993 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 100 with the following transitions: [2018-01-24 17:27:44,994 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], [60], [64], [67], [68], [69], [72], [73], [74], [78], [80], [81], [82], [84], [87], [92], [93], [96], [97], [100], [101], [102], [105], [108], [123], [124], [127], [130], [131], [134], [135], [136], [138], [139], [140], [141], [145], [148], [153], [154], [158], [159], [160], [161], [162], [163], [164], [166], [167], [168], [170], [171], [172], [174], [175], [176], [177], [178], [182], [183], [184], [185], [186], [187], [188], [190], [192], [194], [195], [196], [197], [198] [2018-01-24 17:27:44,996 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:27:44,996 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:27:45,093 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:27:45,093 INFO L268 AbstractInterpreter]: Visited 95 different actions 99 times. Merged at 3 different actions 3 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 27 variables. [2018-01-24 17:27:45,097 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:27:45,097 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:27:45,097 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 17:27:45,113 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:27:45,113 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:27:45,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:27:45,171 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:27:45,184 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 17:27:45,185 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:27:45,389 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. Received shutdown request... [2018-01-24 17:27:45,411 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:27:45,411 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 17:27:45,418 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:27:45,418 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:27:45,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:27:45,553 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:27:45,554 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 17:27:45,555 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 17:27:45,558 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 17:27:45,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 05:27:45 BoogieIcfgContainer [2018-01-24 17:27:45,559 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 17:27:45,560 INFO L168 Benchmark]: Toolchain (without parser) took 40917.36 ms. Allocated memory was 298.8 MB in the beginning and 802.7 MB in the end (delta: 503.8 MB). Free memory was 257.9 MB in the beginning and 508.1 MB in the end (delta: -250.2 MB). Peak memory consumption was 253.6 MB. Max. memory is 5.3 GB. [2018-01-24 17:27:45,561 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 298.8 MB. Free memory is still 264.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 17:27:45,561 INFO L168 Benchmark]: CACSL2BoogieTranslator took 234.75 ms. Allocated memory is still 298.8 MB. Free memory was 257.9 MB in the beginning and 243.7 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 5.3 GB. [2018-01-24 17:27:45,561 INFO L168 Benchmark]: Boogie Preprocessor took 39.11 ms. Allocated memory is still 298.8 MB. Free memory was 243.7 MB in the beginning and 241.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 17:27:45,561 INFO L168 Benchmark]: RCFGBuilder took 488.94 ms. Allocated memory is still 298.8 MB. Free memory was 241.8 MB in the beginning and 207.0 MB in the end (delta: 34.8 MB). Peak memory consumption was 34.8 MB. Max. memory is 5.3 GB. [2018-01-24 17:27:45,562 INFO L168 Benchmark]: TraceAbstraction took 40145.29 ms. Allocated memory was 298.8 MB in the beginning and 802.7 MB in the end (delta: 503.8 MB). Free memory was 207.0 MB in the beginning and 508.1 MB in the end (delta: -301.1 MB). Peak memory consumption was 202.7 MB. Max. memory is 5.3 GB. [2018-01-24 17:27:45,564 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 298.8 MB. Free memory is still 264.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 234.75 ms. Allocated memory is still 298.8 MB. Free memory was 257.9 MB in the beginning and 243.7 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.11 ms. Allocated memory is still 298.8 MB. Free memory was 243.7 MB in the beginning and 241.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 488.94 ms. Allocated memory is still 298.8 MB. Free memory was 241.8 MB in the beginning and 207.0 MB in the end (delta: 34.8 MB). Peak memory consumption was 34.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 40145.29 ms. Allocated memory was 298.8 MB in the beginning and 802.7 MB in the end (delta: 503.8 MB). Free memory was 207.0 MB in the beginning and 508.1 MB in the end (delta: -301.1 MB). Peak memory consumption was 202.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 34 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 237 LocStat_NO_SUPPORTING_DISEQUALITIES : 25 LocStat_NO_DISJUNCTIONS : -68 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 53 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 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.684570 RENAME_VARIABLES(MILLISECONDS) : 0.232914 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.294166 PROJECTAWAY(MILLISECONDS) : 0.076213 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001631 DISJOIN(MILLISECONDS) : 2.230245 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.267650 ADD_EQUALITY(MILLISECONDS) : 0.023410 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.014405 #CONJOIN_DISJUNCTIVE : 74 #RENAME_VARIABLES : 112 #UNFREEZE : 0 #CONJOIN : 154 #PROJECTAWAY : 118 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 1 #RENAME_VARIABLES_DISJUNCTIVE : 108 #ADD_EQUALITY : 111 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 39 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 272 LocStat_NO_SUPPORTING_DISEQUALITIES : 30 LocStat_NO_DISJUNCTIONS : -78 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 60 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 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.494416 RENAME_VARIABLES(MILLISECONDS) : 0.137938 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.207218 PROJECTAWAY(MILLISECONDS) : 0.070497 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001172 DISJOIN(MILLISECONDS) : 0.486514 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.172921 ADD_EQUALITY(MILLISECONDS) : 0.024316 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.013775 #CONJOIN_DISJUNCTIVE : 84 #RENAME_VARIABLES : 127 #UNFREEZE : 0 #CONJOIN : 179 #PROJECTAWAY : 135 #ADD_WEAK_EQUALITY : 15 #DISJOIN : 1 #RENAME_VARIABLES_DISJUNCTIVE : 123 #ADD_EQUALITY : 128 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 58 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 402 LocStat_NO_SUPPORTING_DISEQUALITIES : 49 LocStat_NO_DISJUNCTIONS : -116 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 85 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 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.461855 RENAME_VARIABLES(MILLISECONDS) : 0.131038 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.187712 PROJECTAWAY(MILLISECONDS) : 0.039196 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001184 DISJOIN(MILLISECONDS) : 0.359803 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.157147 ADD_EQUALITY(MILLISECONDS) : 0.023112 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.014109 #CONJOIN_DISJUNCTIVE : 120 #RENAME_VARIABLES : 184 #UNFREEZE : 0 #CONJOIN : 260 #PROJECTAWAY : 199 #ADD_WEAK_EQUALITY : 27 #DISJOIN : 1 #RENAME_VARIABLES_DISJUNCTIVE : 179 #ADD_EQUALITY : 180 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 10 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 80 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 591 LocStat_NO_SUPPORTING_DISEQUALITIES : 71 LocStat_NO_DISJUNCTIONS : -160 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 115 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 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.286336 RENAME_VARIABLES(MILLISECONDS) : 0.102321 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.099118 PROJECTAWAY(MILLISECONDS) : 0.025444 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001051 DISJOIN(MILLISECONDS) : 0.427164 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.167823 ADD_EQUALITY(MILLISECONDS) : 0.019158 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.007366 #CONJOIN_DISJUNCTIVE : 163 #RENAME_VARIABLES : 246 #UNFREEZE : 0 #CONJOIN : 359 #PROJECTAWAY : 268 #ADD_WEAK_EQUALITY : 33 #DISJOIN : 1 #RENAME_VARIABLES_DISJUNCTIVE : 240 #ADD_EQUALITY : 254 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 12 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 72 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 510 LocStat_NO_SUPPORTING_DISEQUALITIES : 63 LocStat_NO_DISJUNCTIONS : -144 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 102 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 187 TransStat_NO_SUPPORTING_DISEQUALITIES : 11 TransStat_NO_DISJUNCTIONS : 106 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.185984 RENAME_VARIABLES(MILLISECONDS) : 0.080683 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.165027 PROJECTAWAY(MILLISECONDS) : 0.021510 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.000972 DISJOIN(MILLISECONDS) : 0.000000 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.106840 ADD_EQUALITY(MILLISECONDS) : 0.015716 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.006269 #CONJOIN_DISJUNCTIVE : 145 #RENAME_VARIABLES : 224 #UNFREEZE : 0 #CONJOIN : 311 #PROJECTAWAY : 241 #ADD_WEAK_EQUALITY : 33 #DISJOIN : 0 #RENAME_VARIABLES_DISJUNCTIVE : 220 #ADD_EQUALITY : 208 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 10 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 94 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 720 LocStat_NO_SUPPORTING_DISEQUALITIES : 85 LocStat_NO_DISJUNCTIONS : -188 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 135 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 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.139522 RENAME_VARIABLES(MILLISECONDS) : 0.046153 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.052847 PROJECTAWAY(MILLISECONDS) : 0.013700 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.000960 DISJOIN(MILLISECONDS) : 0.379841 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.056692 ADD_EQUALITY(MILLISECONDS) : 0.009021 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.004228 #CONJOIN_DISJUNCTIVE : 186 #RENAME_VARIABLES : 283 #UNFREEZE : 0 #CONJOIN : 407 #PROJECTAWAY : 309 #ADD_WEAK_EQUALITY : 39 #DISJOIN : 1 #RENAME_VARIABLES_DISJUNCTIVE : 277 #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 100 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1294). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1411). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1411). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1265). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1265). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1267). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1267). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1256). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1256). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1258). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1258). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1339). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1339). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1443]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1443). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1099). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1100). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1100). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1099). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 143 locations, 23 error locations. TIMEOUT Result, 40.0s OverallTime, 26 OverallIterations, 5 TraceHistogramMax, 18.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3198 SDtfs, 1275 SDslu, 19285 SDs, 0 SdLazy, 8995 SolverSat, 306 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.0s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 1714 GetRequests, 1263 SyntacticMatches, 19 SemanticMatches, 432 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3081 ImplicationChecksByTransitivity, 17.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=172occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.9s AbstIntTime, 6 AbstIntIterations, 1 AbstIntStrong, 0.923116248750123 AbsIntWeakeningRatio, 0.9195402298850575 AbsIntAvgWeakeningVarsNumRemoved, 4.540229885057471 AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 25 MinimizatonAttempts, 61 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 17.2s InterpolantComputationTime, 1918 NumberOfCodeBlocks, 1904 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 2536 ConstructedInterpolants, 173 QuantifiedInterpolants, 596941 SizeOfPredicates, 64 NumberOfNonLiveVariables, 3114 ConjunctsInSsa, 257 ConjunctsInUnsatCore, 49 InterpolantComputations, 24 PerfectInterpolantSequences, 148/285 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_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_17-27-45-577.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_17-27-45-577.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_17-27-45-577.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_17-27-45-577.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_17-27-45-577.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-24_17-27-45-577.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-24_17-27-45-577.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-24_17-27-45-577.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-24_17-27-45-577.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-4-2018-01-24_17-27-45-577.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-4-2018-01-24_17-27-45-577.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-5-2018-01-24_17-27-45-577.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-5-2018-01-24_17-27-45-577.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_17-27-45-577.csv Completed graceful shutdown