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_2_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 19:27:40,588 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 19:27:40,590 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 19:27:40,604 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 19:27:40,604 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 19:27:40,605 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 19:27:40,606 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 19:27:40,608 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 19:27:40,610 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 19:27:40,610 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 19:27:40,611 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 19:27:40,611 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 19:27:40,612 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 19:27:40,613 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 19:27:40,614 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 19:27:40,616 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 19:27:40,617 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 19:27:40,619 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 19:27:40,620 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 19:27:40,621 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 19:27:40,623 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 19:27:40,623 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 19:27:40,623 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 19:27:40,624 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 19:27:40,625 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 19:27:40,626 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 19:27:40,626 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 19:27:40,627 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 19:27:40,627 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 19:27:40,627 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 19:27:40,627 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 19:27:40,628 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:27:40,637 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 19:27:40,638 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 19:27:40,639 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 19:27:40,639 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 19:27:40,639 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 19:27:40,639 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 19:27:40,639 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 19:27:40,640 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 19:27:40,640 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 19:27:40,640 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 19:27:40,640 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 19:27:40,640 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 19:27:40,640 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 19:27:40,640 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 19:27:40,641 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 19:27:40,641 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 19:27:40,641 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 19:27:40,641 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 19:27:40,641 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 19:27:40,641 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 19:27:40,642 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 19:27:40,642 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 19:27:40,642 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 19:27:40,642 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 19:27:40,642 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 19:27:40,670 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 19:27:40,682 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 19:27:40,688 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 19:27:40,689 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 19:27:40,689 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 19:27:40,690 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_2_true-valid-memsafety_true-termination.i [2018-02-02 19:27:40,844 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 19:27:40,845 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 19:27:40,846 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 19:27:40,846 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 19:27:40,851 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 19:27:40,852 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 07:27:40" (1/1) ... [2018-02-02 19:27:40,854 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30ce2b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:27:40, skipping insertion in model container [2018-02-02 19:27:40,855 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 07:27:40" (1/1) ... [2018-02-02 19:27:40,865 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 19:27:40,903 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 19:27:40,999 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 19:27:41,015 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 19:27:41,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:27:41 WrapperNode [2018-02-02 19:27:41,021 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 19:27:41,022 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 19:27:41,022 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 19:27:41,022 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 19:27:41,031 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:27:41" (1/1) ... [2018-02-02 19:27:41,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:27:41" (1/1) ... [2018-02-02 19:27:41,039 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:27:41" (1/1) ... [2018-02-02 19:27:41,039 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:27:41" (1/1) ... [2018-02-02 19:27:41,044 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:27:41" (1/1) ... [2018-02-02 19:27:41,046 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:27:41" (1/1) ... [2018-02-02 19:27:41,047 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:27:41" (1/1) ... [2018-02-02 19:27:41,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 19:27:41,049 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 19:27:41,049 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 19:27:41,049 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 19:27:41,050 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:27:41" (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:27:41,085 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 19:27:41,085 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 19:27:41,085 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-02-02 19:27:41,085 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 19:27:41,085 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-02-02 19:27:41,086 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2018-02-02 19:27:41,086 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-02-02 19:27:41,086 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-02-02 19:27:41,086 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-02-02 19:27:41,086 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2018-02-02 19:27:41,086 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-02-02 19:27:41,086 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-02-02 19:27:41,086 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-02-02 19:27:41,087 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-02-02 19:27:41,087 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2018-02-02 19:27:41,087 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-02-02 19:27:41,087 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-02-02 19:27:41,087 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-02-02 19:27:41,087 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 19:27:41,087 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 19:27:41,088 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 19:27:41,088 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 19:27:41,088 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 19:27:41,088 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 19:27:41,088 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 19:27:41,088 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 19:27:41,088 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 19:27:41,089 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-02 19:27:41,089 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-02 19:27:41,089 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 19:27:41,089 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 19:27:41,089 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 19:27:41,089 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-02 19:27:41,089 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 19:27:41,089 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-02-02 19:27:41,090 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2018-02-02 19:27:41,090 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-02-02 19:27:41,090 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-02-02 19:27:41,090 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-02-02 19:27:41,090 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-02-02 19:27:41,090 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2018-02-02 19:27:41,090 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-02-02 19:27:41,090 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-02-02 19:27:41,090 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-02-02 19:27:41,090 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-02-02 19:27:41,090 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2018-02-02 19:27:41,090 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-02-02 19:27:41,090 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-02-02 19:27:41,091 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-02-02 19:27:41,091 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 19:27:41,091 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 19:27:41,091 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 19:27:41,091 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 19:27:41,326 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-02 19:27:41,417 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 19:27:41,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 07:27:41 BoogieIcfgContainer [2018-02-02 19:27:41,418 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 19:27:41,419 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 19:27:41,419 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 19:27:41,421 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 19:27:41,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 07:27:40" (1/3) ... [2018-02-02 19:27:41,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ff3f65b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 07:27:41, skipping insertion in model container [2018-02-02 19:27:41,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:27:41" (2/3) ... [2018-02-02 19:27:41,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ff3f65b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 07:27:41, skipping insertion in model container [2018-02-02 19:27:41,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 07:27:41" (3/3) ... [2018-02-02 19:27:41,424 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test22_2_true-valid-memsafety_true-termination.i [2018-02-02 19:27:41,430 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 19:27:41,435 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-02-02 19:27:41,464 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 19:27:41,464 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 19:27:41,464 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 19:27:41,464 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 19:27:41,464 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 19:27:41,464 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 19:27:41,464 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 19:27:41,464 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 19:27:41,465 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 19:27:41,476 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2018-02-02 19:27:41,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 19:27:41,483 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:27:41,484 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:27:41,484 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 19:27:41,487 INFO L82 PathProgramCache]: Analyzing trace with hash -998986606, now seen corresponding path program 1 times [2018-02-02 19:27:41,488 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:27:41,488 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:27:41,524 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:27:41,524 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:27:41,524 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:27:41,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:27:41,568 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:27:41,737 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:27:41,739 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:27:41,739 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:27:41,741 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 19:27:41,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 19:27:41,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:27:41,754 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 5 states. [2018-02-02 19:27:41,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:27:41,792 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2018-02-02 19:27:41,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:27:41,793 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 19:27:41,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:27:41,801 INFO L225 Difference]: With dead ends: 149 [2018-02-02 19:27:41,801 INFO L226 Difference]: Without dead ends: 146 [2018-02-02 19:27:41,803 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:27:41,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-02 19:27:41,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2018-02-02 19:27:41,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-02 19:27:41,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 153 transitions. [2018-02-02 19:27:41,841 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 153 transitions. Word has length 17 [2018-02-02 19:27:41,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:27:41,841 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 153 transitions. [2018-02-02 19:27:41,841 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 19:27:41,841 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2018-02-02 19:27:41,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 19:27:41,842 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:27:41,842 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:27:41,842 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 19:27:41,843 INFO L82 PathProgramCache]: Analyzing trace with hash -2077747980, now seen corresponding path program 1 times [2018-02-02 19:27:41,843 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:27:41,843 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:27:41,844 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:27:41,845 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:27:41,845 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:27:41,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:27:41,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:27:41,907 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:27:41,907 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:27:41,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:27:41,908 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:27:41,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:27:41,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:27:41,909 INFO L87 Difference]: Start difference. First operand 144 states and 153 transitions. Second operand 6 states. [2018-02-02 19:27:42,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:27:42,036 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2018-02-02 19:27:42,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 19:27:42,037 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 19:27:42,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:27:42,038 INFO L225 Difference]: With dead ends: 145 [2018-02-02 19:27:42,038 INFO L226 Difference]: Without dead ends: 145 [2018-02-02 19:27:42,039 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:27:42,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-02 19:27:42,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2018-02-02 19:27:42,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-02 19:27:42,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 152 transitions. [2018-02-02 19:27:42,048 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 152 transitions. Word has length 19 [2018-02-02 19:27:42,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:27:42,049 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 152 transitions. [2018-02-02 19:27:42,049 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:27:42,049 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 152 transitions. [2018-02-02 19:27:42,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 19:27:42,049 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:27:42,050 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:27:42,050 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 19:27:42,050 INFO L82 PathProgramCache]: Analyzing trace with hash -2077747979, now seen corresponding path program 1 times [2018-02-02 19:27:42,050 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:27:42,050 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:27:42,051 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:27:42,051 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:27:42,051 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:27:42,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:27:42,069 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:27:42,200 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:27:42,201 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:27:42,201 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 19:27:42,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 19:27:42,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 19:27:42,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:27:42,202 INFO L87 Difference]: Start difference. First operand 143 states and 152 transitions. Second operand 7 states. [2018-02-02 19:27:42,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:27:42,405 INFO L93 Difference]: Finished difference Result 144 states and 153 transitions. [2018-02-02 19:27:42,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 19:27:42,406 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-02-02 19:27:42,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:27:42,407 INFO L225 Difference]: With dead ends: 144 [2018-02-02 19:27:42,407 INFO L226 Difference]: Without dead ends: 144 [2018-02-02 19:27:42,407 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:27:42,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-02-02 19:27:42,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2018-02-02 19:27:42,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-02 19:27:42,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 151 transitions. [2018-02-02 19:27:42,414 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 151 transitions. Word has length 19 [2018-02-02 19:27:42,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:27:42,414 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 151 transitions. [2018-02-02 19:27:42,415 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 19:27:42,415 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2018-02-02 19:27:42,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 19:27:42,415 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:27:42,415 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] [2018-02-02 19:27:42,416 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 19:27:42,416 INFO L82 PathProgramCache]: Analyzing trace with hash -471802203, now seen corresponding path program 1 times [2018-02-02 19:27:42,416 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:27:42,416 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:27:42,417 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:27:42,417 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:27:42,417 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:27:42,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:27:42,430 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:27:42,486 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:27:42,486 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:27:42,486 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 19:27:42,487 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 19:27:42,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 19:27:42,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:27:42,487 INFO L87 Difference]: Start difference. First operand 142 states and 151 transitions. Second operand 7 states. [2018-02-02 19:27:42,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:27:42,519 INFO L93 Difference]: Finished difference Result 159 states and 170 transitions. [2018-02-02 19:27:42,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 19:27:42,519 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-02-02 19:27:42,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:27:42,520 INFO L225 Difference]: With dead ends: 159 [2018-02-02 19:27:42,520 INFO L226 Difference]: Without dead ends: 159 [2018-02-02 19:27:42,521 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:27:42,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-02-02 19:27:42,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 151. [2018-02-02 19:27:42,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-02 19:27:42,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2018-02-02 19:27:42,527 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 27 [2018-02-02 19:27:42,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:27:42,527 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2018-02-02 19:27:42,527 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 19:27:42,527 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2018-02-02 19:27:42,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 19:27:42,528 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:27:42,528 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:27:42,528 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 19:27:42,528 INFO L82 PathProgramCache]: Analyzing trace with hash 131109242, now seen corresponding path program 1 times [2018-02-02 19:27:42,528 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:27:42,528 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:27:42,529 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:27:42,529 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:27:42,529 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:27:42,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:27:42,538 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:27:42,595 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:27:42,595 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:27:42,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 19:27:42,595 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 19:27:42,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 19:27:42,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 19:27:42,596 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand 10 states. [2018-02-02 19:27:42,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:27:42,789 INFO L93 Difference]: Finished difference Result 150 states and 159 transitions. [2018-02-02 19:27:42,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 19:27:42,789 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-02-02 19:27:42,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:27:42,790 INFO L225 Difference]: With dead ends: 150 [2018-02-02 19:27:42,790 INFO L226 Difference]: Without dead ends: 150 [2018-02-02 19:27:42,791 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:27:42,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-02 19:27:42,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-02-02 19:27:42,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-02 19:27:42,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 159 transitions. [2018-02-02 19:27:42,798 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 159 transitions. Word has length 34 [2018-02-02 19:27:42,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:27:42,798 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 159 transitions. [2018-02-02 19:27:42,798 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 19:27:42,798 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 159 transitions. [2018-02-02 19:27:42,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 19:27:42,799 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:27:42,799 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:27:42,799 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 19:27:42,800 INFO L82 PathProgramCache]: Analyzing trace with hash 131109243, now seen corresponding path program 1 times [2018-02-02 19:27:42,800 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:27:42,800 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:27:42,801 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:27:42,801 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:27:42,801 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:27:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:27:42,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:27:42,842 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:27:42,842 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:27:42,842 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 19:27:42,843 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 19:27:42,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 19:27:42,843 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 19:27:42,843 INFO L87 Difference]: Start difference. First operand 150 states and 159 transitions. Second operand 4 states. [2018-02-02 19:27:42,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:27:42,852 INFO L93 Difference]: Finished difference Result 153 states and 162 transitions. [2018-02-02 19:27:42,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 19:27:42,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-02-02 19:27:42,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:27:42,864 INFO L225 Difference]: With dead ends: 153 [2018-02-02 19:27:42,864 INFO L226 Difference]: Without dead ends: 151 [2018-02-02 19:27:42,864 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:27:42,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-02 19:27:42,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-02-02 19:27:42,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-02 19:27:42,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2018-02-02 19:27:42,870 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 34 [2018-02-02 19:27:42,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:27:42,870 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2018-02-02 19:27:42,870 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 19:27:42,871 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2018-02-02 19:27:42,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 19:27:42,871 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:27:42,872 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:27:42,872 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 19:27:42,872 INFO L82 PathProgramCache]: Analyzing trace with hash -2110897305, now seen corresponding path program 1 times [2018-02-02 19:27:42,872 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:27:42,872 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:27:42,873 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:27:42,873 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:27:42,874 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:27:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:27:42,886 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:27:42,911 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:27:42,911 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:27:42,912 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:27:42,921 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:27:42,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:27:42,969 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:27:42,989 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:27:43,006 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:27:43,006 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-02-02 19:27:43,007 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:27:43,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:27:43,007 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:27:43,007 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand 6 states. [2018-02-02 19:27:43,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:27:43,026 INFO L93 Difference]: Finished difference Result 154 states and 163 transitions. [2018-02-02 19:27:43,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:27:43,026 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-02-02 19:27:43,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:27:43,027 INFO L225 Difference]: With dead ends: 154 [2018-02-02 19:27:43,028 INFO L226 Difference]: Without dead ends: 152 [2018-02-02 19:27:43,028 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:27:43,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-02 19:27:43,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-02-02 19:27:43,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-02 19:27:43,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 161 transitions. [2018-02-02 19:27:43,034 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 161 transitions. Word has length 35 [2018-02-02 19:27:43,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:27:43,034 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 161 transitions. [2018-02-02 19:27:43,034 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:27:43,034 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 161 transitions. [2018-02-02 19:27:43,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 19:27:43,035 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:27:43,035 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, 1] [2018-02-02 19:27:43,035 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 19:27:43,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1181841647, now seen corresponding path program 1 times [2018-02-02 19:27:43,035 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:27:43,035 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:27:43,036 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:27:43,036 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:27:43,036 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:27:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:27:43,049 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:27:43,130 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:27:43,131 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:27:43,131 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 19:27:43,131 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 19:27:43,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 19:27:43,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:27:43,132 INFO L87 Difference]: Start difference. First operand 152 states and 161 transitions. Second operand 7 states. [2018-02-02 19:27:43,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:27:43,167 INFO L93 Difference]: Finished difference Result 163 states and 174 transitions. [2018-02-02 19:27:43,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 19:27:43,167 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-02-02 19:27:43,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:27:43,168 INFO L225 Difference]: With dead ends: 163 [2018-02-02 19:27:43,168 INFO L226 Difference]: Without dead ends: 163 [2018-02-02 19:27:43,169 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:27:43,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-02 19:27:43,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2018-02-02 19:27:43,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-02 19:27:43,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 169 transitions. [2018-02-02 19:27:43,174 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 169 transitions. Word has length 36 [2018-02-02 19:27:43,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:27:43,175 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 169 transitions. [2018-02-02 19:27:43,175 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 19:27:43,175 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 169 transitions. [2018-02-02 19:27:43,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 19:27:43,176 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:27:43,176 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:27:43,176 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 19:27:43,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1401343739, now seen corresponding path program 2 times [2018-02-02 19:27:43,176 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:27:43,176 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:27:43,177 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:27:43,178 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:27:43,178 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:27:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:27:43,189 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:27:43,217 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:27:43,217 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:27:43,218 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:27:43,226 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 19:27:43,251 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-02 19:27:43,251 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:27:43,255 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:27:43,290 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:27:43,292 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:27:43,309 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:27:43,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:27:43,324 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:27:43,325 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-02-02 19:27:43,837 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:27:43,855 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:27:43,855 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 19 [2018-02-02 19:27:43,855 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 19:27:43,855 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 19:27:43,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-02-02 19:27:43,856 INFO L87 Difference]: Start difference. First operand 159 states and 169 transitions. Second operand 19 states. [2018-02-02 19:27:44,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:27:44,859 INFO L93 Difference]: Finished difference Result 181 states and 191 transitions. [2018-02-02 19:27:44,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 19:27:44,860 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-02-02 19:27:44,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:27:44,861 INFO L225 Difference]: With dead ends: 181 [2018-02-02 19:27:44,861 INFO L226 Difference]: Without dead ends: 179 [2018-02-02 19:27:44,862 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2018-02-02 19:27:44,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-02-02 19:27:44,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 159. [2018-02-02 19:27:44,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-02 19:27:44,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 169 transitions. [2018-02-02 19:27:44,867 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 169 transitions. Word has length 36 [2018-02-02 19:27:44,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:27:44,869 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 169 transitions. [2018-02-02 19:27:44,869 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 19:27:44,869 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 169 transitions. [2018-02-02 19:27:44,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 19:27:44,870 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:27:44,871 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, 1, 1, 1, 1, 1] [2018-02-02 19:27:44,871 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 19:27:44,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1379512829, now seen corresponding path program 1 times [2018-02-02 19:27:44,871 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:27:44,871 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:27:44,872 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:27:44,872 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:27:44,872 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:27:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:27:44,878 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:27:44,897 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:27:44,897 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:27:44,897 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 19:27:44,898 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 19:27:44,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 19:27:44,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 19:27:44,903 INFO L87 Difference]: Start difference. First operand 159 states and 169 transitions. Second operand 3 states. [2018-02-02 19:27:44,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:27:44,977 INFO L93 Difference]: Finished difference Result 177 states and 190 transitions. [2018-02-02 19:27:44,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 19:27:44,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-02-02 19:27:44,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:27:44,979 INFO L225 Difference]: With dead ends: 177 [2018-02-02 19:27:44,979 INFO L226 Difference]: Without dead ends: 163 [2018-02-02 19:27:44,980 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:27:44,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-02 19:27:44,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 155. [2018-02-02 19:27:44,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-02 19:27:44,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 164 transitions. [2018-02-02 19:27:44,984 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 164 transitions. Word has length 39 [2018-02-02 19:27:44,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:27:44,984 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 164 transitions. [2018-02-02 19:27:44,984 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 19:27:44,984 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 164 transitions. [2018-02-02 19:27:44,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 19:27:44,985 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:27:44,985 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:27:44,985 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 19:27:44,985 INFO L82 PathProgramCache]: Analyzing trace with hash 710655878, now seen corresponding path program 1 times [2018-02-02 19:27:44,985 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:27:44,986 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:27:44,987 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:27:44,987 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:27:44,987 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:27:44,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:27:44,996 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:27:45,046 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:27:45,046 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:27:45,047 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 19:27:45,047 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 19:27:45,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 19:27:45,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 19:27:45,047 INFO L87 Difference]: Start difference. First operand 155 states and 164 transitions. Second operand 10 states. [2018-02-02 19:27:45,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:27:45,218 INFO L93 Difference]: Finished difference Result 153 states and 162 transitions. [2018-02-02 19:27:45,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 19:27:45,219 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-02-02 19:27:45,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:27:45,219 INFO L225 Difference]: With dead ends: 153 [2018-02-02 19:27:45,219 INFO L226 Difference]: Without dead ends: 153 [2018-02-02 19:27:45,220 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:27:45,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-02-02 19:27:45,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-02-02 19:27:45,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-02-02 19:27:45,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 162 transitions. [2018-02-02 19:27:45,225 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 162 transitions. Word has length 42 [2018-02-02 19:27:45,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:27:45,225 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 162 transitions. [2018-02-02 19:27:45,225 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 19:27:45,225 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 162 transitions. [2018-02-02 19:27:45,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 19:27:45,226 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:27:45,226 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:27:45,226 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 19:27:45,226 INFO L82 PathProgramCache]: Analyzing trace with hash 710655879, now seen corresponding path program 1 times [2018-02-02 19:27:45,227 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:27:45,227 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:27:45,228 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:27:45,228 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:27:45,228 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:27:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:27:45,239 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:27:45,266 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:27:45,267 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:27:45,267 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:27:45,272 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:27:45,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:27:45,295 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:27:45,303 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:27:45,324 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:27:45,324 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-02-02 19:27:45,325 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 19:27:45,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 19:27:45,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-02-02 19:27:45,325 INFO L87 Difference]: Start difference. First operand 153 states and 162 transitions. Second operand 8 states. [2018-02-02 19:27:45,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:27:45,346 INFO L93 Difference]: Finished difference Result 156 states and 165 transitions. [2018-02-02 19:27:45,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 19:27:45,346 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-02-02 19:27:45,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:27:45,347 INFO L225 Difference]: With dead ends: 156 [2018-02-02 19:27:45,347 INFO L226 Difference]: Without dead ends: 154 [2018-02-02 19:27:45,347 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:27:45,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-02-02 19:27:45,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-02-02 19:27:45,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-02-02 19:27:45,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 163 transitions. [2018-02-02 19:27:45,351 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 163 transitions. Word has length 42 [2018-02-02 19:27:45,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:27:45,352 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 163 transitions. [2018-02-02 19:27:45,352 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 19:27:45,352 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 163 transitions. [2018-02-02 19:27:45,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 19:27:45,353 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:27:45,353 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:27:45,353 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 19:27:45,353 INFO L82 PathProgramCache]: Analyzing trace with hash -495427355, now seen corresponding path program 1 times [2018-02-02 19:27:45,353 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:27:45,353 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:27:45,354 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:27:45,355 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:27:45,355 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:27:45,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:27:45,359 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:27:45,377 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:27:45,377 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:27:45,377 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 19:27:45,377 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:27:45,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:27:45,378 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:27:45,378 INFO L87 Difference]: Start difference. First operand 154 states and 163 transitions. Second operand 6 states. [2018-02-02 19:27:45,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:27:45,393 INFO L93 Difference]: Finished difference Result 138 states and 145 transitions. [2018-02-02 19:27:45,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 19:27:45,393 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-02-02 19:27:45,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:27:45,394 INFO L225 Difference]: With dead ends: 138 [2018-02-02 19:27:45,394 INFO L226 Difference]: Without dead ends: 138 [2018-02-02 19:27:45,394 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:27:45,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-02 19:27:45,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-02-02 19:27:45,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-02-02 19:27:45,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 145 transitions. [2018-02-02 19:27:45,396 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 145 transitions. Word has length 41 [2018-02-02 19:27:45,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:27:45,396 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 145 transitions. [2018-02-02 19:27:45,396 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:27:45,397 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 145 transitions. [2018-02-02 19:27:45,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 19:27:45,397 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:27:45,397 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:27:45,397 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 19:27:45,397 INFO L82 PathProgramCache]: Analyzing trace with hash -141638285, now seen corresponding path program 2 times [2018-02-02 19:27:45,397 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:27:45,397 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:27:45,398 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:27:45,398 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:27:45,398 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:27:45,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:27:45,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:27:45,442 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:27:45,443 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:27:45,443 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:27:45,453 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 19:27:45,469 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-02 19:27:45,469 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:27:45,471 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:27:45,474 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:27:45,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:27:45,488 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:27:45,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:27:45,499 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:27:45,499 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-02-02 19:27:45,991 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:27:46,010 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:27:46,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 22 [2018-02-02 19:27:46,011 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 19:27:46,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 19:27:46,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2018-02-02 19:27:46,011 INFO L87 Difference]: Start difference. First operand 138 states and 145 transitions. Second operand 22 states. [2018-02-02 19:27:48,228 WARN L143 SmtUtils]: Spent 2014ms on a formula simplification that was a NOOP. DAG size: 31 [2018-02-02 19:27:48,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:27:48,848 INFO L93 Difference]: Finished difference Result 139 states and 146 transitions. [2018-02-02 19:27:48,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 19:27:48,849 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 43 [2018-02-02 19:27:48,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:27:48,849 INFO L225 Difference]: With dead ends: 139 [2018-02-02 19:27:48,850 INFO L226 Difference]: Without dead ends: 137 [2018-02-02 19:27:48,850 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=147, Invalid=845, Unknown=0, NotChecked=0, Total=992 [2018-02-02 19:27:48,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-02-02 19:27:48,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-02-02 19:27:48,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-02 19:27:48,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 144 transitions. [2018-02-02 19:27:48,852 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 144 transitions. Word has length 43 [2018-02-02 19:27:48,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:27:48,852 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 144 transitions. [2018-02-02 19:27:48,852 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 19:27:48,852 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 144 transitions. [2018-02-02 19:27:48,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 19:27:48,853 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:27:48,853 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] [2018-02-02 19:27:48,853 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 19:27:48,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1517747909, now seen corresponding path program 1 times [2018-02-02 19:27:48,853 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:27:48,853 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:27:48,854 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:27:48,854 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:27:48,854 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:27:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:27:48,861 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:27:48,895 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:27:48,895 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:27:48,895 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 19:27:48,895 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 19:27:48,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 19:27:48,896 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 19:27:48,896 INFO L87 Difference]: Start difference. First operand 137 states and 144 transitions. Second operand 8 states. [2018-02-02 19:27:48,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:27:48,919 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2018-02-02 19:27:48,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 19:27:48,920 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-02-02 19:27:48,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:27:48,920 INFO L225 Difference]: With dead ends: 139 [2018-02-02 19:27:48,920 INFO L226 Difference]: Without dead ends: 137 [2018-02-02 19:27:48,920 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:27:48,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-02-02 19:27:48,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-02-02 19:27:48,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-02 19:27:48,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 143 transitions. [2018-02-02 19:27:48,924 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 143 transitions. Word has length 47 [2018-02-02 19:27:48,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:27:48,924 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 143 transitions. [2018-02-02 19:27:48,924 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 19:27:48,924 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 143 transitions. [2018-02-02 19:27:48,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 19:27:48,925 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:27:48,925 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] [2018-02-02 19:27:48,925 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 19:27:48,925 INFO L82 PathProgramCache]: Analyzing trace with hash 2035822852, now seen corresponding path program 1 times [2018-02-02 19:27:48,925 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:27:48,925 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:27:48,926 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:27:48,926 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:27:48,926 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:27:48,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:27:48,935 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:27:48,987 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:27:48,987 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:27:48,987 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 19:27:48,988 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 19:27:48,988 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 19:27:48,988 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 19:27:48,988 INFO L87 Difference]: Start difference. First operand 137 states and 143 transitions. Second operand 10 states. [2018-02-02 19:27:49,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:27:49,025 INFO L93 Difference]: Finished difference Result 141 states and 146 transitions. [2018-02-02 19:27:49,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 19:27:49,025 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2018-02-02 19:27:49,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:27:49,026 INFO L225 Difference]: With dead ends: 141 [2018-02-02 19:27:49,026 INFO L226 Difference]: Without dead ends: 137 [2018-02-02 19:27:49,026 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:27:49,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-02-02 19:27:49,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-02-02 19:27:49,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-02 19:27:49,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 142 transitions. [2018-02-02 19:27:49,033 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 142 transitions. Word has length 52 [2018-02-02 19:27:49,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:27:49,034 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 142 transitions. [2018-02-02 19:27:49,034 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 19:27:49,034 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 142 transitions. [2018-02-02 19:27:49,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 19:27:49,035 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:27:49,035 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] [2018-02-02 19:27:49,035 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 19:27:49,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1511828740, now seen corresponding path program 1 times [2018-02-02 19:27:49,035 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:27:49,035 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:27:49,036 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:27:49,036 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:27:49,036 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:27:49,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:27:49,048 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:27:49,149 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:27:49,149 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:27:49,149 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 19:27:49,149 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 19:27:49,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 19:27:49,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-02-02 19:27:49,150 INFO L87 Difference]: Start difference. First operand 137 states and 142 transitions. Second operand 13 states. [2018-02-02 19:27:49,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:27:49,409 INFO L93 Difference]: Finished difference Result 135 states and 140 transitions. [2018-02-02 19:27:49,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 19:27:49,409 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 63 [2018-02-02 19:27:49,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:27:49,410 INFO L225 Difference]: With dead ends: 135 [2018-02-02 19:27:49,410 INFO L226 Difference]: Without dead ends: 135 [2018-02-02 19:27:49,410 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-02-02 19:27:49,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-02 19:27:49,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-02-02 19:27:49,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-02 19:27:49,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 140 transitions. [2018-02-02 19:27:49,412 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 140 transitions. Word has length 63 [2018-02-02 19:27:49,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:27:49,413 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 140 transitions. [2018-02-02 19:27:49,413 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 19:27:49,413 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 140 transitions. [2018-02-02 19:27:49,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 19:27:49,413 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:27:49,413 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] [2018-02-02 19:27:49,413 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 19:27:49,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1511828741, now seen corresponding path program 1 times [2018-02-02 19:27:49,414 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:27:49,414 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:27:49,414 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:27:49,414 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:27:49,414 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:27:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:27:49,424 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:27:49,471 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:27:49,471 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:27:49,471 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:27:49,477 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:27:49,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:27:49,503 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:27:49,519 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:27:49,538 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:27:49,538 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-02-02 19:27:49,538 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 19:27:49,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 19:27:49,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-02-02 19:27:49,539 INFO L87 Difference]: Start difference. First operand 135 states and 140 transitions. Second operand 10 states. [2018-02-02 19:27:49,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:27:49,552 INFO L93 Difference]: Finished difference Result 138 states and 143 transitions. [2018-02-02 19:27:49,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 19:27:49,552 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2018-02-02 19:27:49,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:27:49,553 INFO L225 Difference]: With dead ends: 138 [2018-02-02 19:27:49,553 INFO L226 Difference]: Without dead ends: 136 [2018-02-02 19:27:49,553 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 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:27:49,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-02-02 19:27:49,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-02-02 19:27:49,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-02-02 19:27:49,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 141 transitions. [2018-02-02 19:27:49,556 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 141 transitions. Word has length 63 [2018-02-02 19:27:49,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:27:49,556 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 141 transitions. [2018-02-02 19:27:49,557 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 19:27:49,557 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 141 transitions. [2018-02-02 19:27:49,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 19:27:49,557 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:27:49,557 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] [2018-02-02 19:27:49,557 INFO L371 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 19:27:49,558 INFO L82 PathProgramCache]: Analyzing trace with hash 2058801817, now seen corresponding path program 2 times [2018-02-02 19:27:49,558 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:27:49,558 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:27:49,559 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:27:49,559 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:27:49,559 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:27:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:27:49,572 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:27:49,620 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:27:49,621 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:27:49,621 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:27:49,630 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 19:27:49,654 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-02 19:27:49,654 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:27:49,657 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:27:49,665 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:27:49,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:27:49,677 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:27:49,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:27:49,686 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:27:49,686 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-02-02 19:27:52,168 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:27:52,185 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:27:52,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [10] total 27 [2018-02-02 19:27:52,186 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 19:27:52,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 19:27:52,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=602, Unknown=1, NotChecked=0, Total=702 [2018-02-02 19:27:52,186 INFO L87 Difference]: Start difference. First operand 136 states and 141 transitions. Second operand 27 states. [2018-02-02 19:27:54,295 WARN L143 SmtUtils]: Spent 2017ms on a formula simplification that was a NOOP. DAG size: 31 [2018-02-02 19:27:56,333 WARN L143 SmtUtils]: Spent 2015ms on a formula simplification that was a NOOP. DAG size: 31 [2018-02-02 19:27:58,486 WARN L143 SmtUtils]: Spent 2018ms on a formula simplification that was a NOOP. DAG size: 31 [2018-02-02 19:28:04,529 WARN L143 SmtUtils]: Spent 6026ms on a formula simplification that was a NOOP. DAG size: 32 [2018-02-02 19:28:05,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:28:05,190 INFO L93 Difference]: Finished difference Result 137 states and 142 transitions. [2018-02-02 19:28:05,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 19:28:05,190 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 64 [2018-02-02 19:28:05,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:28:05,191 INFO L225 Difference]: With dead ends: 137 [2018-02-02 19:28:05,191 INFO L226 Difference]: Without dead ends: 135 [2018-02-02 19:28:05,191 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=213, Invalid=1346, Unknown=1, NotChecked=0, Total=1560 [2018-02-02 19:28:05,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-02 19:28:05,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-02-02 19:28:05,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-02 19:28:05,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 140 transitions. [2018-02-02 19:28:05,193 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 140 transitions. Word has length 64 [2018-02-02 19:28:05,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:28:05,194 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 140 transitions. [2018-02-02 19:28:05,194 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 19:28:05,194 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 140 transitions. [2018-02-02 19:28:05,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 19:28:05,194 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:28:05,194 INFO L351 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:28:05,194 INFO L371 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 19:28:05,194 INFO L82 PathProgramCache]: Analyzing trace with hash -243629328, now seen corresponding path program 1 times [2018-02-02 19:28:05,194 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:28:05,195 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:28:05,195 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:28:05,195 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:28:05,195 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:28:05,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:28:05,204 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:28:05,299 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-02-02 19:28:05,299 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:28:05,299 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 19:28:05,300 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 19:28:05,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 19:28:05,300 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-02 19:28:05,300 INFO L87 Difference]: Start difference. First operand 135 states and 140 transitions. Second operand 11 states. [2018-02-02 19:28:05,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:28:05,343 INFO L93 Difference]: Finished difference Result 138 states and 142 transitions. [2018-02-02 19:28:05,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 19:28:05,343 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2018-02-02 19:28:05,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:28:05,343 INFO L225 Difference]: With dead ends: 138 [2018-02-02 19:28:05,343 INFO L226 Difference]: Without dead ends: 135 [2018-02-02 19:28:05,343 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-02-02 19:28:05,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-02 19:28:05,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-02-02 19:28:05,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-02 19:28:05,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2018-02-02 19:28:05,345 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 74 [2018-02-02 19:28:05,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:28:05,345 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2018-02-02 19:28:05,345 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 19:28:05,345 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2018-02-02 19:28:05,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 19:28:05,346 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:28:05,346 INFO L351 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:28:05,346 INFO L371 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 19:28:05,346 INFO L82 PathProgramCache]: Analyzing trace with hash 254396120, now seen corresponding path program 1 times [2018-02-02 19:28:05,346 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:28:05,346 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:28:05,347 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:28:05,347 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:28:05,347 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:28:05,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:28:05,357 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:28:05,519 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-02-02 19:28:05,519 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:28:05,520 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-02 19:28:05,520 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 19:28:05,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 19:28:05,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-02-02 19:28:05,520 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand 18 states. [2018-02-02 19:28:05,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:28:05,818 INFO L93 Difference]: Finished difference Result 163 states and 174 transitions. [2018-02-02 19:28:05,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 19:28:05,818 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2018-02-02 19:28:05,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:28:05,819 INFO L225 Difference]: With dead ends: 163 [2018-02-02 19:28:05,819 INFO L226 Difference]: Without dead ends: 163 [2018-02-02 19:28:05,820 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2018-02-02 19:28:05,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-02 19:28:05,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 158. [2018-02-02 19:28:05,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-02 19:28:05,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 170 transitions. [2018-02-02 19:28:05,824 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 170 transitions. Word has length 87 [2018-02-02 19:28:05,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:28:05,824 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 170 transitions. [2018-02-02 19:28:05,824 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 19:28:05,824 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 170 transitions. [2018-02-02 19:28:05,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 19:28:05,825 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:28:05,825 INFO L351 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:28:05,825 INFO L371 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 19:28:05,826 INFO L82 PathProgramCache]: Analyzing trace with hash 254396121, now seen corresponding path program 1 times [2018-02-02 19:28:05,826 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:28:05,826 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:28:05,827 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:28:05,827 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:28:05,827 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:28:05,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:28:05,843 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:28:05,917 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:28:05,918 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:28:05,918 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:28:05,927 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:28:05,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:28:05,983 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:28:06,006 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:28:06,027 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:28:06,027 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-02-02 19:28:06,027 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 19:28:06,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 19:28:06,027 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-02-02 19:28:06,027 INFO L87 Difference]: Start difference. First operand 158 states and 170 transitions. Second operand 12 states. [2018-02-02 19:28:06,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:28:06,055 INFO L93 Difference]: Finished difference Result 161 states and 173 transitions. [2018-02-02 19:28:06,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 19:28:06,058 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 87 [2018-02-02 19:28:06,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:28:06,059 INFO L225 Difference]: With dead ends: 161 [2018-02-02 19:28:06,059 INFO L226 Difference]: Without dead ends: 159 [2018-02-02 19:28:06,059 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2018-02-02 19:28:06,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-02-02 19:28:06,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-02-02 19:28:06,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-02 19:28:06,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 171 transitions. [2018-02-02 19:28:06,063 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 171 transitions. Word has length 87 [2018-02-02 19:28:06,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:28:06,063 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 171 transitions. [2018-02-02 19:28:06,063 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 19:28:06,063 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 171 transitions. [2018-02-02 19:28:06,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-02 19:28:06,064 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:28:06,064 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, 1, 1, 1, 1, 1, 1] [2018-02-02 19:28:06,064 INFO L371 AbstractCegarLoop]: === Iteration 23 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 19:28:06,065 INFO L82 PathProgramCache]: Analyzing trace with hash -388927379, now seen corresponding path program 2 times [2018-02-02 19:28:06,065 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:28:06,065 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:28:06,065 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:28:06,066 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:28:06,066 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:28:06,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:28:06,083 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:28:06,158 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:28:06,159 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:28:06,159 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:28:06,167 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 19:28:06,213 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-02 19:28:06,213 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:28:06,218 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:28:06,225 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:28:06,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:28:06,239 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:28:06,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:28:06,253 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:28:06,253 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-02-02 19:28:07,066 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:28:07,084 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:28:07,084 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [12] total 31 [2018-02-02 19:28:07,084 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 19:28:07,085 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 19:28:07,085 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=804, Unknown=0, NotChecked=0, Total=930 [2018-02-02 19:28:07,085 INFO L87 Difference]: Start difference. First operand 159 states and 171 transitions. Second operand 31 states. [2018-02-02 19:28:10,900 WARN L143 SmtUtils]: Spent 3777ms on a formula simplification that was a NOOP. DAG size: 39 [2018-02-02 19:28:13,301 WARN L143 SmtUtils]: Spent 2023ms on a formula simplification that was a NOOP. DAG size: 36 [2018-02-02 19:28:14,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:28:14,033 INFO L93 Difference]: Finished difference Result 160 states and 170 transitions. [2018-02-02 19:28:14,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 19:28:14,033 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 88 [2018-02-02 19:28:14,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:28:14,033 INFO L225 Difference]: With dead ends: 160 [2018-02-02 19:28:14,033 INFO L226 Difference]: Without dead ends: 158 [2018-02-02 19:28:14,034 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=286, Invalid=1876, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 19:28:14,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-02 19:28:14,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-02-02 19:28:14,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-02 19:28:14,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 168 transitions. [2018-02-02 19:28:14,038 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 168 transitions. Word has length 88 [2018-02-02 19:28:14,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:28:14,038 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 168 transitions. [2018-02-02 19:28:14,038 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 19:28:14,038 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 168 transitions. [2018-02-02 19:28:14,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-02 19:28:14,039 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:28:14,039 INFO L351 BasicCegarLoop]: trace histogram [9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:28:14,039 INFO L371 AbstractCegarLoop]: === Iteration 24 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 19:28:14,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1868073210, now seen corresponding path program 1 times [2018-02-02 19:28:14,039 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:28:14,039 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:28:14,040 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:28:14,040 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:28:14,040 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:28:14,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:28:14,054 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:28:14,130 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-02-02 19:28:14,130 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:28:14,130 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:28:14,138 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:28:14,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:28:14,177 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:28:14,256 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 19:28:14,274 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:28:14,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 22 [2018-02-02 19:28:14,274 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 19:28:14,274 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 19:28:14,274 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-02-02 19:28:14,275 INFO L87 Difference]: Start difference. First operand 158 states and 168 transitions. Second operand 22 states. [2018-02-02 19:28:14,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:28:14,373 INFO L93 Difference]: Finished difference Result 162 states and 168 transitions. [2018-02-02 19:28:14,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 19:28:14,374 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 92 [2018-02-02 19:28:14,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:28:14,374 INFO L225 Difference]: With dead ends: 162 [2018-02-02 19:28:14,374 INFO L226 Difference]: Without dead ends: 156 [2018-02-02 19:28:14,375 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2018-02-02 19:28:14,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-02-02 19:28:14,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-02-02 19:28:14,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-02-02 19:28:14,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 162 transitions. [2018-02-02 19:28:14,377 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 162 transitions. Word has length 92 [2018-02-02 19:28:14,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:28:14,377 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 162 transitions. [2018-02-02 19:28:14,377 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 19:28:14,377 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 162 transitions. [2018-02-02 19:28:14,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-02-02 19:28:14,378 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:28:14,378 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:28:14,378 INFO L371 AbstractCegarLoop]: === Iteration 25 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 19:28:14,378 INFO L82 PathProgramCache]: Analyzing trace with hash -63866368, now seen corresponding path program 1 times [2018-02-02 19:28:14,378 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:28:14,378 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:28:14,379 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:28:14,379 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:28:14,379 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:28:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:28:14,391 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:28:14,635 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-02-02 19:28:14,635 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:28:14,635 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-02-02 19:28:14,636 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 19:28:14,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 19:28:14,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-02-02 19:28:14,636 INFO L87 Difference]: Start difference. First operand 156 states and 162 transitions. Second operand 21 states. [2018-02-02 19:28:15,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:28:15,057 INFO L93 Difference]: Finished difference Result 166 states and 175 transitions. [2018-02-02 19:28:15,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 19:28:15,058 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 104 [2018-02-02 19:28:15,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:28:15,058 INFO L225 Difference]: With dead ends: 166 [2018-02-02 19:28:15,058 INFO L226 Difference]: Without dead ends: 166 [2018-02-02 19:28:15,059 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2018-02-02 19:28:15,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-02-02 19:28:15,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2018-02-02 19:28:15,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-02-02 19:28:15,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 172 transitions. [2018-02-02 19:28:15,061 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 172 transitions. Word has length 104 [2018-02-02 19:28:15,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:28:15,061 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 172 transitions. [2018-02-02 19:28:15,061 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 19:28:15,061 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 172 transitions. [2018-02-02 19:28:15,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-02-02 19:28:15,062 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:28:15,062 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:28:15,062 INFO L371 AbstractCegarLoop]: === Iteration 26 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 19:28:15,062 INFO L82 PathProgramCache]: Analyzing trace with hash -63866367, now seen corresponding path program 1 times [2018-02-02 19:28:15,062 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:28:15,062 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:28:15,063 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:28:15,063 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:28:15,063 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:28:15,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:28:15,074 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:28:15,183 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:28:15,183 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:28:15,183 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:28:15,193 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:28:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:28:15,241 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:28:15,255 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:28:15,287 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:28:15,287 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-02-02 19:28:15,287 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 19:28:15,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 19:28:15,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-02-02 19:28:15,288 INFO L87 Difference]: Start difference. First operand 162 states and 172 transitions. Second operand 15 states. [2018-02-02 19:28:15,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:28:15,319 INFO L93 Difference]: Finished difference Result 165 states and 175 transitions. [2018-02-02 19:28:15,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 19:28:15,319 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 104 [2018-02-02 19:28:15,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:28:15,320 INFO L225 Difference]: With dead ends: 165 [2018-02-02 19:28:15,320 INFO L226 Difference]: Without dead ends: 163 [2018-02-02 19:28:15,321 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 104 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:28:15,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-02 19:28:15,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-02-02 19:28:15,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-02-02 19:28:15,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 173 transitions. [2018-02-02 19:28:15,324 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 173 transitions. Word has length 104 [2018-02-02 19:28:15,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:28:15,325 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 173 transitions. [2018-02-02 19:28:15,325 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 19:28:15,325 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 173 transitions. [2018-02-02 19:28:15,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-02-02 19:28:15,325 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:28:15,326 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:28:15,326 INFO L371 AbstractCegarLoop]: === Iteration 27 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 19:28:15,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1207457043, now seen corresponding path program 2 times [2018-02-02 19:28:15,326 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:28:15,326 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:28:15,327 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:28:15,327 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:28:15,327 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:28:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:28:15,346 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:28:15,482 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:28:15,483 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:28:15,483 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:28:15,488 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 19:28:15,543 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-02 19:28:15,543 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:28:15,549 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:28:15,569 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:28:15,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:28:15,589 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:28:15,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:28:15,598 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:28:15,599 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-02-02 19:28:16,634 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-02-02 19:28:16,652 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:28:16,652 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [15] total 38 [2018-02-02 19:28:16,652 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-02 19:28:16,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-02 19:28:16,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1228, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 19:28:16,653 INFO L87 Difference]: Start difference. First operand 163 states and 173 transitions. Second operand 38 states. [2018-02-02 19:28:19,174 WARN L143 SmtUtils]: Spent 2020ms on a formula simplification that was a NOOP. DAG size: 35 [2018-02-02 19:28:21,220 WARN L143 SmtUtils]: Spent 2024ms on a formula simplification that was a NOOP. DAG size: 35 [2018-02-02 19:28:22,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:28:22,339 INFO L93 Difference]: Finished difference Result 164 states and 173 transitions. [2018-02-02 19:28:22,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-02 19:28:22,339 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 105 [2018-02-02 19:28:22,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:28:22,340 INFO L225 Difference]: With dead ends: 164 [2018-02-02 19:28:22,340 INFO L226 Difference]: Without dead ends: 162 [2018-02-02 19:28:22,341 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 78 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=425, Invalid=2997, Unknown=0, NotChecked=0, Total=3422 [2018-02-02 19:28:22,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-02 19:28:22,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-02-02 19:28:22,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-02-02 19:28:22,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 171 transitions. [2018-02-02 19:28:22,343 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 171 transitions. Word has length 105 [2018-02-02 19:28:22,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:28:22,343 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 171 transitions. [2018-02-02 19:28:22,343 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-02 19:28:22,343 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 171 transitions. [2018-02-02 19:28:22,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-02-02 19:28:22,343 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:28:22,343 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:28:22,343 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_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 19:28:22,344 INFO L82 PathProgramCache]: Analyzing trace with hash 2055534530, now seen corresponding path program 1 times [2018-02-02 19:28:22,344 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:28:22,344 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:28:22,344 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:28:22,344 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:28:22,344 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:28:22,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:28:22,363 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:28:22,508 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:28:22,508 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:28:22,508 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:28:22,516 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:28:22,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:28:22,581 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:28:22,596 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:28:22,628 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:28:22,628 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-02-02 19:28:22,628 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 19:28:22,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 19:28:22,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-02-02 19:28:22,629 INFO L87 Difference]: Start difference. First operand 162 states and 171 transitions. Second operand 17 states. [2018-02-02 19:28:22,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:28:22,654 INFO L93 Difference]: Finished difference Result 165 states and 174 transitions. [2018-02-02 19:28:22,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 19:28:22,655 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 110 [2018-02-02 19:28:22,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:28:22,655 INFO L225 Difference]: With dead ends: 165 [2018-02-02 19:28:22,655 INFO L226 Difference]: Without dead ends: 163 [2018-02-02 19:28:22,656 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=126, Invalid=180, Unknown=0, NotChecked=0, Total=306 [2018-02-02 19:28:22,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-02 19:28:22,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-02-02 19:28:22,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-02-02 19:28:22,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 172 transitions. [2018-02-02 19:28:22,659 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 172 transitions. Word has length 110 [2018-02-02 19:28:22,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:28:22,659 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 172 transitions. [2018-02-02 19:28:22,659 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 19:28:22,659 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 172 transitions. [2018-02-02 19:28:22,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-02-02 19:28:22,659 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:28:22,660 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:28:22,660 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_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 19:28:22,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1832241070, now seen corresponding path program 2 times [2018-02-02 19:28:22,660 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:28:22,660 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:28:22,660 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:28:22,660 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:28:22,661 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:28:22,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:28:22,672 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:28:22,801 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:28:22,801 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:28:22,801 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:28:22,806 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 19:28:22,839 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-02 19:28:22,840 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:28:22,844 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:28:22,893 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 11 treesize of output 8 [2018-02-02 19:28:22,893 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 8 treesize of output 7 [2018-02-02 19:28:22,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:28:22,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:28:22,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:28:22,895 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-02-02 19:28:22,962 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:28:22,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:28:22,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 19:28:22,967 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:26 [2018-02-02 19:28:22,969 WARN L1033 $PredicateComparison]: unable to prove that (exists ((LDV_INIT_LIST_HEAD_~list.offset Int) (v_DerPreprocessor_2 Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (let ((.cse0 (+ LDV_INIT_LIST_HEAD_~list.offset 4))) (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) LDV_INIT_LIST_HEAD_~list.offset v_DerPreprocessor_2) .cse0 (select (select |c_#memory_int| |c_LDV_INIT_LIST_HEAD_#in~list.base|) .cse0))))) (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) is different from true [2018-02-02 19:28:22,990 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 32 treesize of output 27 [2018-02-02 19:28:22,992 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:22,994 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-02-02 19:28:22,997 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:22,998 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:23,001 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 37 [2018-02-02 19:28:23,001 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:28:23,005 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:28:23,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:28:23,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:28:23,010 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:37, output treesize:9 [2018-02-02 19:28:23,399 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:23,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 36 [2018-02-02 19:28:23,403 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:28:23,404 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:23,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2018-02-02 19:28:23,405 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:28:23,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:28:23,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:28:23,410 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:13 [2018-02-02 19:28:23,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 17 treesize of output 13 [2018-02-02 19:28:23,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 13 treesize of output 5 [2018-02-02 19:28:23,834 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:28:23,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:28:23,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:28:23,843 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-02-02 19:28:23,880 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-02-02 19:28:23,906 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:28:23,906 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [41] imperfect sequences [17] total 56 [2018-02-02 19:28:23,906 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-02 19:28:23,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-02 19:28:23,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=2761, Unknown=1, NotChecked=106, Total=3080 [2018-02-02 19:28:23,907 INFO L87 Difference]: Start difference. First operand 163 states and 172 transitions. Second operand 56 states. [2018-02-02 19:28:25,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:28:25,717 INFO L93 Difference]: Finished difference Result 159 states and 162 transitions. [2018-02-02 19:28:25,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-02-02 19:28:25,718 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 111 [2018-02-02 19:28:25,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:28:25,718 INFO L225 Difference]: With dead ends: 159 [2018-02-02 19:28:25,718 INFO L226 Difference]: Without dead ends: 157 [2018-02-02 19:28:25,719 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1026 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=325, Invalid=5530, Unknown=1, NotChecked=150, Total=6006 [2018-02-02 19:28:25,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-02-02 19:28:25,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-02-02 19:28:25,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-02-02 19:28:25,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 160 transitions. [2018-02-02 19:28:25,721 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 160 transitions. Word has length 111 [2018-02-02 19:28:25,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:28:25,721 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 160 transitions. [2018-02-02 19:28:25,721 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-02 19:28:25,721 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 160 transitions. [2018-02-02 19:28:25,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-02-02 19:28:25,721 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:28:25,721 INFO L351 BasicCegarLoop]: trace histogram [14, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:28:25,721 INFO L371 AbstractCegarLoop]: === Iteration 30 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 19:28:25,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1142789455, now seen corresponding path program 1 times [2018-02-02 19:28:25,722 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:28:25,722 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:28:25,722 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:28:25,722 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:28:25,722 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:28:25,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:28:25,739 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:28:25,911 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-02-02 19:28:25,911 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:28:25,912 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:28:25,917 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:28:25,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:28:25,972 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:28:26,195 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 19:28:26,228 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:28:26,228 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2018-02-02 19:28:26,228 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 19:28:26,228 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 19:28:26,229 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1016, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 19:28:26,229 INFO L87 Difference]: Start difference. First operand 157 states and 160 transitions. Second operand 35 states. [2018-02-02 19:28:27,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:28:27,048 INFO L93 Difference]: Finished difference Result 169 states and 172 transitions. [2018-02-02 19:28:27,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 19:28:27,048 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 119 [2018-02-02 19:28:27,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:28:27,049 INFO L225 Difference]: With dead ends: 169 [2018-02-02 19:28:27,049 INFO L226 Difference]: Without dead ends: 167 [2018-02-02 19:28:27,050 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=521, Invalid=3639, Unknown=0, NotChecked=0, Total=4160 [2018-02-02 19:28:27,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-02-02 19:28:27,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-02-02 19:28:27,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-02 19:28:27,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 168 transitions. [2018-02-02 19:28:27,052 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 168 transitions. Word has length 119 [2018-02-02 19:28:27,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:28:27,052 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 168 transitions. [2018-02-02 19:28:27,052 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 19:28:27,052 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 168 transitions. [2018-02-02 19:28:27,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-02-02 19:28:27,053 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:28:27,053 INFO L351 BasicCegarLoop]: trace histogram [15, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:28:27,053 INFO L371 AbstractCegarLoop]: === Iteration 31 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 19:28:27,053 INFO L82 PathProgramCache]: Analyzing trace with hash -577478985, now seen corresponding path program 1 times [2018-02-02 19:28:27,053 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:28:27,053 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:28:27,054 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:28:27,054 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:28:27,054 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:28:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:28:27,071 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:28:27,326 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-02-02 19:28:27,326 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:28:27,326 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:28:27,331 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:28:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:28:27,393 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:28:27,658 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-02-02 19:28:27,675 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:28:27,675 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 39 [2018-02-02 19:28:27,676 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-02 19:28:27,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-02 19:28:27,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1287, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 19:28:27,677 INFO L87 Difference]: Start difference. First operand 165 states and 168 transitions. Second operand 39 states. [2018-02-02 19:28:28,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:28:28,735 INFO L93 Difference]: Finished difference Result 169 states and 172 transitions. [2018-02-02 19:28:28,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 19:28:28,735 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 134 [2018-02-02 19:28:28,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:28:28,736 INFO L225 Difference]: With dead ends: 169 [2018-02-02 19:28:28,736 INFO L226 Difference]: Without dead ends: 167 [2018-02-02 19:28:28,738 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=595, Invalid=4807, Unknown=0, NotChecked=0, Total=5402 [2018-02-02 19:28:28,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-02-02 19:28:28,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-02-02 19:28:28,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-02 19:28:28,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 168 transitions. [2018-02-02 19:28:28,741 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 168 transitions. Word has length 134 [2018-02-02 19:28:28,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:28:28,741 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 168 transitions. [2018-02-02 19:28:28,741 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-02 19:28:28,742 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 168 transitions. [2018-02-02 19:28:28,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-02-02 19:28:28,742 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:28:28,742 INFO L351 BasicCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:28:28,743 INFO L371 AbstractCegarLoop]: === Iteration 32 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 19:28:28,743 INFO L82 PathProgramCache]: Analyzing trace with hash -460832411, now seen corresponding path program 1 times [2018-02-02 19:28:28,743 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:28:28,743 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:28:28,744 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:28:28,744 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:28:28,744 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:28:28,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:28:28,850 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:28:33,212 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 22 proven. 129 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 19:28:33,212 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:28:33,213 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:28:33,218 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:28:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:28:33,272 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:28:33,359 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:28:33,360 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:28:33,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:28:33,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:28:33,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:28:33,364 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-02-02 19:28:33,418 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:28:33,419 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:33,420 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:28:33,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:28:33,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:28:33,430 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:28:33,431 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2018-02-02 19:28:33,508 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:28:33,510 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:33,511 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:33,512 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:33,512 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:28:33,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:28:33,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:28:33,528 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:28:33,528 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2018-02-02 19:28:33,639 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:28:33,642 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:33,642 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:33,643 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:33,644 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:33,644 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:33,645 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:33,645 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:28:33,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:28:33,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:28:33,666 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:28:33,667 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:68, output treesize:64 [2018-02-02 19:28:33,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 58 treesize of output 47 [2018-02-02 19:28:33,775 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:33,776 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:33,777 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:33,783 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:33,784 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:33,784 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:33,785 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:33,786 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:33,787 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:33,787 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:33,788 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:28:33,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:28:33,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:28:33,825 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:28:33,826 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:84, output treesize:80 [2018-02-02 19:28:33,936 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:28:33,939 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:33,940 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:33,940 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:33,941 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:33,941 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:33,942 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:33,943 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:33,943 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:33,944 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:33,944 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:33,945 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:33,946 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:33,946 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:33,947 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:33,947 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:33,948 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:28:33,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:28:33,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:28:33,991 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:28:33,991 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:100, output treesize:96 [2018-02-02 19:28:34,127 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:28:34,131 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,132 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,133 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,134 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,134 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,135 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,136 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,137 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,138 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,139 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,139 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,140 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,141 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,142 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,143 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,143 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,144 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,145 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,146 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,146 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,147 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,148 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:28:34,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:28:34,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:28:34,205 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:28:34,205 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:116, output treesize:112 [2018-02-02 19:28:34,626 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:28:34,636 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,638 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,639 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,640 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,641 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,642 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,643 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,644 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,645 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,646 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,647 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,648 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,649 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,649 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,650 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,651 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,652 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,654 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,655 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,655 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,656 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,657 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,658 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,658 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,659 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,660 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,661 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,662 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:34,662 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:28:34,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:28:34,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:28:34,746 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:28:34,747 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:132, output treesize:128 [2018-02-02 19:28:39,507 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:28:39,518 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:39,519 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:39,520 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:39,521 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:39,524 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:39,525 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:39,526 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:39,527 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:39,528 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:39,529 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:39,529 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:39,530 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:39,531 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:39,532 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:39,533 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:39,534 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:39,535 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:39,536 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:39,537 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:39,538 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:39,538 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:39,539 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:39,540 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:39,541 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:39,542 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:39,543 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:39,543 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:39,544 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:39,545 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:39,546 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:39,547 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:39,548 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:39,549 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:39,550 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:39,551 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:39,552 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:39,553 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:28:39,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:28:39,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:28:39,654 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:28:39,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:148, output treesize:144 [2018-02-02 19:28:52,397 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:28:52,408 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:52,410 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:52,411 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:52,411 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:52,413 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:52,413 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:52,414 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:52,415 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:52,416 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:52,417 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:52,418 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:52,418 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:52,419 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:52,420 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:52,421 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:52,421 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:52,422 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:52,423 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:52,425 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:52,426 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:52,427 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:52,428 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:52,429 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:52,430 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:52,431 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:52,432 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:52,433 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:52,434 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:52,434 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:52,435 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:52,436 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:52,437 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:52,438 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:52,439 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:52,440 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:52,441 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:52,442 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:52,442 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:52,443 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:52,444 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:52,445 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:52,446 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:52,447 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:52,448 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:52,449 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:28:52,450 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:28:52,450 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:28:52,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:28:52,577 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:28:52,577 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:164, output treesize:160 Received shutdown request... [2018-02-02 19:29:13,945 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-02 19:29:13,945 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 19:29:13,949 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 19:29:13,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 07:29:13 BoogieIcfgContainer [2018-02-02 19:29:13,949 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 19:29:13,950 INFO L168 Benchmark]: Toolchain (without parser) took 93105.53 ms. Allocated memory was 401.6 MB in the beginning and 1.2 GB in the end (delta: 755.0 MB). Free memory was 355.7 MB in the beginning and 1.0 GB in the end (delta: -658.8 MB). Peak memory consumption was 96.2 MB. Max. memory is 5.3 GB. [2018-02-02 19:29:13,951 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 401.6 MB. Free memory is still 364.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 19:29:13,951 INFO L168 Benchmark]: CACSL2BoogieTranslator took 176.00 ms. Allocated memory is still 401.6 MB. Free memory was 355.7 MB in the beginning and 341.1 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:29:13,951 INFO L168 Benchmark]: Boogie Preprocessor took 27.18 ms. Allocated memory is still 401.6 MB. Free memory was 341.1 MB in the beginning and 339.8 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:29:13,951 INFO L168 Benchmark]: RCFGBuilder took 368.70 ms. Allocated memory is still 401.6 MB. Free memory was 339.8 MB in the beginning and 302.7 MB in the end (delta: 37.1 MB). Peak memory consumption was 37.1 MB. Max. memory is 5.3 GB. [2018-02-02 19:29:13,952 INFO L168 Benchmark]: TraceAbstraction took 92530.57 ms. Allocated memory was 401.6 MB in the beginning and 1.2 GB in the end (delta: 755.0 MB). Free memory was 302.7 MB in the beginning and 1.0 GB in the end (delta: -711.8 MB). Peak memory consumption was 43.2 MB. Max. memory is 5.3 GB. [2018-02-02 19:29:13,953 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 401.6 MB. Free memory is still 364.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 176.00 ms. Allocated memory is still 401.6 MB. Free memory was 355.7 MB in the beginning and 341.1 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.18 ms. Allocated memory is still 401.6 MB. Free memory was 341.1 MB in the beginning and 339.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 368.70 ms. Allocated memory is still 401.6 MB. Free memory was 339.8 MB in the beginning and 302.7 MB in the end (delta: 37.1 MB). Peak memory consumption was 37.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 92530.57 ms. Allocated memory was 401.6 MB in the beginning and 1.2 GB in the end (delta: 755.0 MB). Free memory was 302.7 MB in the beginning and 1.0 GB in the end (delta: -711.8 MB). Peak memory consumption was 43.2 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 140 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 71. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1294). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 71. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1411). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 71. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1411). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 71. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1265). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 71. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1265). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 71. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1267). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 71. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1267). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 71. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1256). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 71. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1256). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 71. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1258). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 71. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1258). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 71. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 71. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 71. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 71. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 71. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1339). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 71. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1339). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 71. - TimeoutResultAtElement [Line: 1443]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1443). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 71. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1099). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 71. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1100). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 71. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1100). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 71. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1099). Cancelled while BasicCegarLoop was analyzing trace of length 140 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 71. - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 143 locations, 23 error locations. TIMEOUT Result, 92.4s OverallTime, 32 OverallIterations, 16 TraceHistogramMax, 35.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3830 SDtfs, 1230 SDslu, 34678 SDs, 0 SdLazy, 16493 SolverSat, 387 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1762 GetRequests, 1106 SyntacticMatches, 10 SemanticMatches, 646 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4245 ImplicationChecksByTransitivity, 35.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=165occurred in iteration=30, 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, 31 MinimizatonAttempts, 59 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 3201 NumberOfCodeBlocks, 3157 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 3155 ConstructedInterpolants, 273 QuantifiedInterpolants, 1038937 SizeOfPredicates, 112 NumberOfNonLiveVariables, 5731 ConjunctsInSsa, 562 ConjunctsInUnsatCore, 46 InterpolantComputations, 22 PerfectInterpolantSequences, 706/1588 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_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_19-29-13-959.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_19-29-13-959.csv Completed graceful shutdown