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_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_5_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:18:03,344 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:18:03,346 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:18:03,359 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:18:03,360 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:18:03,362 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:18:03,363 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:18:03,365 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:18:03,366 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:18:03,367 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:18:03,367 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:18:03,368 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:18:03,369 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:18:03,370 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:18:03,371 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:18:03,374 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:18:03,376 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:18:03,378 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:18:03,380 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:18:03,381 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:18:03,383 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:18:03,384 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:18:03,384 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:18:03,385 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:18:03,386 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:18:03,388 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:18:03,388 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:18:03,389 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:18:03,389 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:18:03,390 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:18:03,390 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:18:03,391 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf [2018-01-24 12:18:03,401 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:18:03,401 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:18:03,402 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:18:03,403 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:18:03,403 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:18:03,403 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:18:03,403 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:18:03,404 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:18:03,404 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:18:03,404 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:18:03,405 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:18:03,405 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:18:03,405 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:18:03,405 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:18:03,405 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:18:03,406 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:18:03,406 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:18:03,406 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:18:03,406 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:18:03,406 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:18:03,407 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:18:03,407 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:18:03,407 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:18:03,407 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:18:03,407 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:18:03,408 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:18:03,408 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:18:03,408 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:18:03,408 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 12:18:03,409 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:18:03,409 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:18:03,409 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:18:03,410 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:18:03,410 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:18:03,445 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:18:03,458 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:18:03,462 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:18:03,464 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:18:03,464 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:18:03,465 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_5_false-valid-deref.i [2018-01-24 12:18:03,669 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:18:03,675 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:18:03,676 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:18:03,676 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:18:03,684 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:18:03,685 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:18:03" (1/1) ... [2018-01-24 12:18:03,689 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c336041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:18:03, skipping insertion in model container [2018-01-24 12:18:03,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:18:03" (1/1) ... [2018-01-24 12:18:03,708 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:18:03,761 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:18:03,883 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:18:03,904 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:18:03,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:18:03 WrapperNode [2018-01-24 12:18:03,916 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:18:03,917 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:18:03,917 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:18:03,918 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:18:03,934 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:18:03" (1/1) ... [2018-01-24 12:18:03,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:18:03" (1/1) ... [2018-01-24 12:18:03,947 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:18:03" (1/1) ... [2018-01-24 12:18:03,947 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:18:03" (1/1) ... [2018-01-24 12:18:03,955 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:18:03" (1/1) ... [2018-01-24 12:18:03,958 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:18:03" (1/1) ... [2018-01-24 12:18:03,960 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:18:03" (1/1) ... [2018-01-24 12:18:03,962 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:18:03,963 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:18:03,963 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:18:03,963 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:18:03,964 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:18:03" (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 12:18:04,009 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:18:04,009 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:18:04,009 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-01-24 12:18:04,009 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 12:18:04,010 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-01-24 12:18:04,010 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-01-24 12:18:04,010 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-01-24 12:18:04,010 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-01-24 12:18:04,010 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-01-24 12:18:04,010 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-01-24 12:18:04,010 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-01-24 12:18:04,010 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-01-24 12:18:04,010 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-01-24 12:18:04,010 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-01-24 12:18:04,011 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-01-24 12:18:04,011 INFO L136 BoogieDeclarations]: Found implementation of procedure f_22_put [2018-01-24 12:18:04,011 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 12:18:04,011 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:18:04,011 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 12:18:04,011 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 12:18:04,011 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 12:18:04,012 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 12:18:04,012 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:18:04,012 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:18:04,012 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:18:04,012 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-24 12:18:04,012 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-24 12:18:04,013 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 12:18:04,013 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 12:18:04,013 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:18:04,013 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-24 12:18:04,013 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 12:18:04,013 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-01-24 12:18:04,014 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-01-24 12:18:04,014 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-01-24 12:18:04,014 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-01-24 12:18:04,014 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-01-24 12:18:04,014 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-01-24 12:18:04,014 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-01-24 12:18:04,014 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-01-24 12:18:04,014 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-01-24 12:18:04,015 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-01-24 12:18:04,015 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-01-24 12:18:04,015 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-01-24 12:18:04,015 INFO L128 BoogieDeclarations]: Found specification of procedure f_22_put [2018-01-24 12:18:04,015 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 12:18:04,015 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:18:04,015 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:18:04,016 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:18:04,257 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-24 12:18:04,405 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:18:04,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:18:04 BoogieIcfgContainer [2018-01-24 12:18:04,406 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:18:04,407 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:18:04,407 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:18:04,408 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:18:04,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:18:03" (1/3) ... [2018-01-24 12:18:04,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1008e982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:18:04, skipping insertion in model container [2018-01-24 12:18:04,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:18:03" (2/3) ... [2018-01-24 12:18:04,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1008e982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:18:04, skipping insertion in model container [2018-01-24 12:18:04,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:18:04" (3/3) ... [2018-01-24 12:18:04,411 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test22_5_false-valid-deref.i [2018-01-24 12:18:04,418 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:18:04,424 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-01-24 12:18:04,476 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:18:04,476 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:18:04,476 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:18:04,476 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:18:04,476 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:18:04,476 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:18:04,477 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:18:04,477 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:18:04,478 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:18:04,501 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states. [2018-01-24 12:18:04,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 12:18:04,508 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:18:04,509 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 12:18:04,509 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 12:18:04,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1211515492, now seen corresponding path program 1 times [2018-01-24 12:18:04,517 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:18:04,518 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:18:04,584 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:04,585 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:18:04,585 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:04,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:18:04,651 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:18:04,788 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 12:18:04,790 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:18:04,790 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:18:04,792 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:18:04,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:18:04,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:18:04,884 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 5 states. [2018-01-24 12:18:04,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:18:04,960 INFO L93 Difference]: Finished difference Result 234 states and 249 transitions. [2018-01-24 12:18:04,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:18:04,963 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-24 12:18:04,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:18:04,978 INFO L225 Difference]: With dead ends: 234 [2018-01-24 12:18:04,978 INFO L226 Difference]: Without dead ends: 126 [2018-01-24 12:18:04,982 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 12:18:04,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-24 12:18:05,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2018-01-24 12:18:05,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-24 12:18:05,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2018-01-24 12:18:05,033 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 17 [2018-01-24 12:18:05,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:18:05,034 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2018-01-24 12:18:05,034 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:18:05,034 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2018-01-24 12:18:05,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 12:18:05,035 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:18:05,035 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 12:18:05,035 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 12:18:05,036 INFO L82 PathProgramCache]: Analyzing trace with hash 774524518, now seen corresponding path program 1 times [2018-01-24 12:18:05,036 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:18:05,036 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:18:05,038 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:05,038 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:18:05,039 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:05,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:18:05,061 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:18:05,158 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 12:18:05,158 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:18:05,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:18:05,160 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:18:05,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:18:05,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:18:05,161 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand 6 states. [2018-01-24 12:18:05,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:18:05,354 INFO L93 Difference]: Finished difference Result 126 states and 134 transitions. [2018-01-24 12:18:05,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:18:05,354 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 12:18:05,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:18:05,356 INFO L225 Difference]: With dead ends: 126 [2018-01-24 12:18:05,356 INFO L226 Difference]: Without dead ends: 125 [2018-01-24 12:18:05,357 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 12:18:05,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-24 12:18:05,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-01-24 12:18:05,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-24 12:18:05,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2018-01-24 12:18:05,367 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 19 [2018-01-24 12:18:05,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:18:05,367 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2018-01-24 12:18:05,367 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:18:05,368 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2018-01-24 12:18:05,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 12:18:05,368 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:18:05,368 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 12:18:05,368 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 12:18:05,369 INFO L82 PathProgramCache]: Analyzing trace with hash 774524519, now seen corresponding path program 1 times [2018-01-24 12:18:05,369 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:18:05,369 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:18:05,370 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:05,371 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:18:05,371 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:05,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:18:05,394 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:18:05,618 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 12:18:05,618 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:18:05,618 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:18:05,618 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:18:05,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:18:05,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:18:05,619 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand 7 states. [2018-01-24 12:18:05,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:18:05,835 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2018-01-24 12:18:05,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:18:05,837 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-01-24 12:18:05,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:18:05,839 INFO L225 Difference]: With dead ends: 125 [2018-01-24 12:18:05,839 INFO L226 Difference]: Without dead ends: 124 [2018-01-24 12:18:05,840 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:18:05,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-24 12:18:05,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-01-24 12:18:05,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-24 12:18:05,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2018-01-24 12:18:05,855 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 19 [2018-01-24 12:18:05,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:18:05,855 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2018-01-24 12:18:05,855 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:18:05,856 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2018-01-24 12:18:05,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 12:18:05,857 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:18:05,857 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:18:05,858 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 12:18:05,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1886266821, now seen corresponding path program 1 times [2018-01-24 12:18:05,858 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:18:05,858 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:18:05,860 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:05,860 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:18:05,860 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:18:05,887 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:18:06,027 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 12:18:06,027 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:18:06,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 12:18:06,028 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:18:06,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:18:06,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:18:06,029 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand 9 states. [2018-01-24 12:18:06,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:18:06,192 INFO L93 Difference]: Finished difference Result 198 states and 213 transitions. [2018-01-24 12:18:06,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:18:06,193 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-01-24 12:18:06,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:18:06,202 INFO L225 Difference]: With dead ends: 198 [2018-01-24 12:18:06,202 INFO L226 Difference]: Without dead ends: 139 [2018-01-24 12:18:06,203 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:18:06,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-01-24 12:18:06,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2018-01-24 12:18:06,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-24 12:18:06,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 144 transitions. [2018-01-24 12:18:06,218 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 144 transitions. Word has length 31 [2018-01-24 12:18:06,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:18:06,220 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 144 transitions. [2018-01-24 12:18:06,221 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:18:06,221 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 144 transitions. [2018-01-24 12:18:06,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 12:18:06,222 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:18:06,222 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 12:18:06,222 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 12:18:06,222 INFO L82 PathProgramCache]: Analyzing trace with hash 107698799, now seen corresponding path program 1 times [2018-01-24 12:18:06,222 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:18:06,223 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:18:06,224 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:06,224 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:18:06,224 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:06,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:18:06,243 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:18:06,344 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 12:18:06,344 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:18:06,345 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 12:18:06,345 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 12:18:06,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 12:18:06,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:18:06,346 INFO L87 Difference]: Start difference. First operand 135 states and 144 transitions. Second operand 10 states. [2018-01-24 12:18:06,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:18:06,550 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2018-01-24 12:18:06,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:18:06,550 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-01-24 12:18:06,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:18:06,551 INFO L225 Difference]: With dead ends: 135 [2018-01-24 12:18:06,552 INFO L226 Difference]: Without dead ends: 134 [2018-01-24 12:18:06,552 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:18:06,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-01-24 12:18:06,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-01-24 12:18:06,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-01-24 12:18:06,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 143 transitions. [2018-01-24 12:18:06,566 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 143 transitions. Word has length 34 [2018-01-24 12:18:06,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:18:06,567 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 143 transitions. [2018-01-24 12:18:06,567 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 12:18:06,567 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 143 transitions. [2018-01-24 12:18:06,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 12:18:06,568 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:18:06,569 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 12:18:06,569 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 12:18:06,569 INFO L82 PathProgramCache]: Analyzing trace with hash 107698800, now seen corresponding path program 1 times [2018-01-24 12:18:06,569 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:18:06,569 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:18:06,571 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:06,571 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:18:06,571 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:06,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:18:06,591 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:18:06,626 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 12:18:06,627 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:18:06,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:18:06,627 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:18:06,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:18:06,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:18:06,628 INFO L87 Difference]: Start difference. First operand 134 states and 143 transitions. Second operand 4 states. [2018-01-24 12:18:06,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:18:06,655 INFO L93 Difference]: Finished difference Result 230 states and 245 transitions. [2018-01-24 12:18:06,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:18:06,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-01-24 12:18:06,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:18:06,658 INFO L225 Difference]: With dead ends: 230 [2018-01-24 12:18:06,658 INFO L226 Difference]: Without dead ends: 135 [2018-01-24 12:18:06,659 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 12:18:06,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-24 12:18:06,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-01-24 12:18:06,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-24 12:18:06,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 144 transitions. [2018-01-24 12:18:06,674 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 144 transitions. Word has length 34 [2018-01-24 12:18:06,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:18:06,674 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 144 transitions. [2018-01-24 12:18:06,674 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:18:06,674 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 144 transitions. [2018-01-24 12:18:06,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-24 12:18:06,676 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:18:06,676 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 12:18:06,676 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 12:18:06,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1590593736, now seen corresponding path program 1 times [2018-01-24 12:18:06,676 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:18:06,677 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:18:06,678 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:06,678 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:18:06,678 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:18:06,695 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:18:06,746 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 12:18:06,747 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:18:06,747 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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 12:18:06,758 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:18:06,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:18:06,814 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:18:06,864 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 12:18:06,901 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:18:06,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-01-24 12:18:06,902 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:18:06,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:18:06,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:18:06,902 INFO L87 Difference]: Start difference. First operand 135 states and 144 transitions. Second operand 6 states. [2018-01-24 12:18:06,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:18:06,949 INFO L93 Difference]: Finished difference Result 231 states and 246 transitions. [2018-01-24 12:18:06,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:18:06,950 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-24 12:18:06,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:18:06,951 INFO L225 Difference]: With dead ends: 231 [2018-01-24 12:18:06,951 INFO L226 Difference]: Without dead ends: 136 [2018-01-24 12:18:06,952 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:18:06,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-01-24 12:18:06,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-01-24 12:18:06,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-01-24 12:18:06,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 145 transitions. [2018-01-24 12:18:06,962 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 145 transitions. Word has length 35 [2018-01-24 12:18:06,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:18:06,963 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 145 transitions. [2018-01-24 12:18:06,963 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:18:06,963 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 145 transitions. [2018-01-24 12:18:06,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 12:18:06,964 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:18:06,964 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 12:18:06,964 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 12:18:06,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1596912496, now seen corresponding path program 2 times [2018-01-24 12:18:06,964 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:18:06,965 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:18:06,965 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:06,966 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:18:06,966 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:06,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:18:06,984 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:18:07,034 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 12:18:07,034 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:18:07,034 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:18:07,047 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:18:07,078 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:18:07,082 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:18:07,088 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:18:07,128 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 12:18:07,131 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:18:07,163 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 12:18:07,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:18:07,183 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 12:18:07,183 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-24 12:18:09,513 WARN L143 SmtUtils]: Spent 2025ms on a formula simplification that was a NOOP. DAG size: 27 [2018-01-24 12:18:09,858 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 12:18:09,879 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:18:09,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 19 [2018-01-24 12:18:09,880 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 12:18:09,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 12:18:09,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-01-24 12:18:09,880 INFO L87 Difference]: Start difference. First operand 136 states and 145 transitions. Second operand 19 states. [2018-01-24 12:18:14,213 WARN L143 SmtUtils]: Spent 4040ms on a formula simplification that was a NOOP. DAG size: 31 [2018-01-24 12:18:18,349 WARN L143 SmtUtils]: Spent 4035ms on a formula simplification that was a NOOP. DAG size: 32 [2018-01-24 12:18:19,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:18:19,126 INFO L93 Difference]: Finished difference Result 248 states and 264 transitions. [2018-01-24 12:18:19,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 12:18:19,127 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-01-24 12:18:19,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:18:19,128 INFO L225 Difference]: With dead ends: 248 [2018-01-24 12:18:19,128 INFO L226 Difference]: Without dead ends: 153 [2018-01-24 12:18:19,129 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2018-01-24 12:18:19,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-01-24 12:18:19,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 136. [2018-01-24 12:18:19,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-01-24 12:18:19,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 145 transitions. [2018-01-24 12:18:19,149 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 145 transitions. Word has length 36 [2018-01-24 12:18:19,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:18:19,150 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 145 transitions. [2018-01-24 12:18:19,150 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-24 12:18:19,150 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 145 transitions. [2018-01-24 12:18:19,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 12:18:19,152 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:18:19,152 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:18:19,152 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 12:18:19,152 INFO L82 PathProgramCache]: Analyzing trace with hash 2040634480, now seen corresponding path program 1 times [2018-01-24 12:18:19,152 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:18:19,153 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:18:19,154 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:19,154 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:18:19,154 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:19,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:18:19,177 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:18:19,223 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 12:18:19,223 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:18:19,223 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 12:18:19,224 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:18:19,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:18:19,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:18:19,224 INFO L87 Difference]: Start difference. First operand 136 states and 145 transitions. Second operand 3 states. [2018-01-24 12:18:19,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:18:19,365 INFO L93 Difference]: Finished difference Result 155 states and 166 transitions. [2018-01-24 12:18:19,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:18:19,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-01-24 12:18:19,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:18:19,368 INFO L225 Difference]: With dead ends: 155 [2018-01-24 12:18:19,368 INFO L226 Difference]: Without dead ends: 142 [2018-01-24 12:18:19,369 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:18:19,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-01-24 12:18:19,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 132. [2018-01-24 12:18:19,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-24 12:18:19,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 140 transitions. [2018-01-24 12:18:19,389 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 140 transitions. Word has length 36 [2018-01-24 12:18:19,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:18:19,389 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 140 transitions. [2018-01-24 12:18:19,389 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:18:19,390 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 140 transitions. [2018-01-24 12:18:19,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 12:18:19,391 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:18:19,391 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:18:19,391 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 12:18:19,391 INFO L82 PathProgramCache]: Analyzing trace with hash 746437934, now seen corresponding path program 1 times [2018-01-24 12:18:19,392 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:18:19,392 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:18:19,393 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:19,393 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:18:19,393 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:19,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:18:19,401 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:18:19,456 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 12:18:19,456 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:18:19,456 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:18:19,457 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:18:19,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:18:19,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:18:19,457 INFO L87 Difference]: Start difference. First operand 132 states and 140 transitions. Second operand 6 states. [2018-01-24 12:18:19,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:18:19,515 INFO L93 Difference]: Finished difference Result 136 states and 143 transitions. [2018-01-24 12:18:19,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:18:19,516 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-01-24 12:18:19,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:18:19,517 INFO L225 Difference]: With dead ends: 136 [2018-01-24 12:18:19,517 INFO L226 Difference]: Without dead ends: 119 [2018-01-24 12:18:19,518 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 12:18:19,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-24 12:18:19,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-01-24 12:18:19,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-24 12:18:19,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 125 transitions. [2018-01-24 12:18:19,534 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 125 transitions. Word has length 38 [2018-01-24 12:18:19,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:18:19,535 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 125 transitions. [2018-01-24 12:18:19,535 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:18:19,535 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2018-01-24 12:18:19,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-24 12:18:19,536 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:18:19,536 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 12:18:19,536 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 12:18:19,536 INFO L82 PathProgramCache]: Analyzing trace with hash -98646161, now seen corresponding path program 1 times [2018-01-24 12:18:19,536 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:18:19,537 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:18:19,538 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:19,538 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:18:19,538 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:19,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:18:19,554 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:18:19,682 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 12:18:19,682 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:18:19,682 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 12:18:19,683 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 12:18:19,683 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 12:18:19,683 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:18:19,683 INFO L87 Difference]: Start difference. First operand 119 states and 125 transitions. Second operand 10 states. [2018-01-24 12:18:19,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:18:19,989 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2018-01-24 12:18:19,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:18:19,989 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-01-24 12:18:19,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:18:19,990 INFO L225 Difference]: With dead ends: 119 [2018-01-24 12:18:19,991 INFO L226 Difference]: Without dead ends: 117 [2018-01-24 12:18:19,991 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 12:18:19,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-24 12:18:20,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-01-24 12:18:20,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-24 12:18:20,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 123 transitions. [2018-01-24 12:18:20,005 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 123 transitions. Word has length 42 [2018-01-24 12:18:20,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:18:20,006 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 123 transitions. [2018-01-24 12:18:20,006 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 12:18:20,006 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2018-01-24 12:18:20,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-24 12:18:20,007 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:18:20,007 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 12:18:20,007 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 12:18:20,007 INFO L82 PathProgramCache]: Analyzing trace with hash -98646160, now seen corresponding path program 1 times [2018-01-24 12:18:20,008 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:18:20,008 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:18:20,009 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:20,009 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:18:20,009 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:18:20,028 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:18:20,078 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 12:18:20,078 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:18:20,078 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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 12:18:20,083 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:18:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:18:20,110 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:18:20,136 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 12:18:20,157 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:18:20,158 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-01-24 12:18:20,158 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:18:20,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:18:20,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:18:20,158 INFO L87 Difference]: Start difference. First operand 117 states and 123 transitions. Second operand 8 states. [2018-01-24 12:18:20,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:18:20,194 INFO L93 Difference]: Finished difference Result 210 states and 222 transitions. [2018-01-24 12:18:20,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:18:20,194 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-01-24 12:18:20,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:18:20,196 INFO L225 Difference]: With dead ends: 210 [2018-01-24 12:18:20,196 INFO L226 Difference]: Without dead ends: 118 [2018-01-24 12:18:20,196 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:18:20,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-24 12:18:20,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-01-24 12:18:20,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-24 12:18:20,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 124 transitions. [2018-01-24 12:18:20,213 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 124 transitions. Word has length 42 [2018-01-24 12:18:20,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:18:20,213 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 124 transitions. [2018-01-24 12:18:20,213 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:18:20,213 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2018-01-24 12:18:20,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-24 12:18:20,214 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:18:20,214 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] [2018-01-24 12:18:20,214 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 12:18:20,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1065378760, now seen corresponding path program 2 times [2018-01-24 12:18:20,214 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:18:20,215 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:18:20,215 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:20,216 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:18:20,216 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:20,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:18:20,234 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:18:20,298 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 12:18:20,299 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:18:20,313 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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 12:18:20,321 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:18:20,342 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:18:20,344 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:18:20,348 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:18:20,354 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 12:18:20,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:18:20,375 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 12:18:20,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:18:20,390 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 12:18:20,390 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-24 12:18:24,622 WARN L143 SmtUtils]: Spent 2025ms on a formula simplification that was a NOOP. DAG size: 27 [2018-01-24 12:18:24,932 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 12:18:24,952 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:18:24,952 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 22 [2018-01-24 12:18:24,953 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-24 12:18:24,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-24 12:18:24,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=389, Unknown=1, NotChecked=0, Total=462 [2018-01-24 12:18:24,953 INFO L87 Difference]: Start difference. First operand 118 states and 124 transitions. Second operand 22 states. [2018-01-24 12:18:25,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:18:25,909 INFO L93 Difference]: Finished difference Result 209 states and 223 transitions. [2018-01-24 12:18:25,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-24 12:18:25,909 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 43 [2018-01-24 12:18:25,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:18:25,910 INFO L225 Difference]: With dead ends: 209 [2018-01-24 12:18:25,910 INFO L226 Difference]: Without dead ends: 117 [2018-01-24 12:18:25,911 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=147, Invalid=844, Unknown=1, NotChecked=0, Total=992 [2018-01-24 12:18:25,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-24 12:18:25,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-01-24 12:18:25,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-24 12:18:25,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 123 transitions. [2018-01-24 12:18:25,924 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 123 transitions. Word has length 43 [2018-01-24 12:18:25,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:18:25,925 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 123 transitions. [2018-01-24 12:18:25,925 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-24 12:18:25,925 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2018-01-24 12:18:25,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-24 12:18:25,925 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:18:25,925 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] [2018-01-24 12:18:25,925 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 12:18:25,925 INFO L82 PathProgramCache]: Analyzing trace with hash -403711437, now seen corresponding path program 1 times [2018-01-24 12:18:25,926 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:18:25,926 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:18:25,927 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:25,927 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:18:25,927 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:25,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:18:25,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:18:26,005 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 12:18:26,005 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:18:26,005 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 12:18:26,006 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:18:26,006 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:18:26,006 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:18:26,006 INFO L87 Difference]: Start difference. First operand 117 states and 123 transitions. Second operand 8 states. [2018-01-24 12:18:26,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:18:26,051 INFO L93 Difference]: Finished difference Result 185 states and 194 transitions. [2018-01-24 12:18:26,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:18:26,052 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-01-24 12:18:26,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:18:26,053 INFO L225 Difference]: With dead ends: 185 [2018-01-24 12:18:26,053 INFO L226 Difference]: Without dead ends: 117 [2018-01-24 12:18:26,053 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 12:18:26,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-24 12:18:26,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-01-24 12:18:26,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-24 12:18:26,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 122 transitions. [2018-01-24 12:18:26,070 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 122 transitions. Word has length 51 [2018-01-24 12:18:26,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:18:26,070 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 122 transitions. [2018-01-24 12:18:26,070 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:18:26,070 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2018-01-24 12:18:26,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-24 12:18:26,071 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:18:26,071 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] [2018-01-24 12:18:26,071 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 12:18:26,071 INFO L82 PathProgramCache]: Analyzing trace with hash 90191936, now seen corresponding path program 1 times [2018-01-24 12:18:26,072 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:18:26,072 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:18:26,073 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:26,073 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:18:26,073 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:26,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:18:26,086 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:18:26,187 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 12:18:26,188 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:18:26,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 12:18:26,188 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 12:18:26,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 12:18:26,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:18:26,189 INFO L87 Difference]: Start difference. First operand 117 states and 122 transitions. Second operand 10 states. [2018-01-24 12:18:26,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:18:26,354 INFO L93 Difference]: Finished difference Result 187 states and 195 transitions. [2018-01-24 12:18:26,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:18:26,354 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-01-24 12:18:26,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:18:26,355 INFO L225 Difference]: With dead ends: 187 [2018-01-24 12:18:26,356 INFO L226 Difference]: Without dead ends: 117 [2018-01-24 12:18:26,356 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 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 12:18:26,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-24 12:18:26,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-01-24 12:18:26,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-24 12:18:26,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 121 transitions. [2018-01-24 12:18:26,374 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 121 transitions. Word has length 56 [2018-01-24 12:18:26,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:18:26,374 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 121 transitions. [2018-01-24 12:18:26,374 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 12:18:26,374 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2018-01-24 12:18:26,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-24 12:18:26,375 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:18:26,375 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] [2018-01-24 12:18:26,375 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 12:18:26,376 INFO L82 PathProgramCache]: Analyzing trace with hash 222221704, now seen corresponding path program 1 times [2018-01-24 12:18:26,376 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:18:26,376 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:18:26,377 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:26,377 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:18:26,377 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:26,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:18:26,396 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:18:26,637 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 12:18:26,638 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:18:26,638 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-01-24 12:18:26,638 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-24 12:18:26,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-24 12:18:26,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2018-01-24 12:18:26,639 INFO L87 Difference]: Start difference. First operand 117 states and 121 transitions. Second operand 23 states. [2018-01-24 12:18:27,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:18:27,218 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2018-01-24 12:18:27,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-24 12:18:27,219 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 67 [2018-01-24 12:18:27,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:18:27,219 INFO L225 Difference]: With dead ends: 146 [2018-01-24 12:18:27,220 INFO L226 Difference]: Without dead ends: 144 [2018-01-24 12:18:27,220 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=853, Unknown=0, NotChecked=0, Total=930 [2018-01-24 12:18:27,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-01-24 12:18:27,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 139. [2018-01-24 12:18:27,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-01-24 12:18:27,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 149 transitions. [2018-01-24 12:18:27,239 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 149 transitions. Word has length 67 [2018-01-24 12:18:27,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:18:27,239 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 149 transitions. [2018-01-24 12:18:27,239 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-24 12:18:27,239 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 149 transitions. [2018-01-24 12:18:27,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-24 12:18:27,240 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:18:27,240 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] [2018-01-24 12:18:27,241 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 12:18:27,241 INFO L82 PathProgramCache]: Analyzing trace with hash 222221705, now seen corresponding path program 1 times [2018-01-24 12:18:27,241 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:18:27,241 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:18:27,242 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:27,242 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:18:27,242 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:18:27,264 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:18:27,339 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 12:18:27,339 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:18:27,339 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:18:27,348 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:18:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:18:27,397 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:18:27,419 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 12:18:27,453 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:18:27,454 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-01-24 12:18:27,454 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 12:18:27,455 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 12:18:27,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:18:27,455 INFO L87 Difference]: Start difference. First operand 139 states and 149 transitions. Second operand 10 states. [2018-01-24 12:18:27,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:18:27,550 INFO L93 Difference]: Finished difference Result 252 states and 272 transitions. [2018-01-24 12:18:27,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:18:27,550 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2018-01-24 12:18:27,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:18:27,551 INFO L225 Difference]: With dead ends: 252 [2018-01-24 12:18:27,551 INFO L226 Difference]: Without dead ends: 140 [2018-01-24 12:18:27,551 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:18:27,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-24 12:18:27,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-01-24 12:18:27,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-24 12:18:27,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 150 transitions. [2018-01-24 12:18:27,566 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 150 transitions. Word has length 67 [2018-01-24 12:18:27,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:18:27,566 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 150 transitions. [2018-01-24 12:18:27,566 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 12:18:27,567 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 150 transitions. [2018-01-24 12:18:27,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-24 12:18:27,567 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:18:27,567 INFO L322 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:18:27,567 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 12:18:27,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1652723263, now seen corresponding path program 2 times [2018-01-24 12:18:27,568 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:18:27,568 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:18:27,569 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:27,569 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:18:27,569 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:27,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:18:27,585 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:18:27,691 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:18:27,691 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:18:27,692 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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 12:18:27,697 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:18:27,734 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:18:27,737 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:18:27,743 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:18:27,748 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 12:18:27,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:18:27,761 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 12:18:27,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:18:27,773 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 12:18:27,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-24 12:18:28,666 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-01-24 12:18:28,685 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:18:28,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [10] total 31 [2018-01-24 12:18:28,686 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-24 12:18:28,686 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-24 12:18:28,686 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=815, Unknown=0, NotChecked=0, Total=930 [2018-01-24 12:18:28,686 INFO L87 Difference]: Start difference. First operand 140 states and 150 transitions. Second operand 31 states. [2018-01-24 12:18:30,917 WARN L143 SmtUtils]: Spent 2017ms on a formula simplification that was a NOOP. DAG size: 31 [2018-01-24 12:18:32,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:18:32,096 INFO L93 Difference]: Finished difference Result 251 states and 273 transitions. [2018-01-24 12:18:32,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-24 12:18:32,096 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 68 [2018-01-24 12:18:32,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:18:32,097 INFO L225 Difference]: With dead ends: 251 [2018-01-24 12:18:32,097 INFO L226 Difference]: Without dead ends: 139 [2018-01-24 12:18:32,098 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=241, Invalid=1829, Unknown=0, NotChecked=0, Total=2070 [2018-01-24 12:18:32,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-01-24 12:18:32,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-01-24 12:18:32,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-01-24 12:18:32,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 147 transitions. [2018-01-24 12:18:32,114 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 147 transitions. Word has length 68 [2018-01-24 12:18:32,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:18:32,115 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 147 transitions. [2018-01-24 12:18:32,115 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-24 12:18:32,115 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 147 transitions. [2018-01-24 12:18:32,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-01-24 12:18:32,116 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:18:32,116 INFO L322 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:18:32,116 INFO L371 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 12:18:32,116 INFO L82 PathProgramCache]: Analyzing trace with hash 973434245, now seen corresponding path program 1 times [2018-01-24 12:18:32,117 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:18:32,117 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:18:32,118 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:32,118 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:18:32,118 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:18:32,134 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:18:32,307 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-01-24 12:18:32,307 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:18:32,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-24 12:18:32,308 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 12:18:32,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 12:18:32,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:18:32,308 INFO L87 Difference]: Start difference. First operand 139 states and 147 transitions. Second operand 13 states. [2018-01-24 12:18:32,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:18:32,450 INFO L93 Difference]: Finished difference Result 197 states and 207 transitions. [2018-01-24 12:18:32,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 12:18:32,450 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 76 [2018-01-24 12:18:32,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:18:32,451 INFO L225 Difference]: With dead ends: 197 [2018-01-24 12:18:32,451 INFO L226 Difference]: Without dead ends: 137 [2018-01-24 12:18:32,451 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-01-24 12:18:32,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-24 12:18:32,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-01-24 12:18:32,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-01-24 12:18:32,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 143 transitions. [2018-01-24 12:18:32,468 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 143 transitions. Word has length 76 [2018-01-24 12:18:32,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:18:32,468 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 143 transitions. [2018-01-24 12:18:32,468 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 12:18:32,468 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 143 transitions. [2018-01-24 12:18:32,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-01-24 12:18:32,469 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:18:32,469 INFO L322 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:18:32,469 INFO L371 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 12:18:32,470 INFO L82 PathProgramCache]: Analyzing trace with hash -323701284, now seen corresponding path program 1 times [2018-01-24 12:18:32,470 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:18:32,470 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:18:32,470 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:32,471 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:18:32,471 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:32,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:18:32,486 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:18:32,983 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-01-24 12:18:32,983 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:18:32,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2018-01-24 12:18:32,984 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-24 12:18:32,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-24 12:18:32,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2018-01-24 12:18:32,984 INFO L87 Difference]: Start difference. First operand 137 states and 143 transitions. Second operand 27 states. [2018-01-24 12:18:33,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:18:33,638 INFO L93 Difference]: Finished difference Result 149 states and 159 transitions. [2018-01-24 12:18:33,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-24 12:18:33,639 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 83 [2018-01-24 12:18:33,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:18:33,640 INFO L225 Difference]: With dead ends: 149 [2018-01-24 12:18:33,640 INFO L226 Difference]: Without dead ends: 147 [2018-01-24 12:18:33,640 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=1239, Unknown=0, NotChecked=0, Total=1332 [2018-01-24 12:18:33,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-01-24 12:18:33,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2018-01-24 12:18:33,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-24 12:18:33,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 153 transitions. [2018-01-24 12:18:33,659 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 153 transitions. Word has length 83 [2018-01-24 12:18:33,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:18:33,659 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 153 transitions. [2018-01-24 12:18:33,659 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-24 12:18:33,660 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 153 transitions. [2018-01-24 12:18:33,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-01-24 12:18:33,660 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:18:33,660 INFO L322 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:18:33,660 INFO L371 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 12:18:33,660 INFO L82 PathProgramCache]: Analyzing trace with hash -323701283, now seen corresponding path program 1 times [2018-01-24 12:18:33,660 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:18:33,661 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:18:33,661 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:33,661 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:18:33,662 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:33,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:18:33,679 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:18:33,978 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:18:33,979 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:18:33,979 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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 12:18:33,988 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:18:34,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:18:34,046 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:18:34,124 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:18:34,146 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:18:34,146 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-01-24 12:18:34,146 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 12:18:34,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 12:18:34,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-01-24 12:18:34,147 INFO L87 Difference]: Start difference. First operand 143 states and 153 transitions. Second operand 12 states. [2018-01-24 12:18:34,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:18:34,227 INFO L93 Difference]: Finished difference Result 258 states and 278 transitions. [2018-01-24 12:18:34,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 12:18:34,227 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 83 [2018-01-24 12:18:34,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:18:34,228 INFO L225 Difference]: With dead ends: 258 [2018-01-24 12:18:34,228 INFO L226 Difference]: Without dead ends: 144 [2018-01-24 12:18:34,228 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:18:34,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-01-24 12:18:34,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-01-24 12:18:34,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-01-24 12:18:34,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 154 transitions. [2018-01-24 12:18:34,269 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 154 transitions. Word has length 83 [2018-01-24 12:18:34,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:18:34,270 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 154 transitions. [2018-01-24 12:18:34,270 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 12:18:34,270 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 154 transitions. [2018-01-24 12:18:34,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-24 12:18:34,271 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:18:34,271 INFO L322 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:18:34,271 INFO L371 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 12:18:34,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1768153621, now seen corresponding path program 2 times [2018-01-24 12:18:34,271 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:18:34,272 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:18:34,272 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:34,272 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:18:34,273 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:34,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:18:34,297 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:18:34,449 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:18:34,449 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:18:34,450 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:18:34,459 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:18:34,509 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:18:34,518 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:18:34,525 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:18:34,531 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 12:18:34,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:18:34,599 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 12:18:34,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:18:34,623 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 12:18:34,623 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-24 12:18:36,044 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-01-24 12:18:36,065 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:18:36,065 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [12] total 37 [2018-01-24 12:18:36,066 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-24 12:18:36,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-24 12:18:36,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1182, Unknown=0, NotChecked=0, Total=1332 [2018-01-24 12:18:36,067 INFO L87 Difference]: Start difference. First operand 144 states and 154 transitions. Second operand 37 states. [2018-01-24 12:18:38,155 WARN L143 SmtUtils]: Spent 2050ms on a formula simplification that was a NOOP. DAG size: 39 [2018-01-24 12:18:40,298 WARN L143 SmtUtils]: Spent 2042ms on a formula simplification that was a NOOP. DAG size: 35 [2018-01-24 12:18:44,001 WARN L143 SmtUtils]: Spent 3386ms on a formula simplification that was a NOOP. DAG size: 36 [2018-01-24 12:18:45,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:18:45,268 INFO L93 Difference]: Finished difference Result 257 states and 279 transitions. [2018-01-24 12:18:45,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-01-24 12:18:45,268 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 84 [2018-01-24 12:18:45,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:18:45,269 INFO L225 Difference]: With dead ends: 257 [2018-01-24 12:18:45,270 INFO L226 Difference]: Without dead ends: 143 [2018-01-24 12:18:45,271 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=328, Invalid=2752, Unknown=0, NotChecked=0, Total=3080 [2018-01-24 12:18:45,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-24 12:18:45,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-01-24 12:18:45,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-24 12:18:45,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 152 transitions. [2018-01-24 12:18:45,292 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 152 transitions. Word has length 84 [2018-01-24 12:18:45,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:18:45,293 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 152 transitions. [2018-01-24 12:18:45,293 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-24 12:18:45,293 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 152 transitions. [2018-01-24 12:18:45,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-01-24 12:18:45,293 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:18:45,293 INFO L322 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:18:45,294 INFO L371 AbstractCegarLoop]: === Iteration 23 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 12:18:45,294 INFO L82 PathProgramCache]: Analyzing trace with hash -11138274, now seen corresponding path program 1 times [2018-01-24 12:18:45,294 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:18:45,294 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:18:45,294 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:45,295 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:18:45,295 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:45,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:18:45,314 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:18:45,735 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:18:45,735 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:18:45,735 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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 12:18:45,749 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:18:45,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:18:45,811 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:18:45,857 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:18:45,878 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:18:45,878 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-01-24 12:18:45,878 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 12:18:45,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 12:18:45,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2018-01-24 12:18:45,879 INFO L87 Difference]: Start difference. First operand 143 states and 152 transitions. Second operand 14 states. [2018-01-24 12:18:45,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:18:45,946 INFO L93 Difference]: Finished difference Result 256 states and 274 transitions. [2018-01-24 12:18:45,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 12:18:45,947 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2018-01-24 12:18:45,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:18:45,948 INFO L225 Difference]: With dead ends: 256 [2018-01-24 12:18:45,948 INFO L226 Difference]: Without dead ends: 144 [2018-01-24 12:18:45,948 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2018-01-24 12:18:45,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-01-24 12:18:45,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-01-24 12:18:45,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-01-24 12:18:45,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 153 transitions. [2018-01-24 12:18:45,984 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 153 transitions. Word has length 89 [2018-01-24 12:18:45,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:18:45,984 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 153 transitions. [2018-01-24 12:18:45,985 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 12:18:45,985 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2018-01-24 12:18:45,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-01-24 12:18:45,986 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:18:45,986 INFO L322 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:18:45,986 INFO L371 AbstractCegarLoop]: === Iteration 24 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 12:18:45,986 INFO L82 PathProgramCache]: Analyzing trace with hash 558968150, now seen corresponding path program 2 times [2018-01-24 12:18:45,986 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:18:45,986 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:18:45,987 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:45,988 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:18:45,988 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:46,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:18:46,013 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:18:46,162 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:18:46,162 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:18:46,162 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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 12:18:46,170 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:18:46,223 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:18:46,249 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:18:46,252 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:18:46,257 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:18:46,286 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:18:46,314 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:18:46,314 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-01-24 12:18:46,315 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 12:18:46,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 12:18:46,315 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-01-24 12:18:46,316 INFO L87 Difference]: Start difference. First operand 144 states and 153 transitions. Second operand 15 states. [2018-01-24 12:18:46,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:18:46,367 INFO L93 Difference]: Finished difference Result 257 states and 275 transitions. [2018-01-24 12:18:46,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 12:18:46,367 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 90 [2018-01-24 12:18:46,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:18:46,368 INFO L225 Difference]: With dead ends: 257 [2018-01-24 12:18:46,368 INFO L226 Difference]: Without dead ends: 145 [2018-01-24 12:18:46,369 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=143, Unknown=0, NotChecked=0, Total=240 [2018-01-24 12:18:46,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-01-24 12:18:46,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-01-24 12:18:46,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-01-24 12:18:46,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 154 transitions. [2018-01-24 12:18:46,402 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 154 transitions. Word has length 90 [2018-01-24 12:18:46,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:18:46,403 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 154 transitions. [2018-01-24 12:18:46,403 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 12:18:46,403 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 154 transitions. [2018-01-24 12:18:46,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-01-24 12:18:46,404 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:18:46,404 INFO L322 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:18:46,405 INFO L371 AbstractCegarLoop]: === Iteration 25 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 12:18:46,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1052398110, now seen corresponding path program 3 times [2018-01-24 12:18:46,405 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:18:46,405 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:18:46,406 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:46,406 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:18:46,406 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:18:46,433 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:18:46,592 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:18:46,592 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:18:46,592 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:18:46,600 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 12:18:46,642 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:18:46,655 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:18:46,687 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:18:46,921 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:18:47,032 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:18:47,870 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:18:48,485 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:18:48,488 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:18:48,493 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:18:48,688 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:18:48,709 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:18:48,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 33 [2018-01-24 12:18:48,710 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-24 12:18:48,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-24 12:18:48,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=770, Unknown=0, NotChecked=0, Total=1056 [2018-01-24 12:18:48,711 INFO L87 Difference]: Start difference. First operand 145 states and 154 transitions. Second operand 33 states. [2018-01-24 12:18:48,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:18:48,862 INFO L93 Difference]: Finished difference Result 258 states and 276 transitions. [2018-01-24 12:18:48,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-24 12:18:48,892 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 91 [2018-01-24 12:18:48,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:18:48,894 INFO L225 Difference]: With dead ends: 258 [2018-01-24 12:18:48,894 INFO L226 Difference]: Without dead ends: 146 [2018-01-24 12:18:48,895 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=324, Invalid=936, Unknown=0, NotChecked=0, Total=1260 [2018-01-24 12:18:48,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-01-24 12:18:48,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-01-24 12:18:48,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-01-24 12:18:48,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 155 transitions. [2018-01-24 12:18:48,930 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 155 transitions. Word has length 91 [2018-01-24 12:18:48,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:18:48,931 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 155 transitions. [2018-01-24 12:18:48,931 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-24 12:18:48,931 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 155 transitions. [2018-01-24 12:18:48,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-01-24 12:18:48,932 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:18:48,932 INFO L322 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:18:48,932 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_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 12:18:48,933 INFO L82 PathProgramCache]: Analyzing trace with hash -831142314, now seen corresponding path program 4 times [2018-01-24 12:18:48,933 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:18:48,933 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:18:48,934 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:48,934 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:18:48,934 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:18:48,959 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:18:49,167 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:18:49,167 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:18:49,167 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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 12:18:49,173 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-24 12:18:49,238 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:18:49,242 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:18:49,258 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:18:49,279 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:18:49,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-01-24 12:18:49,279 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 12:18:49,279 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 12:18:49,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-01-24 12:18:49,280 INFO L87 Difference]: Start difference. First operand 146 states and 155 transitions. Second operand 17 states. [2018-01-24 12:18:49,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:18:49,332 INFO L93 Difference]: Finished difference Result 259 states and 277 transitions. [2018-01-24 12:18:49,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 12:18:49,332 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 92 [2018-01-24 12:18:49,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:18:49,333 INFO L225 Difference]: With dead ends: 259 [2018-01-24 12:18:49,333 INFO L226 Difference]: Without dead ends: 147 [2018-01-24 12:18:49,334 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=180, Unknown=0, NotChecked=0, Total=306 [2018-01-24 12:18:49,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-01-24 12:18:49,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-01-24 12:18:49,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-01-24 12:18:49,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 156 transitions. [2018-01-24 12:18:49,357 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 156 transitions. Word has length 92 [2018-01-24 12:18:49,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:18:49,357 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 156 transitions. [2018-01-24 12:18:49,357 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 12:18:49,357 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 156 transitions. [2018-01-24 12:18:49,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-01-24 12:18:49,358 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:18:49,358 INFO L322 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:18:49,358 INFO L371 AbstractCegarLoop]: === Iteration 27 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_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 12:18:49,358 INFO L82 PathProgramCache]: Analyzing trace with hash 908646686, now seen corresponding path program 5 times [2018-01-24 12:18:49,358 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:18:49,358 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:18:49,359 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:49,359 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:18:49,359 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:18:49,383 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:18:49,611 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:18:49,611 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:18:49,611 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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 12:18:49,619 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-24 12:18:49,635 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:18:49,638 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:18:49,643 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:18:49,660 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:18:49,714 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:18:49,763 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:18:50,058 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:18:50,586 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:18:50,592 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:18:50,596 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:18:50,609 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:18:50,630 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:18:50,630 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-01-24 12:18:50,630 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 12:18:50,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 12:18:50,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-01-24 12:18:50,631 INFO L87 Difference]: Start difference. First operand 147 states and 156 transitions. Second operand 18 states. [2018-01-24 12:18:50,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:18:50,679 INFO L93 Difference]: Finished difference Result 260 states and 278 transitions. [2018-01-24 12:18:50,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-24 12:18:50,679 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 93 [2018-01-24 12:18:50,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:18:50,680 INFO L225 Difference]: With dead ends: 260 [2018-01-24 12:18:50,680 INFO L226 Difference]: Without dead ends: 148 [2018-01-24 12:18:50,680 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=200, Unknown=0, NotChecked=0, Total=342 [2018-01-24 12:18:50,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-01-24 12:18:50,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-01-24 12:18:50,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-01-24 12:18:50,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 157 transitions. [2018-01-24 12:18:50,702 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 157 transitions. Word has length 93 [2018-01-24 12:18:50,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:18:50,703 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 157 transitions. [2018-01-24 12:18:50,703 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-24 12:18:50,703 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 157 transitions. [2018-01-24 12:18:50,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-01-24 12:18:50,703 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:18:50,703 INFO L322 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:18:50,703 INFO L371 AbstractCegarLoop]: === Iteration 28 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 12:18:50,704 INFO L82 PathProgramCache]: Analyzing trace with hash -992469162, now seen corresponding path program 6 times [2018-01-24 12:18:50,704 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:18:50,704 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:18:50,704 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:50,704 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:18:50,705 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:50,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:18:50,721 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:18:51,001 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:18:51,001 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:18:51,001 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:18:51,007 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-24 12:18:51,039 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 12:18:51,051 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 12:18:51,075 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 12:18:51,240 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 12:18:51,477 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 12:18:53,922 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 12:18:55,848 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 12:18:57,279 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 12:18:57,281 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:18:57,287 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:18:57,298 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:18:57,319 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:18:57,320 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-01-24 12:18:57,320 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 12:18:57,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 12:18:57,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-01-24 12:18:57,320 INFO L87 Difference]: Start difference. First operand 148 states and 157 transitions. Second operand 19 states. [2018-01-24 12:18:57,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:18:57,397 INFO L93 Difference]: Finished difference Result 261 states and 279 transitions. [2018-01-24 12:18:57,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 12:18:57,398 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 94 [2018-01-24 12:18:57,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:18:57,398 INFO L225 Difference]: With dead ends: 261 [2018-01-24 12:18:57,398 INFO L226 Difference]: Without dead ends: 149 [2018-01-24 12:18:57,399 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=221, Unknown=0, NotChecked=0, Total=380 [2018-01-24 12:18:57,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-01-24 12:18:57,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-01-24 12:18:57,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-01-24 12:18:57,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 158 transitions. [2018-01-24 12:18:57,422 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 158 transitions. Word has length 94 [2018-01-24 12:18:57,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:18:57,422 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 158 transitions. [2018-01-24 12:18:57,422 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-24 12:18:57,422 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 158 transitions. [2018-01-24 12:18:57,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-01-24 12:18:57,422 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:18:57,422 INFO L322 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:18:57,423 INFO L371 AbstractCegarLoop]: === Iteration 29 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 12:18:57,423 INFO L82 PathProgramCache]: Analyzing trace with hash 202481694, now seen corresponding path program 7 times [2018-01-24 12:18:57,423 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:18:57,423 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:18:57,424 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:57,424 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:18:57,424 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:57,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:18:57,445 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:18:57,661 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:18:57,661 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:18:57,661 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:18:57,666 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:18:57,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:18:57,714 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:18:57,727 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:18:57,746 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:18:57,746 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-01-24 12:18:57,747 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-24 12:18:57,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-24 12:18:57,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2018-01-24 12:18:57,747 INFO L87 Difference]: Start difference. First operand 149 states and 158 transitions. Second operand 20 states. [2018-01-24 12:18:57,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:18:57,798 INFO L93 Difference]: Finished difference Result 262 states and 280 transitions. [2018-01-24 12:18:57,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 12:18:57,798 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 95 [2018-01-24 12:18:57,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:18:57,799 INFO L225 Difference]: With dead ends: 262 [2018-01-24 12:18:57,799 INFO L226 Difference]: Without dead ends: 150 [2018-01-24 12:18:57,800 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=177, Invalid=243, Unknown=0, NotChecked=0, Total=420 [2018-01-24 12:18:57,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-01-24 12:18:57,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-01-24 12:18:57,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-24 12:18:57,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 159 transitions. [2018-01-24 12:18:57,823 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 159 transitions. Word has length 95 [2018-01-24 12:18:57,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:18:57,823 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 159 transitions. [2018-01-24 12:18:57,823 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-24 12:18:57,824 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 159 transitions. [2018-01-24 12:18:57,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-01-24 12:18:57,824 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:18:57,824 INFO L322 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:18:57,825 INFO L371 AbstractCegarLoop]: === Iteration 30 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-24 12:18:57,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1408747434, now seen corresponding path program 8 times [2018-01-24 12:18:57,825 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:18:57,825 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:18:57,826 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:57,826 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:18:57,826 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:18:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:18:57,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:18:59,015 WARN L146 SmtUtils]: Spent 172ms on a formula simplification. DAG size of input: 60 DAG size of output 27 Received shutdown request... [2018-01-24 12:18:59,637 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 12:18:59,641 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 12:18:59,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:18:59 BoogieIcfgContainer [2018-01-24 12:18:59,641 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:18:59,642 INFO L168 Benchmark]: Toolchain (without parser) took 55972.19 ms. Allocated memory was 300.9 MB in the beginning and 752.4 MB in the end (delta: 451.4 MB). Free memory was 260.0 MB in the beginning and 475.1 MB in the end (delta: -215.2 MB). Peak memory consumption was 236.3 MB. Max. memory is 5.3 GB. [2018-01-24 12:18:59,643 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 300.9 MB. Free memory is still 267.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:18:59,643 INFO L168 Benchmark]: CACSL2BoogieTranslator took 240.65 ms. Allocated memory is still 300.9 MB. Free memory was 260.0 MB in the beginning and 245.8 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 5.3 GB. [2018-01-24 12:18:59,643 INFO L168 Benchmark]: Boogie Preprocessor took 45.34 ms. Allocated memory is still 300.9 MB. Free memory was 245.8 MB in the beginning and 243.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 12:18:59,644 INFO L168 Benchmark]: RCFGBuilder took 443.13 ms. Allocated memory is still 300.9 MB. Free memory was 243.8 MB in the beginning and 213.2 MB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 5.3 GB. [2018-01-24 12:18:59,644 INFO L168 Benchmark]: TraceAbstraction took 55234.55 ms. Allocated memory was 300.9 MB in the beginning and 752.4 MB in the end (delta: 451.4 MB). Free memory was 212.2 MB in the beginning and 479.3 MB in the end (delta: -267.1 MB). Peak memory consumption was 184.3 MB. Max. memory is 5.3 GB. [2018-01-24 12:18:59,645 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.13 ms. Allocated memory is still 300.9 MB. Free memory is still 267.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 240.65 ms. Allocated memory is still 300.9 MB. Free memory was 260.0 MB in the beginning and 245.8 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 45.34 ms. Allocated memory is still 300.9 MB. Free memory was 245.8 MB in the beginning and 243.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 443.13 ms. Allocated memory is still 300.9 MB. Free memory was 243.8 MB in the beginning and 213.2 MB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 55234.55 ms. Allocated memory was 300.9 MB in the beginning and 752.4 MB in the end (delta: 451.4 MB). Free memory was 212.2 MB in the beginning and 479.3 MB in the end (delta: -267.1 MB). Peak memory consumption was 184.3 MB. Max. memory is 5.3 GB. * 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 97 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 22 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1294). Cancelled while BasicCegarLoop was analyzing trace of length 97 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 22 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1411). Cancelled while BasicCegarLoop was analyzing trace of length 97 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 22 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1411). Cancelled while BasicCegarLoop was analyzing trace of length 97 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 22 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1265). Cancelled while BasicCegarLoop was analyzing trace of length 97 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 22 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1265). Cancelled while BasicCegarLoop was analyzing trace of length 97 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 22 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1267). Cancelled while BasicCegarLoop was analyzing trace of length 97 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 22 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1267). Cancelled while BasicCegarLoop was analyzing trace of length 97 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 22 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was analyzing trace of length 97 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 22 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was analyzing trace of length 97 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 22 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was analyzing trace of length 97 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 22 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was analyzing trace of length 97 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 22 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1339). Cancelled while BasicCegarLoop was analyzing trace of length 97 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 22 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1339). Cancelled while BasicCegarLoop was analyzing trace of length 97 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 22 known predicates. - TimeoutResultAtElement [Line: 1452]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1452). Cancelled while BasicCegarLoop was analyzing trace of length 97 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 22 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1099). Cancelled while BasicCegarLoop was analyzing trace of length 97 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 22 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1100). Cancelled while BasicCegarLoop was analyzing trace of length 97 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 22 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1100). Cancelled while BasicCegarLoop was analyzing trace of length 97 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 22 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1099). Cancelled while BasicCegarLoop was analyzing trace of length 97 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 22 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 19 procedures, 123 locations, 19 error locations. TIMEOUT Result, 55.1s OverallTime, 30 OverallIterations, 16 TraceHistogramMax, 26.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3131 SDtfs, 730 SDslu, 26772 SDs, 0 SdLazy, 7895 SolverSat, 220 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1519 GetRequests, 1045 SyntacticMatches, 5 SemanticMatches, 469 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2163 ImplicationChecksByTransitivity, 32.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=150occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 29 MinimizatonAttempts, 46 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 9.9s SatisfiabilityAnalysisTime, 14.8s InterpolantComputationTime, 2807 NumberOfCodeBlocks, 2787 NumberOfCodeBlocksAsserted, 66 NumberOfCheckSat, 2763 ConstructedInterpolants, 179 QuantifiedInterpolants, 615629 SizeOfPredicates, 71 NumberOfNonLiveVariables, 5545 ConjunctsInSsa, 411 ConjunctsInUnsatCore, 44 InterpolantComputations, 18 PerfectInterpolantSequences, 187/1477 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_5_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-18-59-651.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_5_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_12-18-59-651.csv Completed graceful shutdown