/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_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread/queue.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 23:44:32,274 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 23:44:32,316 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 23:44:32,320 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 23:44:32,320 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 23:44:32,345 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 23:44:32,345 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 23:44:32,345 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 23:44:32,346 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 23:44:32,346 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 23:44:32,346 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 23:44:32,346 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 23:44:32,346 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 23:44:32,346 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 23:44:32,346 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 23:44:32,346 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 23:44:32,346 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 23:44:32,346 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 23:44:32,346 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 23:44:32,347 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 23:44:32,348 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 23:44:32,348 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 23:44:32,348 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 23:44:32,348 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 23:44:32,348 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 23:44:32,348 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 23:44:32,348 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 23:44:32,348 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 23:44:32,348 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 23:44:32,348 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:44:32,348 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:44:32,348 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:44:32,348 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:44:32,348 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 23:44:32,348 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:44:32,348 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:44:32,348 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:44:32,348 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:44:32,348 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 23:44:32,349 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 23:44:32,349 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 23:44:32,349 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 23:44:32,349 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 23:44:32,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 23:44:32,349 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 23:44:32,349 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 23:44:32,349 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 23:44:32,349 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 23:44:32,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 23:44:32,576 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 23:44:32,578 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 23:44:32,579 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 23:44:32,581 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 23:44:32,582 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue.i [2025-04-13 23:44:33,838 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c1804460/e19fe919eeff49d4a95bf496131ed4af/FLAGb2f4cb8a2 [2025-04-13 23:44:34,078 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 23:44:34,078 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i [2025-04-13 23:44:34,088 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c1804460/e19fe919eeff49d4a95bf496131ed4af/FLAGb2f4cb8a2 [2025-04-13 23:44:34,889 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c1804460/e19fe919eeff49d4a95bf496131ed4af [2025-04-13 23:44:34,891 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 23:44:34,892 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 23:44:34,892 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 23:44:34,893 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 23:44:34,895 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 23:44:34,896 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:44:34" (1/1) ... [2025-04-13 23:44:34,896 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22418520 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:34, skipping insertion in model container [2025-04-13 23:44:34,896 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:44:34" (1/1) ... [2025-04-13 23:44:34,919 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 23:44:35,181 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/queue.i[43284,43297] [2025-04-13 23:44:35,187 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/queue.i[43491,43504] [2025-04-13 23:44:35,191 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/queue.i[43772,43785] [2025-04-13 23:44:35,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:44:35,208 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 23:44:35,246 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/queue.i[43284,43297] [2025-04-13 23:44:35,252 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/queue.i[43491,43504] [2025-04-13 23:44:35,253 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/queue.i[43772,43785] [2025-04-13 23:44:35,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:44:35,300 INFO L204 MainTranslator]: Completed translation [2025-04-13 23:44:35,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:35 WrapperNode [2025-04-13 23:44:35,300 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 23:44:35,301 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 23:44:35,301 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 23:44:35,301 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 23:44:35,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:35" (1/1) ... [2025-04-13 23:44:35,325 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:35" (1/1) ... [2025-04-13 23:44:35,358 INFO L138 Inliner]: procedures = 274, calls = 104, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 283 [2025-04-13 23:44:35,358 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 23:44:35,358 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 23:44:35,358 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 23:44:35,358 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 23:44:35,365 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:35" (1/1) ... [2025-04-13 23:44:35,365 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:35" (1/1) ... [2025-04-13 23:44:35,372 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:35" (1/1) ... [2025-04-13 23:44:35,383 INFO L175 MemorySlicer]: Split 92 memory accesses to 5 slices as follows [2, 8, 5, 23, 54]. 59 percent of accesses are in the largest equivalence class. The 58 initializations are split as follows [2, 8, 5, 20, 23]. The 16 writes are split as follows [0, 0, 0, 2, 14]. [2025-04-13 23:44:35,383 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:35" (1/1) ... [2025-04-13 23:44:35,383 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:35" (1/1) ... [2025-04-13 23:44:35,390 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:35" (1/1) ... [2025-04-13 23:44:35,391 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:35" (1/1) ... [2025-04-13 23:44:35,392 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:35" (1/1) ... [2025-04-13 23:44:35,392 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:35" (1/1) ... [2025-04-13 23:44:35,396 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 23:44:35,396 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 23:44:35,396 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 23:44:35,396 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 23:44:35,397 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:35" (1/1) ... [2025-04-13 23:44:35,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:44:35,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:44:35,429 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 23:44:35,437 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 23:44:35,452 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-13 23:44:35,452 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-13 23:44:35,452 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-13 23:44:35,452 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-13 23:44:35,452 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 23:44:35,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 23:44:35,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 23:44:35,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 23:44:35,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-04-13 23:44:35,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-04-13 23:44:35,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 23:44:35,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 23:44:35,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 23:44:35,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-04-13 23:44:35,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-04-13 23:44:35,454 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 23:44:35,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 23:44:35,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 23:44:35,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 23:44:35,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 23:44:35,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-04-13 23:44:35,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-04-13 23:44:35,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 23:44:35,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 23:44:35,457 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 23:44:35,592 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 23:44:35,593 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 23:44:35,941 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 23:44:35,942 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 23:44:35,942 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 23:44:36,428 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 23:44:36,429 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 23:44:36,431 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 23:44:36,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:44:36 BoogieIcfgContainer [2025-04-13 23:44:36,431 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 23:44:36,432 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 23:44:36,432 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 23:44:36,435 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 23:44:36,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 11:44:34" (1/3) ... [2025-04-13 23:44:36,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53823b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:44:36, skipping insertion in model container [2025-04-13 23:44:36,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:35" (2/3) ... [2025-04-13 23:44:36,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53823b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:44:36, skipping insertion in model container [2025-04-13 23:44:36,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:44:36" (3/3) ... [2025-04-13 23:44:36,438 INFO L128 eAbstractionObserver]: Analyzing ICFG queue.i [2025-04-13 23:44:36,448 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 23:44:36,449 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue.i that has 3 procedures, 29 locations, 32 edges, 1 initial locations, 2 loop locations, and 3 error locations. [2025-04-13 23:44:36,449 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 23:44:36,523 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 23:44:36,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 34 transitions, 82 flow [2025-04-13 23:44:36,572 INFO L116 PetriNetUnfolderBase]: 6/32 cut-off events. [2025-04-13 23:44:36,575 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 23:44:36,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 32 events. 6/32 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 55 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 26. Up to 3 conditions per place. [2025-04-13 23:44:36,576 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 34 transitions, 82 flow [2025-04-13 23:44:36,578 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 30 transitions, 69 flow [2025-04-13 23:44:36,586 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:44:36,597 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;@74f8d650, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:44:36,597 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 23:44:36,599 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:44:36,599 INFO L116 PetriNetUnfolderBase]: 1/3 cut-off events. [2025-04-13 23:44:36,599 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 23:44:36,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:44:36,600 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-04-13 23:44:36,600 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:44:36,603 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:44:36,603 INFO L85 PathProgramCache]: Analyzing trace with hash 21817, now seen corresponding path program 1 times [2025-04-13 23:44:36,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:44:36,608 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834752841] [2025-04-13 23:44:36,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:44:36,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:44:36,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-13 23:44:36,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-13 23:44:36,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:44:36,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:44:36,699 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 23:44:36,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:44:36,700 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834752841] [2025-04-13 23:44:36,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834752841] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:44:36,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:44:36,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:44:36,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096684556] [2025-04-13 23:44:36,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:44:36,708 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 23:44:36,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:44:36,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 23:44:36,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 23:44:36,729 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 23:44:36,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 30 transitions, 69 flow. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 23:44:36,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:44:36,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 23:44:36,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:44:36,879 INFO L116 PetriNetUnfolderBase]: 261/445 cut-off events. [2025-04-13 23:44:36,879 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-13 23:44:36,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 925 conditions, 445 events. 261/445 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1463 event pairs, 222 based on Foata normal form. 0/367 useless extension candidates. Maximal degree in co-relation 880. Up to 446 conditions per place. [2025-04-13 23:44:36,885 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 24 selfloop transitions, 0 changer transitions 0/24 dead transitions. [2025-04-13 23:44:36,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 24 transitions, 105 flow [2025-04-13 23:44:36,888 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 23:44:36,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 23:44:36,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2025-04-13 23:44:36,897 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-13 23:44:36,898 INFO L175 Difference]: Start difference. First operand has 31 places, 30 transitions, 69 flow. Second operand 2 states and 34 transitions. [2025-04-13 23:44:36,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 24 transitions, 105 flow [2025-04-13 23:44:36,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 24 transitions, 100 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-13 23:44:36,905 INFO L231 Difference]: Finished difference. Result has 27 places, 24 transitions, 52 flow [2025-04-13 23:44:36,907 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=52, PETRI_PLACES=27, PETRI_TRANSITIONS=24} [2025-04-13 23:44:36,910 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -4 predicate places. [2025-04-13 23:44:36,910 INFO L485 AbstractCegarLoop]: Abstraction has has 27 places, 24 transitions, 52 flow [2025-04-13 23:44:36,911 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 23:44:36,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:44:36,911 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 23:44:36,911 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 23:44:36,911 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:44:36,912 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:44:36,912 INFO L85 PathProgramCache]: Analyzing trace with hash 652967094, now seen corresponding path program 1 times [2025-04-13 23:44:36,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:44:36,912 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063603858] [2025-04-13 23:44:36,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:44:36,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:44:36,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 23:44:36,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 23:44:36,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:44:36,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:44:37,506 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 23:44:37,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:44:37,507 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063603858] [2025-04-13 23:44:37,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063603858] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:44:37,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:44:37,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:44:37,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073087988] [2025-04-13 23:44:37,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:44:37,508 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:44:37,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:44:37,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:44:37,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:44:37,509 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 23:44:37,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 24 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 23:44:37,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:44:37,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 23:44:37,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:44:37,671 INFO L116 PetriNetUnfolderBase]: 280/472 cut-off events. [2025-04-13 23:44:37,672 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 23:44:37,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 968 conditions, 472 events. 280/472 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1589 event pairs, 80 based on Foata normal form. 0/392 useless extension candidates. Maximal degree in co-relation 965. Up to 428 conditions per place. [2025-04-13 23:44:37,677 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2025-04-13 23:44:37,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 34 transitions, 142 flow [2025-04-13 23:44:37,678 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:44:37,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:44:37,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2025-04-13 23:44:37,678 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43137254901960786 [2025-04-13 23:44:37,678 INFO L175 Difference]: Start difference. First operand has 27 places, 24 transitions, 52 flow. Second operand 3 states and 44 transitions. [2025-04-13 23:44:37,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 34 transitions, 142 flow [2025-04-13 23:44:37,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 34 transitions, 142 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 23:44:37,680 INFO L231 Difference]: Finished difference. Result has 30 places, 27 transitions, 78 flow [2025-04-13 23:44:37,681 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=30, PETRI_TRANSITIONS=27} [2025-04-13 23:44:37,681 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -1 predicate places. [2025-04-13 23:44:37,681 INFO L485 AbstractCegarLoop]: Abstraction has has 30 places, 27 transitions, 78 flow [2025-04-13 23:44:37,681 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 23:44:37,681 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:44:37,681 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:44:37,681 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 23:44:37,682 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:44:37,682 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:44:37,682 INFO L85 PathProgramCache]: Analyzing trace with hash 410027087, now seen corresponding path program 1 times [2025-04-13 23:44:37,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:44:37,683 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051068293] [2025-04-13 23:44:37,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:44:37,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:44:37,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 23:44:37,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 23:44:37,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:44:37,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:44:37,788 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 23:44:37,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:44:37,788 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051068293] [2025-04-13 23:44:37,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051068293] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:44:37,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:44:37,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:44:37,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375322090] [2025-04-13 23:44:37,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:44:37,788 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:44:37,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:44:37,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:44:37,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:44:37,789 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 23:44:37,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 27 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 23:44:37,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:44:37,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 23:44:37,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:44:37,939 INFO L116 PetriNetUnfolderBase]: 296/504 cut-off events. [2025-04-13 23:44:37,940 INFO L117 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-04-13 23:44:37,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1125 conditions, 504 events. 296/504 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1704 event pairs, 143 based on Foata normal form. 0/440 useless extension candidates. Maximal degree in co-relation 1120. Up to 281 conditions per place. [2025-04-13 23:44:37,943 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 34 selfloop transitions, 2 changer transitions 1/37 dead transitions. [2025-04-13 23:44:37,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 37 transitions, 173 flow [2025-04-13 23:44:37,943 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:44:37,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:44:37,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2025-04-13 23:44:37,945 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4411764705882353 [2025-04-13 23:44:37,945 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 78 flow. Second operand 3 states and 45 transitions. [2025-04-13 23:44:37,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 37 transitions, 173 flow [2025-04-13 23:44:37,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 37 transitions, 170 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 23:44:37,948 INFO L231 Difference]: Finished difference. Result has 32 places, 27 transitions, 82 flow [2025-04-13 23:44:37,948 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=32, PETRI_TRANSITIONS=27} [2025-04-13 23:44:37,948 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2025-04-13 23:44:37,948 INFO L485 AbstractCegarLoop]: Abstraction has has 32 places, 27 transitions, 82 flow [2025-04-13 23:44:37,949 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 23:44:37,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:44:37,949 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:44:37,949 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 23:44:37,949 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:44:37,949 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:44:37,949 INFO L85 PathProgramCache]: Analyzing trace with hash 877307412, now seen corresponding path program 1 times [2025-04-13 23:44:37,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:44:37,949 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362326522] [2025-04-13 23:44:37,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:44:37,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:44:37,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 23:44:37,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:44:37,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:44:37,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:44:38,056 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 23:44:38,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:44:38,056 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362326522] [2025-04-13 23:44:38,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362326522] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:44:38,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:44:38,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:44:38,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734131813] [2025-04-13 23:44:38,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:44:38,057 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:44:38,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:44:38,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:44:38,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:44:38,057 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 23:44:38,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 27 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 23:44:38,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:44:38,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 23:44:38,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:44:38,165 INFO L116 PetriNetUnfolderBase]: 221/399 cut-off events. [2025-04-13 23:44:38,165 INFO L117 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-04-13 23:44:38,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 912 conditions, 399 events. 221/399 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1403 event pairs, 78 based on Foata normal form. 30/380 useless extension candidates. Maximal degree in co-relation 906. Up to 227 conditions per place. [2025-04-13 23:44:38,167 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 32 selfloop transitions, 6 changer transitions 0/38 dead transitions. [2025-04-13 23:44:38,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 38 transitions, 183 flow [2025-04-13 23:44:38,168 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:44:38,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:44:38,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2025-04-13 23:44:38,168 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.46078431372549017 [2025-04-13 23:44:38,168 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 82 flow. Second operand 3 states and 47 transitions. [2025-04-13 23:44:38,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 38 transitions, 183 flow [2025-04-13 23:44:38,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 38 transitions, 181 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 23:44:38,169 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 92 flow [2025-04-13 23:44:38,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2025-04-13 23:44:38,170 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 2 predicate places. [2025-04-13 23:44:38,170 INFO L485 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 92 flow [2025-04-13 23:44:38,170 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 23:44:38,170 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:44:38,170 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:44:38,170 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 23:44:38,171 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:44:38,172 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:44:38,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1666287348, now seen corresponding path program 1 times [2025-04-13 23:44:38,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:44:38,172 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700571829] [2025-04-13 23:44:38,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:44:38,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:44:38,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 23:44:38,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 23:44:38,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:44:38,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:44:38,661 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 23:44:38,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:44:38,661 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700571829] [2025-04-13 23:44:38,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700571829] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:44:38,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:44:38,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:44:38,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737713755] [2025-04-13 23:44:38,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:44:38,662 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:44:38,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:44:38,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:44:38,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:44:38,662 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 23:44:38,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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 23:44:38,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:44:38,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 23:44:38,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:44:38,780 INFO L116 PetriNetUnfolderBase]: 214/386 cut-off events. [2025-04-13 23:44:38,780 INFO L117 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-04-13 23:44:38,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 956 conditions, 386 events. 214/386 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1265 event pairs, 87 based on Foata normal form. 0/345 useless extension candidates. Maximal degree in co-relation 950. Up to 290 conditions per place. [2025-04-13 23:44:38,782 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 30 selfloop transitions, 3 changer transitions 2/35 dead transitions. [2025-04-13 23:44:38,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 184 flow [2025-04-13 23:44:38,782 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:44:38,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:44:38,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2025-04-13 23:44:38,784 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4117647058823529 [2025-04-13 23:44:38,784 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 92 flow. Second operand 3 states and 42 transitions. [2025-04-13 23:44:38,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 184 flow [2025-04-13 23:44:38,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 35 transitions, 176 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 23:44:38,787 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 86 flow [2025-04-13 23:44:38,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2025-04-13 23:44:38,788 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 2 predicate places. [2025-04-13 23:44:38,788 INFO L485 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 86 flow [2025-04-13 23:44:38,788 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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 23:44:38,789 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:44:38,789 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:44:38,789 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 23:44:38,789 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:44:38,789 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:44:38,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1159292848, now seen corresponding path program 1 times [2025-04-13 23:44:38,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:44:38,789 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563392680] [2025-04-13 23:44:38,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:44:38,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:44:38,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 23:44:38,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 23:44:38,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:44:38,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:44:39,963 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 23:44:39,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:44:39,963 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563392680] [2025-04-13 23:44:39,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563392680] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:44:39,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:44:39,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:44:39,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196900953] [2025-04-13 23:44:39,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:44:39,963 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 23:44:39,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:44:39,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 23:44:39,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:44:39,964 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 23:44:39,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 86 flow. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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 23:44:39,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:44:39,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 23:44:39,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:44:40,191 INFO L116 PetriNetUnfolderBase]: 209/386 cut-off events. [2025-04-13 23:44:40,191 INFO L117 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2025-04-13 23:44:40,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 926 conditions, 386 events. 209/386 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1348 event pairs, 58 based on Foata normal form. 7/375 useless extension candidates. Maximal degree in co-relation 919. Up to 296 conditions per place. [2025-04-13 23:44:40,193 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 44 selfloop transitions, 11 changer transitions 0/55 dead transitions. [2025-04-13 23:44:40,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 55 transitions, 283 flow [2025-04-13 23:44:40,194 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 23:44:40,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 23:44:40,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2025-04-13 23:44:40,195 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31932773109243695 [2025-04-13 23:44:40,195 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 86 flow. Second operand 7 states and 76 transitions. [2025-04-13 23:44:40,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 55 transitions, 283 flow [2025-04-13 23:44:40,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 55 transitions, 275 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 23:44:40,196 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 154 flow [2025-04-13 23:44:40,196 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=154, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2025-04-13 23:44:40,197 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2025-04-13 23:44:40,197 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 154 flow [2025-04-13 23:44:40,197 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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 23:44:40,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:44:40,197 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:44:40,197 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 23:44:40,197 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:44:40,199 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:44:40,199 INFO L85 PathProgramCache]: Analyzing trace with hash -730758788, now seen corresponding path program 2 times [2025-04-13 23:44:40,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:44:40,199 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048028974] [2025-04-13 23:44:40,199 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:44:40,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:44:40,215 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 1 equivalence classes. [2025-04-13 23:44:40,263 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 23:44:40,264 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:44:40,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:44:41,076 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 23:44:41,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:44:41,076 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048028974] [2025-04-13 23:44:41,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048028974] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:44:41,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:44:41,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:44:41,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001760862] [2025-04-13 23:44:41,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:44:41,077 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 23:44:41,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:44:41,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 23:44:41,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:44:41,077 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 23:44:41,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 154 flow. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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 23:44:41,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:44:41,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 23:44:41,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:44:41,327 INFO L116 PetriNetUnfolderBase]: 241/448 cut-off events. [2025-04-13 23:44:41,328 INFO L117 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2025-04-13 23:44:41,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1215 conditions, 448 events. 241/448 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1692 event pairs, 62 based on Foata normal form. 7/433 useless extension candidates. Maximal degree in co-relation 1204. Up to 304 conditions per place. [2025-04-13 23:44:41,331 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 54 selfloop transitions, 18 changer transitions 0/72 dead transitions. [2025-04-13 23:44:41,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 72 transitions, 428 flow [2025-04-13 23:44:41,332 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 23:44:41,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 23:44:41,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2025-04-13 23:44:41,333 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33455882352941174 [2025-04-13 23:44:41,333 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 154 flow. Second operand 8 states and 91 transitions. [2025-04-13 23:44:41,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 72 transitions, 428 flow [2025-04-13 23:44:41,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 72 transitions, 416 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-04-13 23:44:41,337 INFO L231 Difference]: Finished difference. Result has 47 places, 43 transitions, 245 flow [2025-04-13 23:44:41,338 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=245, PETRI_PLACES=47, PETRI_TRANSITIONS=43} [2025-04-13 23:44:41,338 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 16 predicate places. [2025-04-13 23:44:41,338 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 43 transitions, 245 flow [2025-04-13 23:44:41,339 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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 23:44:41,339 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:44:41,339 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:44:41,339 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 23:44:41,339 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:44:41,340 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:44:41,340 INFO L85 PathProgramCache]: Analyzing trace with hash -872948348, now seen corresponding path program 3 times [2025-04-13 23:44:41,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:44:41,340 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348433913] [2025-04-13 23:44:41,340 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:44:41,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:44:41,359 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 1 equivalence classes. [2025-04-13 23:44:41,391 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 23:44:41,391 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:44:41,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:44:42,024 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 23:44:42,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:44:42,024 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348433913] [2025-04-13 23:44:42,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348433913] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:44:42,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:44:42,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:44:42,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533964149] [2025-04-13 23:44:42,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:44:42,025 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 23:44:42,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:44:42,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 23:44:42,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:44:42,025 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 23:44:42,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 43 transitions, 245 flow. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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 23:44:42,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:44:42,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 23:44:42,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:44:42,290 INFO L116 PetriNetUnfolderBase]: 287/533 cut-off events. [2025-04-13 23:44:42,290 INFO L117 PetriNetUnfolderBase]: For 474/474 co-relation queries the response was YES. [2025-04-13 23:44:42,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1568 conditions, 533 events. 287/533 cut-off events. For 474/474 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2052 event pairs, 39 based on Foata normal form. 7/510 useless extension candidates. Maximal degree in co-relation 1555. Up to 282 conditions per place. [2025-04-13 23:44:42,293 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 57 selfloop transitions, 22 changer transitions 0/79 dead transitions. [2025-04-13 23:44:42,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 79 transitions, 519 flow [2025-04-13 23:44:42,293 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 23:44:42,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 23:44:42,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2025-04-13 23:44:42,294 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37815126050420167 [2025-04-13 23:44:42,294 INFO L175 Difference]: Start difference. First operand has 47 places, 43 transitions, 245 flow. Second operand 7 states and 90 transitions. [2025-04-13 23:44:42,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 79 transitions, 519 flow [2025-04-13 23:44:42,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 79 transitions, 480 flow, removed 16 selfloop flow, removed 2 redundant places. [2025-04-13 23:44:42,297 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 300 flow [2025-04-13 23:44:42,297 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=300, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2025-04-13 23:44:42,298 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 22 predicate places. [2025-04-13 23:44:42,298 INFO L485 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 300 flow [2025-04-13 23:44:42,298 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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 23:44:42,298 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:44:42,298 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:44:42,298 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 23:44:42,298 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:44:42,299 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:44:42,299 INFO L85 PathProgramCache]: Analyzing trace with hash 727044583, now seen corresponding path program 1 times [2025-04-13 23:44:42,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:44:42,299 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486068389] [2025-04-13 23:44:42,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:44:42,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:44:42,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 23:44:42,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 23:44:42,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:44:42,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:44:42,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:44:42,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:44:42,410 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486068389] [2025-04-13 23:44:42,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486068389] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:44:42,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:44:42,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:44:42,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424588152] [2025-04-13 23:44:42,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:44:42,410 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:44:42,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:44:42,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:44:42,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:44:42,411 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 23:44:42,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 300 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 23:44:42,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:44:42,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 23:44:42,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:44:42,504 INFO L116 PetriNetUnfolderBase]: 319/590 cut-off events. [2025-04-13 23:44:42,505 INFO L117 PetriNetUnfolderBase]: For 787/787 co-relation queries the response was YES. [2025-04-13 23:44:42,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1807 conditions, 590 events. 319/590 cut-off events. For 787/787 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2317 event pairs, 133 based on Foata normal form. 7/561 useless extension candidates. Maximal degree in co-relation 1792. Up to 314 conditions per place. [2025-04-13 23:44:42,509 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 46 selfloop transitions, 10 changer transitions 2/58 dead transitions. [2025-04-13 23:44:42,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 58 transitions, 459 flow [2025-04-13 23:44:42,509 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:44:42,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 23:44:42,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2025-04-13 23:44:42,510 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.34558823529411764 [2025-04-13 23:44:42,510 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 300 flow. Second operand 4 states and 47 transitions. [2025-04-13 23:44:42,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 58 transitions, 459 flow [2025-04-13 23:44:42,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 58 transitions, 426 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-04-13 23:44:42,515 INFO L231 Difference]: Finished difference. Result has 55 places, 49 transitions, 332 flow [2025-04-13 23:44:42,515 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=332, PETRI_PLACES=55, PETRI_TRANSITIONS=49} [2025-04-13 23:44:42,516 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 24 predicate places. [2025-04-13 23:44:42,516 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 332 flow [2025-04-13 23:44:42,516 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 23:44:42,516 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:44:42,516 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:44:42,516 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 23:44:42,516 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:44:42,517 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:44:42,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1043139951, now seen corresponding path program 2 times [2025-04-13 23:44:42,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:44:42,517 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975802719] [2025-04-13 23:44:42,517 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:44:42,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:44:42,535 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 23:44:42,590 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 23:44:42,590 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:44:42,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:44:42,590 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:44:42,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 23:44:42,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 23:44:42,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:44:42,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:44:42,645 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:44:42,645 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:44:42,649 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2025-04-13 23:44:42,651 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-04-13 23:44:42,651 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-04-13 23:44:42,651 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-04-13 23:44:42,651 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2025-04-13 23:44:42,651 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-04-13 23:44:42,651 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-04-13 23:44:42,651 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 23:44:42,652 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1] [2025-04-13 23:44:42,718 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 23:44:42,718 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 23:44:42,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 11:44:42 BasicIcfg [2025-04-13 23:44:42,722 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 23:44:42,723 INFO L158 Benchmark]: Toolchain (without parser) took 7830.99ms. Allocated memory was 125.8MB in the beginning and 520.1MB in the end (delta: 394.3MB). Free memory was 85.8MB in the beginning and 421.9MB in the end (delta: -336.2MB). Peak memory consumption was 58.6MB. Max. memory is 8.0GB. [2025-04-13 23:44:42,723 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 159.4MB. Free memory is still 88.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:44:42,723 INFO L158 Benchmark]: CACSL2BoogieTranslator took 408.27ms. Allocated memory is still 125.8MB. Free memory was 85.8MB in the beginning and 52.1MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2025-04-13 23:44:42,723 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.82ms. Allocated memory is still 125.8MB. Free memory was 52.1MB in the beginning and 48.6MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 23:44:42,723 INFO L158 Benchmark]: Boogie Preprocessor took 37.33ms. Allocated memory is still 125.8MB. Free memory was 48.6MB in the beginning and 45.7MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 23:44:42,723 INFO L158 Benchmark]: IcfgBuilder took 1035.00ms. Allocated memory is still 125.8MB. Free memory was 45.7MB in the beginning and 32.8MB in the end (delta: 12.9MB). Peak memory consumption was 34.0MB. Max. memory is 8.0GB. [2025-04-13 23:44:42,724 INFO L158 Benchmark]: TraceAbstraction took 6289.73ms. Allocated memory was 125.8MB in the beginning and 520.1MB in the end (delta: 394.3MB). Free memory was 32.3MB in the beginning and 421.9MB in the end (delta: -389.7MB). Peak memory consumption was 6.7MB. Max. memory is 8.0GB. [2025-04-13 23:44:42,724 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.31ms. Allocated memory is still 159.4MB. Free memory is still 88.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 408.27ms. Allocated memory is still 125.8MB. Free memory was 85.8MB in the beginning and 52.1MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.82ms. Allocated memory is still 125.8MB. Free memory was 52.1MB in the beginning and 48.6MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.33ms. Allocated memory is still 125.8MB. Free memory was 48.6MB in the beginning and 45.7MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 1035.00ms. Allocated memory is still 125.8MB. Free memory was 45.7MB in the beginning and 32.8MB in the end (delta: 12.9MB). Peak memory consumption was 34.0MB. Max. memory is 8.0GB. * TraceAbstraction took 6289.73ms. Allocated memory was 125.8MB in the beginning and 520.1MB in the end (delta: 394.3MB). Free memory was 32.3MB in the beginning and 421.9MB in the end (delta: -389.7MB). Peak memory consumption was 6.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1043]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L950] 0 _Bool enqueue_flag, dequeue_flag; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L1054] 0 pthread_t id1, id2; [L1055] 0 enqueue_flag=(1) [L1056] 0 dequeue_flag=(0) [L1057] CALL 0 init(&queue) [L954] 0 q->head=0 [L955] 0 q->tail=0 [L956] 0 q->amount=0 [L1057] RET 0 init(&queue) [L1058] CALL, EXPR 0 empty(&queue) [L960] EXPR 0 q->head [L960] EXPR 0 q->tail [L960] COND TRUE 0 q->head == q->tail [L963] 0 return (-1); [L1058] RET, EXPR 0 empty(&queue) [L1058] COND FALSE 0 !(!empty(&queue)==(-1)) [L1063] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, &queue) VAL [dequeue_flag=0, enqueue_flag=1, id1=-2, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1007] 1 int value, i; VAL [\at(arg, Pre)={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1064] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, &queue) VAL [dequeue_flag=0, enqueue_flag=1, id1=-2, id2=-1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1009] 1 value = __VERIFIER_nondet_int() [L1010] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail [L980] 1 q->element[q->tail] = x [L981] EXPR 1 q->amount [L981] 1 q->amount++ [L981] 1 q->amount++ [L982] EXPR 1 q->tail [L982] COND FALSE 1 !(q->tail == (20)) [L988] EXPR 1 q->tail [L988] 1 q->tail++ [L988] 1 q->tail++ [L990] 1 return 0; [L1010] RET 1 enqueue(&queue,value) [L1010] COND FALSE 1 !(enqueue(&queue,value)) [L1013] 1 stored_elements[0]=value [L1014] CALL 1 empty(&queue) [L960] EXPR 1 q->head [L960] EXPR 1 q->tail [L960] COND FALSE 1 !(q->head == q->tail) [L966] 1 return 0; [L1014] RET 1 empty(&queue) [L1014] COND FALSE 1 !(empty(&queue)) [L1018] 1 i=0 [L1018] COND TRUE 1 i<((20)-1) VAL [dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1036] 2 int i; [L1037] 2 i=0 [L1037] COND TRUE 2 i<(20) VAL [dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1040] COND FALSE 2 !(\read(dequeue_flag)) VAL [dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1037] 2 i++ [L1037] COND TRUE 2 i<(20) VAL [dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1021] COND TRUE 1 \read(enqueue_flag) [L1023] 1 value = __VERIFIER_nondet_int() [L1024] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail [L980] 1 q->element[q->tail] = x [L981] EXPR 1 q->amount [L981] 1 q->amount++ [L981] 1 q->amount++ [L982] EXPR 1 q->tail [L982] COND FALSE 1 !(q->tail == (20)) [L988] EXPR 1 q->tail [L988] 1 q->tail++ [L988] 1 q->tail++ [L990] 1 return 0; [L1024] RET 1 enqueue(&queue,value) [L1025] 1 stored_elements[i+1]=value [L1026] 1 enqueue_flag=(0) [L1027] 1 dequeue_flag=(1) VAL [\at(arg, Pre)={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}, value=0] [L1040] COND TRUE 2 \read(dequeue_flag) [L1042] CALL, EXPR 2 dequeue(&queue) [L994] 2 int x; [L995] EXPR 2 q->head [L995] EXPR 2 q->element[q->head] [L995] 2 x = q->element[q->head] [L996] EXPR 2 q->amount [L996] 2 q->amount-- [L996] 2 q->amount-- [L997] EXPR 2 q->head [L997] COND FALSE 2 !(q->head == (20)) [L1002] EXPR 2 q->head [L1002] 2 q->head++ [L1002] 2 q->head++ [L1003] 2 return x; [L1042] RET, EXPR 2 dequeue(&queue) [L1042] EXPR 2 stored_elements[i] [L1042] COND TRUE 2 !dequeue(&queue)==stored_elements[i] [L1043] 2 reach_error() VAL [\at(arg, Pre)={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] - UnprovableResult [Line: 1059]: 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: 1064]: 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: 1063]: 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: 1032]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 49 locations, 59 edges, 7 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: 6.1s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 118 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 118 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 811 IncrementalHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 0 mSDtfsCounter, 811 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=332occurred in iteration=9, InterpolantAutomatonStates: 40, 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.3s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 118 NumberOfCodeBlocks, 118 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 1853 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-04-13 23:44:42,735 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...