/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_70-funloop_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:16:18,232 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:16:18,291 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:16:18,297 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:16:18,297 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:16:18,318 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:16:18,318 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:16:18,318 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:16:18,319 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:16:18,319 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:16:18,319 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:16:18,319 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:16:18,319 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:16:18,319 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:16:18,319 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:16:18,319 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:16:18,319 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:16:18,319 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:16:18,319 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:16:18,319 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:16:18,320 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:16:18,320 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:16:18,320 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:16:18,320 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:16:18,320 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:16:18,320 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:16:18,320 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:16:18,320 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:16:18,320 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:16:18,320 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:16:18,320 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:16:18,320 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:16:18,320 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:16:18,320 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:16:18,320 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:16:18,320 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:16:18,320 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:16:18,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:16:18,321 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:16:18,321 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:16:18,321 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:16:18,321 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:16:18,321 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:16:18,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:16:18,321 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:16:18,321 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:16:18,321 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:16:18,321 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:16:18,559 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:16:18,567 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:16:18,568 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:16:18,569 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:16:18,571 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:16:18,572 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i [2025-04-14 00:16:19,858 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17d6259af/160f2ffe4fab4902b21116670b2ccc61/FLAG83e0aea6a [2025-04-14 00:16:20,095 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:16:20,095 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i [2025-04-14 00:16:20,119 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17d6259af/160f2ffe4fab4902b21116670b2ccc61/FLAG83e0aea6a [2025-04-14 00:16:20,858 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17d6259af/160f2ffe4fab4902b21116670b2ccc61 [2025-04-14 00:16:20,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:16:20,861 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:16:20,862 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:16:20,862 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:16:20,865 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:16:20,865 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:16:20" (1/1) ... [2025-04-14 00:16:20,866 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23f4b7c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:16:20, skipping insertion in model container [2025-04-14 00:16:20,866 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:16:20" (1/1) ... [2025-04-14 00:16:20,902 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:16:21,215 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_70-funloop_racefree.i[41323,41336] [2025-04-14 00:16:21,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:16:21,262 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:16:21,324 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_70-funloop_racefree.i[41323,41336] [2025-04-14 00:16:21,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:16:21,373 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:16:21,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:16:21 WrapperNode [2025-04-14 00:16:21,375 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:16:21,376 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:16:21,376 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:16:21,376 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:16:21,380 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:16:21" (1/1) ... [2025-04-14 00:16:21,402 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:16:21" (1/1) ... [2025-04-14 00:16:21,425 INFO L138 Inliner]: procedures = 272, calls = 95, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 252 [2025-04-14 00:16:21,427 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:16:21,427 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:16:21,427 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:16:21,427 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:16:21,433 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:16:21" (1/1) ... [2025-04-14 00:16:21,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:16:21" (1/1) ... [2025-04-14 00:16:21,436 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:16:21" (1/1) ... [2025-04-14 00:16:21,452 INFO L175 MemorySlicer]: Split 79 memory accesses to 4 slices as follows [2, 5, 2, 70]. 89 percent of accesses are in the largest equivalence class. The 67 initializations are split as follows [2, 5, 0, 60]. The 5 writes are split as follows [0, 0, 1, 4]. [2025-04-14 00:16:21,452 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:16:21" (1/1) ... [2025-04-14 00:16:21,452 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:16:21" (1/1) ... [2025-04-14 00:16:21,459 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:16:21" (1/1) ... [2025-04-14 00:16:21,460 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:16:21" (1/1) ... [2025-04-14 00:16:21,464 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:16:21" (1/1) ... [2025-04-14 00:16:21,465 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:16:21" (1/1) ... [2025-04-14 00:16:21,471 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:16:21,472 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:16:21,472 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:16:21,472 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:16:21,473 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:16:21" (1/1) ... [2025-04-14 00:16:21,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:16:21,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:16:21,494 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:16:21,496 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:16:21,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-14 00:16:21,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-14 00:16:21,510 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-14 00:16:21,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 00:16:21,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 00:16:21,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-14 00:16:21,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-04-14 00:16:21,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 00:16:21,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 00:16:21,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-14 00:16:21,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-04-14 00:16:21,510 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-14 00:16:21,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:16:21,510 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-14 00:16:21,510 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-14 00:16:21,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:16:21,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 00:16:21,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-14 00:16:21,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-04-14 00:16:21,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:16:21,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:16:21,511 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:16:21,635 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:16:21,637 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:16:21,881 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L954: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-04-14 00:16:21,881 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L954-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-04-14 00:16:21,950 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:16:21,951 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:16:21,951 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:16:22,311 WARN L179 LargeBlockEncoding]: Complex 2:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:16:22,314 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:16:22,316 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:16:22,316 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:16:22,316 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:16:22,320 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:16:22,324 WARN L179 LargeBlockEncoding]: Complex 3:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:16:22,329 WARN L179 LargeBlockEncoding]: Complex 2:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:16:22,335 WARN L179 LargeBlockEncoding]: Complex 5:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:16:22,337 WARN L179 LargeBlockEncoding]: Complex 5:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:16:22,342 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:16:22,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:16:22 BoogieIcfgContainer [2025-04-14 00:16:22,343 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:16:22,345 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:16:22,345 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:16:22,348 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:16:22,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:16:20" (1/3) ... [2025-04-14 00:16:22,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@594aa8ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:16:22, skipping insertion in model container [2025-04-14 00:16:22,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:16:21" (2/3) ... [2025-04-14 00:16:22,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@594aa8ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:16:22, skipping insertion in model container [2025-04-14 00:16:22,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:16:22" (3/3) ... [2025-04-14 00:16:22,350 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_70-funloop_racefree.i [2025-04-14 00:16:22,362 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:16:22,363 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_70-funloop_racefree.i that has 2 procedures, 43 locations, 91 edges, 1 initial locations, 13 loop locations, and 2 error locations. [2025-04-14 00:16:22,363 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:16:22,404 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-14 00:16:22,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 92 transitions, 191 flow [2025-04-14 00:16:22,477 INFO L116 PetriNetUnfolderBase]: 68/130 cut-off events. [2025-04-14 00:16:22,479 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-14 00:16:22,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 130 events. 68/130 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 369 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 81. Up to 16 conditions per place. [2025-04-14 00:16:22,482 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 92 transitions, 191 flow [2025-04-14 00:16:22,488 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 87 transitions, 178 flow [2025-04-14 00:16:22,497 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:16:22,507 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;@5c483a0d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:16:22,507 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-14 00:16:22,516 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:16:22,517 INFO L116 PetriNetUnfolderBase]: 7/21 cut-off events. [2025-04-14 00:16:22,517 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:16:22,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:16:22,517 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-14 00:16:22,518 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-14 00:16:22,521 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:16:22,522 INFO L85 PathProgramCache]: Analyzing trace with hash 648400752, now seen corresponding path program 1 times [2025-04-14 00:16:22,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:16:22,527 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385422786] [2025-04-14 00:16:22,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:16:22,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:16:22,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-14 00:16:22,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-14 00:16:22,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:16:22,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:16:22,789 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:16:22,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:16:22,789 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385422786] [2025-04-14 00:16:22,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385422786] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:16:22,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:16:22,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:16:22,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275101353] [2025-04-14 00:16:22,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:16:22,798 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:16:22,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:16:22,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:16:22,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:16:22,823 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 92 [2025-04-14 00:16:22,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 87 transitions, 178 flow. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-14 00:16:22,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:16:22,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 92 [2025-04-14 00:16:22,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:16:23,040 INFO L116 PetriNetUnfolderBase]: 421/806 cut-off events. [2025-04-14 00:16:23,040 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:16:23,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1615 conditions, 806 events. 421/806 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3597 event pairs, 342 based on Foata normal form. 0/669 useless extension candidates. Maximal degree in co-relation 1598. Up to 804 conditions per place. [2025-04-14 00:16:23,046 INFO L140 encePairwiseOnDemand]: 48/92 looper letters, 44 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2025-04-14 00:16:23,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 47 transitions, 190 flow [2025-04-14 00:16:23,047 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:16:23,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:16:23,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2025-04-14 00:16:23,059 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2025-04-14 00:16:23,060 INFO L175 Difference]: Start difference. First operand has 45 places, 87 transitions, 178 flow. Second operand 3 states and 92 transitions. [2025-04-14 00:16:23,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 47 transitions, 190 flow [2025-04-14 00:16:23,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 47 transitions, 190 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 00:16:23,065 INFO L231 Difference]: Finished difference. Result has 47 places, 47 transitions, 108 flow [2025-04-14 00:16:23,066 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=47, PETRI_TRANSITIONS=47} [2025-04-14 00:16:23,068 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2025-04-14 00:16:23,068 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 47 transitions, 108 flow [2025-04-14 00:16:23,068 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-14 00:16:23,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:16:23,069 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-14 00:16:23,069 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:16:23,069 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-14 00:16:23,069 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:16:23,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1378930510, now seen corresponding path program 1 times [2025-04-14 00:16:23,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:16:23,069 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778611808] [2025-04-14 00:16:23,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:16:23,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:16:23,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-14 00:16:23,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-14 00:16:23,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:16:23,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:16:23,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:16:23,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:16:23,152 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778611808] [2025-04-14 00:16:23,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778611808] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:16:23,152 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502882279] [2025-04-14 00:16:23,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:16:23,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:16:23,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:16:23,157 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:16:23,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-14 00:16:23,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-14 00:16:23,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-14 00:16:23,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:16:23,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:16:23,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-14 00:16:23,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:16:23,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:16:23,268 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:16:23,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:16:23,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502882279] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:16:23,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:16:23,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-04-14 00:16:23,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402551600] [2025-04-14 00:16:23,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:16:23,283 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:16:23,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:16:23,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:16:23,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:16:23,284 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 92 [2025-04-14 00:16:23,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 47 transitions, 108 flow. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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:16:23,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:16:23,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 92 [2025-04-14 00:16:23,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:16:23,476 INFO L116 PetriNetUnfolderBase]: 421/809 cut-off events. [2025-04-14 00:16:23,476 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:16:23,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1631 conditions, 809 events. 421/809 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3599 event pairs, 342 based on Foata normal form. 0/672 useless extension candidates. Maximal degree in co-relation 1619. Up to 804 conditions per place. [2025-04-14 00:16:23,481 INFO L140 encePairwiseOnDemand]: 89/92 looper letters, 44 selfloop transitions, 5 changer transitions 0/50 dead transitions. [2025-04-14 00:16:23,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 50 transitions, 218 flow [2025-04-14 00:16:23,482 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:16:23,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:16:23,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2025-04-14 00:16:23,483 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.10507246376811594 [2025-04-14 00:16:23,483 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 108 flow. Second operand 6 states and 58 transitions. [2025-04-14 00:16:23,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 50 transitions, 218 flow [2025-04-14 00:16:23,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 50 transitions, 214 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-14 00:16:23,484 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 140 flow [2025-04-14 00:16:23,484 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=140, PETRI_PLACES=54, PETRI_TRANSITIONS=50} [2025-04-14 00:16:23,485 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 9 predicate places. [2025-04-14 00:16:23,485 INFO L485 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 140 flow [2025-04-14 00:16:23,485 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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:16:23,485 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:16:23,485 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1] [2025-04-14 00:16:23,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-14 00:16:23,690 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:16:23,690 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-14 00:16:23,691 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:16:23,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1452609520, now seen corresponding path program 2 times [2025-04-14 00:16:23,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:16:23,691 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830549244] [2025-04-14 00:16:23,691 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:16:23,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:16:23,712 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-04-14 00:16:23,741 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-04-14 00:16:23,742 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:16:23,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:16:23,862 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:16:23,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:16:23,862 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830549244] [2025-04-14 00:16:23,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830549244] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:16:23,862 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491675419] [2025-04-14 00:16:23,862 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:16:23,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:16:23,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:16:23,866 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:16:23,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-14 00:16:23,918 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-04-14 00:16:23,945 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-04-14 00:16:23,945 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:16:23,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:16:23,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 00:16:23,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:16:23,966 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:16:23,966 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:16:24,021 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:16:24,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491675419] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:16:24,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:16:24,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-14 00:16:24,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097978650] [2025-04-14 00:16:24,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:16:24,022 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-14 00:16:24,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:16:24,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-14 00:16:24,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-14 00:16:24,023 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 92 [2025-04-14 00:16:24,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 140 flow. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:16:24,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:16:24,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 92 [2025-04-14 00:16:24,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:16:24,229 INFO L116 PetriNetUnfolderBase]: 421/815 cut-off events. [2025-04-14 00:16:24,229 INFO L117 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-04-14 00:16:24,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1668 conditions, 815 events. 421/815 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3592 event pairs, 342 based on Foata normal form. 6/685 useless extension candidates. Maximal degree in co-relation 1610. Up to 804 conditions per place. [2025-04-14 00:16:24,233 INFO L140 encePairwiseOnDemand]: 89/92 looper letters, 44 selfloop transitions, 11 changer transitions 0/56 dead transitions. [2025-04-14 00:16:24,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 56 transitions, 286 flow [2025-04-14 00:16:24,234 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 00:16:24,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-14 00:16:24,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 73 transitions. [2025-04-14 00:16:24,235 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.0661231884057971 [2025-04-14 00:16:24,235 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 140 flow. Second operand 12 states and 73 transitions. [2025-04-14 00:16:24,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 56 transitions, 286 flow [2025-04-14 00:16:24,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 56 transitions, 272 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-14 00:16:24,237 INFO L231 Difference]: Finished difference. Result has 70 places, 56 transitions, 210 flow [2025-04-14 00:16:24,237 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=210, PETRI_PLACES=70, PETRI_TRANSITIONS=56} [2025-04-14 00:16:24,238 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 25 predicate places. [2025-04-14 00:16:24,238 INFO L485 AbstractCegarLoop]: Abstraction has has 70 places, 56 transitions, 210 flow [2025-04-14 00:16:24,238 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:16:24,238 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:16:24,238 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1] [2025-04-14 00:16:24,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-14 00:16:24,439 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-04-14 00:16:24,439 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-14 00:16:24,440 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:16:24,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1066399920, now seen corresponding path program 3 times [2025-04-14 00:16:24,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:16:24,440 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017820886] [2025-04-14 00:16:24,440 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:16:24,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:16:24,453 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 6 equivalence classes. [2025-04-14 00:16:24,490 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 00:16:24,491 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-14 00:16:24,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 00:16:24,491 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 00:16:24,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-14 00:16:24,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 00:16:24,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:16:24,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 00:16:24,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 00:16:24,525 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 00:16:24,526 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-04-14 00:16:24,527 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-04-14 00:16:24,527 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-04-14 00:16:24,527 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-04-14 00:16:24,527 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:16:24,528 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-04-14 00:16:24,529 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-14 00:16:24,529 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-14 00:16:24,573 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-14 00:16:24,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 133 transitions, 282 flow [2025-04-14 00:16:24,589 INFO L116 PetriNetUnfolderBase]: 114/219 cut-off events. [2025-04-14 00:16:24,590 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-14 00:16:24,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231 conditions, 219 events. 114/219 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 732 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 132. Up to 24 conditions per place. [2025-04-14 00:16:24,591 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 133 transitions, 282 flow [2025-04-14 00:16:24,593 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 131 transitions, 278 flow [2025-04-14 00:16:24,594 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:16:24,594 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;@5c483a0d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:16:24,594 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-14 00:16:24,602 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:16:24,602 INFO L116 PetriNetUnfolderBase]: 26/64 cut-off events. [2025-04-14 00:16:24,602 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-14 00:16:24,602 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:16:24,602 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-14 00:16:24,602 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-14 00:16:24,603 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:16:24,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1736439396, now seen corresponding path program 1 times [2025-04-14 00:16:24,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:16:24,603 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900442243] [2025-04-14 00:16:24,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:16:24,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:16:24,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-14 00:16:24,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-14 00:16:24,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:16:24,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:16:24,631 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:16:24,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:16:24,632 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900442243] [2025-04-14 00:16:24,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900442243] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:16:24,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:16:24,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:16:24,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270454600] [2025-04-14 00:16:24,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:16:24,633 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-14 00:16:24,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:16:24,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-14 00:16:24,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-14 00:16:24,635 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 133 [2025-04-14 00:16:24,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 131 transitions, 278 flow. Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:16:24,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:16:24,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 133 [2025-04-14 00:16:24,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:16:26,162 INFO L116 PetriNetUnfolderBase]: 16121/23824 cut-off events. [2025-04-14 00:16:26,162 INFO L117 PetriNetUnfolderBase]: For 106/106 co-relation queries the response was YES. [2025-04-14 00:16:26,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47748 conditions, 23824 events. 16121/23824 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 624. Compared 140515 event pairs, 13770 based on Foata normal form. 0/19909 useless extension candidates. Maximal degree in co-relation 41099. Up to 23822 conditions per place. [2025-04-14 00:16:26,287 INFO L140 encePairwiseOnDemand]: 73/133 looper letters, 70 selfloop transitions, 0 changer transitions 0/71 dead transitions. [2025-04-14 00:16:26,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 71 transitions, 298 flow [2025-04-14 00:16:26,288 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 00:16:26,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-14 00:16:26,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 132 transitions. [2025-04-14 00:16:26,291 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49624060150375937 [2025-04-14 00:16:26,291 INFO L175 Difference]: Start difference. First operand has 67 places, 131 transitions, 278 flow. Second operand 2 states and 132 transitions. [2025-04-14 00:16:26,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 71 transitions, 298 flow [2025-04-14 00:16:26,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 71 transitions, 298 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 00:16:26,296 INFO L231 Difference]: Finished difference. Result has 68 places, 71 transitions, 158 flow [2025-04-14 00:16:26,296 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=158, PETRI_PLACES=68, PETRI_TRANSITIONS=71} [2025-04-14 00:16:26,297 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, 1 predicate places. [2025-04-14 00:16:26,297 INFO L485 AbstractCegarLoop]: Abstraction has has 68 places, 71 transitions, 158 flow [2025-04-14 00:16:26,297 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:16:26,297 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:16:26,297 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-04-14 00:16:26,298 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:16:26,298 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-14 00:16:26,298 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:16:26,299 INFO L85 PathProgramCache]: Analyzing trace with hash 2092446262, now seen corresponding path program 1 times [2025-04-14 00:16:26,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:16:26,299 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641018435] [2025-04-14 00:16:26,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:16:26,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:16:26,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-14 00:16:26,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-14 00:16:26,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:16:26,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:16:26,344 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:16:26,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:16:26,345 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641018435] [2025-04-14 00:16:26,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641018435] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:16:26,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:16:26,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:16:26,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275634367] [2025-04-14 00:16:26,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:16:26,345 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:16:26,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:16:26,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:16:26,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:16:26,346 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 133 [2025-04-14 00:16:26,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 71 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:16:26,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:16:26,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 133 [2025-04-14 00:16:26,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:16:27,713 INFO L116 PetriNetUnfolderBase]: 16121/23825 cut-off events. [2025-04-14 00:16:27,713 INFO L117 PetriNetUnfolderBase]: For 106/106 co-relation queries the response was YES. [2025-04-14 00:16:27,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47751 conditions, 23825 events. 16121/23825 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 624. Compared 140434 event pairs, 13770 based on Foata normal form. 0/19910 useless extension candidates. Maximal degree in co-relation 47746. Up to 23822 conditions per place. [2025-04-14 00:16:27,793 INFO L140 encePairwiseOnDemand]: 130/133 looper letters, 69 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2025-04-14 00:16:27,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 72 transitions, 302 flow [2025-04-14 00:16:27,794 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:16:27,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:16:27,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2025-04-14 00:16:27,796 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.18796992481203006 [2025-04-14 00:16:27,796 INFO L175 Difference]: Start difference. First operand has 68 places, 71 transitions, 158 flow. Second operand 3 states and 75 transitions. [2025-04-14 00:16:27,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 72 transitions, 302 flow [2025-04-14 00:16:27,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 72 transitions, 302 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 00:16:27,801 INFO L231 Difference]: Finished difference. Result has 71 places, 72 transitions, 170 flow [2025-04-14 00:16:27,801 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=71, PETRI_TRANSITIONS=72} [2025-04-14 00:16:27,801 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, 4 predicate places. [2025-04-14 00:16:27,802 INFO L485 AbstractCegarLoop]: Abstraction has has 71 places, 72 transitions, 170 flow [2025-04-14 00:16:27,802 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:16:27,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:16:27,802 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-04-14 00:16:27,802 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 00:16:27,802 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-14 00:16:27,802 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:16:27,802 INFO L85 PathProgramCache]: Analyzing trace with hash -687170861, now seen corresponding path program 1 times [2025-04-14 00:16:27,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:16:27,802 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149085373] [2025-04-14 00:16:27,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:16:27,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:16:27,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-14 00:16:27,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-14 00:16:27,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:16:27,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:16:27,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:16:27,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:16:27,851 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149085373] [2025-04-14 00:16:27,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149085373] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:16:27,851 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522931435] [2025-04-14 00:16:27,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:16:27,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:16:27,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:16:27,853 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:16:27,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-14 00:16:27,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-14 00:16:27,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-14 00:16:27,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:16:27,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:16:27,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-14 00:16:27,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:16:27,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:16:27,939 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:16:27,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:16:27,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522931435] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:16:27,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:16:27,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-04-14 00:16:27,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034715137] [2025-04-14 00:16:27,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:16:27,949 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:16:27,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:16:27,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:16:27,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:16:27,950 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 133 [2025-04-14 00:16:27,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 72 transitions, 170 flow. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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:16:27,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:16:27,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 133 [2025-04-14 00:16:27,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:16:29,238 INFO L116 PetriNetUnfolderBase]: 16121/23828 cut-off events. [2025-04-14 00:16:29,238 INFO L117 PetriNetUnfolderBase]: For 106/106 co-relation queries the response was YES. [2025-04-14 00:16:29,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47767 conditions, 23828 events. 16121/23828 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 624. Compared 140434 event pairs, 13770 based on Foata normal form. 0/19913 useless extension candidates. Maximal degree in co-relation 47760. Up to 23822 conditions per place. [2025-04-14 00:16:29,335 INFO L140 encePairwiseOnDemand]: 130/133 looper letters, 69 selfloop transitions, 5 changer transitions 0/75 dead transitions. [2025-04-14 00:16:29,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 75 transitions, 330 flow [2025-04-14 00:16:29,336 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:16:29,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:16:29,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2025-04-14 00:16:29,337 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.10401002506265664 [2025-04-14 00:16:29,337 INFO L175 Difference]: Start difference. First operand has 71 places, 72 transitions, 170 flow. Second operand 6 states and 83 transitions. [2025-04-14 00:16:29,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 75 transitions, 330 flow [2025-04-14 00:16:29,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 75 transitions, 326 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-14 00:16:29,339 INFO L231 Difference]: Finished difference. Result has 78 places, 75 transitions, 202 flow [2025-04-14 00:16:29,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=202, PETRI_PLACES=78, PETRI_TRANSITIONS=75} [2025-04-14 00:16:29,340 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, 11 predicate places. [2025-04-14 00:16:29,340 INFO L485 AbstractCegarLoop]: Abstraction has has 78 places, 75 transitions, 202 flow [2025-04-14 00:16:29,340 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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:16:29,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:16:29,340 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2025-04-14 00:16:29,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-14 00:16:29,540 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:16:29,541 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-14 00:16:29,541 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:16:29,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1302597258, now seen corresponding path program 2 times [2025-04-14 00:16:29,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:16:29,541 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254676416] [2025-04-14 00:16:29,541 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:16:29,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:16:29,550 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-04-14 00:16:29,563 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-04-14 00:16:29,563 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:16:29,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:16:29,636 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:16:29,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:16:29,637 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254676416] [2025-04-14 00:16:29,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254676416] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:16:29,637 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804204252] [2025-04-14 00:16:29,637 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:16:29,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:16:29,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:16:29,639 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:16:29,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-14 00:16:29,697 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-04-14 00:16:29,726 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-04-14 00:16:29,726 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:16:29,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:16:29,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 00:16:29,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:16:29,741 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:16:29,742 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:16:29,787 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:16:29,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804204252] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:16:29,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:16:29,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-14 00:16:29,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431525958] [2025-04-14 00:16:29,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:16:29,788 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-14 00:16:29,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:16:29,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-14 00:16:29,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-14 00:16:29,789 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 133 [2025-04-14 00:16:29,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 75 transitions, 202 flow. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 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:16:29,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:16:29,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 133 [2025-04-14 00:16:29,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:16:31,264 INFO L116 PetriNetUnfolderBase]: 16121/23834 cut-off events. [2025-04-14 00:16:31,264 INFO L117 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2025-04-14 00:16:31,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47804 conditions, 23834 events. 16121/23834 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 624. Compared 140489 event pairs, 13770 based on Foata normal form. 6/19926 useless extension candidates. Maximal degree in co-relation 47794. Up to 23822 conditions per place. [2025-04-14 00:16:31,380 INFO L140 encePairwiseOnDemand]: 130/133 looper letters, 69 selfloop transitions, 11 changer transitions 0/81 dead transitions. [2025-04-14 00:16:31,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 81 transitions, 398 flow [2025-04-14 00:16:31,382 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 00:16:31,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-14 00:16:31,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 98 transitions. [2025-04-14 00:16:31,383 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.06140350877192982 [2025-04-14 00:16:31,384 INFO L175 Difference]: Start difference. First operand has 78 places, 75 transitions, 202 flow. Second operand 12 states and 98 transitions. [2025-04-14 00:16:31,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 81 transitions, 398 flow [2025-04-14 00:16:31,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 81 transitions, 384 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-14 00:16:31,386 INFO L231 Difference]: Finished difference. Result has 94 places, 81 transitions, 272 flow [2025-04-14 00:16:31,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=272, PETRI_PLACES=94, PETRI_TRANSITIONS=81} [2025-04-14 00:16:31,386 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, 27 predicate places. [2025-04-14 00:16:31,386 INFO L485 AbstractCegarLoop]: Abstraction has has 94 places, 81 transitions, 272 flow [2025-04-14 00:16:31,386 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 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:16:31,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:16:31,386 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2025-04-14 00:16:31,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-14 00:16:31,788 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:16:31,788 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-14 00:16:31,789 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:16:31,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1373471830, now seen corresponding path program 3 times [2025-04-14 00:16:31,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:16:31,789 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215440200] [2025-04-14 00:16:31,789 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:16:31,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:16:31,796 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 6 equivalence classes. [2025-04-14 00:16:31,816 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 00:16:31,817 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-14 00:16:31,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 00:16:31,817 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 00:16:31,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 00:16:31,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 00:16:31,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:16:31,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 00:16:31,838 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 00:16:31,839 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 00:16:31,839 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-04-14 00:16:31,839 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-04-14 00:16:31,839 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-04-14 00:16:31,839 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-04-14 00:16:31,839 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-04-14 00:16:31,839 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 00:16:31,839 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-04-14 00:16:31,841 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-14 00:16:31,841 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-14 00:16:31,869 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-14 00:16:31,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 174 transitions, 375 flow [2025-04-14 00:16:31,890 INFO L116 PetriNetUnfolderBase]: 163/317 cut-off events. [2025-04-14 00:16:31,890 INFO L117 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-04-14 00:16:31,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 342 conditions, 317 events. 163/317 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1194 event pairs, 1 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 228. Up to 32 conditions per place. [2025-04-14 00:16:31,892 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 174 transitions, 375 flow [2025-04-14 00:16:31,896 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 172 transitions, 371 flow [2025-04-14 00:16:31,897 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:16:31,897 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;@5c483a0d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:16:31,897 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-14 00:16:31,902 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:16:31,902 INFO L116 PetriNetUnfolderBase]: 26/64 cut-off events. [2025-04-14 00:16:31,902 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-14 00:16:31,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:16:31,903 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-14 00:16:31,903 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-14 00:16:31,903 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:16:31,903 INFO L85 PathProgramCache]: Analyzing trace with hash -883885348, now seen corresponding path program 1 times [2025-04-14 00:16:31,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:16:31,904 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198816093] [2025-04-14 00:16:31,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:16:31,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:16:31,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-14 00:16:31,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-14 00:16:31,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:16:31,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:16:31,919 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:16:31,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:16:31,920 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198816093] [2025-04-14 00:16:31,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198816093] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:16:31,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:16:31,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:16:31,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049814610] [2025-04-14 00:16:31,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:16:31,920 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-14 00:16:31,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:16:31,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-14 00:16:31,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-14 00:16:31,921 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 174 [2025-04-14 00:16:31,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 172 transitions, 371 flow. Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:16:31,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:16:31,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 174 [2025-04-14 00:16:31,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:16:58,392 INFO L116 PetriNetUnfolderBase]: 463100/610939 cut-off events. [2025-04-14 00:16:58,392 INFO L117 PetriNetUnfolderBase]: For 4094/4094 co-relation queries the response was YES. [2025-04-14 00:16:59,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1224572 conditions, 610939 events. 463100/610939 cut-off events. For 4094/4094 co-relation queries the response was YES. Maximal size of possible extension queue 10260. Compared 4045618 event pairs, 402697 based on Foata normal form. 0/512585 useless extension candidates. Maximal degree in co-relation 407787. Up to 610926 conditions per place. [2025-04-14 00:17:01,289 INFO L140 encePairwiseOnDemand]: 95/174 looper letters, 92 selfloop transitions, 0 changer transitions 0/93 dead transitions. [2025-04-14 00:17:01,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 93 transitions, 397 flow [2025-04-14 00:17:01,291 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 00:17:01,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-14 00:17:01,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 173 transitions. [2025-04-14 00:17:01,292 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49712643678160917 [2025-04-14 00:17:01,292 INFO L175 Difference]: Start difference. First operand has 88 places, 172 transitions, 371 flow. Second operand 2 states and 173 transitions. [2025-04-14 00:17:01,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 93 transitions, 397 flow [2025-04-14 00:17:01,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 93 transitions, 397 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 00:17:01,308 INFO L231 Difference]: Finished difference. Result has 89 places, 93 transitions, 213 flow [2025-04-14 00:17:01,308 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=213, PETRI_PLACES=89, PETRI_TRANSITIONS=93} [2025-04-14 00:17:01,312 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 1 predicate places. [2025-04-14 00:17:01,312 INFO L485 AbstractCegarLoop]: Abstraction has has 89 places, 93 transitions, 213 flow [2025-04-14 00:17:01,313 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:17:01,313 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:17:01,313 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:17:01,313 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 00:17:01,313 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-14 00:17:01,313 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:17:01,313 INFO L85 PathProgramCache]: Analyzing trace with hash 658533237, now seen corresponding path program 1 times [2025-04-14 00:17:01,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:17:01,314 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018733843] [2025-04-14 00:17:01,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:17:01,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:17:01,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-14 00:17:01,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-14 00:17:01,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:17:01,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:17:01,388 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:17:01,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:17:01,388 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018733843] [2025-04-14 00:17:01,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018733843] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:17:01,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:17:01,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:17:01,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994238996] [2025-04-14 00:17:01,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:17:01,389 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:17:01,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:17:01,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:17:01,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:17:01,390 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 174 [2025-04-14 00:17:01,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 93 transitions, 213 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:17:01,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:17:01,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 174 [2025-04-14 00:17:01,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand