./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/13-privatized_67-pthread_cond_wait_unknown_1_pos.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/goblint-regression/13-privatized_67-pthread_cond_wait_unknown_1_pos.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 1cd82b96c01a730247618eab1464d47c03eec9013c1d245312913e94981f2bce --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:33:55,416 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:33:55,453 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:33:55,461 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:33:55,464 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:33:55,490 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:33:55,491 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:33:55,492 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:33:55,492 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:33:55,492 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:33:55,492 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:33:55,492 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:33:55,493 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:33:55,493 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:33:55,493 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:33:55,494 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:33:55,494 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:33:55,494 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:33:55,494 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:33:55,494 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:33:55,494 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:33:55,494 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:33:55,494 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:33:55,495 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:33:55,495 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:33:55,495 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:33:55,495 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:33:55,495 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:33:55,495 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:33:55,495 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:33:55,495 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:33:55,495 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:33:55,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:33:55,495 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:33:55,495 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:33:55,496 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:33:55,496 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:33:55,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:33:55,496 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:33:55,496 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:33:55,496 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:33:55,496 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:33:55,497 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:33:55,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:33:55,497 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:33:55,497 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:33:55,497 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:33:55,497 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:33:55,497 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 -> 1cd82b96c01a730247618eab1464d47c03eec9013c1d245312913e94981f2bce [2025-01-09 16:33:55,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:33:55,711 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:33:55,713 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:33:55,714 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:33:55,715 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:33:55,715 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_67-pthread_cond_wait_unknown_1_pos.i [2025-01-09 16:33:56,860 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/78f7c721f/1ce1f6eafc8847d6ac4f9b927bea19f8/FLAG17286d399 [2025-01-09 16:33:57,158 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:33:57,159 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_67-pthread_cond_wait_unknown_1_pos.i [2025-01-09 16:33:57,174 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/78f7c721f/1ce1f6eafc8847d6ac4f9b927bea19f8/FLAG17286d399 [2025-01-09 16:33:57,423 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/78f7c721f/1ce1f6eafc8847d6ac4f9b927bea19f8 [2025-01-09 16:33:57,425 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:33:57,425 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:33:57,426 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:33:57,426 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:33:57,429 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:33:57,429 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:33:57" (1/1) ... [2025-01-09 16:33:57,430 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f12d730 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:57, skipping insertion in model container [2025-01-09 16:33:57,430 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:33:57" (1/1) ... [2025-01-09 16:33:57,458 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:33:57,580 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/goblint-regression/13-privatized_67-pthread_cond_wait_unknown_1_pos.i[1103,1116] [2025-01-09 16:33:57,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:33:57,828 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:33:57,839 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/goblint-regression/13-privatized_67-pthread_cond_wait_unknown_1_pos.i[1103,1116] [2025-01-09 16:33:57,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:33:57,940 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:33:57,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:57 WrapperNode [2025-01-09 16:33:57,941 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:33:57,941 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:33:57,942 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:33:57,942 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:33:57,945 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:57" (1/1) ... [2025-01-09 16:33:57,968 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:57" (1/1) ... [2025-01-09 16:33:57,988 INFO L138 Inliner]: procedures = 354, calls = 21, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 158 [2025-01-09 16:33:57,990 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:33:57,991 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:33:57,992 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:33:57,992 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:33:57,998 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:57" (1/1) ... [2025-01-09 16:33:57,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:57" (1/1) ... [2025-01-09 16:33:58,002 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:57" (1/1) ... [2025-01-09 16:33:58,018 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5]. The 0 writes are split as follows [0, 0]. [2025-01-09 16:33:58,021 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:57" (1/1) ... [2025-01-09 16:33:58,022 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:57" (1/1) ... [2025-01-09 16:33:58,037 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:57" (1/1) ... [2025-01-09 16:33:58,038 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:57" (1/1) ... [2025-01-09 16:33:58,039 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:57" (1/1) ... [2025-01-09 16:33:58,045 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:57" (1/1) ... [2025-01-09 16:33:58,045 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:57" (1/1) ... [2025-01-09 16:33:58,051 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:33:58,051 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:33:58,052 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:33:58,052 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:33:58,052 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:57" (1/1) ... [2025-01-09 16:33:58,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:33:58,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:33:58,083 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 16:33:58,088 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 16:33:58,104 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-01-09 16:33:58,104 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-01-09 16:33:58,104 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-01-09 16:33:58,105 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-01-09 16:33:58,105 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 16:33:58,105 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 16:33:58,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:33:58,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:33:58,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:33:58,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:33:58,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:33:58,106 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:33:58,316 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:33:58,317 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:33:58,497 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:33:58,498 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:33:59,020 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:33:59,021 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:33:59,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:33:59 BoogieIcfgContainer [2025-01-09 16:33:59,021 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:33:59,023 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:33:59,023 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:33:59,027 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:33:59,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:33:57" (1/3) ... [2025-01-09 16:33:59,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@251d7a89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:33:59, skipping insertion in model container [2025-01-09 16:33:59,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:57" (2/3) ... [2025-01-09 16:33:59,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@251d7a89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:33:59, skipping insertion in model container [2025-01-09 16:33:59,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:33:59" (3/3) ... [2025-01-09 16:33:59,029 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_67-pthread_cond_wait_unknown_1_pos.i [2025-01-09 16:33:59,038 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:33:59,040 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_67-pthread_cond_wait_unknown_1_pos.i that has 3 procedures, 28 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 16:33:59,040 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:33:59,074 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 16:33:59,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 28 transitions, 70 flow [2025-01-09 16:33:59,132 INFO L124 PetriNetUnfolderBase]: 1/26 cut-off events. [2025-01-09 16:33:59,134 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 16:33:59,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 26 events. 1/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 29 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-01-09 16:33:59,137 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 28 transitions, 70 flow [2025-01-09 16:33:59,138 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 19 transitions, 47 flow [2025-01-09 16:33:59,146 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:33:59,156 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;@50dd6f68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:33:59,157 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 16:33:59,172 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:33:59,173 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 16:33:59,173 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:33:59,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:33:59,173 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:33:59,174 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:33:59,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:33:59,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1129188560, now seen corresponding path program 1 times [2025-01-09 16:33:59,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:33:59,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235569121] [2025-01-09 16:33:59,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:33:59,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:33:59,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 16:33:59,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 16:33:59,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:33:59,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:33:59,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:33:59,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:33:59,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235569121] [2025-01-09 16:33:59,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235569121] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:33:59,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:33:59,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:33:59,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153260410] [2025-01-09 16:33:59,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:33:59,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:33:59,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:33:59,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:33:59,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:33:59,666 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:33:59,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 47 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:33:59,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:33:59,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:33:59,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:33:59,750 INFO L124 PetriNetUnfolderBase]: 88/191 cut-off events. [2025-01-09 16:33:59,751 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-01-09 16:33:59,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 400 conditions, 191 events. 88/191 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 717 event pairs, 40 based on Foata normal form. 17/206 useless extension candidates. Maximal degree in co-relation 369. Up to 86 conditions per place. [2025-01-09 16:33:59,753 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 18 selfloop transitions, 3 changer transitions 11/35 dead transitions. [2025-01-09 16:33:59,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 35 transitions, 149 flow [2025-01-09 16:33:59,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:33:59,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:33:59,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2025-01-09 16:33:59,761 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42142857142857143 [2025-01-09 16:33:59,762 INFO L175 Difference]: Start difference. First operand has 26 places, 19 transitions, 47 flow. Second operand 5 states and 59 transitions. [2025-01-09 16:33:59,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 35 transitions, 149 flow [2025-01-09 16:33:59,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 35 transitions, 141 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 16:33:59,766 INFO L231 Difference]: Finished difference. Result has 30 places, 19 transitions, 57 flow [2025-01-09 16:33:59,767 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=57, PETRI_PLACES=30, PETRI_TRANSITIONS=19} [2025-01-09 16:33:59,770 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 4 predicate places. [2025-01-09 16:33:59,770 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 19 transitions, 57 flow [2025-01-09 16:33:59,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:33:59,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:33:59,770 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:33:59,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:33:59,770 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:33:59,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:33:59,771 INFO L85 PathProgramCache]: Analyzing trace with hash -394457200, now seen corresponding path program 1 times [2025-01-09 16:33:59,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:33:59,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673343441] [2025-01-09 16:33:59,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:33:59,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:33:59,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 16:33:59,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 16:33:59,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:33:59,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:34:00,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:34:00,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:34:00,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673343441] [2025-01-09 16:34:00,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673343441] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:34:00,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:34:00,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:34:00,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828112889] [2025-01-09 16:34:00,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:34:00,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:34:00,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:34:00,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:34:00,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:34:00,066 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:34:00,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 19 transitions, 57 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:34:00,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:34:00,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:34:00,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:34:00,135 INFO L124 PetriNetUnfolderBase]: 30/82 cut-off events. [2025-01-09 16:34:00,136 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 16:34:00,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 82 events. 30/82 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 218 event pairs, 6 based on Foata normal form. 16/96 useless extension candidates. Maximal degree in co-relation 183. Up to 27 conditions per place. [2025-01-09 16:34:00,136 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 15 selfloop transitions, 5 changer transitions 8/31 dead transitions. [2025-01-09 16:34:00,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 31 transitions, 144 flow [2025-01-09 16:34:00,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:34:00,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:34:00,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2025-01-09 16:34:00,137 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40714285714285714 [2025-01-09 16:34:00,138 INFO L175 Difference]: Start difference. First operand has 30 places, 19 transitions, 57 flow. Second operand 5 states and 57 transitions. [2025-01-09 16:34:00,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 31 transitions, 144 flow [2025-01-09 16:34:00,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 31 transitions, 134 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-01-09 16:34:00,139 INFO L231 Difference]: Finished difference. Result has 28 places, 14 transitions, 45 flow [2025-01-09 16:34:00,139 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=47, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=45, PETRI_PLACES=28, PETRI_TRANSITIONS=14} [2025-01-09 16:34:00,139 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 2 predicate places. [2025-01-09 16:34:00,139 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 14 transitions, 45 flow [2025-01-09 16:34:00,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:34:00,139 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:34:00,139 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:34:00,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:34:00,140 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:34:00,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:34:00,140 INFO L85 PathProgramCache]: Analyzing trace with hash -912932818, now seen corresponding path program 1 times [2025-01-09 16:34:00,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:34:00,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915832654] [2025-01-09 16:34:00,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:34:00,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:34:00,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 16:34:00,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 16:34:00,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:34:00,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:34:00,284 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:34:00,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 16:34:00,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 16:34:00,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:34:00,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:34:00,330 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:34:00,332 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:34:00,333 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-01-09 16:34:00,334 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-01-09 16:34:00,334 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-01-09 16:34:00,335 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-01-09 16:34:00,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:34:00,335 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 16:34:00,366 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 16:34:00,367 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 16:34:00,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:34:00 BasicIcfg [2025-01-09 16:34:00,371 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 16:34:00,372 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 16:34:00,372 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 16:34:00,372 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 16:34:00,373 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:33:59" (3/4) ... [2025-01-09 16:34:00,373 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 16:34:00,423 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 3. [2025-01-09 16:34:00,476 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 16:34:00,477 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 16:34:00,477 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 16:34:00,477 INFO L158 Benchmark]: Toolchain (without parser) took 3051.79ms. Allocated memory was 201.3MB in the beginning and 335.5MB in the end (delta: 134.2MB). Free memory was 156.9MB in the beginning and 192.6MB in the end (delta: -35.7MB). Peak memory consumption was 97.8MB. Max. memory is 16.1GB. [2025-01-09 16:34:00,477 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 218.1MB. Free memory is still 133.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:34:00,478 INFO L158 Benchmark]: CACSL2BoogieTranslator took 514.65ms. Allocated memory is still 201.3MB. Free memory was 156.9MB in the beginning and 118.8MB in the end (delta: 38.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-09 16:34:00,478 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.31ms. Allocated memory is still 201.3MB. Free memory was 118.8MB in the beginning and 115.9MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:34:00,478 INFO L158 Benchmark]: Boogie Preprocessor took 59.89ms. Allocated memory is still 201.3MB. Free memory was 115.9MB in the beginning and 113.0MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:34:00,478 INFO L158 Benchmark]: RCFGBuilder took 970.10ms. Allocated memory is still 201.3MB. Free memory was 113.0MB in the beginning and 138.4MB in the end (delta: -25.4MB). Peak memory consumption was 76.1MB. Max. memory is 16.1GB. [2025-01-09 16:34:00,480 INFO L158 Benchmark]: TraceAbstraction took 1348.22ms. Allocated memory was 201.3MB in the beginning and 335.5MB in the end (delta: 134.2MB). Free memory was 137.2MB in the beginning and 200.5MB in the end (delta: -63.3MB). Peak memory consumption was 71.9MB. Max. memory is 16.1GB. [2025-01-09 16:34:00,481 INFO L158 Benchmark]: Witness Printer took 104.92ms. Allocated memory is still 335.5MB. Free memory was 200.5MB in the beginning and 192.6MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:34:00,482 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 218.1MB. Free memory is still 133.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 514.65ms. Allocated memory is still 201.3MB. Free memory was 156.9MB in the beginning and 118.8MB in the end (delta: 38.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.31ms. Allocated memory is still 201.3MB. Free memory was 118.8MB in the beginning and 115.9MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 59.89ms. Allocated memory is still 201.3MB. Free memory was 115.9MB in the beginning and 113.0MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 970.10ms. Allocated memory is still 201.3MB. Free memory was 113.0MB in the beginning and 138.4MB in the end (delta: -25.4MB). Peak memory consumption was 76.1MB. Max. memory is 16.1GB. * TraceAbstraction took 1348.22ms. Allocated memory was 201.3MB in the beginning and 335.5MB in the end (delta: 134.2MB). Free memory was 137.2MB in the beginning and 200.5MB in the end (delta: -63.3MB). Peak memory consumption was 71.9MB. Max. memory is 16.1GB. * Witness Printer took 104.92ms. Allocated memory is still 335.5MB. Free memory was 200.5MB in the beginning and 192.6MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1351] 0 int g; [L1352] 0 pthread_mutex_t mut = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L1352] 0 pthread_mutex_t mut = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L1352] 0 pthread_mutex_t mut = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L1352] 0 pthread_mutex_t mut = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L1352] 0 pthread_mutex_t mut = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L1352] 0 pthread_mutex_t mut = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L1353] 0 pthread_cond_t cond = { { {0}, {0}, {0, 0}, {0, 0}, 0, 0, {0, 0} } }; [L1373] 0 pthread_t t1; [L1374] 0 pthread_t t2; [L1375] FCALL, FORK 0 pthread_create(&t1,((void *)0),f1,((void *)0)) VAL [\old(argc)=1162, \old(argv)={1183:1186}, \old(ptr)={0:0}, argc=1162, g=0, mut={3:0}, t1=-2] [L1377] FCALL, FORK 0 pthread_create(&t2,((void *)0),f2,((void *)0)) VAL [\old(argc)=1162, \old(argv)={1183:1186}, \old(ptr)={0:0}, argc=1162, g=0, mut={3:0}, t1=-2, t2=-1] [L1356] 1 g = 1 VAL [\old(ptr)={0:0}, g=1, mut={3:0}, ptr={0:0}] [L1365] CALL 2 __VERIFIER_assert(g == 0) [L19] COND TRUE 2 !(cond) VAL [\old(cond)=0, \old(ptr)={0:0}, cond=0, g=1, mut={3:0}, ptr={0:0}] [L19] 2 reach_error() VAL [\old(cond)=0, \old(ptr)={0:0}, cond=0, g=1, mut={3:0}, ptr={0:0}] - UnprovableResult [Line: 1375]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1377]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 49 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.2s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 114 IncrementalHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 5 mSDtfsCounter, 114 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=1, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 19 ConstructedInterpolants, 0 QuantifiedInterpolants, 63 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-09 16:34:00,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE