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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_3_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 19:10:21,153 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 19:10:21,155 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 19:10:21,164 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 19:10:21,164 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 19:10:21,164 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 19:10:21,165 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 19:10:21,166 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 19:10:21,167 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 19:10:21,168 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 19:10:21,169 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 19:10:21,169 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 19:10:21,170 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 19:10:21,171 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 19:10:21,171 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 19:10:21,173 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 19:10:21,175 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 19:10:21,176 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 19:10:21,177 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 19:10:21,178 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 19:10:21,180 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 19:10:21,180 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 19:10:21,180 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 19:10:21,181 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 19:10:21,181 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 19:10:21,182 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 19:10:21,183 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 19:10:21,183 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 19:10:21,183 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 19:10:21,183 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 19:10:21,184 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 19:10:21,184 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 19:10:21,193 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 19:10:21,193 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 19:10:21,194 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 19:10:21,195 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 19:10:21,195 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 19:10:21,195 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 19:10:21,195 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 19:10:21,195 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 19:10:21,195 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 19:10:21,195 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 19:10:21,196 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 19:10:21,196 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 19:10:21,196 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 19:10:21,196 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 19:10:21,196 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 19:10:21,196 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 19:10:21,196 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 19:10:21,197 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 19:10:21,197 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 19:10:21,197 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 19:10:21,197 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 19:10:21,197 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 19:10:21,197 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 19:10:21,197 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 19:10:21,198 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 19:10:21,225 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 19:10:21,235 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 19:10:21,238 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 19:10:21,239 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 19:10:21,240 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 19:10:21,240 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_3_false-valid-deref.i [2018-02-02 19:10:21,400 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 19:10:21,401 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 19:10:21,402 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 19:10:21,402 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 19:10:21,407 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 19:10:21,407 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 07:10:21" (1/1) ... [2018-02-02 19:10:21,409 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1719b99c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:10:21, skipping insertion in model container [2018-02-02 19:10:21,409 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 07:10:21" (1/1) ... [2018-02-02 19:10:21,419 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 19:10:21,453 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 19:10:21,541 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 19:10:21,556 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 19:10:21,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:10:21 WrapperNode [2018-02-02 19:10:21,563 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 19:10:21,563 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 19:10:21,564 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 19:10:21,564 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 19:10:21,573 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:10:21" (1/1) ... [2018-02-02 19:10:21,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:10:21" (1/1) ... [2018-02-02 19:10:21,581 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:10:21" (1/1) ... [2018-02-02 19:10:21,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:10:21" (1/1) ... [2018-02-02 19:10:21,586 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:10:21" (1/1) ... [2018-02-02 19:10:21,588 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:10:21" (1/1) ... [2018-02-02 19:10:21,590 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:10:21" (1/1) ... [2018-02-02 19:10:21,592 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 19:10:21,592 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 19:10:21,592 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 19:10:21,592 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 19:10:21,593 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:10:21" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-02 19:10:21,626 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 19:10:21,626 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 19:10:21,626 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-02-02 19:10:21,626 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 19:10:21,626 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-02-02 19:10:21,626 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-02-02 19:10:21,626 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-02-02 19:10:21,627 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-02-02 19:10:21,627 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-02-02 19:10:21,627 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-02-02 19:10:21,627 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-02-02 19:10:21,627 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-02-02 19:10:21,627 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-02-02 19:10:21,627 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-02-02 19:10:21,627 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-02-02 19:10:21,627 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 19:10:21,627 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 19:10:21,627 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 19:10:21,627 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 19:10:21,627 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 19:10:21,628 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 19:10:21,628 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 19:10:21,628 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 19:10:21,628 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 19:10:21,628 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-02 19:10:21,628 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-02 19:10:21,628 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 19:10:21,628 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 19:10:21,628 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 19:10:21,628 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-02 19:10:21,628 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 19:10:21,628 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-02-02 19:10:21,628 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-02-02 19:10:21,628 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-02-02 19:10:21,629 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-02-02 19:10:21,629 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-02-02 19:10:21,629 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-02-02 19:10:21,629 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-02-02 19:10:21,629 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-02-02 19:10:21,629 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-02-02 19:10:21,629 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-02-02 19:10:21,629 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-02-02 19:10:21,629 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-02-02 19:10:21,629 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 19:10:21,629 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 19:10:21,629 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 19:10:21,629 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 19:10:21,787 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-02 19:10:21,890 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 19:10:21,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 07:10:21 BoogieIcfgContainer [2018-02-02 19:10:21,890 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 19:10:21,891 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 19:10:21,891 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 19:10:21,893 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 19:10:21,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 07:10:21" (1/3) ... [2018-02-02 19:10:21,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63cf5334 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 07:10:21, skipping insertion in model container [2018-02-02 19:10:21,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:10:21" (2/3) ... [2018-02-02 19:10:21,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63cf5334 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 07:10:21, skipping insertion in model container [2018-02-02 19:10:21,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 07:10:21" (3/3) ... [2018-02-02 19:10:21,895 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test22_3_false-valid-deref.i [2018-02-02 19:10:21,900 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 19:10:21,905 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-02-02 19:10:21,934 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 19:10:21,934 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 19:10:21,934 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 19:10:21,935 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 19:10:21,935 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 19:10:21,935 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 19:10:21,935 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 19:10:21,935 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 19:10:21,936 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 19:10:21,945 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states. [2018-02-02 19:10:21,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 19:10:21,954 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:10:21,954 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:10:21,954 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-02-02 19:10:21,960 INFO L82 PathProgramCache]: Analyzing trace with hash 556227080, now seen corresponding path program 1 times [2018-02-02 19:10:21,961 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:10:21,961 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:10:21,999 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:10:21,999 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:10:21,999 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:10:22,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:10:22,043 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:10:22,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:10:22,149 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:10:22,149 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:10:22,150 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 19:10:22,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 19:10:22,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:10:22,254 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 5 states. [2018-02-02 19:10:22,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:10:22,291 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2018-02-02 19:10:22,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:10:22,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 19:10:22,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:10:22,302 INFO L225 Difference]: With dead ends: 125 [2018-02-02 19:10:22,302 INFO L226 Difference]: Without dead ends: 122 [2018-02-02 19:10:22,304 INFO L554 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-02-02 19:10:22,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-02 19:10:22,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2018-02-02 19:10:22,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-02 19:10:22,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-02-02 19:10:22,336 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 17 [2018-02-02 19:10:22,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:10:22,337 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-02-02 19:10:22,337 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 19:10:22,337 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-02-02 19:10:22,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 19:10:22,338 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:10:22,338 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:10:22,338 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-02-02 19:10:22,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1895274134, now seen corresponding path program 1 times [2018-02-02 19:10:22,338 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:10:22,338 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:10:22,340 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:10:22,340 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:10:22,340 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:10:22,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:10:22,356 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:10:22,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:10:22,398 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:10:22,398 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:10:22,399 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:10:22,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:10:22,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:10:22,400 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 6 states. [2018-02-02 19:10:22,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:10:22,548 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2018-02-02 19:10:22,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 19:10:22,551 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 19:10:22,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:10:22,552 INFO L225 Difference]: With dead ends: 121 [2018-02-02 19:10:22,555 INFO L226 Difference]: Without dead ends: 121 [2018-02-02 19:10:22,555 INFO L554 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-02-02 19:10:22,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-02 19:10:22,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-02-02 19:10:22,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-02 19:10:22,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2018-02-02 19:10:22,563 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 19 [2018-02-02 19:10:22,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:10:22,563 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2018-02-02 19:10:22,563 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:10:22,563 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2018-02-02 19:10:22,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 19:10:22,564 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:10:22,564 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:10:22,564 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-02-02 19:10:22,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1895274133, now seen corresponding path program 1 times [2018-02-02 19:10:22,564 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:10:22,565 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:10:22,566 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:10:22,566 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:10:22,566 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:10:22,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:10:22,580 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:10:22,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:10:22,767 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:10:22,767 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 19:10:22,767 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 19:10:22,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 19:10:22,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:10:22,768 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 7 states. [2018-02-02 19:10:22,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:10:22,894 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2018-02-02 19:10:22,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 19:10:22,894 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-02-02 19:10:22,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:10:22,895 INFO L225 Difference]: With dead ends: 120 [2018-02-02 19:10:22,895 INFO L226 Difference]: Without dead ends: 120 [2018-02-02 19:10:22,896 INFO L554 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-02-02 19:10:22,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-02 19:10:22,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-02-02 19:10:22,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-02 19:10:22,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2018-02-02 19:10:22,907 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 19 [2018-02-02 19:10:22,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:10:22,907 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2018-02-02 19:10:22,907 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 19:10:22,907 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2018-02-02 19:10:22,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 19:10:22,908 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:10:22,908 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:10:22,908 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-02-02 19:10:22,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1715794329, now seen corresponding path program 1 times [2018-02-02 19:10:22,909 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:10:22,909 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:10:22,910 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:10:22,910 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:10:22,910 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:10:22,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:10:22,931 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:10:23,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:10:23,006 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:10:23,006 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 19:10:23,006 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 19:10:23,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 19:10:23,007 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:10:23,007 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand 7 states. [2018-02-02 19:10:23,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:10:23,058 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2018-02-02 19:10:23,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 19:10:23,058 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-02-02 19:10:23,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:10:23,059 INFO L225 Difference]: With dead ends: 131 [2018-02-02 19:10:23,059 INFO L226 Difference]: Without dead ends: 131 [2018-02-02 19:10:23,060 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 19:10:23,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-02 19:10:23,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2018-02-02 19:10:23,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-02 19:10:23,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 136 transitions. [2018-02-02 19:10:23,069 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 136 transitions. Word has length 29 [2018-02-02 19:10:23,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:10:23,069 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 136 transitions. [2018-02-02 19:10:23,069 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 19:10:23,070 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 136 transitions. [2018-02-02 19:10:23,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 19:10:23,071 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:10:23,071 INFO L351 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-02-02 19:10:23,071 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-02-02 19:10:23,071 INFO L82 PathProgramCache]: Analyzing trace with hash -785661208, now seen corresponding path program 1 times [2018-02-02 19:10:23,071 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:10:23,071 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:10:23,072 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:10:23,073 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:10:23,073 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:10:23,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:10:23,090 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:10:23,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:10:23,180 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:10:23,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 19:10:23,181 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 19:10:23,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 19:10:23,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 19:10:23,181 INFO L87 Difference]: Start difference. First operand 127 states and 136 transitions. Second operand 10 states. [2018-02-02 19:10:23,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:10:23,379 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2018-02-02 19:10:23,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 19:10:23,382 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-02-02 19:10:23,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:10:23,383 INFO L225 Difference]: With dead ends: 126 [2018-02-02 19:10:23,383 INFO L226 Difference]: Without dead ends: 126 [2018-02-02 19:10:23,384 INFO L554 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-02-02 19:10:23,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-02 19:10:23,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-02-02 19:10:23,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-02 19:10:23,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2018-02-02 19:10:23,391 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 34 [2018-02-02 19:10:23,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:10:23,392 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2018-02-02 19:10:23,392 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 19:10:23,392 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2018-02-02 19:10:23,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 19:10:23,392 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:10:23,393 INFO L351 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-02-02 19:10:23,395 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-02-02 19:10:23,396 INFO L82 PathProgramCache]: Analyzing trace with hash -785661207, now seen corresponding path program 1 times [2018-02-02 19:10:23,396 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:10:23,396 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:10:23,397 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:10:23,397 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:10:23,397 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:10:23,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:10:23,411 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:10:23,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:10:23,455 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:10:23,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 19:10:23,456 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 19:10:23,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 19:10:23,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 19:10:23,456 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand 4 states. [2018-02-02 19:10:23,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:10:23,469 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2018-02-02 19:10:23,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 19:10:23,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-02-02 19:10:23,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:10:23,471 INFO L225 Difference]: With dead ends: 129 [2018-02-02 19:10:23,471 INFO L226 Difference]: Without dead ends: 127 [2018-02-02 19:10:23,471 INFO L554 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-02-02 19:10:23,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-02 19:10:23,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-02-02 19:10:23,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-02 19:10:23,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 136 transitions. [2018-02-02 19:10:23,477 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 136 transitions. Word has length 34 [2018-02-02 19:10:23,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:10:23,478 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 136 transitions. [2018-02-02 19:10:23,478 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 19:10:23,478 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 136 transitions. [2018-02-02 19:10:23,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 19:10:23,479 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:10:23,479 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:10:23,479 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-02-02 19:10:23,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1322241719, now seen corresponding path program 1 times [2018-02-02 19:10:23,479 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:10:23,479 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:10:23,480 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:10:23,480 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:10:23,480 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:10:23,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:10:23,488 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:10:23,518 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 19:10:23,518 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:10:23,518 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 19:10:23,519 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 19:10:23,519 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 19:10:23,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 19:10:23,519 INFO L87 Difference]: Start difference. First operand 127 states and 136 transitions. Second operand 3 states. [2018-02-02 19:10:23,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:10:23,581 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2018-02-02 19:10:23,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 19:10:23,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-02-02 19:10:23,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:10:23,582 INFO L225 Difference]: With dead ends: 143 [2018-02-02 19:10:23,582 INFO L226 Difference]: Without dead ends: 131 [2018-02-02 19:10:23,583 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 19:10:23,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-02 19:10:23,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2018-02-02 19:10:23,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-02 19:10:23,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2018-02-02 19:10:23,589 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 32 [2018-02-02 19:10:23,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:10:23,589 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2018-02-02 19:10:23,589 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 19:10:23,589 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2018-02-02 19:10:23,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 19:10:23,590 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:10:23,590 INFO L351 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-02-02 19:10:23,590 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-02-02 19:10:23,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1082750419, now seen corresponding path program 1 times [2018-02-02 19:10:23,590 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:10:23,591 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:10:23,591 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:10:23,591 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:10:23,591 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:10:23,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:10:23,600 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:10:23,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:10:23,655 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:10:23,655 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 19:10:23,661 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:10:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:10:23,700 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:10:23,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:10:23,737 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:10:23,737 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-02-02 19:10:23,737 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:10:23,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:10:23,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:10:23,737 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand 6 states. [2018-02-02 19:10:23,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:10:23,754 INFO L93 Difference]: Finished difference Result 126 states and 134 transitions. [2018-02-02 19:10:23,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:10:23,754 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-02-02 19:10:23,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:10:23,755 INFO L225 Difference]: With dead ends: 126 [2018-02-02 19:10:23,755 INFO L226 Difference]: Without dead ends: 124 [2018-02-02 19:10:23,755 INFO L554 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-02-02 19:10:23,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-02 19:10:23,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-02-02 19:10:23,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-02 19:10:23,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2018-02-02 19:10:23,760 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 35 [2018-02-02 19:10:23,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:10:23,761 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2018-02-02 19:10:23,761 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:10:23,761 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2018-02-02 19:10:23,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 19:10:23,761 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:10:23,761 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:10:23,761 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-02-02 19:10:23,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1962528345, now seen corresponding path program 1 times [2018-02-02 19:10:23,762 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:10:23,762 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:10:23,762 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:10:23,763 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:10:23,763 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:10:23,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:10:23,767 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:10:23,792 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 19:10:23,792 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:10:23,793 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 19:10:23,793 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:10:23,793 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:10:23,793 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:10:23,793 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand 6 states. [2018-02-02 19:10:23,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:10:23,809 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2018-02-02 19:10:23,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 19:10:23,811 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-02-02 19:10:23,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:10:23,811 INFO L225 Difference]: With dead ends: 115 [2018-02-02 19:10:23,811 INFO L226 Difference]: Without dead ends: 115 [2018-02-02 19:10:23,812 INFO L554 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-02-02 19:10:23,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-02 19:10:23,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-02-02 19:10:23,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-02 19:10:23,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2018-02-02 19:10:23,816 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 34 [2018-02-02 19:10:23,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:10:23,816 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2018-02-02 19:10:23,816 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:10:23,816 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2018-02-02 19:10:23,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 19:10:23,817 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:10:23,817 INFO L351 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-02-02 19:10:23,817 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-02-02 19:10:23,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1126031319, now seen corresponding path program 2 times [2018-02-02 19:10:23,817 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:10:23,817 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:10:23,818 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:10:23,818 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:10:23,818 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:10:23,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:10:23,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:10:23,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:10:23,856 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:10:23,856 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 19:10:23,863 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 19:10:23,888 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-02 19:10:23,888 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:10:23,891 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:10:23,918 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-02-02 19:10:23,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:10:23,936 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-02-02 19:10:23,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:10:23,951 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-02-02 19:10:23,951 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-02-02 19:10:26,206 WARN L143 SmtUtils]: Spent 2036ms on a formula simplification that was a NOOP. DAG size: 27 [2018-02-02 19:10:26,462 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 19:10:26,479 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:10:26,479 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 19 [2018-02-02 19:10:26,479 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 19:10:26,480 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 19:10:26,480 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-02-02 19:10:26,480 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand 19 states. [2018-02-02 19:10:27,320 WARN L143 SmtUtils]: Spent 701ms on a formula simplification that was a NOOP. DAG size: 31 [2018-02-02 19:10:28,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:10:28,077 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2018-02-02 19:10:28,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 19:10:28,077 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-02-02 19:10:28,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:10:28,077 INFO L225 Difference]: With dead ends: 117 [2018-02-02 19:10:28,077 INFO L226 Difference]: Without dead ends: 115 [2018-02-02 19:10:28,078 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2018-02-02 19:10:28,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-02 19:10:28,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-02-02 19:10:28,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-02 19:10:28,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2018-02-02 19:10:28,081 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 36 [2018-02-02 19:10:28,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:10:28,081 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2018-02-02 19:10:28,082 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 19:10:28,082 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2018-02-02 19:10:28,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 19:10:28,083 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:10:28,083 INFO L351 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-02-02 19:10:28,083 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-02-02 19:10:28,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1693572500, now seen corresponding path program 1 times [2018-02-02 19:10:28,083 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:10:28,083 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:10:28,084 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:10:28,085 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:10:28,085 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:10:28,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:10:28,096 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:10:28,148 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 19:10:28,148 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:10:28,148 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 19:10:28,148 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 19:10:28,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 19:10:28,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 19:10:28,149 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand 10 states. [2018-02-02 19:10:28,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:10:28,287 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2018-02-02 19:10:28,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 19:10:28,287 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-02-02 19:10:28,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:10:28,288 INFO L225 Difference]: With dead ends: 113 [2018-02-02 19:10:28,288 INFO L226 Difference]: Without dead ends: 113 [2018-02-02 19:10:28,289 INFO L554 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-02-02 19:10:28,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-02 19:10:28,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-02-02 19:10:28,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-02 19:10:28,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2018-02-02 19:10:28,292 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 42 [2018-02-02 19:10:28,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:10:28,292 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2018-02-02 19:10:28,293 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 19:10:28,293 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-02-02 19:10:28,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 19:10:28,293 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:10:28,293 INFO L351 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-02-02 19:10:28,293 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-02-02 19:10:28,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1693572501, now seen corresponding path program 1 times [2018-02-02 19:10:28,294 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:10:28,294 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:10:28,294 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:10:28,296 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:10:28,297 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:10:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:10:28,310 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:10:28,362 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:10:28,362 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:10:28,362 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 19:10:28,371 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:10:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:10:28,392 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:10:28,398 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:10:28,417 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:10:28,417 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-02-02 19:10:28,417 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 19:10:28,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 19:10:28,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-02-02 19:10:28,417 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand 8 states. [2018-02-02 19:10:28,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:10:28,440 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2018-02-02 19:10:28,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 19:10:28,441 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-02-02 19:10:28,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:10:28,441 INFO L225 Difference]: With dead ends: 116 [2018-02-02 19:10:28,441 INFO L226 Difference]: Without dead ends: 114 [2018-02-02 19:10:28,441 INFO L554 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-02-02 19:10:28,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-02 19:10:28,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-02-02 19:10:28,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 19:10:28,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 120 transitions. [2018-02-02 19:10:28,445 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 120 transitions. Word has length 42 [2018-02-02 19:10:28,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:10:28,445 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 120 transitions. [2018-02-02 19:10:28,445 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 19:10:28,445 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions. [2018-02-02 19:10:28,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 19:10:28,446 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:10:28,446 INFO L351 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-02-02 19:10:28,446 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-02-02 19:10:28,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1124796031, now seen corresponding path program 2 times [2018-02-02 19:10:28,446 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:10:28,446 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:10:28,447 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:10:28,447 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:10:28,447 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:10:28,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:10:28,459 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:10:28,500 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:10:28,500 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:10:28,500 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 19:10:28,506 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 19:10:28,523 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-02 19:10:28,523 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:10:28,526 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:10:28,533 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-02-02 19:10:28,533 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:10:28,550 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-02-02 19:10:28,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:10:28,567 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-02-02 19:10:28,568 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-02-02 19:10:29,050 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 19:10:29,068 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:10:29,068 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 22 [2018-02-02 19:10:29,068 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 19:10:29,068 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 19:10:29,068 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2018-02-02 19:10:29,068 INFO L87 Difference]: Start difference. First operand 114 states and 120 transitions. Second operand 22 states. [2018-02-02 19:10:33,262 WARN L143 SmtUtils]: Spent 4020ms on a formula simplification that was a NOOP. DAG size: 31 [2018-02-02 19:10:33,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:10:33,847 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2018-02-02 19:10:33,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 19:10:33,848 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 43 [2018-02-02 19:10:33,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:10:33,848 INFO L225 Difference]: With dead ends: 115 [2018-02-02 19:10:33,848 INFO L226 Difference]: Without dead ends: 113 [2018-02-02 19:10:33,849 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=147, Invalid=845, Unknown=0, NotChecked=0, Total=992 [2018-02-02 19:10:33,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-02 19:10:33,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-02-02 19:10:33,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-02 19:10:33,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2018-02-02 19:10:33,851 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 43 [2018-02-02 19:10:33,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:10:33,851 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2018-02-02 19:10:33,852 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 19:10:33,852 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-02-02 19:10:33,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 19:10:33,852 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:10:33,852 INFO L351 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] [2018-02-02 19:10:33,852 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-02-02 19:10:33,853 INFO L82 PathProgramCache]: Analyzing trace with hash -889747813, now seen corresponding path program 1 times [2018-02-02 19:10:33,853 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:10:33,853 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:10:33,854 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:10:33,854 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:10:33,854 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:10:33,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:10:33,862 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:10:33,907 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-02 19:10:33,907 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:10:33,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 19:10:33,908 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 19:10:33,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 19:10:33,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 19:10:33,908 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand 8 states. [2018-02-02 19:10:33,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:10:33,933 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2018-02-02 19:10:33,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 19:10:33,935 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-02-02 19:10:33,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:10:33,935 INFO L225 Difference]: With dead ends: 115 [2018-02-02 19:10:33,935 INFO L226 Difference]: Without dead ends: 113 [2018-02-02 19:10:33,935 INFO L554 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-02-02 19:10:33,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-02 19:10:33,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-02-02 19:10:33,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-02 19:10:33,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 118 transitions. [2018-02-02 19:10:33,939 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 118 transitions. Word has length 49 [2018-02-02 19:10:33,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:10:33,940 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 118 transitions. [2018-02-02 19:10:33,940 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 19:10:33,940 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2018-02-02 19:10:33,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 19:10:33,940 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:10:33,940 INFO L351 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] [2018-02-02 19:10:33,941 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-02-02 19:10:33,941 INFO L82 PathProgramCache]: Analyzing trace with hash 2041611084, now seen corresponding path program 1 times [2018-02-02 19:10:33,941 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:10:33,941 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:10:33,942 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:10:33,942 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:10:33,942 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:10:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:10:33,951 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:10:34,018 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-02 19:10:34,018 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:10:34,018 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 19:10:34,018 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 19:10:34,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 19:10:34,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 19:10:34,019 INFO L87 Difference]: Start difference. First operand 113 states and 118 transitions. Second operand 10 states. [2018-02-02 19:10:34,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:10:34,058 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2018-02-02 19:10:34,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 19:10:34,058 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-02-02 19:10:34,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:10:34,059 INFO L225 Difference]: With dead ends: 117 [2018-02-02 19:10:34,059 INFO L226 Difference]: Without dead ends: 113 [2018-02-02 19:10:34,059 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-02 19:10:34,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-02 19:10:34,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-02-02 19:10:34,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-02 19:10:34,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2018-02-02 19:10:34,062 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 54 [2018-02-02 19:10:34,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:10:34,062 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2018-02-02 19:10:34,062 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 19:10:34,062 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2018-02-02 19:10:34,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 19:10:34,063 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:10:34,063 INFO L351 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] [2018-02-02 19:10:34,063 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-02-02 19:10:34,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1648870102, now seen corresponding path program 1 times [2018-02-02 19:10:34,063 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:10:34,063 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:10:34,064 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:10:34,064 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:10:34,064 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:10:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:10:34,073 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:10:34,223 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-02 19:10:34,224 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:10:34,224 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-02-02 19:10:34,224 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 19:10:34,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 19:10:34,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-02-02 19:10:34,224 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand 21 states. [2018-02-02 19:10:34,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:10:34,528 INFO L93 Difference]: Finished difference Result 141 states and 152 transitions. [2018-02-02 19:10:34,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 19:10:34,528 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 65 [2018-02-02 19:10:34,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:10:34,529 INFO L225 Difference]: With dead ends: 141 [2018-02-02 19:10:34,529 INFO L226 Difference]: Without dead ends: 141 [2018-02-02 19:10:34,529 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2018-02-02 19:10:34,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-02 19:10:34,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 136. [2018-02-02 19:10:34,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-02-02 19:10:34,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2018-02-02 19:10:34,532 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 65 [2018-02-02 19:10:34,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:10:34,533 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2018-02-02 19:10:34,533 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 19:10:34,533 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2018-02-02 19:10:34,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 19:10:34,534 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:10:34,534 INFO L351 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] [2018-02-02 19:10:34,534 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-02-02 19:10:34,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1648870101, now seen corresponding path program 1 times [2018-02-02 19:10:34,534 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:10:34,534 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:10:34,535 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:10:34,535 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:10:34,535 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:10:34,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:10:34,550 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:10:34,616 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:10:34,617 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:10:34,617 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 19:10:34,628 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:10:34,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:10:34,674 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:10:34,691 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:10:34,717 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:10:34,717 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-02-02 19:10:34,718 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 19:10:34,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 19:10:34,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-02-02 19:10:34,718 INFO L87 Difference]: Start difference. First operand 136 states and 148 transitions. Second operand 10 states. [2018-02-02 19:10:34,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:10:34,735 INFO L93 Difference]: Finished difference Result 139 states and 151 transitions. [2018-02-02 19:10:34,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 19:10:34,751 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2018-02-02 19:10:34,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:10:34,752 INFO L225 Difference]: With dead ends: 139 [2018-02-02 19:10:34,752 INFO L226 Difference]: Without dead ends: 137 [2018-02-02 19:10:34,752 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 65 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-02-02 19:10:34,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-02-02 19:10:34,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-02-02 19:10:34,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-02 19:10:34,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2018-02-02 19:10:34,756 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 149 transitions. Word has length 65 [2018-02-02 19:10:34,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:10:34,756 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 149 transitions. [2018-02-02 19:10:34,756 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 19:10:34,756 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 149 transitions. [2018-02-02 19:10:34,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 19:10:34,757 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:10:34,757 INFO L351 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] [2018-02-02 19:10:34,757 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-02-02 19:10:34,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1958826751, now seen corresponding path program 2 times [2018-02-02 19:10:34,757 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:10:34,757 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:10:34,758 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:10:34,758 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:10:34,758 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:10:34,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:10:34,771 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:10:34,844 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:10:34,844 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:10:34,845 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 19:10:34,859 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 19:10:34,899 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-02 19:10:34,899 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:10:34,906 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:10:34,935 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-02-02 19:10:34,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:10:34,947 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-02-02 19:10:34,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:10:34,958 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-02-02 19:10:34,958 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-02-02 19:10:37,157 WARN L143 SmtUtils]: Spent 2012ms on a formula simplification that was a NOOP. DAG size: 21 [2018-02-02 19:10:37,570 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-02-02 19:10:37,587 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:10:37,587 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [10] total 29 [2018-02-02 19:10:37,588 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 19:10:37,588 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 19:10:37,588 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=705, Unknown=0, NotChecked=0, Total=812 [2018-02-02 19:10:37,588 INFO L87 Difference]: Start difference. First operand 137 states and 149 transitions. Second operand 29 states. [2018-02-02 19:10:43,788 WARN L143 SmtUtils]: Spent 6027ms on a formula simplification that was a NOOP. DAG size: 31 [2018-02-02 19:10:49,826 WARN L143 SmtUtils]: Spent 6024ms on a formula simplification that was a NOOP. DAG size: 31 [2018-02-02 19:10:51,857 WARN L143 SmtUtils]: Spent 2019ms on a formula simplification that was a NOOP. DAG size: 31 [2018-02-02 19:10:53,620 WARN L143 SmtUtils]: Spent 1744ms on a formula simplification that was a NOOP. DAG size: 31 [2018-02-02 19:10:55,656 WARN L143 SmtUtils]: Spent 2019ms on a formula simplification that was a NOOP. DAG size: 31 [2018-02-02 19:10:56,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:10:56,385 INFO L93 Difference]: Finished difference Result 138 states and 148 transitions. [2018-02-02 19:10:56,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 19:10:56,385 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 66 [2018-02-02 19:10:56,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:10:56,385 INFO L225 Difference]: With dead ends: 138 [2018-02-02 19:10:56,385 INFO L226 Difference]: Without dead ends: 136 [2018-02-02 19:10:56,386 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=227, Invalid=1579, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 19:10:56,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-02-02 19:10:56,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-02-02 19:10:56,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-02-02 19:10:56,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 146 transitions. [2018-02-02 19:10:56,388 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 146 transitions. Word has length 66 [2018-02-02 19:10:56,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:10:56,388 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 146 transitions. [2018-02-02 19:10:56,388 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 19:10:56,388 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 146 transitions. [2018-02-02 19:10:56,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 19:10:56,389 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:10:56,389 INFO L351 BasicCegarLoop]: trace histogram [7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:10:56,389 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-02-02 19:10:56,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1967521112, now seen corresponding path program 1 times [2018-02-02 19:10:56,389 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:10:56,389 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:10:56,390 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:10:56,390 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:10:56,390 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:10:56,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:10:56,401 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:10:56,469 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-02-02 19:10:56,469 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:10:56,469 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 19:10:56,480 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:10:56,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:10:56,510 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:10:56,603 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 19:10:56,623 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:10:56,623 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-02-02 19:10:56,623 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 19:10:56,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 19:10:56,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2018-02-02 19:10:56,624 INFO L87 Difference]: Start difference. First operand 136 states and 146 transitions. Second operand 20 states. [2018-02-02 19:10:56,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:10:56,709 INFO L93 Difference]: Finished difference Result 140 states and 146 transitions. [2018-02-02 19:10:56,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 19:10:56,709 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 70 [2018-02-02 19:10:56,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:10:56,710 INFO L225 Difference]: With dead ends: 140 [2018-02-02 19:10:56,710 INFO L226 Difference]: Without dead ends: 134 [2018-02-02 19:10:56,710 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2018-02-02 19:10:56,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-02 19:10:56,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-02-02 19:10:56,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-02 19:10:56,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 140 transitions. [2018-02-02 19:10:56,714 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 140 transitions. Word has length 70 [2018-02-02 19:10:56,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:10:56,714 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 140 transitions. [2018-02-02 19:10:56,714 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 19:10:56,714 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 140 transitions. [2018-02-02 19:10:56,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 19:10:56,715 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:10:56,715 INFO L351 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] [2018-02-02 19:10:56,715 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-02-02 19:10:56,715 INFO L82 PathProgramCache]: Analyzing trace with hash -170218834, now seen corresponding path program 1 times [2018-02-02 19:10:56,715 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:10:56,716 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:10:56,716 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:10:56,716 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:10:56,716 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:10:56,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:10:56,732 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:10:56,989 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 19:10:56,989 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:10:56,989 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-02-02 19:10:56,989 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 19:10:56,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 19:10:56,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2018-02-02 19:10:56,990 INFO L87 Difference]: Start difference. First operand 134 states and 140 transitions. Second operand 25 states. [2018-02-02 19:10:57,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:10:57,442 INFO L93 Difference]: Finished difference Result 144 states and 153 transitions. [2018-02-02 19:10:57,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 19:10:57,443 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 82 [2018-02-02 19:10:57,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:10:57,443 INFO L225 Difference]: With dead ends: 144 [2018-02-02 19:10:57,443 INFO L226 Difference]: Without dead ends: 144 [2018-02-02 19:10:57,444 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 19:10:57,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-02-02 19:10:57,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 140. [2018-02-02 19:10:57,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-02 19:10:57,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 150 transitions. [2018-02-02 19:10:57,446 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 150 transitions. Word has length 82 [2018-02-02 19:10:57,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:10:57,446 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 150 transitions. [2018-02-02 19:10:57,446 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 19:10:57,446 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 150 transitions. [2018-02-02 19:10:57,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 19:10:57,447 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:10:57,447 INFO L351 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] [2018-02-02 19:10:57,447 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-02-02 19:10:57,447 INFO L82 PathProgramCache]: Analyzing trace with hash -170218833, now seen corresponding path program 1 times [2018-02-02 19:10:57,447 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:10:57,447 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:10:57,448 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:10:57,448 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:10:57,448 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:10:57,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:10:57,459 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:10:57,518 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:10:57,519 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:10:57,519 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 19:10:57,529 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:10:57,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:10:57,581 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:10:57,598 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:10:57,635 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:10:57,636 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-02-02 19:10:57,636 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 19:10:57,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 19:10:57,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-02 19:10:57,637 INFO L87 Difference]: Start difference. First operand 140 states and 150 transitions. Second operand 13 states. [2018-02-02 19:10:57,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:10:57,671 INFO L93 Difference]: Finished difference Result 143 states and 153 transitions. [2018-02-02 19:10:57,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 19:10:57,671 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 82 [2018-02-02 19:10:57,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:10:57,672 INFO L225 Difference]: With dead ends: 143 [2018-02-02 19:10:57,672 INFO L226 Difference]: Without dead ends: 141 [2018-02-02 19:10:57,672 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2018-02-02 19:10:57,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-02 19:10:57,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-02-02 19:10:57,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-02-02 19:10:57,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 151 transitions. [2018-02-02 19:10:57,679 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 151 transitions. Word has length 82 [2018-02-02 19:10:57,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:10:57,679 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 151 transitions. [2018-02-02 19:10:57,679 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 19:10:57,679 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 151 transitions. [2018-02-02 19:10:57,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-02 19:10:57,680 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:10:57,680 INFO L351 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] [2018-02-02 19:10:57,680 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-02-02 19:10:57,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1743576679, now seen corresponding path program 2 times [2018-02-02 19:10:57,681 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:10:57,681 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:10:57,681 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:10:57,681 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:10:57,681 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:10:57,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:10:57,698 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:10:57,784 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:10:57,785 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:10:57,785 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 19:10:57,790 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 19:10:57,827 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-02 19:10:57,827 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:10:57,830 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:10:57,833 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-02-02 19:10:57,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:10:57,862 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-02-02 19:10:57,863 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:10:57,873 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-02-02 19:10:57,874 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-02-02 19:10:58,894 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-02-02 19:10:58,913 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:10:58,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [13] total 36 [2018-02-02 19:10:58,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-02 19:10:58,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-02 19:10:58,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1107, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 19:10:58,914 INFO L87 Difference]: Start difference. First operand 141 states and 151 transitions. Second operand 36 states. [2018-02-02 19:11:05,205 WARN L143 SmtUtils]: Spent 6038ms on a formula simplification that was a NOOP. DAG size: 35 [2018-02-02 19:11:07,313 WARN L143 SmtUtils]: Spent 2020ms on a formula simplification that was a NOOP. DAG size: 35 [2018-02-02 19:11:13,436 WARN L143 SmtUtils]: Spent 6029ms on a formula simplification that was a NOOP. DAG size: 35 [2018-02-02 19:11:15,484 WARN L143 SmtUtils]: Spent 2022ms on a formula simplification that was a NOOP. DAG size: 36 [2018-02-02 19:11:16,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:11:16,506 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2018-02-02 19:11:16,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-02 19:11:16,506 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 83 [2018-02-02 19:11:16,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:11:16,507 INFO L225 Difference]: With dead ends: 142 [2018-02-02 19:11:16,507 INFO L226 Difference]: Without dead ends: 140 [2018-02-02 19:11:16,508 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 678 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=348, Invalid=2622, Unknown=0, NotChecked=0, Total=2970 [2018-02-02 19:11:16,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-02-02 19:11:16,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-02-02 19:11:16,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-02 19:11:16,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 149 transitions. [2018-02-02 19:11:16,511 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 149 transitions. Word has length 83 [2018-02-02 19:11:16,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:11:16,511 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 149 transitions. [2018-02-02 19:11:16,511 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-02 19:11:16,511 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 149 transitions. [2018-02-02 19:11:16,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-02 19:11:16,513 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:11:16,513 INFO L351 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] [2018-02-02 19:11:16,513 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-02-02 19:11:16,513 INFO L82 PathProgramCache]: Analyzing trace with hash 470121776, now seen corresponding path program 1 times [2018-02-02 19:11:16,513 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:11:16,514 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:11:16,514 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:11:16,515 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:11:16,515 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:11:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:11:16,535 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:11:16,664 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:11:16,664 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:11:16,664 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 19:11:16,677 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:11:16,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:11:16,754 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:11:16,766 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:11:16,797 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:11:16,797 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-02-02 19:11:16,798 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 19:11:16,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 19:11:16,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-02-02 19:11:16,801 INFO L87 Difference]: Start difference. First operand 140 states and 149 transitions. Second operand 15 states. [2018-02-02 19:11:16,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:11:16,846 INFO L93 Difference]: Finished difference Result 143 states and 152 transitions. [2018-02-02 19:11:16,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 19:11:16,846 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 88 [2018-02-02 19:11:16,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:11:16,847 INFO L225 Difference]: With dead ends: 143 [2018-02-02 19:11:16,847 INFO L226 Difference]: Without dead ends: 141 [2018-02-02 19:11:16,848 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=97, Invalid=143, Unknown=0, NotChecked=0, Total=240 [2018-02-02 19:11:16,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-02 19:11:16,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-02-02 19:11:16,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-02-02 19:11:16,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 150 transitions. [2018-02-02 19:11:16,852 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 150 transitions. Word has length 88 [2018-02-02 19:11:16,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:11:16,852 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 150 transitions. [2018-02-02 19:11:16,852 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 19:11:16,852 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 150 transitions. [2018-02-02 19:11:16,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-02 19:11:16,853 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:11:16,853 INFO L351 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] [2018-02-02 19:11:16,853 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-02-02 19:11:16,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1375757158, now seen corresponding path program 2 times [2018-02-02 19:11:16,854 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:11:16,854 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:11:16,855 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:11:16,855 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:11:16,855 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:11:16,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:11:16,871 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:11:16,984 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:11:16,984 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:11:16,984 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 19:11:16,989 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 19:11:17,064 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 19:11:17,064 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:11:17,068 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:11:17,082 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:11:17,116 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:11:17,116 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-02-02 19:11:17,117 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 19:11:17,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 19:11:17,117 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2018-02-02 19:11:17,117 INFO L87 Difference]: Start difference. First operand 141 states and 150 transitions. Second operand 16 states. [2018-02-02 19:11:17,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:11:17,156 INFO L93 Difference]: Finished difference Result 144 states and 153 transitions. [2018-02-02 19:11:17,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 19:11:17,157 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 89 [2018-02-02 19:11:17,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:11:17,157 INFO L225 Difference]: With dead ends: 144 [2018-02-02 19:11:17,157 INFO L226 Difference]: Without dead ends: 142 [2018-02-02 19:11:17,158 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=111, Invalid=161, Unknown=0, NotChecked=0, Total=272 [2018-02-02 19:11:17,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-02-02 19:11:17,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-02-02 19:11:17,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-02 19:11:17,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 151 transitions. [2018-02-02 19:11:17,161 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 151 transitions. Word has length 89 [2018-02-02 19:11:17,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:11:17,161 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 151 transitions. [2018-02-02 19:11:17,161 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 19:11:17,161 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2018-02-02 19:11:17,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-02-02 19:11:17,162 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:11:17,162 INFO L351 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] [2018-02-02 19:11:17,162 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-02-02 19:11:17,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1531538032, now seen corresponding path program 3 times [2018-02-02 19:11:17,162 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:11:17,163 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:11:17,163 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:11:17,163 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:11:17,163 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:11:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:11:17,178 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:11:17,300 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:11:17,300 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:11:17,300 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 19:11:17,314 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 19:11:18,523 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-02-02 19:11:18,523 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:11:18,527 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:11:18,710 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:11:18,729 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:11:18,729 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21] total 35 [2018-02-02 19:11:18,730 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 19:11:18,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 19:11:18,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=862, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 19:11:18,730 INFO L87 Difference]: Start difference. First operand 142 states and 151 transitions. Second operand 35 states. [2018-02-02 19:11:18,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:11:18,809 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2018-02-02 19:11:18,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 19:11:18,809 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 90 [2018-02-02 19:11:18,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:11:18,810 INFO L225 Difference]: With dead ends: 145 [2018-02-02 19:11:18,810 INFO L226 Difference]: Without dead ends: 143 [2018-02-02 19:11:18,810 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=368, Invalid=1038, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 19:11:18,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-02 19:11:18,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-02-02 19:11:18,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-02 19:11:18,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 152 transitions. [2018-02-02 19:11:18,813 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 152 transitions. Word has length 90 [2018-02-02 19:11:18,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:11:18,813 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 152 transitions. [2018-02-02 19:11:18,813 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 19:11:18,813 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 152 transitions. [2018-02-02 19:11:18,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-02-02 19:11:18,814 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:11:18,814 INFO L351 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] [2018-02-02 19:11:18,814 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-02-02 19:11:18,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1463375706, now seen corresponding path program 4 times [2018-02-02 19:11:18,815 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:11:18,815 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:11:18,815 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:11:18,815 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:11:18,816 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:11:18,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:11:18,826 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:11:18,954 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:11:18,955 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:11:18,955 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 19:11:18,964 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 19:11:19,071 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 19:11:19,071 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:11:19,075 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:11:19,092 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:11:19,126 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:11:19,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-02-02 19:11:19,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 19:11:19,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 19:11:19,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-02-02 19:11:19,127 INFO L87 Difference]: Start difference. First operand 143 states and 152 transitions. Second operand 18 states. [2018-02-02 19:11:19,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:11:19,184 INFO L93 Difference]: Finished difference Result 146 states and 155 transitions. [2018-02-02 19:11:19,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 19:11:19,184 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 91 [2018-02-02 19:11:19,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:11:19,185 INFO L225 Difference]: With dead ends: 146 [2018-02-02 19:11:19,185 INFO L226 Difference]: Without dead ends: 144 [2018-02-02 19:11:19,185 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 91 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-02-02 19:11:19,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-02-02 19:11:19,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-02-02 19:11:19,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-02 19:11:19,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 153 transitions. [2018-02-02 19:11:19,189 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 153 transitions. Word has length 91 [2018-02-02 19:11:19,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:11:19,189 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 153 transitions. [2018-02-02 19:11:19,189 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 19:11:19,189 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2018-02-02 19:11:19,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-02 19:11:19,190 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:11:19,190 INFO L351 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] [2018-02-02 19:11:19,190 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-02-02 19:11:19,190 INFO L82 PathProgramCache]: Analyzing trace with hash -649656400, now seen corresponding path program 5 times [2018-02-02 19:11:19,190 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:11:19,191 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:11:19,191 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:11:19,191 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:11:19,191 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:11:19,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:11:19,207 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:11:19,476 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:11:19,476 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:11:19,476 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 19:11:19,482 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 19:11:19,798 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-02-02 19:11:19,798 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:11:19,803 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:11:19,814 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:11:19,833 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:11:19,833 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-02-02 19:11:19,833 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 19:11:19,834 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 19:11:19,834 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-02-02 19:11:19,834 INFO L87 Difference]: Start difference. First operand 144 states and 153 transitions. Second operand 19 states. [2018-02-02 19:11:19,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:11:19,868 INFO L93 Difference]: Finished difference Result 147 states and 156 transitions. [2018-02-02 19:11:19,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 19:11:19,883 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2018-02-02 19:11:19,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:11:19,884 INFO L225 Difference]: With dead ends: 147 [2018-02-02 19:11:19,884 INFO L226 Difference]: Without dead ends: 145 [2018-02-02 19:11:19,884 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 92 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-02-02 19:11:19,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-02 19:11:19,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-02-02 19:11:19,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-02 19:11:19,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 154 transitions. [2018-02-02 19:11:19,887 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 154 transitions. Word has length 92 [2018-02-02 19:11:19,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:11:19,888 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 154 transitions. [2018-02-02 19:11:19,888 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 19:11:19,888 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 154 transitions. [2018-02-02 19:11:19,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-02 19:11:19,888 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:11:19,888 INFO L351 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] [2018-02-02 19:11:19,889 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-02-02 19:11:19,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1729142246, now seen corresponding path program 6 times [2018-02-02 19:11:19,889 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:11:19,889 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:11:19,890 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:11:19,890 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:11:19,890 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:11:19,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:11:19,907 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:11:20,031 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:11:20,032 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:11:20,032 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 19:11:20,036 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 19:11:23,998 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-02-02 19:11:23,998 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:11:24,003 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:11:24,033 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:11:24,055 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:11:24,055 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-02-02 19:11:24,056 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 19:11:24,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 19:11:24,056 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2018-02-02 19:11:24,056 INFO L87 Difference]: Start difference. First operand 145 states and 154 transitions. Second operand 20 states. [2018-02-02 19:11:24,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:11:24,085 INFO L93 Difference]: Finished difference Result 148 states and 157 transitions. [2018-02-02 19:11:24,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 19:11:24,085 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 93 [2018-02-02 19:11:24,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:11:24,086 INFO L225 Difference]: With dead ends: 148 [2018-02-02 19:11:24,086 INFO L226 Difference]: Without dead ends: 146 [2018-02-02 19:11:24,086 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 93 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-02-02 19:11:24,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-02 19:11:24,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-02-02 19:11:24,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-02 19:11:24,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 155 transitions. [2018-02-02 19:11:24,089 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 155 transitions. Word has length 93 [2018-02-02 19:11:24,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:11:24,089 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 155 transitions. [2018-02-02 19:11:24,089 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 19:11:24,090 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 155 transitions. [2018-02-02 19:11:24,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 19:11:24,091 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:11:24,091 INFO L351 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] [2018-02-02 19:11:24,091 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-02-02 19:11:24,091 INFO L82 PathProgramCache]: Analyzing trace with hash -833465104, now seen corresponding path program 7 times [2018-02-02 19:11:24,091 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:11:24,091 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:11:24,092 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:11:24,092 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:11:24,092 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:11:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:11:24,149 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:11:26,695 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:11:26,695 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:11:26,695 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:11:26,700 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:11:26,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:11:26,744 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:11:26,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-02 19:11:26,806 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 10 treesize of output 9 [2018-02-02 19:11:26,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:11:26,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:11:26,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:11:26,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-02-02 19:11:26,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-02-02 19:11:26,853 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:26,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-02-02 19:11:26,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:11:26,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:11:26,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:11:26,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2018-02-02 19:11:26,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-02-02 19:11:26,922 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:26,923 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:26,923 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:26,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 52 [2018-02-02 19:11:26,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:11:26,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:11:26,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 19:11:26,941 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2018-02-02 19:11:27,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2018-02-02 19:11:27,025 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,026 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,027 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,027 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,028 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,029 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 85 [2018-02-02 19:11:27,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:11:27,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:11:27,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-02 19:11:27,054 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:68, output treesize:64 [2018-02-02 19:11:27,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 47 [2018-02-02 19:11:27,137 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,138 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,139 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,140 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,140 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,141 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,142 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,143 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,144 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,144 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 126 [2018-02-02 19:11:27,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:11:27,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:11:27,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-02 19:11:27,181 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:84, output treesize:80 [2018-02-02 19:11:27,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2018-02-02 19:11:27,267 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,268 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,268 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,269 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,270 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,271 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,271 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,272 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,273 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,273 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,274 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,275 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,276 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,276 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,277 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 175 [2018-02-02 19:11:27,278 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:11:27,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:11:27,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-02-02 19:11:27,318 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:100, output treesize:96 [2018-02-02 19:11:27,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 65 [2018-02-02 19:11:27,466 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,467 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,467 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,468 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,469 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,470 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,470 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,471 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,472 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,472 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,473 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,474 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,475 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,475 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,476 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,477 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,477 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,478 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,479 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,480 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,480 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 232 [2018-02-02 19:11:27,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:11:27,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:11:27,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-02-02 19:11:27,538 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:116, output treesize:112 [2018-02-02 19:11:27,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 74 [2018-02-02 19:11:27,936 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,937 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,938 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,939 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,940 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,941 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,942 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,943 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,944 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,945 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,946 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,951 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,952 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,953 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,953 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,954 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,955 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,956 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,957 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,957 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,958 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,959 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,960 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,961 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,962 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,962 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,963 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,964 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:27,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 297 [2018-02-02 19:11:27,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:11:28,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:11:28,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-02-02 19:11:28,048 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:132, output treesize:128 [2018-02-02 19:11:32,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 83 [2018-02-02 19:11:32,869 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:32,870 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:32,871 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:32,871 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:32,872 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:32,873 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:32,873 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:32,874 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:32,875 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:32,876 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:32,877 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:32,878 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:32,878 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:32,879 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:32,880 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:32,881 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:32,882 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:32,882 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:32,883 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:32,884 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:32,885 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:32,886 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:32,887 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:32,888 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:32,889 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:32,889 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:32,890 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:32,891 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:32,891 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:32,892 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:32,893 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:32,894 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:32,894 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:32,895 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:32,896 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:32,897 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:32,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 370 [2018-02-02 19:11:32,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:11:32,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:11:33,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-02-02 19:11:33,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:148, output treesize:144 [2018-02-02 19:11:45,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 92 [2018-02-02 19:11:45,777 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:45,778 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:45,779 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:45,779 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:45,780 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:45,781 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:45,782 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:45,783 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:45,783 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:45,784 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:45,785 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:45,786 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:45,787 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:45,787 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:45,788 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:45,789 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:45,790 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:45,790 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:45,791 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:45,792 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:45,793 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:45,794 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:45,794 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:45,795 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:45,796 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:45,797 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:45,798 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:45,798 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:45,800 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:45,801 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:45,802 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:45,803 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:45,804 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:45,805 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:45,805 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:45,806 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:45,815 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:45,816 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:45,817 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:45,818 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:45,819 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:45,819 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:45,820 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:45,821 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:45,822 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:11:45,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 451 [2018-02-02 19:11:45,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:11:45,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:11:45,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2018-02-02 19:11:45,943 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:164, output treesize:160 Received shutdown request... [2018-02-02 19:12:01,515 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-02 19:12:01,515 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 19:12:01,519 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 19:12:01,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 07:12:01 BoogieIcfgContainer [2018-02-02 19:12:01,519 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 19:12:01,520 INFO L168 Benchmark]: Toolchain (without parser) took 100119.40 ms. Allocated memory was 403.2 MB in the beginning and 984.1 MB in the end (delta: 580.9 MB). Free memory was 359.9 MB in the beginning and 913.2 MB in the end (delta: -553.4 MB). Peak memory consumption was 549.9 MB. Max. memory is 5.3 GB. [2018-02-02 19:12:01,521 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 403.2 MB. Free memory is still 366.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 19:12:01,521 INFO L168 Benchmark]: CACSL2BoogieTranslator took 161.68 ms. Allocated memory is still 403.2 MB. Free memory was 359.9 MB in the beginning and 345.3 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. [2018-02-02 19:12:01,521 INFO L168 Benchmark]: Boogie Preprocessor took 28.74 ms. Allocated memory is still 403.2 MB. Free memory was 345.3 MB in the beginning and 344.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 19:12:01,521 INFO L168 Benchmark]: RCFGBuilder took 297.90 ms. Allocated memory is still 403.2 MB. Free memory was 344.0 MB in the beginning and 310.9 MB in the end (delta: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 5.3 GB. [2018-02-02 19:12:01,522 INFO L168 Benchmark]: TraceAbstraction took 99628.41 ms. Allocated memory was 403.2 MB in the beginning and 984.1 MB in the end (delta: 580.9 MB). Free memory was 310.9 MB in the beginning and 913.2 MB in the end (delta: -602.4 MB). Peak memory consumption was 500.8 MB. Max. memory is 5.3 GB. [2018-02-02 19:12:01,523 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.16 ms. Allocated memory is still 403.2 MB. Free memory is still 366.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 161.68 ms. Allocated memory is still 403.2 MB. Free memory was 359.9 MB in the beginning and 345.3 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.74 ms. Allocated memory is still 403.2 MB. Free memory was 345.3 MB in the beginning and 344.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 297.90 ms. Allocated memory is still 403.2 MB. Free memory was 344.0 MB in the beginning and 310.9 MB in the end (delta: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 99628.41 ms. Allocated memory was 403.2 MB in the beginning and 984.1 MB in the end (delta: 580.9 MB). Free memory was 310.9 MB in the beginning and 913.2 MB in the end (delta: -602.4 MB). Peak memory consumption was 500.8 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 95 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 69 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 95 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 69 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 95 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 69 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 95 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 69 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 95 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 69 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 95 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 69 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 95 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 69 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 95 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 69 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 69 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 69 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 69 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 69 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 95 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 69 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 95 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 69 known predicates. - TimeoutResultAtElement [Line: 1443]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1443). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 69 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 95 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 69 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 95 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 69 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 95 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 69 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 95 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 69 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 18 procedures, 119 locations, 19 error locations. TIMEOUT Result, 99.5s OverallTime, 29 OverallIterations, 16 TraceHistogramMax, 45.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2898 SDtfs, 723 SDslu, 24520 SDs, 0 SdLazy, 7203 SolverSat, 227 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1456 GetRequests, 999 SyntacticMatches, 5 SemanticMatches, 452 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2121 ImplicationChecksByTransitivity, 48.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=28, 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, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 28 MinimizatonAttempts, 27 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 6.1s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 2640 NumberOfCodeBlocks, 2619 NumberOfCodeBlocksAsserted, 66 NumberOfCheckSat, 2597 ConstructedInterpolants, 176 QuantifiedInterpolants, 582813 SizeOfPredicates, 67 NumberOfNonLiveVariables, 5238 ConjunctsInSsa, 394 ConjunctsInUnsatCore, 43 InterpolantComputations, 17 PerfectInterpolantSequences, 207/1463 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_19-12-01-528.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_19-12-01-528.csv Completed graceful shutdown