/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/ldv-sets/test_mutex_double_lock.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 16:18:55,452 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 16:18:55,520 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 16:18:55,524 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 16:18:55,524 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 16:18:55,546 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 16:18:55,547 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 16:18:55,547 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 16:18:55,547 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 16:18:55,550 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 16:18:55,550 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 16:18:55,551 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 16:18:55,551 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 16:18:55,552 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 16:18:55,552 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 16:18:55,553 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 16:18:55,553 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 16:18:55,553 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 16:18:55,553 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 16:18:55,553 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 16:18:55,554 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 16:18:55,554 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 16:18:55,554 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 16:18:55,554 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 16:18:55,554 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 16:18:55,554 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 16:18:55,555 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 16:18:55,555 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 16:18:55,555 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 16:18:55,555 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 16:18:55,556 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 16:18:55,556 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 16:18:55,556 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 16:18:55,556 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 16:18:55,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:18:55,556 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 16:18:55,556 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 16:18:55,556 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 16:18:55,557 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 16:18:55,557 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 16:18:55,557 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 16:18:55,557 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 16:18:55,557 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 16:18:55,557 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 16:18:55,557 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 16:18:55,558 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 16:18:55,558 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-16 16:18:55,736 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 16:18:55,761 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 16:18:55,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 16:18:55,763 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 16:18:55,764 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 16:18:55,765 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-sets/test_mutex_double_lock.i [2023-12-16 16:18:56,789 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 16:18:57,027 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 16:18:57,028 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_double_lock.i [2023-12-16 16:18:57,050 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c86aa375/c1a5a4eddb3c44969861199688b327d1/FLAGb23ef9772 [2023-12-16 16:18:57,063 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c86aa375/c1a5a4eddb3c44969861199688b327d1 [2023-12-16 16:18:57,065 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 16:18:57,066 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 16:18:57,068 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 16:18:57,068 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 16:18:57,071 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 16:18:57,072 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:18:57" (1/1) ... [2023-12-16 16:18:57,073 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@623cabe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:57, skipping insertion in model container [2023-12-16 16:18:57,073 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:18:57" (1/1) ... [2023-12-16 16:18:57,114 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 16:18:57,378 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_double_lock.i[25842,25855] [2023-12-16 16:18:57,382 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_double_lock.i[25967,25980] [2023-12-16 16:18:57,383 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_double_lock.i[26082,26095] [2023-12-16 16:18:57,388 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:18:57,403 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-12-16 16:18:57,412 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 16:18:57,455 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_double_lock.i[25842,25855] [2023-12-16 16:18:57,456 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_double_lock.i[25967,25980] [2023-12-16 16:18:57,457 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_double_lock.i[26082,26095] [2023-12-16 16:18:57,457 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:18:57,459 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 16:18:57,501 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_double_lock.i[25842,25855] [2023-12-16 16:18:57,502 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_double_lock.i[25967,25980] [2023-12-16 16:18:57,503 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_double_lock.i[26082,26095] [2023-12-16 16:18:57,503 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:18:57,537 INFO L206 MainTranslator]: Completed translation [2023-12-16 16:18:57,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:57 WrapperNode [2023-12-16 16:18:57,538 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 16:18:57,539 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 16:18:57,539 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 16:18:57,539 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 16:18:57,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:57" (1/1) ... [2023-12-16 16:18:57,563 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:57" (1/1) ... [2023-12-16 16:18:57,585 INFO L138 Inliner]: procedures = 140, calls = 57, calls flagged for inlining = 14, calls inlined = 13, statements flattened = 136 [2023-12-16 16:18:57,585 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 16:18:57,585 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 16:18:57,586 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 16:18:57,586 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 16:18:57,603 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:57" (1/1) ... [2023-12-16 16:18:57,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:57" (1/1) ... [2023-12-16 16:18:57,618 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:57" (1/1) ... [2023-12-16 16:18:57,654 INFO L175 MemorySlicer]: Split 22 memory accesses to 2 slices as follows [2, 20]. 91 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 7 writes are split as follows [0, 7]. [2023-12-16 16:18:57,655 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:57" (1/1) ... [2023-12-16 16:18:57,655 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:57" (1/1) ... [2023-12-16 16:18:57,667 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:57" (1/1) ... [2023-12-16 16:18:57,671 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:57" (1/1) ... [2023-12-16 16:18:57,679 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:57" (1/1) ... [2023-12-16 16:18:57,681 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:57" (1/1) ... [2023-12-16 16:18:57,689 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 16:18:57,689 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 16:18:57,689 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 16:18:57,690 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 16:18:57,690 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:57" (1/1) ... [2023-12-16 16:18:57,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:18:57,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 16:18:57,711 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 16:18:57,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 16:18:57,744 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2023-12-16 16:18:57,745 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2023-12-16 16:18:57,745 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2023-12-16 16:18:57,745 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2023-12-16 16:18:57,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-16 16:18:57,745 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2023-12-16 16:18:57,745 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2023-12-16 16:18:57,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 16:18:57,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-16 16:18:57,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-16 16:18:57,746 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2023-12-16 16:18:57,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2023-12-16 16:18:57,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-16 16:18:57,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-16 16:18:57,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-16 16:18:57,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-16 16:18:57,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-16 16:18:57,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 16:18:57,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-16 16:18:57,747 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2023-12-16 16:18:57,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2023-12-16 16:18:57,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 16:18:57,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 16:18:57,865 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 16:18:57,866 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 16:18:58,143 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 16:18:58,179 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 16:18:58,179 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-16 16:18:58,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:18:58 BoogieIcfgContainer [2023-12-16 16:18:58,180 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 16:18:58,181 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 16:18:58,181 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 16:18:58,183 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 16:18:58,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:18:57" (1/3) ... [2023-12-16 16:18:58,184 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dfc602c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:18:58, skipping insertion in model container [2023-12-16 16:18:58,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:57" (2/3) ... [2023-12-16 16:18:58,184 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dfc602c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:18:58, skipping insertion in model container [2023-12-16 16:18:58,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:18:58" (3/3) ... [2023-12-16 16:18:58,185 INFO L112 eAbstractionObserver]: Analyzing ICFG test_mutex_double_lock.i [2023-12-16 16:18:58,196 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 16:18:58,196 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-12-16 16:18:58,231 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 16:18:58,236 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7bbc31b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 16:18:58,237 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-16 16:18:58,239 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 32 states have (on average 1.4375) internal successors, (46), 35 states have internal predecessors, (46), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-16 16:18:58,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-16 16:18:58,245 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:18:58,245 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:18:58,245 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:18:58,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:18:58,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1319468369, now seen corresponding path program 1 times [2023-12-16 16:18:58,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:18:58,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1431854042] [2023-12-16 16:18:58,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:18:58,259 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:18:58,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:18:58,262 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:18:58,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-16 16:18:58,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:18:58,388 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 16:18:58,392 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:18:58,409 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-16 16:18:58,409 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:18:58,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:18:58,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1431854042] [2023-12-16 16:18:58,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1431854042] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:18:58,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:18:58,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 16:18:58,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694284070] [2023-12-16 16:18:58,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:18:58,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 16:18:58,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:18:58,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 16:18:58,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 16:18:58,438 INFO L87 Difference]: Start difference. First operand has 52 states, 32 states have (on average 1.4375) internal successors, (46), 35 states have internal predecessors, (46), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 16:18:58,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:18:58,501 INFO L93 Difference]: Finished difference Result 102 states and 143 transitions. [2023-12-16 16:18:58,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 16:18:58,503 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2023-12-16 16:18:58,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:18:58,507 INFO L225 Difference]: With dead ends: 102 [2023-12-16 16:18:58,507 INFO L226 Difference]: Without dead ends: 50 [2023-12-16 16:18:58,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 16:18:58,511 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:18:58,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:18:58,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-12-16 16:18:58,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-12-16 16:18:58,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 33 states have internal predecessors, (38), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-16 16:18:58,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2023-12-16 16:18:58,534 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 23 [2023-12-16 16:18:58,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:18:58,534 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2023-12-16 16:18:58,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 16:18:58,535 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2023-12-16 16:18:58,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-16 16:18:58,535 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:18:58,535 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:18:58,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-16 16:18:58,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:18:58,739 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:18:58,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:18:58,739 INFO L85 PathProgramCache]: Analyzing trace with hash -509297331, now seen corresponding path program 1 times [2023-12-16 16:18:58,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:18:58,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085609655] [2023-12-16 16:18:58,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:18:58,740 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:18:58,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:18:58,741 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:18:58,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-16 16:18:58,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:18:58,818 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-16 16:18:58,823 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:18:59,208 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 16:18:59,208 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:18:59,208 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:18:59,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085609655] [2023-12-16 16:18:59,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1085609655] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:18:59,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:18:59,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 16:18:59,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884919985] [2023-12-16 16:18:59,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:18:59,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 16:18:59,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:18:59,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 16:18:59,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 16:18:59,212 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 16:18:59,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:18:59,617 INFO L93 Difference]: Finished difference Result 141 states and 179 transitions. [2023-12-16 16:18:59,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 16:18:59,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2023-12-16 16:18:59,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:18:59,620 INFO L225 Difference]: With dead ends: 141 [2023-12-16 16:18:59,620 INFO L226 Difference]: Without dead ends: 97 [2023-12-16 16:18:59,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:18:59,622 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 42 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 16:18:59,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 130 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 16:18:59,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-12-16 16:18:59,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 85. [2023-12-16 16:18:59,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 58 states have internal predecessors, (69), 18 states have call successors, (18), 9 states have call predecessors, (18), 10 states have return successors, (23), 17 states have call predecessors, (23), 18 states have call successors, (23) [2023-12-16 16:18:59,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 110 transitions. [2023-12-16 16:18:59,646 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 110 transitions. Word has length 23 [2023-12-16 16:18:59,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:18:59,648 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 110 transitions. [2023-12-16 16:18:59,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 16:18:59,651 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 110 transitions. [2023-12-16 16:18:59,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-16 16:18:59,651 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:18:59,651 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:18:59,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-16 16:18:59,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:18:59,855 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:18:59,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:18:59,855 INFO L85 PathProgramCache]: Analyzing trace with hash -560090986, now seen corresponding path program 1 times [2023-12-16 16:18:59,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:18:59,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [97262889] [2023-12-16 16:18:59,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:18:59,856 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:18:59,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:18:59,857 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:18:59,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-16 16:18:59,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:18:59,920 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 16:18:59,922 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:18:59,933 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 16:18:59,933 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:18:59,933 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:18:59,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [97262889] [2023-12-16 16:18:59,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [97262889] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:18:59,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:18:59,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 16:18:59,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551183876] [2023-12-16 16:18:59,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:18:59,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 16:18:59,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:18:59,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 16:18:59,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 16:18:59,935 INFO L87 Difference]: Start difference. First operand 85 states and 110 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 16:19:00,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:19:00,077 INFO L93 Difference]: Finished difference Result 92 states and 119 transitions. [2023-12-16 16:19:00,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 16:19:00,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2023-12-16 16:19:00,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:19:00,079 INFO L225 Difference]: With dead ends: 92 [2023-12-16 16:19:00,079 INFO L226 Difference]: Without dead ends: 90 [2023-12-16 16:19:00,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 16:19:00,080 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:19:00,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:19:00,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-12-16 16:19:00,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2023-12-16 16:19:00,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 56 states have (on average 1.25) internal successors, (70), 60 states have internal predecessors, (70), 18 states have call successors, (18), 9 states have call predecessors, (18), 11 states have return successors, (26), 18 states have call predecessors, (26), 18 states have call successors, (26) [2023-12-16 16:19:00,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 114 transitions. [2023-12-16 16:19:00,091 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 114 transitions. Word has length 23 [2023-12-16 16:19:00,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:19:00,091 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 114 transitions. [2023-12-16 16:19:00,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 16:19:00,092 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 114 transitions. [2023-12-16 16:19:00,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-16 16:19:00,093 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:19:00,093 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 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] [2023-12-16 16:19:00,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-16 16:19:00,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:19:00,296 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:19:00,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:19:00,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1184464339, now seen corresponding path program 1 times [2023-12-16 16:19:00,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:19:00,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1654823401] [2023-12-16 16:19:00,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:19:00,298 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:19:00,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:19:00,299 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:19:00,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-16 16:19:00,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:19:00,407 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-16 16:19:00,411 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:19:00,783 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-16 16:19:00,783 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:19:00,783 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:19:00,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1654823401] [2023-12-16 16:19:00,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1654823401] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:19:00,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:19:00,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 16:19:00,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112404586] [2023-12-16 16:19:00,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:19:00,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 16:19:00,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:19:00,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 16:19:00,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-16 16:19:00,785 INFO L87 Difference]: Start difference. First operand 88 states and 114 transitions. Second operand has 9 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 4 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2023-12-16 16:19:02,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:19:02,204 INFO L93 Difference]: Finished difference Result 227 states and 297 transitions. [2023-12-16 16:19:02,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-16 16:19:02,204 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 4 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 61 [2023-12-16 16:19:02,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:19:02,206 INFO L225 Difference]: With dead ends: 227 [2023-12-16 16:19:02,206 INFO L226 Difference]: Without dead ends: 137 [2023-12-16 16:19:02,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2023-12-16 16:19:02,208 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 180 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:19:02,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 170 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-16 16:19:02,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-12-16 16:19:02,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 104. [2023-12-16 16:19:02,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 68 states have (on average 1.2352941176470589) internal successors, (84), 74 states have internal predecessors, (84), 19 states have call successors, (19), 10 states have call predecessors, (19), 14 states have return successors, (32), 19 states have call predecessors, (32), 19 states have call successors, (32) [2023-12-16 16:19:02,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 135 transitions. [2023-12-16 16:19:02,223 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 135 transitions. Word has length 61 [2023-12-16 16:19:02,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:19:02,223 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 135 transitions. [2023-12-16 16:19:02,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 4 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2023-12-16 16:19:02,224 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 135 transitions. [2023-12-16 16:19:02,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-16 16:19:02,225 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:19:02,225 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 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] [2023-12-16 16:19:02,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-16 16:19:02,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:19:02,430 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:19:02,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:19:02,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1213095821, now seen corresponding path program 1 times [2023-12-16 16:19:02,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:19:02,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1723184267] [2023-12-16 16:19:02,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:19:02,431 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:19:02,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:19:02,432 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:19:02,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-16 16:19:02,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:19:02,532 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 16:19:02,535 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:19:02,547 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-16 16:19:02,547 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:19:02,547 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:19:02,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1723184267] [2023-12-16 16:19:02,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1723184267] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:19:02,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:19:02,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 16:19:02,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566440966] [2023-12-16 16:19:02,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:19:02,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 16:19:02,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:19:02,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 16:19:02,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 16:19:02,553 INFO L87 Difference]: Start difference. First operand 104 states and 135 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-16 16:19:02,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:19:02,701 INFO L93 Difference]: Finished difference Result 166 states and 207 transitions. [2023-12-16 16:19:02,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 16:19:02,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 61 [2023-12-16 16:19:02,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:19:02,703 INFO L225 Difference]: With dead ends: 166 [2023-12-16 16:19:02,703 INFO L226 Difference]: Without dead ends: 93 [2023-12-16 16:19:02,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 16:19:02,704 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:19:02,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:19:02,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-12-16 16:19:02,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2023-12-16 16:19:02,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 62 states have internal predecessors, (68), 15 states have call successors, (15), 9 states have call predecessors, (15), 12 states have return successors, (23), 16 states have call predecessors, (23), 15 states have call successors, (23) [2023-12-16 16:19:02,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 106 transitions. [2023-12-16 16:19:02,715 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 106 transitions. Word has length 61 [2023-12-16 16:19:02,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:19:02,715 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 106 transitions. [2023-12-16 16:19:02,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-16 16:19:02,715 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 106 transitions. [2023-12-16 16:19:02,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-16 16:19:02,721 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:19:02,721 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2023-12-16 16:19:02,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-16 16:19:02,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:19:02,928 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:19:02,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:19:02,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1300834151, now seen corresponding path program 1 times [2023-12-16 16:19:02,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:19:02,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [14883436] [2023-12-16 16:19:02,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:19:02,929 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:19:02,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:19:02,930 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:19:02,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-16 16:19:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 16:19:03,105 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 16:19:03,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 16:19:03,253 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-16 16:19:03,253 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 16:19:03,254 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-12-16 16:19:03,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-12-16 16:19:03,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-12-16 16:19:03,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-16 16:19:03,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:19:03,459 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-16 16:19:03,461 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 16:19:03,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:19:03 BoogieIcfgContainer [2023-12-16 16:19:03,501 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 16:19:03,501 INFO L158 Benchmark]: Toolchain (without parser) took 6434.71ms. Allocated memory was 303.0MB in the beginning and 363.9MB in the end (delta: 60.8MB). Free memory was 251.2MB in the beginning and 255.4MB in the end (delta: -4.3MB). Peak memory consumption was 57.2MB. Max. memory is 8.0GB. [2023-12-16 16:19:03,501 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 234.9MB. Free memory is still 185.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 16:19:03,501 INFO L158 Benchmark]: CACSL2BoogieTranslator took 469.77ms. Allocated memory is still 303.0MB. Free memory was 251.2MB in the beginning and 224.9MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2023-12-16 16:19:03,502 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.96ms. Allocated memory is still 303.0MB. Free memory was 224.9MB in the beginning and 222.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 16:19:03,502 INFO L158 Benchmark]: Boogie Preprocessor took 103.34ms. Allocated memory is still 303.0MB. Free memory was 222.4MB in the beginning and 217.2MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-16 16:19:03,502 INFO L158 Benchmark]: RCFGBuilder took 490.45ms. Allocated memory is still 303.0MB. Free memory was 217.2MB in the beginning and 244.0MB in the end (delta: -26.8MB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. [2023-12-16 16:19:03,503 INFO L158 Benchmark]: TraceAbstraction took 5319.59ms. Allocated memory was 303.0MB in the beginning and 363.9MB in the end (delta: 60.8MB). Free memory was 243.0MB in the beginning and 255.4MB in the end (delta: -12.5MB). Peak memory consumption was 47.8MB. Max. memory is 8.0GB. [2023-12-16 16:19:03,505 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 234.9MB. Free memory is still 185.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 469.77ms. Allocated memory is still 303.0MB. Free memory was 251.2MB in the beginning and 224.9MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.96ms. Allocated memory is still 303.0MB. Free memory was 224.9MB in the beginning and 222.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 103.34ms. Allocated memory is still 303.0MB. Free memory was 222.4MB in the beginning and 217.2MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 490.45ms. Allocated memory is still 303.0MB. Free memory was 217.2MB in the beginning and 244.0MB in the end (delta: -26.8MB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. * TraceAbstraction took 5319.59ms. Allocated memory was 303.0MB in the beginning and 363.9MB in the end (delta: 60.8MB). Free memory was 243.0MB in the beginning and 255.4MB in the end (delta: -12.5MB). Peak memory consumption was 47.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 669]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L665] struct ldv_list_head mutexes = { &(mutexes), &(mutexes) }; [L665] struct ldv_list_head mutexes = { &(mutexes), &(mutexes) }; [L665] struct ldv_list_head mutexes = { &(mutexes), &(mutexes) }; [L692] CALL foo() [L681] FCALL ldv_initialize() [L682] CALL, EXPR ldv_successful_malloc(sizeof(struct mutex)) VAL [mutexes={3:0}] [L576] void *ptr = malloc(size); [L577] CALL assume_abort_if_not(ptr!=0) [L565] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, mutexes={3:0}] [L577] RET assume_abort_if_not(ptr!=0) [L578] return ptr; [L682] RET, EXPR ldv_successful_malloc(sizeof(struct mutex)) VAL [mutexes={3:0}] [L682] struct mutex *m1 = ldv_successful_malloc(sizeof(struct mutex)); [L683] CALL, EXPR ldv_successful_malloc(sizeof(struct mutex)) VAL [mutexes={3:0}] [L576] void *ptr = malloc(size); [L577] CALL assume_abort_if_not(ptr!=0) [L565] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, mutexes={3:0}] [L577] RET assume_abort_if_not(ptr!=0) [L578] return ptr; [L683] RET, EXPR ldv_successful_malloc(sizeof(struct mutex)) VAL [m1={7:0}, mutexes={3:0}] [L683] struct mutex *m2 = ldv_successful_malloc(sizeof(struct mutex)); [L684] CALL mutex_lock(m1) VAL [mutexes={3:0}] [L669] CALL ldv_is_in_set(m, &mutexes) VAL [e={7:0}, mutexes={3:0}, s={3:0}] [L654] struct ldv_list_element *m; [L655] EXPR (s)->next [L655] const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); [L655] { const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); (typeof(*m) *)( (char *)__mptr - ((size_t) &((typeof(*m) *)0)->list) );} [L655] { const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); (typeof(*m) *)( (char *)__mptr - ((size_t) &((typeof(*m) *)0)->list) );} [L655] m = ({ const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); (typeof(*m) *)( (char *)__mptr - ((size_t) &((typeof(*m) *)0)->list) );}) [L655] COND FALSE !(&m->list != (s)) VAL [e={7:0}, e={7:0}, m={3:-4}, mutexes={3:0}, s={3:0}, s={3:0}] [L660] return 0; VAL [\result=0, e={7:0}, e={7:0}, m={3:-4}, mutexes={3:0}, s={3:0}, s={3:0}] [L669] RET ldv_is_in_set(m, &mutexes) VAL [m={7:0}, m={7:0}, mutexes={3:0}] [L669] COND FALSE !(ldv_is_in_set(m, &mutexes)) [L670] CALL ldv_set_add(m, &mutexes) [L636] CALL, EXPR ldv_is_in_set(new, s) VAL [e={7:0}, mutexes={3:0}, s={3:0}] [L654] struct ldv_list_element *m; [L655] EXPR (s)->next [L655] const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); [L655] { const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); (typeof(*m) *)( (char *)__mptr - ((size_t) &((typeof(*m) *)0)->list) );} [L655] { const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); (typeof(*m) *)( (char *)__mptr - ((size_t) &((typeof(*m) *)0)->list) );} [L655] m = ({ const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); (typeof(*m) *)( (char *)__mptr - ((size_t) &((typeof(*m) *)0)->list) );}) [L655] COND FALSE !(&m->list != (s)) VAL [e={7:0}, e={7:0}, m={3:-4}, mutexes={3:0}, s={3:0}, s={3:0}] [L660] return 0; VAL [\result=0, e={7:0}, e={7:0}, m={3:-4}, mutexes={3:0}, s={3:0}, s={3:0}] [L636] RET, EXPR ldv_is_in_set(new, s) VAL [mutexes={3:0}, new={7:0}, new={7:0}, s={3:0}, s={3:0}] [L636] COND TRUE !ldv_is_in_set(new, s) [L637] struct ldv_list_element *le; VAL [mutexes={3:0}, new={7:0}, new={7:0}, s={3:0}, s={3:0}] [L638] CALL, EXPR ldv_successful_malloc(sizeof(struct ldv_list_element)) VAL [mutexes={3:0}] [L576] void *ptr = malloc(size); [L577] CALL assume_abort_if_not(ptr!=0) [L565] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, mutexes={3:0}] [L577] RET assume_abort_if_not(ptr!=0) [L578] return ptr; [L638] RET, EXPR ldv_successful_malloc(sizeof(struct ldv_list_element)) VAL [mutexes={3:0}, new={7:0}, new={7:0}, s={3:0}, s={3:0}] [L638] EXPR le = (struct ldv_list_element*)ldv_successful_malloc(sizeof(struct ldv_list_element)) [L639] EXPR le->e = new [L640] CALL, EXPR ldv_list_add(&le->list, s) [L608] EXPR head->next VAL [m={7:0}, m={7:0}, mutexes={3:0}] [L608] CALL __ldv_list_add(new, head, head->next) VAL [mutexes={3:0}, new={6:4}, next={3:0}, prev={3:0}] [L596] next->prev = new [L597] new->next = next [L598] new->prev = prev [L599] prev->next = new [L608] RET __ldv_list_add(new, head, head->next) VAL [head={3:0}, head={3:0}, mutexes={3:0}, new={6:4}, new={6:4}] [L640] RET, EXPR ldv_list_add(&le->list, s) [L636-L641] { struct ldv_list_element *le; le = (struct ldv_list_element*)ldv_successful_malloc(sizeof(struct ldv_list_element)); le->e = new; ldv_list_add(&le->list, s); } VAL [mutexes={3:0}, new={7:0}, new={7:0}, s={3:0}, s={3:0}] [L670] RET ldv_set_add(m, &mutexes) [L684] RET mutex_lock(m1) VAL [m1={7:0}, m2={5:0}, mutexes={3:0}] [L685] CALL mutex_lock(m1) VAL [mutexes={3:0}] [L669] CALL ldv_is_in_set(m, &mutexes) VAL [e={7:0}, mutexes={3:0}, s={3:0}] [L654] struct ldv_list_element *m; [L655] EXPR (s)->next [L655] const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); [L655] { const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); (typeof(*m) *)( (char *)__mptr - ((size_t) &((typeof(*m) *)0)->list) );} [L655] { const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); (typeof(*m) *)( (char *)__mptr - ((size_t) &((typeof(*m) *)0)->list) );} [L655] m = ({ const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); (typeof(*m) *)( (char *)__mptr - ((size_t) &((typeof(*m) *)0)->list) );}) [L655] COND TRUE &m->list != (s) [L656] EXPR m->e VAL [e={7:0}, e={7:0}, m={6:0}, mutexes={3:0}, s={3:0}, s={3:0}] [L656] COND TRUE m->e == e [L657] return 1; VAL [\result=1, e={7:0}, e={7:0}, m={6:0}, mutexes={3:0}, s={3:0}, s={3:0}] [L669] RET ldv_is_in_set(m, &mutexes) VAL [m={7:0}, m={7:0}, mutexes={3:0}] [L669] COND TRUE ldv_is_in_set(m, &mutexes) [L669] reach_error() VAL [m={7:0}, m={7:0}, mutexes={3:0}] - UnprovableResult [Line: 673]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 677]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 52 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 6, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 236 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 222 mSDsluCounter, 653 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 406 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 602 IncrementalHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 247 mSDtfsCounter, 602 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 198 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=4, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 52 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 243 NumberOfCodeBlocks, 243 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 186 ConstructedInterpolants, 0 QuantifiedInterpolants, 1217 SizeOfPredicates, 14 NumberOfNonLiveVariables, 738 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 130/130 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-12-16 16:19:03,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...