./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 869ef2ac3e655b6efbdfa5c05d637a0f622008da83d6042d15962fe695aee939 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 20:03:41,323 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 20:03:41,381 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 20:03:41,386 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 20:03:41,389 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 20:03:41,403 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 20:03:41,403 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 20:03:41,404 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 20:03:41,404 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 20:03:41,404 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 20:03:41,404 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 20:03:41,404 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 20:03:41,404 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 20:03:41,404 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 20:03:41,405 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 20:03:41,405 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 20:03:41,405 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 20:03:41,405 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 20:03:41,405 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 20:03:41,405 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 20:03:41,405 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 20:03:41,405 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 20:03:41,405 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 20:03:41,405 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 20:03:41,405 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 20:03:41,406 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 20:03:41,406 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 20:03:41,406 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 20:03:41,406 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 20:03:41,406 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 20:03:41,406 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 20:03:41,406 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 20:03:41,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:03:41,406 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 20:03:41,406 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 20:03:41,406 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 20:03:41,407 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 20:03:41,407 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 20:03:41,407 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 20:03:41,407 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 20:03:41,407 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 20:03:41,407 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 20:03:41,407 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 20:03:41,407 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 869ef2ac3e655b6efbdfa5c05d637a0f622008da83d6042d15962fe695aee939 [2025-02-07 20:03:41,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 20:03:41,645 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 20:03:41,646 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 20:03:41,647 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 20:03:41,649 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 20:03:41,651 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i [2025-02-07 20:03:42,896 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e47c787a3/04e5164ad98d49289f85fb88d4665df4/FLAGbc24991df [2025-02-07 20:03:43,173 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 20:03:43,174 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i [2025-02-07 20:03:43,186 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e47c787a3/04e5164ad98d49289f85fb88d4665df4/FLAGbc24991df [2025-02-07 20:03:43,479 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e47c787a3/04e5164ad98d49289f85fb88d4665df4 [2025-02-07 20:03:43,482 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 20:03:43,483 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 20:03:43,484 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 20:03:43,484 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 20:03:43,487 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 20:03:43,488 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:03:43" (1/1) ... [2025-02-07 20:03:43,490 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e8e11e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:03:43, skipping insertion in model container [2025-02-07 20:03:43,490 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:03:43" (1/1) ... [2025-02-07 20:03:43,520 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 20:03:43,767 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i[25842,25855] [2025-02-07 20:03:43,770 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i[25967,25980] [2025-02-07 20:03:43,772 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i[26082,26095] [2025-02-07 20:03:43,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:03:43,786 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 20:03:43,812 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i[25842,25855] [2025-02-07 20:03:43,813 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i[25967,25980] [2025-02-07 20:03:43,814 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i[26082,26095] [2025-02-07 20:03:43,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:03:43,834 INFO L204 MainTranslator]: Completed translation [2025-02-07 20:03:43,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:03:43 WrapperNode [2025-02-07 20:03:43,835 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 20:03:43,836 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 20:03:43,836 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 20:03:43,836 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 20:03:43,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:03:43" (1/1) ... [2025-02-07 20:03:43,849 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:03:43" (1/1) ... [2025-02-07 20:03:43,867 INFO L138 Inliner]: procedures = 139, calls = 57, calls flagged for inlining = 14, calls inlined = 13, statements flattened = 137 [2025-02-07 20:03:43,870 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 20:03:43,871 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 20:03:43,871 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 20:03:43,871 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 20:03:43,878 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:03:43" (1/1) ... [2025-02-07 20:03:43,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:03:43" (1/1) ... [2025-02-07 20:03:43,884 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:03:43" (1/1) ... [2025-02-07 20:03:43,923 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]. [2025-02-07 20:03:43,926 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:03:43" (1/1) ... [2025-02-07 20:03:43,926 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:03:43" (1/1) ... [2025-02-07 20:03:43,937 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:03:43" (1/1) ... [2025-02-07 20:03:43,938 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:03:43" (1/1) ... [2025-02-07 20:03:43,939 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:03:43" (1/1) ... [2025-02-07 20:03:43,939 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:03:43" (1/1) ... [2025-02-07 20:03:43,941 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 20:03:43,944 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 20:03:43,944 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 20:03:43,945 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 20:03:43,945 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:03:43" (1/1) ... [2025-02-07 20:03:43,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:03:43,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:03:43,972 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 20:03:43,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 20:03:43,991 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2025-02-07 20:03:43,991 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2025-02-07 20:03:43,991 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2025-02-07 20:03:43,991 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2025-02-07 20:03:43,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-07 20:03:43,991 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2025-02-07 20:03:43,991 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2025-02-07 20:03:43,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 20:03:43,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-07 20:03:43,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-07 20:03:43,991 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2025-02-07 20:03:43,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2025-02-07 20:03:43,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-07 20:03:43,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-07 20:03:43,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 20:03:43,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-07 20:03:43,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-07 20:03:43,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 20:03:43,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 20:03:43,991 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2025-02-07 20:03:43,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2025-02-07 20:03:43,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 20:03:43,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 20:03:44,095 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 20:03:44,098 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 20:03:44,309 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L663: havoc ldv_set_empty_#t~ret31#1; [2025-02-07 20:03:44,309 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L620: havoc ldv_list_empty_#t~mem10#1.base, ldv_list_empty_#t~mem10#1.offset; [2025-02-07 20:03:44,355 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2025-02-07 20:03:44,355 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 20:03:44,366 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 20:03:44,366 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 20:03:44,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:03:44 BoogieIcfgContainer [2025-02-07 20:03:44,367 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 20:03:44,368 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 20:03:44,369 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 20:03:44,373 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 20:03:44,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 08:03:43" (1/3) ... [2025-02-07 20:03:44,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61d4823b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:03:44, skipping insertion in model container [2025-02-07 20:03:44,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:03:43" (2/3) ... [2025-02-07 20:03:44,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61d4823b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:03:44, skipping insertion in model container [2025-02-07 20:03:44,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:03:44" (3/3) ... [2025-02-07 20:03:44,375 INFO L128 eAbstractionObserver]: Analyzing ICFG test_mutex_double_lock.i [2025-02-07 20:03:44,386 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 20:03:44,388 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test_mutex_double_lock.i that has 6 procedures, 60 locations, 1 initial locations, 2 loop locations, and 3 error locations. [2025-02-07 20:03:44,431 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 20:03:44,442 INFO L333 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, 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;@68ab9784, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 20:03:44,443 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-02-07 20:03:44,447 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 40 states have (on average 1.3) internal successors, (52), 43 states have internal predecessors, (52), 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) [2025-02-07 20:03:44,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-07 20:03:44,452 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:03:44,453 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:03:44,453 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:03:44,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:03:44,457 INFO L85 PathProgramCache]: Analyzing trace with hash -45049607, now seen corresponding path program 1 times [2025-02-07 20:03:44,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:03:44,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145842649] [2025-02-07 20:03:44,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:03:44,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:03:44,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-07 20:03:44,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-07 20:03:44,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:03:44,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:03:44,602 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-07 20:03:44,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:03:44,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145842649] [2025-02-07 20:03:44,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145842649] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:03:44,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645408295] [2025-02-07 20:03:44,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:03:44,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:03:44,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:03:44,607 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:03:44,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 20:03:44,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-07 20:03:44,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-07 20:03:44,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:03:44,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:03:44,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-07 20:03:44,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:03:44,731 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-07 20:03:44,732 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 20:03:44,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645408295] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:03:44,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 20:03:44,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-07 20:03:44,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147412633] [2025-02-07 20:03:44,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:03:44,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 20:03:44,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:03:44,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 20:03:44,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 20:03:44,790 INFO L87 Difference]: Start difference. First operand has 60 states, 40 states have (on average 1.3) internal successors, (52), 43 states have internal predecessors, (52), 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 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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) [2025-02-07 20:03:44,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:03:44,817 INFO L93 Difference]: Finished difference Result 118 states and 152 transitions. [2025-02-07 20:03:44,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 20:03:44,818 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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 25 [2025-02-07 20:03:44,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:03:44,822 INFO L225 Difference]: With dead ends: 118 [2025-02-07 20:03:44,822 INFO L226 Difference]: Without dead ends: 57 [2025-02-07 20:03:44,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 20:03:44,827 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:03:44,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:03:44,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-07 20:03:44,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-02-07 20:03:44,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 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) [2025-02-07 20:03:44,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2025-02-07 20:03:44,856 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 25 [2025-02-07 20:03:44,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:03:44,856 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2025-02-07 20:03:44,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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) [2025-02-07 20:03:44,856 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2025-02-07 20:03:44,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-07 20:03:44,857 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:03:44,857 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:03:44,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-07 20:03:45,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-07 20:03:45,058 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:03:45,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:03:45,058 INFO L85 PathProgramCache]: Analyzing trace with hash -575554087, now seen corresponding path program 1 times [2025-02-07 20:03:45,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:03:45,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730728388] [2025-02-07 20:03:45,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:03:45,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:03:45,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-07 20:03:45,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-07 20:03:45,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:03:45,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:03:45,225 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-07 20:03:45,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:03:45,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730728388] [2025-02-07 20:03:45,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730728388] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:03:45,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:03:45,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 20:03:45,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829842769] [2025-02-07 20:03:45,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:03:45,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:03:45,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:03:45,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:03:45,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:03:45,228 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2025-02-07 20:03:45,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:03:45,248 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2025-02-07 20:03:45,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:03:45,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 25 [2025-02-07 20:03:45,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:03:45,250 INFO L225 Difference]: With dead ends: 63 [2025-02-07 20:03:45,252 INFO L226 Difference]: Without dead ends: 61 [2025-02-07 20:03:45,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:03:45,253 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:03:45,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 192 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:03:45,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-02-07 20:03:45,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-02-07 20:03:45,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 41 states have (on average 1.170731707317073) internal successors, (48), 43 states have internal predecessors, (48), 11 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (14), 12 states have call predecessors, (14), 11 states have call successors, (14) [2025-02-07 20:03:45,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2025-02-07 20:03:45,266 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 25 [2025-02-07 20:03:45,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:03:45,267 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2025-02-07 20:03:45,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2025-02-07 20:03:45,267 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2025-02-07 20:03:45,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-07 20:03:45,268 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:03:45,268 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:03:45,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 20:03:45,268 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:03:45,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:03:45,268 INFO L85 PathProgramCache]: Analyzing trace with hash -670854371, now seen corresponding path program 1 times [2025-02-07 20:03:45,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:03:45,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394223177] [2025-02-07 20:03:45,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:03:45,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:03:45,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-07 20:03:45,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-07 20:03:45,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:03:45,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:03:45,548 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-07 20:03:45,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:03:45,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394223177] [2025-02-07 20:03:45,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394223177] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:03:45,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:03:45,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:03:45,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165785397] [2025-02-07 20:03:45,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:03:45,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:03:45,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:03:45,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:03:45,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:03:45,551 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 20:03:45,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:03:45,846 INFO L93 Difference]: Finished difference Result 174 states and 224 transitions. [2025-02-07 20:03:45,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 20:03:45,847 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (4), 2 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 26 [2025-02-07 20:03:45,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:03:45,848 INFO L225 Difference]: With dead ends: 174 [2025-02-07 20:03:45,849 INFO L226 Difference]: Without dead ends: 119 [2025-02-07 20:03:45,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-07 20:03:45,851 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 69 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:03:45,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 186 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 20:03:45,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-02-07 20:03:45,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 99. [2025-02-07 20:03:45,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 67 states have (on average 1.208955223880597) internal successors, (81), 71 states have internal predecessors, (81), 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) [2025-02-07 20:03:45,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 125 transitions. [2025-02-07 20:03:45,870 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 125 transitions. Word has length 26 [2025-02-07 20:03:45,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:03:45,871 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 125 transitions. [2025-02-07 20:03:45,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 20:03:45,871 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 125 transitions. [2025-02-07 20:03:45,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-07 20:03:45,872 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:03:45,872 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1] [2025-02-07 20:03:45,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 20:03:45,872 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:03:45,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:03:45,873 INFO L85 PathProgramCache]: Analyzing trace with hash 168890527, now seen corresponding path program 1 times [2025-02-07 20:03:45,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:03:45,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614007785] [2025-02-07 20:03:45,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:03:45,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:03:45,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-07 20:03:45,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-07 20:03:45,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:03:45,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 20:03:45,919 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 20:03:45,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-07 20:03:45,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-07 20:03:45,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:03:45,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 20:03:45,973 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 20:03:45,973 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 20:03:45,974 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-02-07 20:03:45,975 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-02-07 20:03:45,975 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-02-07 20:03:45,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 20:03:45,978 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-07 20:03:46,010 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 20:03:46,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 08:03:46 BoogieIcfgContainer [2025-02-07 20:03:46,013 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 20:03:46,014 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 20:03:46,014 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 20:03:46,015 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 20:03:46,015 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:03:44" (3/4) ... [2025-02-07 20:03:46,016 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-07 20:03:46,065 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 39. [2025-02-07 20:03:46,125 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 20:03:46,126 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 20:03:46,126 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 20:03:46,126 INFO L158 Benchmark]: Toolchain (without parser) took 2642.95ms. Allocated memory is still 142.6MB. Free memory was 104.1MB in the beginning and 60.4MB in the end (delta: 43.6MB). Peak memory consumption was 44.1MB. Max. memory is 16.1GB. [2025-02-07 20:03:46,126 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:03:46,126 INFO L158 Benchmark]: CACSL2BoogieTranslator took 351.09ms. Allocated memory is still 142.6MB. Free memory was 104.1MB in the beginning and 84.7MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 20:03:46,127 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.56ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 81.9MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:03:46,127 INFO L158 Benchmark]: Boogie Preprocessor took 70.55ms. Allocated memory is still 142.6MB. Free memory was 81.9MB in the beginning and 78.6MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:03:46,127 INFO L158 Benchmark]: IcfgBuilder took 422.41ms. Allocated memory is still 142.6MB. Free memory was 78.6MB in the beginning and 56.7MB in the end (delta: 21.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-07 20:03:46,127 INFO L158 Benchmark]: TraceAbstraction took 1645.23ms. Allocated memory is still 142.6MB. Free memory was 56.7MB in the beginning and 69.1MB in the end (delta: -12.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:03:46,127 INFO L158 Benchmark]: Witness Printer took 111.34ms. Allocated memory is still 142.6MB. Free memory was 69.1MB in the beginning and 60.4MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:03:46,132 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.28ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 351.09ms. Allocated memory is still 142.6MB. Free memory was 104.1MB in the beginning and 84.7MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.56ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 81.9MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.55ms. Allocated memory is still 142.6MB. Free memory was 81.9MB in the beginning and 78.6MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 422.41ms. Allocated memory is still 142.6MB. Free memory was 78.6MB in the beginning and 56.7MB in the end (delta: 21.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1645.23ms. Allocated memory is still 142.6MB. Free memory was 56.7MB in the beginning and 69.1MB in the end (delta: -12.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 111.34ms. Allocated memory is still 142.6MB. Free memory was 69.1MB in the beginning and 60.4MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * 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 [mutexes={3:0}] [L577] RET assume_abort_if_not(ptr!=0) [L578] return ptr; VAL [\old(size)=8, \result={-1:0}, mutexes={3:0}] [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 [mutexes={3:0}] [L577] RET assume_abort_if_not(ptr!=0) [L578] return ptr; VAL [\old(size)=8, \result={-2:0}, mutexes={3:0}] [L683] RET, EXPR ldv_successful_malloc(sizeof(struct mutex)) VAL [m1={-1: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 [\old(e)={-1:0}, \old(s)={3:0}, mutexes={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] 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)) [L660] return 0; VAL [\old(e)={-1:0}, \old(s)={3:0}, \result=0, e={-1:0}, mutexes={3:0}] [L669] RET ldv_is_in_set(m, &mutexes) VAL [\old(m)={-1:0}, m={-1: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 [\old(e)={-1:0}, \old(s)={3:0}, mutexes={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] 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)) [L660] return 0; VAL [\old(e)={-1:0}, \old(s)={3:0}, \result=0, e={-1:0}, mutexes={3:0}] [L636] RET, EXPR ldv_is_in_set(new, s) VAL [mutexes={3:0}, new={-1:0}, s={3:0}] [L636] COND TRUE !ldv_is_in_set(new, s) [L637] struct ldv_list_element *le; VAL [mutexes={3:0}, new={-1: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 [mutexes={3:0}] [L577] RET assume_abort_if_not(ptr!=0) [L578] return ptr; VAL [\old(size)=12, \result={-3:0}, mutexes={3:0}] [L638] RET, EXPR ldv_successful_malloc(sizeof(struct ldv_list_element)) VAL [mutexes={3:0}, new={-1:0}, s={3:0}] [L638] le = (struct ldv_list_element*)ldv_successful_malloc(sizeof(struct ldv_list_element)) [L639] le->e = new [L640] CALL ldv_list_add(&le->list, s) [L608] EXPR head->next VAL [\old(m)={-1:0}, mutexes={3:0}] [L608] CALL __ldv_list_add(new, head, head->next) VAL [\old(new)={-3:4}, \old(next)={3:0}, \old(prev)={3:0}, mutexes={3:0}] [L596] next->prev = new [L597] new->next = next [L598] new->prev = prev [L599] prev->next = new VAL [\old(new)={-3:4}, \old(next)={3:0}, \old(prev)={3:0}, mutexes={3:0}] [L608] RET __ldv_list_add(new, head, head->next) VAL [head={3:0}, mutexes={3:0}, new={-3:4}] [L640] RET ldv_list_add(&le->list, s) [L670] RET ldv_set_add(m, &mutexes) [L684] RET mutex_lock(m1) VAL [m1={-1:0}, m2={-2:0}, mutexes={3:0}] [L685] CALL mutex_lock(m1) VAL [mutexes={3:0}] [L669] CALL ldv_is_in_set(m, &mutexes) VAL [\old(e)={-1:0}, \old(s)={3:0}, mutexes={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] 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 [\old(e)={-1:0}, \old(s)={3:0}, e={-1:0}, m={-3:0}, mutexes={3:0}, s={3:0}] [L656] COND TRUE m->e == e [L657] return 1; VAL [\old(e)={-1:0}, \old(s)={3:0}, \result=1, m={-3:0}, mutexes={3:0}, s={3:0}] [L669] RET ldv_is_in_set(m, &mutexes) VAL [\old(m)={-1:0}, m={-1:0}, mutexes={3:0}] [L669] COND TRUE ldv_is_in_set(m, &mutexes) [L669] reach_error() VAL [\old(m)={-1:0}, m={-1: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, 60 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 69 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 69 mSDsluCounter, 448 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 250 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 121 IncrementalHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 198 mSDtfsCounter, 121 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=3, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 20 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 159 NumberOfCodeBlocks, 159 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 97 ConstructedInterpolants, 0 QuantifiedInterpolants, 273 SizeOfPredicates, 0 NumberOfNonLiveVariables, 162 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 17/20 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-07 20:03:46,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE