/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/goblint-regression/28-race_reach_01-simple_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:13:56,253 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:13:56,307 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-14 00:13:56,313 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:13:56,313 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:13:56,333 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:13:56,333 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:13:56,333 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:13:56,333 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:13:56,336 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:13:56,336 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:13:56,336 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:13:56,336 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:13:56,336 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:13:56,337 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:13:56,337 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:13:56,337 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:13:56,337 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:13:56,337 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:13:56,337 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:13:56,337 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:13:56,338 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:13:56,338 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:13:56,338 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:13:56,338 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:13:56,338 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:13:56,338 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:13:56,338 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:13:56,338 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:13:56,338 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:13:56,339 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:13:56,339 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:13:56,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:13:56,339 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:13:56,339 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:13:56,339 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:13:56,339 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:13:56,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:13:56,339 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:13:56,339 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:13:56,339 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:13:56,339 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:13:56,339 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:13:56,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:13:56,339 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:13:56,340 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:13:56,340 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:13:56,340 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-14 00:13:56,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:13:56,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:13:56,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:13:56,549 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:13:56,551 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:13:56,552 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_01-simple_racing.i [2025-04-14 00:13:57,822 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bcb5e72b/a3b54e08270d47f59c1eef25514dca58/FLAGdb0732ffe [2025-04-14 00:13:58,127 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:13:58,127 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_01-simple_racing.i [2025-04-14 00:13:58,142 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bcb5e72b/a3b54e08270d47f59c1eef25514dca58/FLAGdb0732ffe [2025-04-14 00:13:58,821 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bcb5e72b/a3b54e08270d47f59c1eef25514dca58 [2025-04-14 00:13:58,823 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:13:58,824 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:13:58,825 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:13:58,825 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:13:58,829 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:13:58,830 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:13:58" (1/1) ... [2025-04-14 00:13:58,830 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43cc25a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:58, skipping insertion in model container [2025-04-14 00:13:58,830 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:13:58" (1/1) ... [2025-04-14 00:13:58,856 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:13:59,152 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_01-simple_racing.i[30176,30189] [2025-04-14 00:13:59,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:13:59,206 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:13:59,258 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_01-simple_racing.i[30176,30189] [2025-04-14 00:13:59,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:13:59,292 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:13:59,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:59 WrapperNode [2025-04-14 00:13:59,293 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:13:59,293 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:13:59,293 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:13:59,293 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:13:59,297 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:59" (1/1) ... [2025-04-14 00:13:59,307 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:59" (1/1) ... [2025-04-14 00:13:59,324 INFO L138 Inliner]: procedures = 171, calls = 41, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 76 [2025-04-14 00:13:59,324 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:13:59,324 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:13:59,325 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:13:59,325 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:13:59,330 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:59" (1/1) ... [2025-04-14 00:13:59,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:59" (1/1) ... [2025-04-14 00:13:59,338 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:59" (1/1) ... [2025-04-14 00:13:59,349 INFO L175 MemorySlicer]: Split 19 memory accesses to 5 slices as follows [2, 5, 2, 5, 5]. 26 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 0, 5, 5]. The 1 writes are split as follows [0, 0, 1, 0, 0]. [2025-04-14 00:13:59,349 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:59" (1/1) ... [2025-04-14 00:13:59,349 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:59" (1/1) ... [2025-04-14 00:13:59,354 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:59" (1/1) ... [2025-04-14 00:13:59,354 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:59" (1/1) ... [2025-04-14 00:13:59,355 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:59" (1/1) ... [2025-04-14 00:13:59,356 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:59" (1/1) ... [2025-04-14 00:13:59,359 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:13:59,360 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:13:59,360 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:13:59,360 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:13:59,360 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:59" (1/1) ... [2025-04-14 00:13:59,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:13:59,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:13:59,386 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-14 00:13:59,388 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-14 00:13:59,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 00:13:59,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 00:13:59,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-14 00:13:59,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-04-14 00:13:59,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-04-14 00:13:59,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 00:13:59,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 00:13:59,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-14 00:13:59,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-04-14 00:13:59,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-04-14 00:13:59,404 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-14 00:13:59,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:13:59,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-14 00:13:59,404 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-14 00:13:59,404 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-14 00:13:59,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-14 00:13:59,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:13:59,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 00:13:59,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-14 00:13:59,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-04-14 00:13:59,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-04-14 00:13:59,405 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-14 00:13:59,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:13:59,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:13:59,407 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 00:13:59,500 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:13:59,501 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:13:59,646 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-04-14 00:13:59,646 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-04-14 00:13:59,680 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:13:59,681 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:13:59,681 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:13:59,835 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:13:59,842 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:13:59,842 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:13:59,853 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:13:59,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:13:59 BoogieIcfgContainer [2025-04-14 00:13:59,854 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:13:59,855 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:13:59,855 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:13:59,859 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:13:59,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:13:58" (1/3) ... [2025-04-14 00:13:59,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@600724a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:13:59, skipping insertion in model container [2025-04-14 00:13:59,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:59" (2/3) ... [2025-04-14 00:13:59,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@600724a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:13:59, skipping insertion in model container [2025-04-14 00:13:59,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:13:59" (3/3) ... [2025-04-14 00:13:59,861 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_01-simple_racing.i [2025-04-14 00:13:59,872 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:13:59,874 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_01-simple_racing.i that has 2 procedures, 29 locations, 40 edges, 1 initial locations, 5 loop locations, and 1 error locations. [2025-04-14 00:13:59,875 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:13:59,922 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-14 00:13:59,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 41 transitions, 89 flow [2025-04-14 00:13:59,983 INFO L116 PetriNetUnfolderBase]: 13/53 cut-off events. [2025-04-14 00:13:59,989 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-14 00:13:59,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 53 events. 13/53 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 152 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 34. Up to 4 conditions per place. [2025-04-14 00:13:59,991 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 41 transitions, 89 flow [2025-04-14 00:13:59,993 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 38 transitions, 80 flow [2025-04-14 00:14:00,000 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:14:00,009 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;@44b19a3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:14:00,009 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-14 00:14:00,017 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:14:00,017 INFO L116 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-04-14 00:14:00,017 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:14:00,017 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:14:00,019 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-14 00:14:00,019 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:14:00,023 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:14:00,023 INFO L85 PathProgramCache]: Analyzing trace with hash 8932450, now seen corresponding path program 1 times [2025-04-14 00:14:00,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:14:00,031 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272710014] [2025-04-14 00:14:00,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:14:00,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:14:00,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-14 00:14:00,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-14 00:14:00,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:14:00,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 00:14:00,133 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 00:14:00,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-14 00:14:00,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-14 00:14:00,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:14:00,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 00:14:00,167 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 00:14:00,170 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 00:14:00,171 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-14 00:14:00,172 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-14 00:14:00,173 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:14:00,173 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-14 00:14:00,176 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-14 00:14:00,177 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-14 00:14:00,196 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-14 00:14:00,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 63 transitions, 142 flow [2025-04-14 00:14:00,221 INFO L116 PetriNetUnfolderBase]: 25/95 cut-off events. [2025-04-14 00:14:00,222 INFO L117 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-04-14 00:14:00,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 95 events. 25/95 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 345 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 58. Up to 6 conditions per place. [2025-04-14 00:14:00,223 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 63 transitions, 142 flow [2025-04-14 00:14:00,224 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 63 transitions, 142 flow [2025-04-14 00:14:00,225 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:14:00,225 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;@44b19a3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:14:00,226 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-14 00:14:00,231 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:14:00,231 INFO L116 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-04-14 00:14:00,232 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-14 00:14:00,232 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:14:00,232 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-14 00:14:00,232 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:14:00,232 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:14:00,232 INFO L85 PathProgramCache]: Analyzing trace with hash 335216462, now seen corresponding path program 1 times [2025-04-14 00:14:00,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:14:00,232 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966323478] [2025-04-14 00:14:00,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:14:00,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:14:00,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-14 00:14:00,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-14 00:14:00,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:14:00,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:14:00,287 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-14 00:14:00,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:14:00,287 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966323478] [2025-04-14 00:14:00,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966323478] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:14:00,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:14:00,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 00:14:00,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986445473] [2025-04-14 00:14:00,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:14:00,292 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-14 00:14:00,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:14:00,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-14 00:14:00,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-14 00:14:00,315 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 63 [2025-04-14 00:14:00,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 63 transitions, 142 flow. Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 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-14 00:14:00,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:14:00,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 63 [2025-04-14 00:14:00,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:14:00,792 INFO L116 PetriNetUnfolderBase]: 2950/4759 cut-off events. [2025-04-14 00:14:00,793 INFO L117 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2025-04-14 00:14:00,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9557 conditions, 4759 events. 2950/4759 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 25799 event pairs, 2937 based on Foata normal form. 0/4407 useless extension candidates. Maximal degree in co-relation 7351. Up to 4731 conditions per place. [2025-04-14 00:14:00,815 INFO L140 encePairwiseOnDemand]: 45/63 looper letters, 30 selfloop transitions, 0 changer transitions 9/45 dead transitions. [2025-04-14 00:14:00,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 45 transitions, 184 flow [2025-04-14 00:14:00,816 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 00:14:00,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-14 00:14:00,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 69 transitions. [2025-04-14 00:14:00,823 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2025-04-14 00:14:00,824 INFO L175 Difference]: Start difference. First operand has 48 places, 63 transitions, 142 flow. Second operand 2 states and 69 transitions. [2025-04-14 00:14:00,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 45 transitions, 184 flow [2025-04-14 00:14:00,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 45 transitions, 184 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 00:14:00,831 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 82 flow [2025-04-14 00:14:00,832 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=82, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2025-04-14 00:14:00,834 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 1 predicate places. [2025-04-14 00:14:00,835 INFO L485 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 82 flow [2025-04-14 00:14:00,835 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 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-14 00:14:00,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:14:00,835 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-04-14 00:14:00,835 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:14:00,835 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:14:00,836 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:14:00,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1876406811, now seen corresponding path program 1 times [2025-04-14 00:14:00,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:14:00,837 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518774627] [2025-04-14 00:14:00,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:14:00,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:14:00,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-14 00:14:00,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-14 00:14:00,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:14:00,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 00:14:00,873 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 00:14:00,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-14 00:14:00,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-14 00:14:00,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:14:00,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 00:14:00,902 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 00:14:00,902 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 00:14:00,902 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-14 00:14:00,902 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-14 00:14:00,903 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:14:00,904 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-14 00:14:00,904 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-14 00:14:00,905 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-14 00:14:00,921 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-14 00:14:00,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 85 transitions, 197 flow [2025-04-14 00:14:00,931 INFO L116 PetriNetUnfolderBase]: 40/146 cut-off events. [2025-04-14 00:14:00,931 INFO L117 PetriNetUnfolderBase]: For 19/22 co-relation queries the response was YES. [2025-04-14 00:14:00,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 146 events. 40/146 cut-off events. For 19/22 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 589 event pairs, 1 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 106. Up to 12 conditions per place. [2025-04-14 00:14:00,932 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 85 transitions, 197 flow [2025-04-14 00:14:00,933 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 85 transitions, 197 flow [2025-04-14 00:14:00,934 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:14:00,934 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;@44b19a3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:14:00,934 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-14 00:14:00,935 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:14:00,936 INFO L116 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-04-14 00:14:00,936 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-14 00:14:00,936 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:14:00,936 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-14 00:14:00,936 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:14:00,936 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:14:00,936 INFO L85 PathProgramCache]: Analyzing trace with hash 416332387, now seen corresponding path program 1 times [2025-04-14 00:14:00,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:14:00,936 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262368475] [2025-04-14 00:14:00,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:14:00,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:14:00,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-14 00:14:00,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-14 00:14:00,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:14:00,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:14:00,947 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-14 00:14:00,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:14:00,947 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262368475] [2025-04-14 00:14:00,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262368475] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:14:00,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:14:00,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 00:14:00,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235212351] [2025-04-14 00:14:00,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:14:00,947 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-14 00:14:00,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:14:00,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-14 00:14:00,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-14 00:14:00,948 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 85 [2025-04-14 00:14:00,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 85 transitions, 197 flow. Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 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-14 00:14:00,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:14:00,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 85 [2025-04-14 00:14:00,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:14:05,198 INFO L116 PetriNetUnfolderBase]: 55964/78032 cut-off events. [2025-04-14 00:14:05,198 INFO L117 PetriNetUnfolderBase]: For 1671/1671 co-relation queries the response was YES. [2025-04-14 00:14:05,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157098 conditions, 78032 events. 55964/78032 cut-off events. For 1671/1671 co-relation queries the response was YES. Maximal size of possible extension queue 1578. Compared 496306 event pairs, 55782 based on Foata normal form. 0/73738 useless extension candidates. Maximal degree in co-relation 100207. Up to 77941 conditions per place. [2025-04-14 00:14:05,441 INFO L140 encePairwiseOnDemand]: 60/85 looper letters, 42 selfloop transitions, 0 changer transitions 10/60 dead transitions. [2025-04-14 00:14:05,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 60 transitions, 251 flow [2025-04-14 00:14:05,442 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 00:14:05,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-14 00:14:05,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 93 transitions. [2025-04-14 00:14:05,443 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5470588235294118 [2025-04-14 00:14:05,443 INFO L175 Difference]: Start difference. First operand has 64 places, 85 transitions, 197 flow. Second operand 2 states and 93 transitions. [2025-04-14 00:14:05,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 60 transitions, 251 flow [2025-04-14 00:14:05,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 60 transitions, 251 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 00:14:05,450 INFO L231 Difference]: Finished difference. Result has 65 places, 50 transitions, 118 flow [2025-04-14 00:14:05,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=118, PETRI_PLACES=65, PETRI_TRANSITIONS=50} [2025-04-14 00:14:05,451 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 1 predicate places. [2025-04-14 00:14:05,451 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 50 transitions, 118 flow [2025-04-14 00:14:05,451 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 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-14 00:14:05,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:14:05,452 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:14:05,452 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:14:05,452 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:14:05,452 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:14:05,453 INFO L85 PathProgramCache]: Analyzing trace with hash -747789537, now seen corresponding path program 1 times [2025-04-14 00:14:05,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:14:05,453 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458088563] [2025-04-14 00:14:05,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:14:05,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:14:05,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-14 00:14:05,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-14 00:14:05,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:14:05,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:14:05,540 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-14 00:14:05,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:14:05,540 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458088563] [2025-04-14 00:14:05,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458088563] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:14:05,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:14:05,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:14:05,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292789563] [2025-04-14 00:14:05,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:14:05,540 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:14:05,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:14:05,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:14:05,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:14:05,541 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 85 [2025-04-14 00:14:05,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 50 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-14 00:14:05,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:14:05,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 85 [2025-04-14 00:14:05,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:14:07,019 INFO L116 PetriNetUnfolderBase]: 28391/39735 cut-off events. [2025-04-14 00:14:07,019 INFO L117 PetriNetUnfolderBase]: For 959/959 co-relation queries the response was YES. [2025-04-14 00:14:07,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80003 conditions, 39735 events. 28391/39735 cut-off events. For 959/959 co-relation queries the response was YES. Maximal size of possible extension queue 912. Compared 239838 event pairs, 27444 based on Foata normal form. 0/37816 useless extension candidates. Maximal degree in co-relation 79997. Up to 39636 conditions per place. [2025-04-14 00:14:07,184 INFO L140 encePairwiseOnDemand]: 82/85 looper letters, 52 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2025-04-14 00:14:07,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 62 transitions, 250 flow [2025-04-14 00:14:07,184 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:14:07,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:14:07,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2025-04-14 00:14:07,187 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30980392156862746 [2025-04-14 00:14:07,188 INFO L175 Difference]: Start difference. First operand has 65 places, 50 transitions, 118 flow. Second operand 3 states and 79 transitions. [2025-04-14 00:14:07,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 62 transitions, 250 flow [2025-04-14 00:14:07,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 62 transitions, 248 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-04-14 00:14:07,193 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 128 flow [2025-04-14 00:14:07,195 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2025-04-14 00:14:07,195 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, -3 predicate places. [2025-04-14 00:14:07,196 INFO L485 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 128 flow [2025-04-14 00:14:07,196 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-14 00:14:07,196 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:14:07,196 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1] [2025-04-14 00:14:07,196 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:14:07,196 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:14:07,196 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:14:07,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1612593859, now seen corresponding path program 1 times [2025-04-14 00:14:07,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:14:07,196 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556296363] [2025-04-14 00:14:07,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:14:07,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:14:07,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-14 00:14:07,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-14 00:14:07,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:14:07,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 00:14:07,221 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 00:14:07,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-14 00:14:07,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-14 00:14:07,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:14:07,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 00:14:07,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 00:14:07,248 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 00:14:07,249 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-14 00:14:07,249 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-14 00:14:07,249 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 00:14:07,249 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-04-14 00:14:07,250 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-14 00:14:07,250 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-14 00:14:07,274 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-14 00:14:07,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 107 transitions, 254 flow [2025-04-14 00:14:07,287 INFO L116 PetriNetUnfolderBase]: 63/217 cut-off events. [2025-04-14 00:14:07,288 INFO L117 PetriNetUnfolderBase]: For 48/54 co-relation queries the response was YES. [2025-04-14 00:14:07,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 217 events. 63/217 cut-off events. For 48/54 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 938 event pairs, 6 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 170. Up to 32 conditions per place. [2025-04-14 00:14:07,289 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 107 transitions, 254 flow [2025-04-14 00:14:07,291 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 107 transitions, 254 flow [2025-04-14 00:14:07,292 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:14:07,294 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;@44b19a3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:14:07,294 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-14 00:14:07,296 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:14:07,296 INFO L116 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-04-14 00:14:07,296 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-14 00:14:07,296 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:14:07,296 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-14 00:14:07,296 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:14:07,296 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:14:07,296 INFO L85 PathProgramCache]: Analyzing trace with hash 518443022, now seen corresponding path program 1 times [2025-04-14 00:14:07,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:14:07,296 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314027436] [2025-04-14 00:14:07,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:14:07,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:14:07,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-14 00:14:07,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-14 00:14:07,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:14:07,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:14:07,309 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-14 00:14:07,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:14:07,309 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314027436] [2025-04-14 00:14:07,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314027436] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:14:07,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:14:07,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 00:14:07,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117536731] [2025-04-14 00:14:07,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:14:07,310 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-14 00:14:07,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:14:07,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-14 00:14:07,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-14 00:14:07,310 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 107 [2025-04-14 00:14:07,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 107 transitions, 254 flow. Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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-14 00:14:07,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:14:07,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 107 [2025-04-14 00:14:07,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand