/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/pthread-complex/bounded_buffer.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:38:14,177 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:38:14,225 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 19:38:14,228 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:38:14,228 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:38:14,243 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:38:14,243 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:38:14,243 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:38:14,244 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:38:14,244 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:38:14,244 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:38:14,244 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:38:14,244 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:38:14,244 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:38:14,244 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:38:14,244 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:38:14,244 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:38:14,244 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:38:14,244 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:38:14,244 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:38:14,244 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:38:14,245 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:38:14,245 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:38:14,245 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:38:14,245 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:38:14,245 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:38:14,245 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:38:14,245 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:38:14,245 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:38:14,245 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:38:14,245 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:38:14,245 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:38:14,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:38:14,245 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:38:14,245 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:38:14,245 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:38:14,245 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:38:14,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:38:14,245 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:38:14,245 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:38:14,245 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:38:14,246 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:38:14,246 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:38:14,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:38:14,246 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:38:14,246 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:38:14,246 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:38:14,246 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 19:38:14,467 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:38:14,475 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:38:14,477 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:38:14,478 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:38:14,480 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:38:14,481 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-complex/bounded_buffer.i [2025-04-13 19:38:15,741 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a567f76e8/552db8720a1648039a0d68e5570fb224/FLAG100ba5448 [2025-04-13 19:38:16,042 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:38:16,043 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/bounded_buffer.i [2025-04-13 19:38:16,060 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a567f76e8/552db8720a1648039a0d68e5570fb224/FLAG100ba5448 [2025-04-13 19:38:16,791 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a567f76e8/552db8720a1648039a0d68e5570fb224 [2025-04-13 19:38:16,793 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:38:16,794 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:38:16,795 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:38:16,795 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:38:16,798 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:38:16,799 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:38:16" (1/1) ... [2025-04-13 19:38:16,800 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49477ef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:16, skipping insertion in model container [2025-04-13 19:38:16,800 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:38:16" (1/1) ... [2025-04-13 19:38:16,838 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:38:17,261 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/bounded_buffer.i[70002,70015] [2025-04-13 19:38:17,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:38:17,304 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:38:17,380 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/bounded_buffer.i[70002,70015] [2025-04-13 19:38:17,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:38:17,464 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:38:17,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:17 WrapperNode [2025-04-13 19:38:17,465 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:38:17,466 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:38:17,466 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:38:17,466 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:38:17,469 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:17" (1/1) ... [2025-04-13 19:38:17,500 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:17" (1/1) ... [2025-04-13 19:38:17,537 INFO L138 Inliner]: procedures = 429, calls = 134, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 450 [2025-04-13 19:38:17,538 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:38:17,538 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:38:17,538 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:38:17,538 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:38:17,552 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:17" (1/1) ... [2025-04-13 19:38:17,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:17" (1/1) ... [2025-04-13 19:38:17,558 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:17" (1/1) ... [2025-04-13 19:38:17,580 INFO L175 MemorySlicer]: Split 78 memory accesses to 6 slices as follows [2, 5, 6, 2, 58, 5]. 74 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0]. The 26 writes are split as follows [0, 3, 2, 1, 17, 3]. [2025-04-13 19:38:17,580 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:17" (1/1) ... [2025-04-13 19:38:17,580 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:17" (1/1) ... [2025-04-13 19:38:17,613 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:17" (1/1) ... [2025-04-13 19:38:17,614 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:17" (1/1) ... [2025-04-13 19:38:17,619 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:17" (1/1) ... [2025-04-13 19:38:17,621 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:17" (1/1) ... [2025-04-13 19:38:17,622 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:17" (1/1) ... [2025-04-13 19:38:17,637 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:38:17,637 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:38:17,638 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:38:17,638 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:38:17,638 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:17" (1/1) ... [2025-04-13 19:38:17,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:38:17,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:38:17,669 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 19:38:17,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 19:38:17,698 INFO L130 BoogieDeclarations]: Found specification of procedure producer_routine [2025-04-13 19:38:17,699 INFO L138 BoogieDeclarations]: Found implementation of procedure producer_routine [2025-04-13 19:38:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-13 19:38:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 19:38:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 19:38:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 19:38:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-04-13 19:38:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-04-13 19:38:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-04-13 19:38:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 19:38:17,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 19:38:17,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:38:17,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-13 19:38:17,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-13 19:38:17,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-13 19:38:17,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-04-13 19:38:17,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-04-13 19:38:17,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-04-13 19:38:17,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:38:17,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:38:17,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-13 19:38:17,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-13 19:38:17,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-13 19:38:17,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-13 19:38:17,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-04-13 19:38:17,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-04-13 19:38:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-04-13 19:38:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure consumer_routine [2025-04-13 19:38:17,702 INFO L138 BoogieDeclarations]: Found implementation of procedure consumer_routine [2025-04-13 19:38:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 19:38:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 19:38:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 19:38:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 19:38:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-04-13 19:38:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-04-13 19:38:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-04-13 19:38:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:38:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 19:38:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 19:38:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-04-13 19:38:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-04-13 19:38:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-04-13 19:38:17,705 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 19:38:17,885 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:38:17,887 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:38:18,402 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:38:18,403 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:38:18,403 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:38:18,892 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:38:18,899 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:38:18,905 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:38:18,925 WARN L179 LargeBlockEncoding]: Complex 2:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:38:18,936 WARN L179 LargeBlockEncoding]: Complex 2:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:38:18,951 WARN L179 LargeBlockEncoding]: Complex 2:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:38:18,958 WARN L179 LargeBlockEncoding]: Complex 4:4 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:38:18,965 WARN L179 LargeBlockEncoding]: Complex 2:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:38:18,974 INFO L313 CfgBuilder]: Removed 7 assume(true) statements. [2025-04-13 19:38:18,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:38:18 BoogieIcfgContainer [2025-04-13 19:38:18,974 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:38:18,976 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:38:18,976 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:38:18,979 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:38:18,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:38:16" (1/3) ... [2025-04-13 19:38:18,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f63bfea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:38:18, skipping insertion in model container [2025-04-13 19:38:18,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:17" (2/3) ... [2025-04-13 19:38:18,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f63bfea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:38:18, skipping insertion in model container [2025-04-13 19:38:18,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:38:18" (3/3) ... [2025-04-13 19:38:18,980 INFO L128 eAbstractionObserver]: Analyzing ICFG bounded_buffer.i [2025-04-13 19:38:18,991 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:38:18,992 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bounded_buffer.i that has 3 procedures, 44 locations, 80 edges, 1 initial locations, 13 loop locations, and 3 error locations. [2025-04-13 19:38:18,993 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:38:19,089 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-13 19:38:19,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 84 transitions, 188 flow [2025-04-13 19:38:19,190 INFO L116 PetriNetUnfolderBase]: 72/170 cut-off events. [2025-04-13 19:38:19,192 INFO L117 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-04-13 19:38:19,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 170 events. 72/170 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 656 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 91. Up to 26 conditions per place. [2025-04-13 19:38:19,197 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 84 transitions, 188 flow [2025-04-13 19:38:19,201 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 80 transitions, 180 flow [2025-04-13 19:38:19,207 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:38:19,214 INFO L340 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;@7880de5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:38:19,214 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-04-13 19:38:19,229 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:38:19,229 INFO L116 PetriNetUnfolderBase]: 8/29 cut-off events. [2025-04-13 19:38:19,229 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 19:38:19,230 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:19,230 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-13 19:38:19,230 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [consumer_routineErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, consumer_routineErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-04-13 19:38:19,234 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:19,235 INFO L85 PathProgramCache]: Analyzing trace with hash 39451777, now seen corresponding path program 1 times [2025-04-13 19:38:19,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:19,240 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471982304] [2025-04-13 19:38:19,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:38:19,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:19,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 19:38:19,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 19:38:19,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:38:19,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:38:19,468 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:38:19,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 19:38:19,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 19:38:19,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:38:19,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:38:19,570 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:38:19,571 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:38:19,572 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-04-13 19:38:19,573 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location consumer_routineErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE (6 of 8 remaining) [2025-04-13 19:38:19,573 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location consumer_routineErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2025-04-13 19:38:19,574 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2025-04-13 19:38:19,574 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location producer_routineErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (3 of 8 remaining) [2025-04-13 19:38:19,574 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location consumer_routineErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE (2 of 8 remaining) [2025-04-13 19:38:19,574 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location consumer_routineErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2025-04-13 19:38:19,574 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location producer_routineErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (0 of 8 remaining) [2025-04-13 19:38:19,574 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:38:19,574 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-13 19:38:19,584 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:38:19,584 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-13 19:38:19,714 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-04-13 19:38:19,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 129 transitions, 302 flow [2025-04-13 19:38:19,869 INFO L116 PetriNetUnfolderBase]: 279/603 cut-off events. [2025-04-13 19:38:19,869 INFO L117 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-04-13 19:38:19,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 692 conditions, 603 events. 279/603 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2980 event pairs, 1 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 359. Up to 103 conditions per place. [2025-04-13 19:38:19,876 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 129 transitions, 302 flow [2025-04-13 19:38:19,886 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 81 places, 125 transitions, 294 flow [2025-04-13 19:38:19,887 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:38:19,888 INFO L340 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;@7880de5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:38:19,888 INFO L341 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-04-13 19:38:19,903 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:38:19,903 INFO L116 PetriNetUnfolderBase]: 10/35 cut-off events. [2025-04-13 19:38:19,903 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-13 19:38:19,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:19,903 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-13 19:38:19,904 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting producer_routineErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [consumer_routineErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, consumer_routineErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-04-13 19:38:19,904 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:19,904 INFO L85 PathProgramCache]: Analyzing trace with hash 43402398, now seen corresponding path program 1 times [2025-04-13 19:38:19,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:19,905 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96247731] [2025-04-13 19:38:19,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:38:19,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:19,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 19:38:19,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 19:38:19,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:38:19,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:20,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:38:20,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:20,805 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96247731] [2025-04-13 19:38:20,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96247731] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:20,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:20,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:38:20,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752821326] [2025-04-13 19:38:20,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:20,813 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:38:20,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:20,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:38:20,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:38:20,831 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 129 [2025-04-13 19:38:20,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 125 transitions, 294 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-04-13 19:38:20,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:20,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 129 [2025-04-13 19:38:20,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:52,501 INFO L116 PetriNetUnfolderBase]: 262770/322404 cut-off events. [2025-04-13 19:38:52,502 INFO L117 PetriNetUnfolderBase]: For 4081/4081 co-relation queries the response was YES. [2025-04-13 19:38:52,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 647197 conditions, 322404 events. 262770/322404 cut-off events. For 4081/4081 co-relation queries the response was YES. Maximal size of possible extension queue 5200. Compared 1603206 event pairs, 159124 based on Foata normal form. 20357/235035 useless extension candidates. Maximal degree in co-relation 403903. Up to 317082 conditions per place. [2025-04-13 19:38:54,294 INFO L140 encePairwiseOnDemand]: 94/129 looper letters, 93 selfloop transitions, 12 changer transitions 0/111 dead transitions. [2025-04-13 19:38:54,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 111 transitions, 460 flow [2025-04-13 19:38:54,295 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:38:54,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:38:54,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 184 transitions. [2025-04-13 19:38:54,304 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.28527131782945736 [2025-04-13 19:38:54,305 INFO L175 Difference]: Start difference. First operand has 81 places, 125 transitions, 294 flow. Second operand 5 states and 184 transitions. [2025-04-13 19:38:54,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 111 transitions, 460 flow [2025-04-13 19:38:54,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 111 transitions, 460 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 19:38:54,325 INFO L231 Difference]: Finished difference. Result has 72 places, 83 transitions, 242 flow [2025-04-13 19:38:54,327 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=242, PETRI_PLACES=72, PETRI_TRANSITIONS=83} [2025-04-13 19:38:54,329 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, -9 predicate places. [2025-04-13 19:38:54,329 INFO L485 AbstractCegarLoop]: Abstraction has has 72 places, 83 transitions, 242 flow [2025-04-13 19:38:54,329 INFO L486 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-04-13 19:38:54,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:54,329 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 19:38:54,330 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:38:54,330 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting producer_routineErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [consumer_routineErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, consumer_routineErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-04-13 19:38:54,330 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:54,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1345365198, now seen corresponding path program 1 times [2025-04-13 19:38:54,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:54,330 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262866566] [2025-04-13 19:38:54,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:38:54,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:54,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 19:38:54,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 19:38:54,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:38:54,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:55,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:38:55,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:55,097 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262866566] [2025-04-13 19:38:55,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262866566] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:55,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:55,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:38:55,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309793236] [2025-04-13 19:38:55,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:55,098 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:38:55,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:55,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:38:55,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:38:55,098 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 129 [2025-04-13 19:38:55,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 83 transitions, 242 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-04-13 19:38:55,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:55,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 129 [2025-04-13 19:38:55,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:39:25,796 INFO L116 PetriNetUnfolderBase]: 281064/345314 cut-off events. [2025-04-13 19:39:25,796 INFO L117 PetriNetUnfolderBase]: For 43710/43710 co-relation queries the response was YES. [2025-04-13 19:39:26,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 739118 conditions, 345314 events. 281064/345314 cut-off events. For 43710/43710 co-relation queries the response was YES. Maximal size of possible extension queue 5817. Compared 1772142 event pairs, 46841 based on Foata normal form. 1089/260905 useless extension candidates. Maximal degree in co-relation 443662. Up to 320455 conditions per place. [2025-04-13 19:39:27,427 INFO L140 encePairwiseOnDemand]: 116/129 looper letters, 113 selfloop transitions, 30 changer transitions 0/149 dead transitions. [2025-04-13 19:39:27,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 149 transitions, 701 flow [2025-04-13 19:39:27,428 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:39:27,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:39:27,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 175 transitions. [2025-04-13 19:39:27,429 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.22609819121447028 [2025-04-13 19:39:27,429 INFO L175 Difference]: Start difference. First operand has 72 places, 83 transitions, 242 flow. Second operand 6 states and 175 transitions. [2025-04-13 19:39:27,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 149 transitions, 701 flow [2025-04-13 19:39:27,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 149 transitions, 700 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:39:27,448 INFO L231 Difference]: Finished difference. Result has 78 places, 101 transitions, 408 flow [2025-04-13 19:39:27,448 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=408, PETRI_PLACES=78, PETRI_TRANSITIONS=101} [2025-04-13 19:39:27,448 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, -3 predicate places. [2025-04-13 19:39:27,448 INFO L485 AbstractCegarLoop]: Abstraction has has 78 places, 101 transitions, 408 flow [2025-04-13 19:39:27,449 INFO L486 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-04-13 19:39:27,449 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:39:27,449 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 19:39:27,449 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:39:27,449 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting consumer_routineErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [consumer_routineErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, consumer_routineErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-04-13 19:39:27,449 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:39:27,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1243286764, now seen corresponding path program 1 times [2025-04-13 19:39:27,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:39:27,449 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635598382] [2025-04-13 19:39:27,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:39:27,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:39:27,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 19:39:27,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 19:39:27,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:39:27,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:39:27,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:39:27,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:39:27,538 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635598382] [2025-04-13 19:39:27,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635598382] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:39:27,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:39:27,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:39:27,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277326790] [2025-04-13 19:39:27,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:39:27,539 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:39:27,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:39:27,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:39:27,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:39:27,539 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 129 [2025-04-13 19:39:27,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 101 transitions, 408 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-04-13 19:39:27,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:39:27,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 129 [2025-04-13 19:39:27,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:39:59,488 INFO L116 PetriNetUnfolderBase]: 254158/311709 cut-off events. [2025-04-13 19:39:59,489 INFO L117 PetriNetUnfolderBase]: For 106939/106939 co-relation queries the response was YES. [2025-04-13 19:40:00,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 722393 conditions, 311709 events. 254158/311709 cut-off events. For 106939/106939 co-relation queries the response was YES. Maximal size of possible extension queue 5595. Compared 1603017 event pairs, 74770 based on Foata normal form. 4/241517 useless extension candidates. Maximal degree in co-relation 720711. Up to 198928 conditions per place. [2025-04-13 19:40:01,262 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 149 selfloop transitions, 7 changer transitions 0/162 dead transitions. [2025-04-13 19:40:01,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 162 transitions, 875 flow [2025-04-13 19:40:01,263 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:40:01,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:40:01,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2025-04-13 19:40:01,264 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3798449612403101 [2025-04-13 19:40:01,264 INFO L175 Difference]: Start difference. First operand has 78 places, 101 transitions, 408 flow. Second operand 3 states and 147 transitions. [2025-04-13 19:40:01,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 162 transitions, 875 flow [2025-04-13 19:40:04,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 162 transitions, 811 flow, removed 30 selfloop flow, removed 2 redundant places. [2025-04-13 19:40:04,469 INFO L231 Difference]: Finished difference. Result has 78 places, 96 transitions, 346 flow [2025-04-13 19:40:04,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=346, PETRI_PLACES=78, PETRI_TRANSITIONS=96} [2025-04-13 19:40:04,469 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, -3 predicate places. [2025-04-13 19:40:04,469 INFO L485 AbstractCegarLoop]: Abstraction has has 78 places, 96 transitions, 346 flow [2025-04-13 19:40:04,469 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-04-13 19:40:04,469 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:40:04,470 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 19:40:04,470 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:40:04,470 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting producer_routineErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [consumer_routineErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, consumer_routineErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-04-13 19:40:04,470 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:40:04,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1243317229, now seen corresponding path program 1 times [2025-04-13 19:40:04,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:40:04,470 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564957900] [2025-04-13 19:40:04,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:40:04,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:40:04,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 19:40:04,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 19:40:04,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:40:04,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:40:04,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:40:04,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:40:04,952 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564957900] [2025-04-13 19:40:04,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564957900] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:40:04,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:40:04,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:40:04,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793590092] [2025-04-13 19:40:04,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:40:04,953 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:40:04,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:40:04,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:40:04,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:40:04,953 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 129 [2025-04-13 19:40:04,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 96 transitions, 346 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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-04-13 19:40:04,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:40:04,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 129 [2025-04-13 19:40:04,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:40:37,389 INFO L116 PetriNetUnfolderBase]: 253106/310720 cut-off events. [2025-04-13 19:40:37,390 INFO L117 PetriNetUnfolderBase]: For 123937/123937 co-relation queries the response was YES. [2025-04-13 19:40:38,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 723142 conditions, 310720 events. 253106/310720 cut-off events. For 123937/123937 co-relation queries the response was YES. Maximal size of possible extension queue 5628. Compared 1591368 event pairs, 47105 based on Foata normal form. 0/258739 useless extension candidates. Maximal degree in co-relation 722738. Up to 289815 conditions per place. [2025-04-13 19:40:39,410 INFO L140 encePairwiseOnDemand]: 116/129 looper letters, 112 selfloop transitions, 24 changer transitions 0/142 dead transitions. [2025-04-13 19:40:39,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 142 transitions, 743 flow [2025-04-13 19:40:39,412 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:40:39,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:40:39,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 161 transitions. [2025-04-13 19:40:39,414 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2496124031007752 [2025-04-13 19:40:39,414 INFO L175 Difference]: Start difference. First operand has 78 places, 96 transitions, 346 flow. Second operand 5 states and 161 transitions. [2025-04-13 19:40:39,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 142 transitions, 743 flow [2025-04-13 19:40:39,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 142 transitions, 734 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:40:39,467 INFO L231 Difference]: Finished difference. Result has 84 places, 99 transitions, 437 flow [2025-04-13 19:40:39,467 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=437, PETRI_PLACES=84, PETRI_TRANSITIONS=99} [2025-04-13 19:40:39,468 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 3 predicate places. [2025-04-13 19:40:39,469 INFO L485 AbstractCegarLoop]: Abstraction has has 84 places, 99 transitions, 437 flow [2025-04-13 19:40:39,469 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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-04-13 19:40:39,469 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:40:39,469 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-04-13 19:40:39,469 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:40:39,469 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [consumer_routineErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, consumer_routineErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-04-13 19:40:39,470 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:40:39,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1243321308, now seen corresponding path program 1 times [2025-04-13 19:40:39,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:40:39,470 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948780126] [2025-04-13 19:40:39,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:40:39,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:40:39,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 19:40:39,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 19:40:39,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:40:39,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:40:39,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:40:39,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:40:39,577 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948780126] [2025-04-13 19:40:39,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948780126] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:40:39,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:40:39,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:40:39,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57114207] [2025-04-13 19:40:39,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:40:39,577 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:40:39,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:40:39,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:40:39,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:40:39,578 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 129 [2025-04-13 19:40:39,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 99 transitions, 437 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-04-13 19:40:39,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:40:39,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 129 [2025-04-13 19:40:39,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:41:04,076 INFO L116 PetriNetUnfolderBase]: 166226/204935 cut-off events. [2025-04-13 19:41:04,076 INFO L117 PetriNetUnfolderBase]: For 71044/71044 co-relation queries the response was YES. [2025-04-13 19:41:04,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 489989 conditions, 204935 events. 166226/204935 cut-off events. For 71044/71044 co-relation queries the response was YES. Maximal size of possible extension queue 3710. Compared 1034607 event pairs, 43438 based on Foata normal form. 16/173397 useless extension candidates. Maximal degree in co-relation 488921. Up to 108927 conditions per place. [2025-04-13 19:41:05,362 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 145 selfloop transitions, 7 changer transitions 0/156 dead transitions. [2025-04-13 19:41:05,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 156 transitions, 886 flow [2025-04-13 19:41:05,362 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:41:05,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:41:05,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2025-04-13 19:41:05,367 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2926356589147287 [2025-04-13 19:41:05,367 INFO L175 Difference]: Start difference. First operand has 84 places, 99 transitions, 437 flow. Second operand 4 states and 151 transitions. [2025-04-13 19:41:05,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 156 transitions, 886 flow [2025-04-13 19:41:05,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 156 transitions, 835 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-13 19:41:05,421 INFO L231 Difference]: Finished difference. Result has 79 places, 90 transitions, 355 flow [2025-04-13 19:41:05,421 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=355, PETRI_PLACES=79, PETRI_TRANSITIONS=90} [2025-04-13 19:41:05,425 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, -2 predicate places. [2025-04-13 19:41:05,425 INFO L485 AbstractCegarLoop]: Abstraction has has 79 places, 90 transitions, 355 flow [2025-04-13 19:41:05,425 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-04-13 19:41:05,425 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:41:05,426 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 19:41:05,426 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 19:41:05,426 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting producer_routineErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [consumer_routineErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, consumer_routineErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-04-13 19:41:05,426 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:41:05,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1239953126, now seen corresponding path program 1 times [2025-04-13 19:41:05,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:41:05,426 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182233080] [2025-04-13 19:41:05,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:41:05,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:41:05,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 19:41:05,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 19:41:05,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:41:05,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:41:05,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:41:05,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:41:05,538 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182233080] [2025-04-13 19:41:05,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182233080] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:41:05,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:41:05,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:41:05,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605308718] [2025-04-13 19:41:05,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:41:05,540 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:41:05,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:41:05,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:41:05,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:41:05,541 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 129 [2025-04-13 19:41:05,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 90 transitions, 355 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-04-13 19:41:05,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:41:05,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 129 [2025-04-13 19:41:05,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:41:27,300 INFO L116 PetriNetUnfolderBase]: 159518/196719 cut-off events. [2025-04-13 19:41:27,301 INFO L117 PetriNetUnfolderBase]: For 96632/96632 co-relation queries the response was YES. [2025-04-13 19:41:27,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485749 conditions, 196719 events. 159518/196719 cut-off events. For 96632/96632 co-relation queries the response was YES. Maximal size of possible extension queue 3549. Compared 962225 event pairs, 88035 based on Foata normal form. 4450/170101 useless extension candidates. Maximal degree in co-relation 429531. Up to 172719 conditions per place. [2025-04-13 19:41:28,515 INFO L140 encePairwiseOnDemand]: 125/129 looper letters, 136 selfloop transitions, 11 changer transitions 0/151 dead transitions. [2025-04-13 19:41:28,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 151 transitions, 871 flow [2025-04-13 19:41:28,516 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:41:28,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:41:28,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2025-04-13 19:41:28,516 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35658914728682173 [2025-04-13 19:41:28,517 INFO L175 Difference]: Start difference. First operand has 79 places, 90 transitions, 355 flow. Second operand 3 states and 138 transitions. [2025-04-13 19:41:28,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 151 transitions, 871 flow [2025-04-13 19:41:28,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 151 transitions, 846 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-13 19:41:28,538 INFO L231 Difference]: Finished difference. Result has 78 places, 89 transitions, 360 flow [2025-04-13 19:41:28,538 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=360, PETRI_PLACES=78, PETRI_TRANSITIONS=89} [2025-04-13 19:41:28,539 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, -3 predicate places. [2025-04-13 19:41:28,539 INFO L485 AbstractCegarLoop]: Abstraction has has 78 places, 89 transitions, 360 flow [2025-04-13 19:41:28,539 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-04-13 19:41:28,539 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:41:28,540 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:41:28,540 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 19:41:28,540 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting consumer_routineErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [consumer_routineErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, consumer_routineErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-04-13 19:41:28,540 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:41:28,540 INFO L85 PathProgramCache]: Analyzing trace with hash -830789847, now seen corresponding path program 1 times [2025-04-13 19:41:28,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:41:28,540 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643494314] [2025-04-13 19:41:28,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:41:28,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:41:28,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 19:41:28,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 19:41:28,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:41:28,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:41:29,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:41:29,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:41:29,264 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643494314] [2025-04-13 19:41:29,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643494314] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:41:29,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:41:29,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:41:29,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913442809] [2025-04-13 19:41:29,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:41:29,264 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:41:29,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:41:29,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:41:29,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:41:29,265 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 129 [2025-04-13 19:41:29,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 89 transitions, 360 flow. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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-04-13 19:41:29,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:41:29,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 129 [2025-04-13 19:41:29,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:41:52,077 INFO L116 PetriNetUnfolderBase]: 159278/198602 cut-off events. [2025-04-13 19:41:52,077 INFO L117 PetriNetUnfolderBase]: For 77289/77289 co-relation queries the response was YES. [2025-04-13 19:41:52,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482665 conditions, 198602 events. 159278/198602 cut-off events. For 77289/77289 co-relation queries the response was YES. Maximal size of possible extension queue 3825. Compared 1032914 event pairs, 30862 based on Foata normal form. 0/167774 useless extension candidates. Maximal degree in co-relation 316869. Up to 187248 conditions per place. [2025-04-13 19:41:53,326 INFO L140 encePairwiseOnDemand]: 115/129 looper letters, 115 selfloop transitions, 31 changer transitions 0/150 dead transitions. [2025-04-13 19:41:53,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 150 transitions, 843 flow [2025-04-13 19:41:53,327 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:41:53,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:41:53,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 188 transitions. [2025-04-13 19:41:53,328 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2081949058693245 [2025-04-13 19:41:53,328 INFO L175 Difference]: Start difference. First operand has 78 places, 89 transitions, 360 flow. Second operand 7 states and 188 transitions. [2025-04-13 19:41:53,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 150 transitions, 843 flow [2025-04-13 19:41:53,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 150 transitions, 803 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:41:53,342 INFO L231 Difference]: Finished difference. Result has 85 places, 101 transitions, 500 flow [2025-04-13 19:41:53,342 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=500, PETRI_PLACES=85, PETRI_TRANSITIONS=101} [2025-04-13 19:41:53,343 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 4 predicate places. [2025-04-13 19:41:53,343 INFO L485 AbstractCegarLoop]: Abstraction has has 85 places, 101 transitions, 500 flow [2025-04-13 19:41:53,343 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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-04-13 19:41:53,343 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:41:53,343 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:41:53,343 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 19:41:53,343 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting producer_routineErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [consumer_routineErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, consumer_routineErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-04-13 19:41:53,344 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:41:53,344 INFO L85 PathProgramCache]: Analyzing trace with hash -826932881, now seen corresponding path program 1 times [2025-04-13 19:41:53,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:41:53,344 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223126361] [2025-04-13 19:41:53,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:41:53,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:41:53,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 19:41:53,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 19:41:53,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:41:53,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:41:53,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:41:53,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:41:53,399 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223126361] [2025-04-13 19:41:53,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223126361] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:41:53,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:41:53,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:41:53,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94266436] [2025-04-13 19:41:53,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:41:53,399 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:41:53,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:41:53,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:41:53,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:41:53,400 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 129 [2025-04-13 19:41:53,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 101 transitions, 500 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-04-13 19:41:53,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:41:53,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 129 [2025-04-13 19:41:53,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:42:13,893 INFO L116 PetriNetUnfolderBase]: 153333/190611 cut-off events. [2025-04-13 19:42:13,894 INFO L117 PetriNetUnfolderBase]: For 73499/73499 co-relation queries the response was YES. [2025-04-13 19:42:14,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 464507 conditions, 190611 events. 153333/190611 cut-off events. For 73499/73499 co-relation queries the response was YES. Maximal size of possible extension queue 3559. Compared 961447 event pairs, 85805 based on Foata normal form. 4266/166757 useless extension candidates. Maximal degree in co-relation 410266. Up to 167331 conditions per place. [2025-04-13 19:42:15,040 INFO L140 encePairwiseOnDemand]: 125/129 looper letters, 152 selfloop transitions, 11 changer transitions 0/167 dead transitions. [2025-04-13 19:42:15,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 167 transitions, 1124 flow [2025-04-13 19:42:15,041 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:42:15,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:42:15,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2025-04-13 19:42:15,042 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3462532299741602 [2025-04-13 19:42:15,042 INFO L175 Difference]: Start difference. First operand has 85 places, 101 transitions, 500 flow. Second operand 3 states and 134 transitions. [2025-04-13 19:42:15,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 167 transitions, 1124 flow [2025-04-13 19:42:15,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 167 transitions, 1036 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-13 19:42:15,061 INFO L231 Difference]: Finished difference. Result has 83 places, 100 transitions, 462 flow [2025-04-13 19:42:15,061 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=462, PETRI_PLACES=83, PETRI_TRANSITIONS=100} [2025-04-13 19:42:15,061 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 2 predicate places. [2025-04-13 19:42:15,061 INFO L485 AbstractCegarLoop]: Abstraction has has 83 places, 100 transitions, 462 flow [2025-04-13 19:42:15,062 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-04-13 19:42:15,062 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:42:15,062 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:42:15,062 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 19:42:15,062 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting producer_routineErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [consumer_routineErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, consumer_routineErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-04-13 19:42:15,062 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:42:15,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1888899530, now seen corresponding path program 1 times [2025-04-13 19:42:15,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:42:15,062 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502635447] [2025-04-13 19:42:15,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:42:15,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:42:15,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 19:42:15,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 19:42:15,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:42:15,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-13 19:42:15,156 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1365578417] [2025-04-13 19:42:15,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:42:15,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:42:15,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:42:15,158 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:42:15,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 19:42:15,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 19:42:16,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 19:42:16,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:42:16,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:42:16,406 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:42:16,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 19:42:18,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 19:42:18,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:42:18,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:42:18,117 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:42:18,117 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:42:18,118 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location producer_routineErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (10 of 11 remaining) [2025-04-13 19:42:18,118 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location consumer_routineErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE (9 of 11 remaining) [2025-04-13 19:42:18,118 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location consumer_routineErr0ASSERT_VIOLATIONERROR_FUNCTION (8 of 11 remaining) [2025-04-13 19:42:18,118 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 11 remaining) [2025-04-13 19:42:18,118 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 11 remaining) [2025-04-13 19:42:18,118 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location producer_routineErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (5 of 11 remaining) [2025-04-13 19:42:18,118 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location consumer_routineErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE (4 of 11 remaining) [2025-04-13 19:42:18,118 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location consumer_routineErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 11 remaining) [2025-04-13 19:42:18,118 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location consumer_routineErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE (2 of 11 remaining) [2025-04-13 19:42:18,118 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location consumer_routineErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 11 remaining) [2025-04-13 19:42:18,118 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location producer_routineErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (0 of 11 remaining) [2025-04-13 19:42:18,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 19:42:18,319 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-13 19:42:18,319 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:42:18,357 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2025-04-13 19:42:18,357 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 19:42:18,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 07:42:18 BasicIcfg [2025-04-13 19:42:18,360 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 19:42:18,361 INFO L158 Benchmark]: Toolchain (without parser) took 241566.92ms. Allocated memory was 142.6MB in the beginning and 3.8GB in the end (delta: 3.7GB). Free memory was 98.2MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2025-04-13 19:42:18,361 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 159.4MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:42:18,361 INFO L158 Benchmark]: CACSL2BoogieTranslator took 670.15ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 43.9MB in the end (delta: 54.3MB). Peak memory consumption was 54.5MB. Max. memory is 8.0GB. [2025-04-13 19:42:18,361 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.28ms. Allocated memory is still 142.6MB. Free memory was 43.9MB in the beginning and 39.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:42:18,361 INFO L158 Benchmark]: Boogie Preprocessor took 98.75ms. Allocated memory is still 142.6MB. Free memory was 39.7MB in the beginning and 34.6MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:42:18,362 INFO L158 Benchmark]: RCFGBuilder took 1336.92ms. Allocated memory is still 142.6MB. Free memory was 34.6MB in the beginning and 52.3MB in the end (delta: -17.7MB). Peak memory consumption was 22.1MB. Max. memory is 8.0GB. [2025-04-13 19:42:18,362 INFO L158 Benchmark]: TraceAbstraction took 239384.96ms. Allocated memory was 142.6MB in the beginning and 3.8GB in the end (delta: 3.7GB). Free memory was 52.3MB in the beginning and 1.7GB in the end (delta: -1.7GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2025-04-13 19:42:18,363 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.26ms. Allocated memory is still 159.4MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 670.15ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 43.9MB in the end (delta: 54.3MB). Peak memory consumption was 54.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 72.28ms. Allocated memory is still 142.6MB. Free memory was 43.9MB in the beginning and 39.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 98.75ms. Allocated memory is still 142.6MB. Free memory was 39.7MB in the beginning and 34.6MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1336.92ms. Allocated memory is still 142.6MB. Free memory was 34.6MB in the beginning and 52.3MB in the end (delta: -17.7MB). Peak memory consumption was 22.1MB. Max. memory is 8.0GB. * TraceAbstraction took 239384.96ms. Allocated memory was 142.6MB in the beginning and 3.8GB in the end (delta: 3.7GB). Free memory was 52.3MB in the beginning and 1.7GB in the end (delta: -1.7GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1636]: Unable to prove that there are no unsupported features in the program Unable to prove that there are no unsupported features in the program Reason: overapproximation of fflush at line 1636. Possible FailurePath: [L1663] 0 thread_t producers[2]; [L1664] 0 thread_t consumers[2]; [L1665] 0 int i; [L1666] 0 bounded_buf_t buffer; [L1667] CALL 0 bounded_buf_init(&buffer, 3) [L1452] 0 int status = 0; [L1453] COND FALSE 0 !(bbuf == ((void *)0)) [L1454] 0 bbuf->valid = 0xACDEFA [L1455] 0 status = pthread_mutex_init(&bbuf->mutex, ((void *)0)) [L1456] COND FALSE 0 !(status != 0) [L1457] 0 status = pthread_cond_init(&bbuf->not_full, ((void *)0)) [L1458] COND FALSE 0 !(status != 0) [L1463] 0 status = pthread_cond_init(&bbuf->not_empty, ((void *)0)) [L1464] COND FALSE 0 !(status != 0) [L1470] 0 bbuf->item_num = 0 [L1471] 0 bbuf->max_size = sz [L1472] 0 bbuf->head = 0 [L1473] 0 bbuf->rear = 0 [L1474] EXPR, FCALL 0 calloc( sz, sizeof(void*) ) [L1474] 0 bbuf->buf = calloc( sz, sizeof(void*) ) [L1475] EXPR 0 bbuf->buf [L1475] COND FALSE 0 !(bbuf->buf == ((void *)0)) [L1482] 0 bbuf->head = 0 [L1483] 0 bbuf->rear = 0 [L1484] 0 bbuf->p_wait = 0 [L1485] 0 bbuf->c_wait = 0 [L1486] 0 return 0; [L1667] RET 0 bounded_buf_init(&buffer, 3) [L1668] 0 i = 0 [L1668] COND TRUE 0 i < 2 [L1670] 0 producers[i].id = i [L1671] 0 producers[i].bbuf = &buffer [L1672] FCALL, FORK 0 pthread_create(&producers[i].pid, ((void *)0), producer_routine, (void*)&producers[i]) VAL [buffer={7:0}, consumers={6:0}, i=0, producers={5:0}] [L1623] 1 thread_t * thread = (thread_t*) arg; [L1624] 1 int i, temp; [L1625] 1 int ch; [L1626] 1 int status = 0; [L1627] 1 i = 0 [L1627] COND TRUE 1 i < 4 [L1629] 1 ch = __VERIFIER_nondet_int() [L1630] 1 temp = ch [L1631] EXPR 1 thread->bbuf [L1631] CALL, EXPR 1 bounded_buf_put(thread->bbuf, (void*)((int)temp)) [L1526] 1 int status = 0, status1 = 0, status2 = 0; [L1527] 1 bbuf == ((void *)0) || bbuf->valid != 0xACDEFA [L1527] 1 bbuf == ((void *)0) || bbuf->valid != 0xACDEFA [L1527] EXPR 1 bbuf->valid [L1527] 1 bbuf == ((void *)0) || bbuf->valid != 0xACDEFA [L1527] COND FALSE 1 !(bbuf == ((void *)0) || bbuf->valid != 0xACDEFA) [L1529] 1 status = pthread_mutex_lock(&bbuf->mutex) [L1531] COND FALSE 1 !(status != 0) [L1532] EXPR 1 bbuf->rear [L1532] EXPR 1 bbuf->max_size [L1532] EXPR 1 bbuf->head [L1532] COND FALSE 1 !((bbuf->rear + 1)% bbuf->max_size == bbuf->head) [L1542] COND TRUE 1 status == 0 [L1543] EXPR 1 bbuf->buf [L1543] EXPR 1 bbuf->rear [L1543] 1 bbuf->buf[bbuf->rear]= item [L1544] EXPR 1 bbuf->rear [L1544] EXPR 1 bbuf->max_size [L1544] 1 bbuf->rear = (bbuf->rear+1)% (bbuf->max_size) [L1545] EXPR 1 bbuf->c_wait [L1545] COND FALSE 1 !(bbuf->c_wait > 0) [L1551] 1 status2 = pthread_mutex_unlock(&bbuf->mutex) [L1552] 1 return (status == 0)? status2 : status; [L1631] RET, EXPR 1 bounded_buf_put(thread->bbuf, (void*)((int)temp)) [L1631] 1 status = bounded_buf_put(thread->bbuf, (void*)((int)temp)) [L1632] COND FALSE 1 !(status != 0) VAL [\at(arg, Pre)={5:0}, arg={5:0}, ch=-2147483648, i=0, status=0, temp=-2147483648, thread={5:0}] [L1636] 1 fflush(stdout) VAL [\at(arg, Pre)={5:0}, arg={5:0}, ch=-2147483648, i=0, status=0, temp=-2147483648, thread={5:0}] - UnprovableResult [Line: 1657]: Unable to prove that there are no unsupported features in the program Unable to prove that there are no unsupported features in the program Reason: Not analyzed. - UnprovableResult [Line: 1581]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1672]: 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: 1678]: 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, 73 locations, 127 edges, 8 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: 0.4s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=180occurred in iteration=0, InterpolantAutomatonStates: 0, 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.0s InterpolantComputationTime, 4 NumberOfCodeBlocks, 4 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 7 procedures, 100 locations, 172 edges, 11 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: 238.6s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 231.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 534 SdHoareTripleChecker+Valid, 8.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 534 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 8.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1787 IncrementalHoareTripleChecker+Invalid, 1826 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 0 mSDtfsCounter, 1787 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=500occurred in iteration=7, InterpolantAutomatonStates: 36, 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.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 65 NumberOfCodeBlocks, 65 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 41 ConstructedInterpolants, 0 QuantifiedInterpolants, 447 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 could not prove your program: unable to determine feasibility of some traces [2025-04-13 19:42:18,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...