./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-sets/test_mutex_unlock_at_exit.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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_unlock_at_exit.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 fd310154a8f082280317f3bf1f868dbee13522304c8e13d29736e7fb8b36c7cf --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 02:38:45,947 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 02:38:46,009 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 02:38:46,017 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 02:38:46,018 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 02:38:46,038 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 02:38:46,039 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 02:38:46,039 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 02:38:46,039 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 02:38:46,040 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 02:38:46,041 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 02:38:46,041 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 02:38:46,041 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 02:38:46,041 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 02:38:46,041 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 02:38:46,041 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 02:38:46,041 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 02:38:46,041 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 02:38:46,041 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 02:38:46,042 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 02:38:46,042 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 02:38:46,042 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 02:38:46,042 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 02:38:46,042 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 02:38:46,042 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 02:38:46,042 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 02:38:46,042 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 02:38:46,042 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 02:38:46,042 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 02:38:46,042 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:38:46,042 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:38:46,042 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:38:46,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:38:46,043 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 02:38:46,043 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:38:46,043 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:38:46,043 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:38:46,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:38:46,044 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 02:38:46,044 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 02:38:46,044 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 02:38:46,044 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 02:38:46,044 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 02:38:46,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 02:38:46,045 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 02:38:46,045 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 02:38:46,045 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 02:38:46,045 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 02:38:46,045 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 -> fd310154a8f082280317f3bf1f868dbee13522304c8e13d29736e7fb8b36c7cf [2025-01-09 02:38:46,333 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 02:38:46,344 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 02:38:46,346 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 02:38:46,348 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 02:38:46,349 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 02:38:46,350 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-sets/test_mutex_unlock_at_exit.i [2025-01-09 02:38:47,725 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1502e4216/91b0bf2d5f8742798c93cc9a109da084/FLAG4a022aa58 [2025-01-09 02:38:48,066 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 02:38:48,067 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unlock_at_exit.i [2025-01-09 02:38:48,079 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1502e4216/91b0bf2d5f8742798c93cc9a109da084/FLAG4a022aa58 [2025-01-09 02:38:48,299 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1502e4216/91b0bf2d5f8742798c93cc9a109da084 [2025-01-09 02:38:48,301 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 02:38:48,302 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 02:38:48,303 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 02:38:48,303 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 02:38:48,307 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 02:38:48,308 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:38:48" (1/1) ... [2025-01-09 02:38:48,309 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79d389e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:48, skipping insertion in model container [2025-01-09 02:38:48,309 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:38:48" (1/1) ... [2025-01-09 02:38:48,344 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 02:38:48,688 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_unlock_at_exit.i[25842,25855] [2025-01-09 02:38:48,696 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_unlock_at_exit.i[25967,25980] [2025-01-09 02:38:48,700 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_unlock_at_exit.i[26082,26095] [2025-01-09 02:38:48,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:38:48,720 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 02:38:48,789 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_unlock_at_exit.i[25842,25855] [2025-01-09 02:38:48,790 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_unlock_at_exit.i[25967,25980] [2025-01-09 02:38:48,793 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_unlock_at_exit.i[26082,26095] [2025-01-09 02:38:48,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:38:48,829 INFO L204 MainTranslator]: Completed translation [2025-01-09 02:38:48,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:48 WrapperNode [2025-01-09 02:38:48,831 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 02:38:48,832 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 02:38:48,832 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 02:38:48,833 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 02:38:48,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:48" (1/1) ... [2025-01-09 02:38:48,856 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:48" (1/1) ... [2025-01-09 02:38:48,883 INFO L138 Inliner]: procedures = 139, calls = 56, calls flagged for inlining = 15, calls inlined = 14, statements flattened = 136 [2025-01-09 02:38:48,885 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 02:38:48,885 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 02:38:48,885 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 02:38:48,886 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 02:38:48,894 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:48" (1/1) ... [2025-01-09 02:38:48,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:48" (1/1) ... [2025-01-09 02:38:48,903 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:48" (1/1) ... [2025-01-09 02:38:48,946 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-01-09 02:38:48,946 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:48" (1/1) ... [2025-01-09 02:38:48,947 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:48" (1/1) ... [2025-01-09 02:38:48,958 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:48" (1/1) ... [2025-01-09 02:38:48,962 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:48" (1/1) ... [2025-01-09 02:38:48,964 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:48" (1/1) ... [2025-01-09 02:38:48,969 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:48" (1/1) ... [2025-01-09 02:38:48,970 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:48" (1/1) ... [2025-01-09 02:38:48,975 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 02:38:48,976 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 02:38:48,976 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 02:38:48,976 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 02:38:48,977 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:48" (1/1) ... [2025-01-09 02:38:48,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:38:49,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:38:49,019 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-01-09 02:38:49,022 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-01-09 02:38:49,049 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2025-01-09 02:38:49,049 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2025-01-09 02:38:49,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 02:38:49,049 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2025-01-09 02:38:49,049 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2025-01-09 02:38:49,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 02:38:49,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 02:38:49,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 02:38:49,050 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2025-01-09 02:38:49,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2025-01-09 02:38:49,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 02:38:49,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 02:38:49,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 02:38:49,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 02:38:49,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 02:38:49,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 02:38:49,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 02:38:49,050 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2025-01-09 02:38:49,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2025-01-09 02:38:49,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 02:38:49,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 02:38:49,174 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 02:38:49,176 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 02:38:49,470 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2025-01-09 02:38:49,471 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 02:38:49,485 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 02:38:49,485 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 02:38:49,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:38:49 BoogieIcfgContainer [2025-01-09 02:38:49,486 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 02:38:49,489 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 02:38:49,489 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 02:38:49,494 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 02:38:49,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:38:48" (1/3) ... [2025-01-09 02:38:49,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@711deb38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:38:49, skipping insertion in model container [2025-01-09 02:38:49,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:48" (2/3) ... [2025-01-09 02:38:49,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@711deb38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:38:49, skipping insertion in model container [2025-01-09 02:38:49,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:38:49" (3/3) ... [2025-01-09 02:38:49,497 INFO L128 eAbstractionObserver]: Analyzing ICFG test_mutex_unlock_at_exit.i [2025-01-09 02:38:49,513 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 02:38:49,516 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test_mutex_unlock_at_exit.i that has 5 procedures, 64 locations, 1 initial locations, 2 loop locations, and 3 error locations. [2025-01-09 02:38:49,578 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 02:38:49,591 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;@1dab9457, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 02:38:49,592 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-01-09 02:38:49,596 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 50 states have internal predecessors, (59), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 02:38:49,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 02:38:49,603 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:38:49,604 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-01-09 02:38:49,605 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:38:49,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:38:49,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1498857239, now seen corresponding path program 1 times [2025-01-09 02:38:49,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:38:49,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101780352] [2025-01-09 02:38:49,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:38:49,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:38:49,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 02:38:49,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 02:38:49,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:38:49,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:38:49,825 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 02:38:49,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:38:49,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101780352] [2025-01-09 02:38:49,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101780352] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:38:49,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626846737] [2025-01-09 02:38:49,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:38:49,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:38:49,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:38:49,830 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-01-09 02:38:49,831 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-01-09 02:38:49,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 02:38:49,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 02:38:49,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:38:49,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:38:49,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 02:38:49,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:38:49,967 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 02:38:49,968 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 02:38:49,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626846737] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:38:49,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 02:38:49,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 02:38:49,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472292089] [2025-01-09 02:38:49,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:38:49,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 02:38:49,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:38:49,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 02:38:49,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 02:38:49,995 INFO L87 Difference]: Start difference. First operand has 64 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 50 states have internal predecessors, (59), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) 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-01-09 02:38:50,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:38:50,013 INFO L93 Difference]: Finished difference Result 124 states and 154 transitions. [2025-01-09 02:38:50,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 02:38:50,015 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-01-09 02:38:50,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:38:50,020 INFO L225 Difference]: With dead ends: 124 [2025-01-09 02:38:50,020 INFO L226 Difference]: Without dead ends: 59 [2025-01-09 02:38:50,023 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-01-09 02:38:50,025 INFO L435 NwaCegarLoop]: 73 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, 73 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-01-09 02:38:50,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:38:50,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-01-09 02:38:50,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-01-09 02:38:50,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 45 states have internal predecessors, (50), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 02:38:50,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2025-01-09 02:38:50,067 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 27 [2025-01-09 02:38:50,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:38:50,068 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2025-01-09 02:38:50,068 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-01-09 02:38:50,068 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2025-01-09 02:38:50,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 02:38:50,070 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:38:50,070 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-01-09 02:38:50,079 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-01-09 02:38:50,271 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-01-09 02:38:50,272 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:38:50,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:38:50,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1735101097, now seen corresponding path program 1 times [2025-01-09 02:38:50,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:38:50,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816176217] [2025-01-09 02:38:50,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:38:50,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:38:50,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 02:38:50,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 02:38:50,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:38:50,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:38:50,430 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 02:38:50,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:38:50,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816176217] [2025-01-09 02:38:50,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816176217] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:38:50,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:38:50,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 02:38:50,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52507157] [2025-01-09 02:38:50,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:38:50,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 02:38:50,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:38:50,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 02:38:50,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:38:50,432 INFO L87 Difference]: Start difference. First operand 59 states and 68 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-01-09 02:38:50,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:38:50,457 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2025-01-09 02:38:50,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 02:38:50,458 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-01-09 02:38:50,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:38:50,461 INFO L225 Difference]: With dead ends: 65 [2025-01-09 02:38:50,461 INFO L226 Difference]: Without dead ends: 63 [2025-01-09 02:38:50,461 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-01-09 02:38:50,466 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 195 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-01-09 02:38:50,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 195 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:38:50,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-01-09 02:38:50,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-01-09 02:38:50,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 48 states have internal predecessors, (53), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2025-01-09 02:38:50,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2025-01-09 02:38:50,479 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 27 [2025-01-09 02:38:50,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:38:50,480 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2025-01-09 02:38:50,480 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-01-09 02:38:50,480 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2025-01-09 02:38:50,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 02:38:50,481 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:38:50,481 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-01-09 02:38:50,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 02:38:50,481 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:38:50,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:38:50,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1105114013, now seen corresponding path program 1 times [2025-01-09 02:38:50,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:38:50,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886549254] [2025-01-09 02:38:50,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:38:50,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:38:50,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 02:38:50,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 02:38:50,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:38:50,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:38:50,937 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 02:38:50,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:38:50,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886549254] [2025-01-09 02:38:50,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886549254] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:38:50,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:38:50,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 02:38:50,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981288345] [2025-01-09 02:38:50,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:38:50,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 02:38:50,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:38:50,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 02:38:50,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:38:50,938 INFO L87 Difference]: Start difference. First operand 63 states and 74 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-01-09 02:38:51,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:38:51,272 INFO L93 Difference]: Finished difference Result 173 states and 216 transitions. [2025-01-09 02:38:51,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 02:38:51,272 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-01-09 02:38:51,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:38:51,274 INFO L225 Difference]: With dead ends: 173 [2025-01-09 02:38:51,274 INFO L226 Difference]: Without dead ends: 118 [2025-01-09 02:38:51,275 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-01-09 02:38:51,275 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 65 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 02:38:51,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 180 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 02:38:51,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-01-09 02:38:51,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 91. [2025-01-09 02:38:51,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 69 states have internal predecessors, (76), 14 states have call successors, (14), 7 states have call predecessors, (14), 9 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2025-01-09 02:38:51,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 110 transitions. [2025-01-09 02:38:51,292 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 110 transitions. Word has length 28 [2025-01-09 02:38:51,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:38:51,292 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 110 transitions. [2025-01-09 02:38:51,292 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-01-09 02:38:51,293 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2025-01-09 02:38:51,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 02:38:51,294 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:38:51,294 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] [2025-01-09 02:38:51,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 02:38:51,295 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:38:51,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:38:51,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1200846878, now seen corresponding path program 1 times [2025-01-09 02:38:51,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:38:51,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825914070] [2025-01-09 02:38:51,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:38:51,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:38:51,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 02:38:51,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 02:38:51,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:38:51,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:38:51,405 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 02:38:51,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:38:51,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825914070] [2025-01-09 02:38:51,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825914070] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:38:51,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325488260] [2025-01-09 02:38:51,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:38:51,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:38:51,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:38:51,408 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:38:51,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 02:38:51,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 02:38:51,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 02:38:51,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:38:51,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:38:51,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 02:38:51,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:38:51,570 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 02:38:51,570 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 02:38:51,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325488260] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:38:51,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 02:38:51,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-01-09 02:38:51,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111310629] [2025-01-09 02:38:51,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:38:51,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 02:38:51,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:38:51,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 02:38:51,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:38:51,572 INFO L87 Difference]: Start difference. First operand 91 states and 110 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, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 02:38:51,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:38:51,599 INFO L93 Difference]: Finished difference Result 161 states and 194 transitions. [2025-01-09 02:38:51,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 02:38:51,599 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, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 66 [2025-01-09 02:38:51,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:38:51,602 INFO L225 Difference]: With dead ends: 161 [2025-01-09 02:38:51,604 INFO L226 Difference]: Without dead ends: 97 [2025-01-09 02:38:51,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 67 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-01-09 02:38:51,606 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 193 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-01-09 02:38:51,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 193 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:38:51,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-01-09 02:38:51,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-01-09 02:38:51,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 70 states have (on average 1.1571428571428573) internal successors, (81), 73 states have internal predecessors, (81), 14 states have call successors, (14), 7 states have call predecessors, (14), 10 states have return successors, (21), 16 states have call predecessors, (21), 14 states have call successors, (21) [2025-01-09 02:38:51,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 116 transitions. [2025-01-09 02:38:51,628 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 116 transitions. Word has length 66 [2025-01-09 02:38:51,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:38:51,628 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 116 transitions. [2025-01-09 02:38:51,628 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, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 02:38:51,628 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 116 transitions. [2025-01-09 02:38:51,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 02:38:51,630 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:38:51,630 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 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] [2025-01-09 02:38:51,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 02:38:51,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:38:51,834 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:38:51,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:38:51,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1807950364, now seen corresponding path program 1 times [2025-01-09 02:38:51,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:38:51,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449927632] [2025-01-09 02:38:51,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:38:51,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:38:51,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 02:38:51,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 02:38:51,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:38:51,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:38:52,280 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 02:38:52,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:38:52,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449927632] [2025-01-09 02:38:52,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449927632] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:38:52,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3291499] [2025-01-09 02:38:52,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:38:52,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:38:52,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:38:52,285 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:38:52,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 02:38:52,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 02:38:52,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 02:38:52,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:38:52,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:38:52,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-09 02:38:52,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:38:53,087 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 02:38:53,088 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 02:38:53,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3291499] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:38:53,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 02:38:53,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 15 [2025-01-09 02:38:53,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427324432] [2025-01-09 02:38:53,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:38:53,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 02:38:53,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:38:53,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 02:38:53,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-01-09 02:38:53,090 INFO L87 Difference]: Start difference. First operand 97 states and 116 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 4 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-01-09 02:38:53,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:38:53,781 INFO L93 Difference]: Finished difference Result 215 states and 260 transitions. [2025-01-09 02:38:53,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 02:38:53,781 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 4 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 68 [2025-01-09 02:38:53,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:38:53,783 INFO L225 Difference]: With dead ends: 215 [2025-01-09 02:38:53,783 INFO L226 Difference]: Without dead ends: 117 [2025-01-09 02:38:53,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2025-01-09 02:38:53,784 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 153 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 02:38:53,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 195 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 02:38:53,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-01-09 02:38:53,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 101. [2025-01-09 02:38:53,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 74 states have (on average 1.135135135135135) internal successors, (84), 78 states have internal predecessors, (84), 13 states have call successors, (13), 8 states have call predecessors, (13), 11 states have return successors, (21), 14 states have call predecessors, (21), 13 states have call successors, (21) [2025-01-09 02:38:53,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 118 transitions. [2025-01-09 02:38:53,814 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 118 transitions. Word has length 68 [2025-01-09 02:38:53,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:38:53,814 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 118 transitions. [2025-01-09 02:38:53,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 4 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-01-09 02:38:53,815 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 118 transitions. [2025-01-09 02:38:53,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 02:38:53,815 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:38:53,816 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-01-09 02:38:53,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 02:38:54,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:38:54,016 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:38:54,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:38:54,017 INFO L85 PathProgramCache]: Analyzing trace with hash 100713526, now seen corresponding path program 1 times [2025-01-09 02:38:54,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:38:54,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626263307] [2025-01-09 02:38:54,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:38:54,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:38:54,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 02:38:54,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 02:38:54,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:38:54,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:38:58,929 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 02:38:58,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:38:58,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626263307] [2025-01-09 02:38:58,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626263307] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:38:58,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046993911] [2025-01-09 02:38:58,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:38:58,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:38:58,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:38:58,932 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:38:58,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 02:38:59,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 02:38:59,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 02:38:59,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:38:59,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:38:59,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 156 conjuncts are in the unsatisfiable core [2025-01-09 02:38:59,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:38:59,399 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 02:38:59,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-09 02:38:59,781 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-01-09 02:38:59,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2025-01-09 02:39:00,922 INFO L349 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2025-01-09 02:39:00,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 184 [2025-01-09 02:39:00,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-01-09 02:39:00,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-01-09 02:39:01,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-01-09 02:39:01,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-01-09 02:39:01,084 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:39:01,091 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:39:01,107 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2025-01-09 02:39:01,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 118 treesize of output 98 [2025-01-09 02:39:01,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-01-09 02:39:01,198 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:39:01,203 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:39:01,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 55 [2025-01-09 02:39:01,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-01-09 02:39:01,324 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:39:01,324 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:39:01,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 5 [2025-01-09 02:39:01,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-01-09 02:39:01,483 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:39:01,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 12 [2025-01-09 02:39:03,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:03,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:03,320 INFO L349 Elim1Store]: treesize reduction 203, result has 0.5 percent of original size [2025-01-09 02:39:03,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 713 treesize of output 623 [2025-01-09 02:39:03,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:03,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 194 [2025-01-09 02:39:03,383 INFO L349 Elim1Store]: treesize reduction 44, result has 38.0 percent of original size [2025-01-09 02:39:03,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 129 [2025-01-09 02:39:03,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:03,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:03,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 172 [2025-01-09 02:39:03,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 105 [2025-01-09 02:39:03,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 7 [2025-01-09 02:39:03,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:03,473 INFO L349 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2025-01-09 02:39:03,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 26 [2025-01-09 02:39:04,642 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 02:39:04,643 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:39:05,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046993911] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:39:05,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 02:39:05,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 60 [2025-01-09 02:39:05,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013640467] [2025-01-09 02:39:05,554 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 02:39:05,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2025-01-09 02:39:05,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:39:05,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2025-01-09 02:39:05,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=4294, Unknown=8, NotChecked=0, Total=4556 [2025-01-09 02:39:05,560 INFO L87 Difference]: Start difference. First operand 101 states and 118 transitions. Second operand has 60 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 43 states have internal predecessors, (82), 17 states have call successors, (18), 11 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2025-01-09 02:39:12,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 02:39:16,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 02:39:20,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 02:39:21,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:39:21,723 INFO L93 Difference]: Finished difference Result 205 states and 238 transitions. [2025-01-09 02:39:21,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-01-09 02:39:21,725 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 43 states have internal predecessors, (82), 17 states have call successors, (18), 11 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) Word has length 61 [2025-01-09 02:39:21,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:39:21,727 INFO L225 Difference]: With dead ends: 205 [2025-01-09 02:39:21,727 INFO L226 Difference]: Without dead ends: 129 [2025-01-09 02:39:21,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2110 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=693, Invalid=9805, Unknown=8, NotChecked=0, Total=10506 [2025-01-09 02:39:21,736 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 166 mSDsluCounter, 1314 mSDsCounter, 0 mSdLazyCounter, 2297 mSolverCounterSat, 46 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 1361 SdHoareTripleChecker+Invalid, 2354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2297 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.2s IncrementalHoareTripleChecker+Time [2025-01-09 02:39:21,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 1361 Invalid, 2354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2297 Invalid, 11 Unknown, 0 Unchecked, 14.2s Time] [2025-01-09 02:39:21,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-01-09 02:39:21,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 107. [2025-01-09 02:39:21,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 79 states have (on average 1.1518987341772151) internal successors, (91), 83 states have internal predecessors, (91), 13 states have call successors, (13), 9 states have call predecessors, (13), 12 states have return successors, (17), 14 states have call predecessors, (17), 13 states have call successors, (17) [2025-01-09 02:39:21,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2025-01-09 02:39:21,765 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 61 [2025-01-09 02:39:21,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:39:21,766 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2025-01-09 02:39:21,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 43 states have internal predecessors, (82), 17 states have call successors, (18), 11 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2025-01-09 02:39:21,766 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2025-01-09 02:39:21,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 02:39:21,769 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:39:21,769 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:39:21,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 02:39:21,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-01-09 02:39:21,970 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:39:21,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:39:21,971 INFO L85 PathProgramCache]: Analyzing trace with hash 2044239698, now seen corresponding path program 1 times [2025-01-09 02:39:21,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:39:21,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428152792] [2025-01-09 02:39:21,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:39:21,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:39:21,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 02:39:22,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 02:39:22,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:39:22,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:39:24,902 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 19 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 02:39:24,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:39:24,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428152792] [2025-01-09 02:39:24,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428152792] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:39:24,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971198603] [2025-01-09 02:39:24,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:39:24,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:39:24,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:39:24,907 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:39:24,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 02:39:24,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 02:39:25,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 02:39:25,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:39:25,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:39:25,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 156 conjuncts are in the unsatisfiable core [2025-01-09 02:39:25,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:39:25,384 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 02:39:25,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-09 02:39:25,634 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 02:39:25,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-09 02:39:26,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:26,259 INFO L349 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2025-01-09 02:39:26,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 15 [2025-01-09 02:39:26,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:26,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-01-09 02:39:26,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:26,327 INFO L349 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2025-01-09 02:39:26,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 15 [2025-01-09 02:39:26,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:26,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-01-09 02:39:26,407 INFO L349 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2025-01-09 02:39:26,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 15 [2025-01-09 02:39:26,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:26,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-01-09 02:39:26,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:26,501 INFO L349 Elim1Store]: treesize reduction 49, result has 2.0 percent of original size [2025-01-09 02:39:26,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 15 [2025-01-09 02:39:26,635 INFO L349 Elim1Store]: treesize reduction 126, result has 10.6 percent of original size [2025-01-09 02:39:26,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 23 [2025-01-09 02:39:53,199 WARN L286 SmtUtils]: Spent 26.06s on a formula simplification. DAG size of input: 212 DAG size of output: 121 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-01-09 02:39:53,199 INFO L349 Elim1Store]: treesize reduction 1445, result has 39.4 percent of original size [2025-01-09 02:39:53,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 14 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 16 new quantified variables, introduced 39 case distinctions, treesize of input 6230 treesize of output 8109 [2025-01-09 02:40:08,590 WARN L286 SmtUtils]: Spent 14.90s on a formula simplification. DAG size of input: 48 DAG size of output: 20 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-01-09 02:40:08,590 INFO L349 Elim1Store]: treesize reduction 125, result has 21.4 percent of original size [2025-01-09 02:40:08,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 10 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 7 new quantified variables, introduced 5 case distinctions, treesize of input 1169 treesize of output 2303