./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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-?-e2fb8be-m [2025-03-08 04:25:09,754 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 04:25:09,815 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 04:25:09,821 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 04:25:09,823 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 04:25:09,843 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 04:25:09,843 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 04:25:09,843 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 04:25:09,844 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 04:25:09,844 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 04:25:09,844 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 04:25:09,844 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 04:25:09,844 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 04:25:09,844 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 04:25:09,845 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 04:25:09,845 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 04:25:09,845 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 04:25:09,845 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 04:25:09,845 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 04:25:09,845 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 04:25:09,845 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 04:25:09,846 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 04:25:09,846 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 04:25:09,846 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 04:25:09,846 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 04:25:09,846 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 04:25:09,846 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 04:25:09,846 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 04:25:09,846 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 04:25:09,846 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 04:25:09,847 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 04:25:09,847 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 04:25:09,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:25:09,847 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 04:25:09,847 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 04:25:09,847 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 04:25:09,847 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 04:25:09,847 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 04:25:09,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 04:25:09,847 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 04:25:09,847 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 04:25:09,847 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 04:25:09,847 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 04:25:09,848 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/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-03-08 04:25:10,068 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 04:25:10,077 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 04:25:10,078 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 04:25:10,080 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 04:25:10,080 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 04:25:10,082 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i [2025-03-08 04:25:11,203 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10cef82ea/20778a6a4fbb43cba978f24d064d5ddd/FLAG2d9bcf7b6 [2025-03-08 04:25:11,505 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 04:25:11,510 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i [2025-03-08 04:25:11,524 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10cef82ea/20778a6a4fbb43cba978f24d064d5ddd/FLAG2d9bcf7b6 [2025-03-08 04:25:11,539 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10cef82ea/20778a6a4fbb43cba978f24d064d5ddd [2025-03-08 04:25:11,541 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 04:25:11,542 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 04:25:11,544 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 04:25:11,544 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 04:25:11,547 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 04:25:11,547 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:25:11" (1/1) ... [2025-03-08 04:25:11,549 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27c4a44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:25:11, skipping insertion in model container [2025-03-08 04:25:11,549 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:25:11" (1/1) ... [2025-03-08 04:25:11,578 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 04:25:11,831 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i[25842,25855] [2025-03-08 04:25:11,835 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i[25967,25980] [2025-03-08 04:25:11,838 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i[26082,26095] [2025-03-08 04:25:11,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:25:11,854 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 04:25:11,885 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i[25842,25855] [2025-03-08 04:25:11,889 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i[25967,25980] [2025-03-08 04:25:11,890 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i[26082,26095] [2025-03-08 04:25:11,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:25:11,918 INFO L204 MainTranslator]: Completed translation [2025-03-08 04:25:11,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:25:11 WrapperNode [2025-03-08 04:25:11,919 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 04:25:11,920 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 04:25:11,920 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 04:25:11,920 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 04:25:11,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:25:11" (1/1) ... [2025-03-08 04:25:11,934 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:25:11" (1/1) ... [2025-03-08 04:25:11,950 INFO L138 Inliner]: procedures = 139, calls = 57, calls flagged for inlining = 14, calls inlined = 13, statements flattened = 137 [2025-03-08 04:25:11,951 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 04:25:11,952 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 04:25:11,952 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 04:25:11,952 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 04:25:11,957 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:25:11" (1/1) ... [2025-03-08 04:25:11,957 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:25:11" (1/1) ... [2025-03-08 04:25:11,960 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:25:11" (1/1) ... [2025-03-08 04:25:11,986 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-03-08 04:25:11,987 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:25:11" (1/1) ... [2025-03-08 04:25:11,987 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:25:11" (1/1) ... [2025-03-08 04:25:11,999 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:25:11" (1/1) ... [2025-03-08 04:25:12,000 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:25:11" (1/1) ... [2025-03-08 04:25:12,004 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:25:11" (1/1) ... [2025-03-08 04:25:12,004 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:25:11" (1/1) ... [2025-03-08 04:25:12,006 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 04:25:12,007 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 04:25:12,007 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 04:25:12,007 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 04:25:12,011 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:25:11" (1/1) ... [2025-03-08 04:25:12,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:25:12,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:25:12,036 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) [2025-03-08 04:25:12,041 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 [2025-03-08 04:25:12,056 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2025-03-08 04:25:12,056 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2025-03-08 04:25:12,057 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2025-03-08 04:25:12,057 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2025-03-08 04:25:12,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 04:25:12,057 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2025-03-08 04:25:12,057 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2025-03-08 04:25:12,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 04:25:12,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 04:25:12,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 04:25:12,057 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2025-03-08 04:25:12,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2025-03-08 04:25:12,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 04:25:12,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 04:25:12,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 04:25:12,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 04:25:12,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 04:25:12,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 04:25:12,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 04:25:12,057 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2025-03-08 04:25:12,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2025-03-08 04:25:12,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 04:25:12,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 04:25:12,150 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 04:25:12,154 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 04:25:12,339 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L663: havoc ldv_set_empty_#t~ret31#1; [2025-03-08 04:25:12,339 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L620: havoc ldv_list_empty_#t~mem10#1.base, ldv_list_empty_#t~mem10#1.offset; [2025-03-08 04:25:12,376 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2025-03-08 04:25:12,376 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 04:25:12,387 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 04:25:12,389 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 04:25:12,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:25:12 BoogieIcfgContainer [2025-03-08 04:25:12,389 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 04:25:12,391 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 04:25:12,391 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 04:25:12,394 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 04:25:12,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:25:11" (1/3) ... [2025-03-08 04:25:12,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c852ff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:25:12, skipping insertion in model container [2025-03-08 04:25:12,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:25:11" (2/3) ... [2025-03-08 04:25:12,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c852ff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:25:12, skipping insertion in model container [2025-03-08 04:25:12,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:25:12" (3/3) ... [2025-03-08 04:25:12,397 INFO L128 eAbstractionObserver]: Analyzing ICFG test_mutex_double_lock.i [2025-03-08 04:25:12,408 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 04:25:12,410 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test_mutex_double_lock.i that has 6 procedures, 68 locations, 1 initial locations, 2 loop locations, and 3 error locations. [2025-03-08 04:25:12,445 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 04:25:12,454 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;@178bc375, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 04:25:12,454 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-08 04:25:12,457 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 48 states have (on average 1.25) internal successors, (60), 51 states have internal predecessors, (60), 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-03-08 04:25:12,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 04:25:12,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:25:12,463 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, 1] [2025-03-08 04:25:12,463 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:25:12,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:25:12,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1577892343, now seen corresponding path program 1 times [2025-03-08 04:25:12,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:25:12,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837576481] [2025-03-08 04:25:12,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:25:12,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:25:12,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 04:25:12,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 04:25:12,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:25:12,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:25:12,613 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 04:25:12,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:25:12,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837576481] [2025-03-08 04:25:12,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837576481] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:25:12,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402220508] [2025-03-08 04:25:12,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:25:12,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:25:12,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:25:12,618 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:25:12,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 04:25:12,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 04:25:12,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 04:25:12,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:25:12,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:25:12,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 04:25:12,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:25:12,765 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 04:25:12,768 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 04:25:12,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402220508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:25:12,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 04:25:12,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 04:25:12,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471432475] [2025-03-08 04:25:12,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:25:12,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 04:25:12,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:25:12,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 04:25:12,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 04:25:12,791 INFO L87 Difference]: Start difference. First operand has 68 states, 48 states have (on average 1.25) internal successors, (60), 51 states have internal predecessors, (60), 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 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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-03-08 04:25:12,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:25:12,808 INFO L93 Difference]: Finished difference Result 132 states and 166 transitions. [2025-03-08 04:25:12,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 04:25:12,810 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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 27 [2025-03-08 04:25:12,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:25:12,815 INFO L225 Difference]: With dead ends: 132 [2025-03-08 04:25:12,815 INFO L226 Difference]: Without dead ends: 63 [2025-03-08 04:25:12,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 28 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-03-08 04:25:12,819 INFO L435 NwaCegarLoop]: 78 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, 78 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-03-08 04:25:12,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:25:12,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-08 04:25:12,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-08 04:25:12,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 46 states have internal predecessors, (51), 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-03-08 04:25:12,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2025-03-08 04:25:12,849 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 27 [2025-03-08 04:25:12,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:25:12,849 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2025-03-08 04:25:12,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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-03-08 04:25:12,850 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2025-03-08 04:25:12,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 04:25:12,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:25:12,851 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, 1] [2025-03-08 04:25:12,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 04:25:13,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 04:25:13,055 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:25:13,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:25:13,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1047387863, now seen corresponding path program 1 times [2025-03-08 04:25:13,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:25:13,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365223819] [2025-03-08 04:25:13,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:25:13,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:25:13,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 04:25:13,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 04:25:13,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:25:13,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:25:13,182 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 04:25:13,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:25:13,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365223819] [2025-03-08 04:25:13,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365223819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:25:13,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:25:13,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 04:25:13,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948472069] [2025-03-08 04:25:13,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:25:13,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 04:25:13,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:25:13,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 04:25:13,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 04:25:13,184 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-03-08 04:25:13,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:25:13,200 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2025-03-08 04:25:13,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 04:25:13,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 27 [2025-03-08 04:25:13,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:25:13,205 INFO L225 Difference]: With dead ends: 69 [2025-03-08 04:25:13,205 INFO L226 Difference]: Without dead ends: 67 [2025-03-08 04:25:13,205 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-03-08 04:25:13,206 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 210 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-03-08 04:25:13,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 210 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:25:13,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-08 04:25:13,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-08 04:25:13,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.148936170212766) internal successors, (54), 49 states have internal predecessors, (54), 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-03-08 04:25:13,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2025-03-08 04:25:13,213 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 27 [2025-03-08 04:25:13,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:25:13,213 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2025-03-08 04:25:13,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-03-08 04:25:13,213 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2025-03-08 04:25:13,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 04:25:13,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:25:13,214 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, 1, 1] [2025-03-08 04:25:13,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 04:25:13,214 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:25:13,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:25:13,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1899112514, now seen corresponding path program 1 times [2025-03-08 04:25:13,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:25:13,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785181015] [2025-03-08 04:25:13,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:25:13,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:25:13,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 04:25:13,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 04:25:13,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:25:13,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:25:13,538 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 04:25:13,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:25:13,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785181015] [2025-03-08 04:25:13,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785181015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:25:13,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:25:13,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 04:25:13,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95463843] [2025-03-08 04:25:13,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:25:13,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 04:25:13,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:25:13,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 04:25:13,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:25:13,541 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-03-08 04:25:13,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:25:13,812 INFO L93 Difference]: Finished difference Result 185 states and 235 transitions. [2025-03-08 04:25:13,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 04:25:13,813 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 28 [2025-03-08 04:25:13,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:25:13,814 INFO L225 Difference]: With dead ends: 185 [2025-03-08 04:25:13,814 INFO L226 Difference]: Without dead ends: 126 [2025-03-08 04:25:13,815 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-03-08 04:25:13,815 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 70 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 04:25:13,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 207 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 04:25:13,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-08 04:25:13,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 106. [2025-03-08 04:25:13,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 74 states have (on average 1.1891891891891893) internal successors, (88), 78 states have internal predecessors, (88), 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-03-08 04:25:13,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 132 transitions. [2025-03-08 04:25:13,834 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 132 transitions. Word has length 28 [2025-03-08 04:25:13,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:25:13,834 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 132 transitions. [2025-03-08 04:25:13,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-03-08 04:25:13,834 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 132 transitions. [2025-03-08 04:25:13,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 04:25:13,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:25:13,836 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:25:13,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 04:25:13,836 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:25:13,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:25:13,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1606189501, now seen corresponding path program 1 times [2025-03-08 04:25:13,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:25:13,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123567696] [2025-03-08 04:25:13,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:25:13,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:25:13,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 04:25:13,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 04:25:13,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:25:13,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:25:13,902 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-08 04:25:13,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:25:13,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123567696] [2025-03-08 04:25:13,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123567696] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:25:13,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496809401] [2025-03-08 04:25:13,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:25:13,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:25:13,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:25:13,904 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:25:13,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 04:25:13,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 04:25:14,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 04:25:14,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:25:14,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:25:14,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 04:25:14,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:25:14,026 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 04:25:14,026 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 04:25:14,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496809401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:25:14,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 04:25:14,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-03-08 04:25:14,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492210874] [2025-03-08 04:25:14,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:25:14,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 04:25:14,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:25:14,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 04:25:14,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 04:25:14,028 INFO L87 Difference]: Start difference. First operand 106 states and 132 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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) [2025-03-08 04:25:14,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:25:14,051 INFO L93 Difference]: Finished difference Result 191 states and 238 transitions. [2025-03-08 04:25:14,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 04:25:14,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 67 [2025-03-08 04:25:14,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:25:14,052 INFO L225 Difference]: With dead ends: 191 [2025-03-08 04:25:14,052 INFO L226 Difference]: Without dead ends: 112 [2025-03-08 04:25:14,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 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-03-08 04:25:14,054 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 208 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 [2025-03-08 04:25:14,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 208 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:25:14,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-08 04:25:14,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-03-08 04:25:14,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 79 states have (on average 1.1772151898734178) internal successors, (93), 82 states have internal predecessors, (93), 18 states have call successors, (18), 9 states have call predecessors, (18), 12 states have return successors, (27), 20 states have call predecessors, (27), 18 states have call successors, (27) [2025-03-08 04:25:14,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 138 transitions. [2025-03-08 04:25:14,064 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 138 transitions. Word has length 67 [2025-03-08 04:25:14,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:25:14,064 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 138 transitions. [2025-03-08 04:25:14,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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) [2025-03-08 04:25:14,064 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 138 transitions. [2025-03-08 04:25:14,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-08 04:25:14,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:25:14,065 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, 1, 1, 1] [2025-03-08 04:25:14,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 04:25:14,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-08 04:25:14,270 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:25:14,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:25:14,271 INFO L85 PathProgramCache]: Analyzing trace with hash 626081900, now seen corresponding path program 1 times [2025-03-08 04:25:14,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:25:14,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650391494] [2025-03-08 04:25:14,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:25:14,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:25:14,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-08 04:25:14,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-08 04:25:14,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:25:14,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 04:25:14,329 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 04:25:14,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-08 04:25:14,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-08 04:25:14,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:25:14,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 04:25:14,387 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 04:25:14,387 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 04:25:14,390 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-03-08 04:25:14,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-03-08 04:25:14,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-03-08 04:25:14,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 04:25:14,394 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-08 04:25:14,430 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 04:25:14,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:25:14 BoogieIcfgContainer [2025-03-08 04:25:14,435 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 04:25:14,436 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 04:25:14,436 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 04:25:14,436 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 04:25:14,437 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:25:12" (3/4) ... [2025-03-08 04:25:14,437 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-08 04:25:14,475 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 39. [2025-03-08 04:25:14,529 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 04:25:14,534 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 04:25:14,534 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 04:25:14,535 INFO L158 Benchmark]: Toolchain (without parser) took 2992.35ms. Allocated memory is still 142.6MB. Free memory was 103.0MB in the beginning and 92.9MB in the end (delta: 10.1MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2025-03-08 04:25:14,535 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 04:25:14,536 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.81ms. Allocated memory is still 142.6MB. Free memory was 103.0MB in the beginning and 83.2MB in the end (delta: 19.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 04:25:14,536 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.06ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 81.0MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 04:25:14,536 INFO L158 Benchmark]: Boogie Preprocessor took 54.62ms. Allocated memory is still 142.6MB. Free memory was 81.0MB in the beginning and 76.6MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 04:25:14,536 INFO L158 Benchmark]: IcfgBuilder took 382.40ms. Allocated memory is still 142.6MB. Free memory was 76.6MB in the beginning and 55.8MB in the end (delta: 20.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 04:25:14,537 INFO L158 Benchmark]: TraceAbstraction took 2044.63ms. Allocated memory is still 142.6MB. Free memory was 54.7MB in the beginning and 101.5MB in the end (delta: -46.7MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. [2025-03-08 04:25:14,537 INFO L158 Benchmark]: Witness Printer took 98.19ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 92.9MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 04:25:14,538 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.27ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 375.81ms. Allocated memory is still 142.6MB. Free memory was 103.0MB in the beginning and 83.2MB in the end (delta: 19.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.06ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 81.0MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.62ms. Allocated memory is still 142.6MB. Free memory was 81.0MB in the beginning and 76.6MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 382.40ms. Allocated memory is still 142.6MB. Free memory was 76.6MB in the beginning and 55.8MB in the end (delta: 20.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2044.63ms. Allocated memory is still 142.6MB. Free memory was 54.7MB in the beginning and 101.5MB in the end (delta: -46.7MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. * Witness Printer took 98.19ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 92.9MB 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) }; VAL [mutexes={3:0}] [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, 68 locations, 93 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 5, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 70 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 70 mSDsluCounter, 703 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 415 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 129 IncrementalHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 288 mSDtfsCounter, 129 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=4, InterpolantAutomatonStates: 19, 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, 4 MinimizatonAttempts, 20 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 304 NumberOfCodeBlocks, 304 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 237 ConstructedInterpolants, 0 QuantifiedInterpolants, 457 SizeOfPredicates, 0 NumberOfNonLiveVariables, 539 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 118/132 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-03-08 04:25:14,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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