./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-queue-add-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-queue-add-2.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8c3fe688d0e9a9929009fc24c8ef56c8fc1bfa15613131b287e178eb7d2f1f1e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:47:41,848 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:47:41,914 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:47:41,918 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:47:41,918 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:47:41,938 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:47:41,939 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:47:41,939 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:47:41,939 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:47:41,940 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:47:41,940 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:47:41,940 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:47:41,940 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:47:41,940 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:47:41,940 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:47:41,941 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:47:41,941 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:47:41,941 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:47:41,941 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:47:41,941 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:47:41,941 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:47:41,941 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:47:41,941 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:47:41,942 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:47:41,942 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:47:41,942 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:47:41,942 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:47:41,942 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:47:41,942 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:47:41,942 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:47:41,943 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:47:41,943 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:47:41,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:47:41,943 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:47:41,943 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:47:41,943 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:47:41,943 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:47:41,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:47:41,944 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:47:41,944 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:47:41,944 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:47:41,944 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:47:41,944 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:47:41,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:47:41,944 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:47:41,944 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:47:41,945 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:47:41,945 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:47:41,945 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8c3fe688d0e9a9929009fc24c8ef56c8fc1bfa15613131b287e178eb7d2f1f1e [2025-01-09 16:47:42,181 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:47:42,189 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:47:42,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:47:42,194 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:47:42,194 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:47:42,195 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-queue-add-2.wvr.c [2025-01-09 16:47:43,413 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/96897737f/4beb521752014074b82e2fe6564bc58b/FLAGd872bb5c4 [2025-01-09 16:47:43,683 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:47:43,684 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-queue-add-2.wvr.c [2025-01-09 16:47:43,720 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/96897737f/4beb521752014074b82e2fe6564bc58b/FLAGd872bb5c4 [2025-01-09 16:47:43,998 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/96897737f/4beb521752014074b82e2fe6564bc58b [2025-01-09 16:47:44,000 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:47:44,001 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:47:44,002 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:47:44,003 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:47:44,006 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:47:44,007 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:47:43" (1/1) ... [2025-01-09 16:47:44,008 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b429eef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:47:44, skipping insertion in model container [2025-01-09 16:47:44,008 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:47:43" (1/1) ... [2025-01-09 16:47:44,025 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:47:44,180 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-queue-add-2.wvr.c[2722,2735] [2025-01-09 16:47:44,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:47:44,202 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:47:44,225 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-queue-add-2.wvr.c[2722,2735] [2025-01-09 16:47:44,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:47:44,243 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:47:44,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:47:44 WrapperNode [2025-01-09 16:47:44,244 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:47:44,245 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:47:44,245 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:47:44,245 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:47:44,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:47:44" (1/1) ... [2025-01-09 16:47:44,258 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:47:44" (1/1) ... [2025-01-09 16:47:44,282 INFO L138 Inliner]: procedures = 23, calls = 29, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 140 [2025-01-09 16:47:44,283 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:47:44,283 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:47:44,285 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:47:44,285 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:47:44,293 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:47:44" (1/1) ... [2025-01-09 16:47:44,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:47:44" (1/1) ... [2025-01-09 16:47:44,300 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:47:44" (1/1) ... [2025-01-09 16:47:44,318 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-01-09 16:47:44,319 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:47:44" (1/1) ... [2025-01-09 16:47:44,319 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:47:44" (1/1) ... [2025-01-09 16:47:44,325 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:47:44" (1/1) ... [2025-01-09 16:47:44,330 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:47:44" (1/1) ... [2025-01-09 16:47:44,333 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:47:44" (1/1) ... [2025-01-09 16:47:44,337 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:47:44" (1/1) ... [2025-01-09 16:47:44,338 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:47:44" (1/1) ... [2025-01-09 16:47:44,339 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:47:44,343 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:47:44,343 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:47:44,343 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:47:44,344 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:47:44" (1/1) ... [2025-01-09 16:47:44,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:47:44,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:47:44,377 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:47:44,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:47:44,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:47:44,400 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:47:44,400 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:47:44,401 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:47:44,401 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:47:44,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:47:44,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:47:44,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:47:44,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:47:44,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 16:47:44,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 16:47:44,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 16:47:44,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:47:44,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:47:44,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:47:44,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:47:44,403 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:47:44,496 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:47:44,497 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:47:44,782 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:47:44,782 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:47:44,982 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:47:44,982 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:47:44,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:47:44 BoogieIcfgContainer [2025-01-09 16:47:44,982 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:47:44,985 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:47:44,986 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:47:44,991 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:47:44,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:47:43" (1/3) ... [2025-01-09 16:47:44,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bada4a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:47:44, skipping insertion in model container [2025-01-09 16:47:44,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:47:44" (2/3) ... [2025-01-09 16:47:44,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bada4a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:47:44, skipping insertion in model container [2025-01-09 16:47:44,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:47:44" (3/3) ... [2025-01-09 16:47:44,994 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-queue-add-2.wvr.c [2025-01-09 16:47:45,006 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:47:45,009 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-queue-add-2.wvr.c that has 3 procedures, 25 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-01-09 16:47:45,009 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:47:45,061 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 16:47:45,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 28 transitions, 70 flow [2025-01-09 16:47:45,128 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2025-01-09 16:47:45,132 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 16:47:45,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 26 events. 4/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 19. Up to 2 conditions per place. [2025-01-09 16:47:45,134 INFO L82 GeneralOperation]: Start removeDead. Operand has 31 places, 28 transitions, 70 flow [2025-01-09 16:47:45,137 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 25 transitions, 62 flow [2025-01-09 16:47:45,144 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:47:45,157 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1144c4a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:47:45,157 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-01-09 16:47:45,168 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:47:45,168 INFO L124 PetriNetUnfolderBase]: 4/24 cut-off events. [2025-01-09 16:47:45,168 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 16:47:45,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:45,169 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:47:45,169 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:47:45,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:45,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1009659823, now seen corresponding path program 1 times [2025-01-09 16:47:45,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:45,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404999054] [2025-01-09 16:47:45,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:47:45,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:45,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 16:47:45,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 16:47:45,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:47:45,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:45,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:47:45,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:45,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404999054] [2025-01-09 16:47:45,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404999054] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:47:45,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:47:45,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:47:45,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045601300] [2025-01-09 16:47:45,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:47:45,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:47:45,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:45,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:47:45,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:47:45,392 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-01-09 16:47:45,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 25 transitions, 62 flow. Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 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-01-09 16:47:45,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:45,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-01-09 16:47:45,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:45,479 INFO L124 PetriNetUnfolderBase]: 89/183 cut-off events. [2025-01-09 16:47:45,479 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-01-09 16:47:45,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 351 conditions, 183 events. 89/183 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 596 event pairs, 66 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 313. Up to 146 conditions per place. [2025-01-09 16:47:45,484 INFO L140 encePairwiseOnDemand]: 27/28 looper letters, 19 selfloop transitions, 0 changer transitions 0/24 dead transitions. [2025-01-09 16:47:45,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 24 transitions, 98 flow [2025-01-09 16:47:45,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:47:45,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-09 16:47:45,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2025-01-09 16:47:45,499 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2025-01-09 16:47:45,500 INFO L175 Difference]: Start difference. First operand has 28 places, 25 transitions, 62 flow. Second operand 2 states and 34 transitions. [2025-01-09 16:47:45,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 24 transitions, 98 flow [2025-01-09 16:47:45,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 24 transitions, 90 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 16:47:45,509 INFO L231 Difference]: Finished difference. Result has 25 places, 24 transitions, 52 flow [2025-01-09 16:47:45,511 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=52, PETRI_PLACES=25, PETRI_TRANSITIONS=24} [2025-01-09 16:47:45,517 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, -3 predicate places. [2025-01-09 16:47:45,518 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 24 transitions, 52 flow [2025-01-09 16:47:45,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 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-01-09 16:47:45,518 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:45,518 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:47:45,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:47:45,518 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:47:45,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:45,519 INFO L85 PathProgramCache]: Analyzing trace with hash 323932301, now seen corresponding path program 1 times [2025-01-09 16:47:45,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:45,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298071126] [2025-01-09 16:47:45,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:47:45,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:45,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 16:47:45,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 16:47:45,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:47:45,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:45,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:47:45,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:45,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298071126] [2025-01-09 16:47:45,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298071126] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:47:45,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:47:45,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:47:45,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746739438] [2025-01-09 16:47:45,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:47:45,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:47:45,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:45,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:47:45,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:47:45,788 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-01-09 16:47:45,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 24 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:45,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:45,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-01-09 16:47:45,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:45,914 INFO L124 PetriNetUnfolderBase]: 102/217 cut-off events. [2025-01-09 16:47:45,915 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 16:47:45,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 409 conditions, 217 events. 102/217 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 742 event pairs, 79 based on Foata normal form. 17/218 useless extension candidates. Maximal degree in co-relation 406. Up to 146 conditions per place. [2025-01-09 16:47:45,919 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 18 selfloop transitions, 2 changer transitions 8/33 dead transitions. [2025-01-09 16:47:45,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 33 transitions, 128 flow [2025-01-09 16:47:45,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:47:45,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:47:45,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2025-01-09 16:47:45,921 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5267857142857143 [2025-01-09 16:47:45,921 INFO L175 Difference]: Start difference. First operand has 25 places, 24 transitions, 52 flow. Second operand 4 states and 59 transitions. [2025-01-09 16:47:45,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 33 transitions, 128 flow [2025-01-09 16:47:45,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 33 transitions, 128 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:47:45,923 INFO L231 Difference]: Finished difference. Result has 30 places, 25 transitions, 70 flow [2025-01-09 16:47:45,923 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=70, PETRI_PLACES=30, PETRI_TRANSITIONS=25} [2025-01-09 16:47:45,924 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 2 predicate places. [2025-01-09 16:47:45,924 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 25 transitions, 70 flow [2025-01-09 16:47:45,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:45,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:45,924 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:47:45,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:47:45,926 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:47:45,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:45,927 INFO L85 PathProgramCache]: Analyzing trace with hash -522827725, now seen corresponding path program 1 times [2025-01-09 16:47:45,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:45,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825735443] [2025-01-09 16:47:45,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:47:45,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:45,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 16:47:45,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 16:47:45,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:47:45,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:46,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:47:46,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:46,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825735443] [2025-01-09 16:47:46,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825735443] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:47:46,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:47:46,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:47:46,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082261247] [2025-01-09 16:47:46,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:47:46,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:47:46,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:46,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:47:46,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:47:46,305 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:47:46,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 25 transitions, 70 flow. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:46,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:46,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:47:46,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:46,482 INFO L124 PetriNetUnfolderBase]: 229/425 cut-off events. [2025-01-09 16:47:46,483 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-01-09 16:47:46,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 948 conditions, 425 events. 229/425 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1772 event pairs, 63 based on Foata normal form. 1/424 useless extension candidates. Maximal degree in co-relation 942. Up to 155 conditions per place. [2025-01-09 16:47:46,489 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 46 selfloop transitions, 9 changer transitions 7/65 dead transitions. [2025-01-09 16:47:46,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 65 transitions, 301 flow [2025-01-09 16:47:46,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:47:46,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:47:46,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2025-01-09 16:47:46,492 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45535714285714285 [2025-01-09 16:47:46,492 INFO L175 Difference]: Start difference. First operand has 30 places, 25 transitions, 70 flow. Second operand 8 states and 102 transitions. [2025-01-09 16:47:46,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 65 transitions, 301 flow [2025-01-09 16:47:46,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 65 transitions, 297 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 16:47:46,494 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 124 flow [2025-01-09 16:47:46,494 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=124, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2025-01-09 16:47:46,495 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 11 predicate places. [2025-01-09 16:47:46,495 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 124 flow [2025-01-09 16:47:46,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:46,495 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:46,496 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:47:46,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:47:46,496 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:47:46,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:46,497 INFO L85 PathProgramCache]: Analyzing trace with hash -535078755, now seen corresponding path program 2 times [2025-01-09 16:47:46,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:46,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650280601] [2025-01-09 16:47:46,498 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:47:46,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:46,512 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-01-09 16:47:46,523 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-01-09 16:47:46,523 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:47:46,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:46,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:47:46,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:46,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650280601] [2025-01-09 16:47:46,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650280601] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:47:46,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:47:46,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:47:46,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140161071] [2025-01-09 16:47:46,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:47:46,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:47:46,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:46,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:47:46,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:47:46,595 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-01-09 16:47:46,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:46,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:46,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-01-09 16:47:46,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:46,668 INFO L124 PetriNetUnfolderBase]: 145/307 cut-off events. [2025-01-09 16:47:46,668 INFO L125 PetriNetUnfolderBase]: For 164/164 co-relation queries the response was YES. [2025-01-09 16:47:46,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 806 conditions, 307 events. 145/307 cut-off events. For 164/164 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1173 event pairs, 39 based on Foata normal form. 6/309 useless extension candidates. Maximal degree in co-relation 796. Up to 214 conditions per place. [2025-01-09 16:47:46,673 INFO L140 encePairwiseOnDemand]: 24/28 looper letters, 26 selfloop transitions, 3 changer transitions 0/37 dead transitions. [2025-01-09 16:47:46,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 37 transitions, 195 flow [2025-01-09 16:47:46,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:47:46,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:47:46,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2025-01-09 16:47:46,674 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-01-09 16:47:46,675 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 124 flow. Second operand 3 states and 48 transitions. [2025-01-09 16:47:46,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 37 transitions, 195 flow [2025-01-09 16:47:46,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 185 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-09 16:47:46,679 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 133 flow [2025-01-09 16:47:46,679 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2025-01-09 16:47:46,681 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 10 predicate places. [2025-01-09 16:47:46,681 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 133 flow [2025-01-09 16:47:46,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:46,682 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:46,682 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:47:46,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:47:46,682 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:47:46,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:46,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1935819147, now seen corresponding path program 1 times [2025-01-09 16:47:46,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:46,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055786182] [2025-01-09 16:47:46,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:47:46,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:46,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 16:47:46,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:47:46,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:47:46,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:46,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:47:46,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:46,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055786182] [2025-01-09 16:47:46,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055786182] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:47:46,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469489322] [2025-01-09 16:47:46,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:47:46,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:47:46,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:47:46,879 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:47:46,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 16:47:46,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 16:47:46,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:47:46,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:47:46,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:46,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:47:46,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:47:47,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:47:47,070 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:47:47,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:47:47,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469489322] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:47:47,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:47:47,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-09 16:47:47,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805499101] [2025-01-09 16:47:47,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:47:47,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:47:47,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:47,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:47:47,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:47:47,184 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-01-09 16:47:47,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 133 flow. Second operand has 12 states, 12 states have (on average 9.75) internal successors, (117), 12 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:47,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:47,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-01-09 16:47:47,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:47,381 INFO L124 PetriNetUnfolderBase]: 238/534 cut-off events. [2025-01-09 16:47:47,384 INFO L125 PetriNetUnfolderBase]: For 473/473 co-relation queries the response was YES. [2025-01-09 16:47:47,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1470 conditions, 534 events. 238/534 cut-off events. For 473/473 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2556 event pairs, 137 based on Foata normal form. 24/549 useless extension candidates. Maximal degree in co-relation 1460. Up to 248 conditions per place. [2025-01-09 16:47:47,389 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 41 selfloop transitions, 5 changer transitions 4/58 dead transitions. [2025-01-09 16:47:47,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 58 transitions, 325 flow [2025-01-09 16:47:47,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:47:47,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:47:47,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2025-01-09 16:47:47,391 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5178571428571429 [2025-01-09 16:47:47,392 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 133 flow. Second operand 6 states and 87 transitions. [2025-01-09 16:47:47,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 58 transitions, 325 flow [2025-01-09 16:47:47,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 58 transitions, 304 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-01-09 16:47:47,397 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 161 flow [2025-01-09 16:47:47,397 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=161, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2025-01-09 16:47:47,398 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 16 predicate places. [2025-01-09 16:47:47,399 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 161 flow [2025-01-09 16:47:47,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.75) internal successors, (117), 12 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:47,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:47,399 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:47:47,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 16:47:47,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:47:47,600 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:47:47,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:47,601 INFO L85 PathProgramCache]: Analyzing trace with hash 748343629, now seen corresponding path program 1 times [2025-01-09 16:47:47,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:47,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033435859] [2025-01-09 16:47:47,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:47:47,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:47,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 16:47:47,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:47:47,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:47:47,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:47,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:47:47,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:47,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033435859] [2025-01-09 16:47:47,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033435859] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:47:47,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168667980] [2025-01-09 16:47:47,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:47:47,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:47:47,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:47:47,755 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:47:47,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 16:47:47,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 16:47:47,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:47:47,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:47:47,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:47,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 16:47:47,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:47:47,881 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:47:47,881 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:47:47,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168667980] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:47:47,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:47:47,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-09 16:47:47,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644283642] [2025-01-09 16:47:47,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:47:47,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:47:47,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:47,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:47:47,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:47:47,883 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-01-09 16:47:47,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 161 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:47,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:47,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-01-09 16:47:47,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:48,013 INFO L124 PetriNetUnfolderBase]: 257/596 cut-off events. [2025-01-09 16:47:48,013 INFO L125 PetriNetUnfolderBase]: For 425/440 co-relation queries the response was YES. [2025-01-09 16:47:48,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1550 conditions, 596 events. 257/596 cut-off events. For 425/440 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2922 event pairs, 64 based on Foata normal form. 21/609 useless extension candidates. Maximal degree in co-relation 1538. Up to 171 conditions per place. [2025-01-09 16:47:48,018 INFO L140 encePairwiseOnDemand]: 24/28 looper letters, 44 selfloop transitions, 7 changer transitions 5/63 dead transitions. [2025-01-09 16:47:48,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 63 transitions, 359 flow [2025-01-09 16:47:48,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:47:48,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:47:48,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2025-01-09 16:47:48,019 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6696428571428571 [2025-01-09 16:47:48,019 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 161 flow. Second operand 4 states and 75 transitions. [2025-01-09 16:47:48,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 63 transitions, 359 flow [2025-01-09 16:47:48,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 63 transitions, 336 flow, removed 9 selfloop flow, removed 3 redundant places. [2025-01-09 16:47:48,022 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 166 flow [2025-01-09 16:47:48,022 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2025-01-09 16:47:48,023 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 18 predicate places. [2025-01-09 16:47:48,023 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 166 flow [2025-01-09 16:47:48,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:48,023 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:48,023 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:47:48,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 16:47:48,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:47:48,224 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:47:48,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:48,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1528626993, now seen corresponding path program 2 times [2025-01-09 16:47:48,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:48,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240892914] [2025-01-09 16:47:48,225 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:47:48,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:48,232 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-01-09 16:47:48,245 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 24 statements. [2025-01-09 16:47:48,245 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:47:48,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:48,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:47:48,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:48,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240892914] [2025-01-09 16:47:48,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240892914] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:47:48,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:47:48,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:47:48,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973035438] [2025-01-09 16:47:48,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:47:48,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:47:48,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:48,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:47:48,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:47:48,351 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:47:48,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 166 flow. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:48,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:48,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:47:48,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:48,492 INFO L124 PetriNetUnfolderBase]: 312/608 cut-off events. [2025-01-09 16:47:48,492 INFO L125 PetriNetUnfolderBase]: For 665/665 co-relation queries the response was YES. [2025-01-09 16:47:48,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1759 conditions, 608 events. 312/608 cut-off events. For 665/665 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2505 event pairs, 43 based on Foata normal form. 28/634 useless extension candidates. Maximal degree in co-relation 1746. Up to 239 conditions per place. [2025-01-09 16:47:48,496 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 50 selfloop transitions, 8 changer transitions 0/63 dead transitions. [2025-01-09 16:47:48,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 63 transitions, 416 flow [2025-01-09 16:47:48,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:47:48,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:47:48,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2025-01-09 16:47:48,497 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43452380952380953 [2025-01-09 16:47:48,497 INFO L175 Difference]: Start difference. First operand has 46 places, 35 transitions, 166 flow. Second operand 6 states and 73 transitions. [2025-01-09 16:47:48,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 63 transitions, 416 flow [2025-01-09 16:47:48,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 63 transitions, 388 flow, removed 14 selfloop flow, removed 2 redundant places. [2025-01-09 16:47:48,500 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 197 flow [2025-01-09 16:47:48,500 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=197, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2025-01-09 16:47:48,500 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 19 predicate places. [2025-01-09 16:47:48,500 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 197 flow [2025-01-09 16:47:48,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:48,501 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:48,501 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:47:48,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:47:48,501 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:47:48,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:48,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1440625333, now seen corresponding path program 1 times [2025-01-09 16:47:48,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:48,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032395812] [2025-01-09 16:47:48,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:47:48,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:48,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 16:47:48,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:47:48,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:47:48,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:49,542 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:47:49,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:49,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032395812] [2025-01-09 16:47:49,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032395812] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:47:49,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82846502] [2025-01-09 16:47:49,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:47:49,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:47:49,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:47:49,545 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:47:49,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 16:47:49,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 16:47:49,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:47:49,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:47:49,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:49,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-01-09 16:47:49,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:47:50,259 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:47:50,259 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:47:50,611 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:47:50,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2025-01-09 16:47:51,104 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:47:51,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82846502] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:47:51,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:47:51,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 41 [2025-01-09 16:47:51,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648856633] [2025-01-09 16:47:51,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:47:51,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-01-09 16:47:51,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:51,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-01-09 16:47:51,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1542, Unknown=0, NotChecked=0, Total=1722 [2025-01-09 16:47:51,134 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-01-09 16:47:51,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 197 flow. Second operand has 42 states, 42 states have (on average 4.785714285714286) internal successors, (201), 42 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:51,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:51,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-01-09 16:47:51,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:56,130 INFO L124 PetriNetUnfolderBase]: 1334/2315 cut-off events. [2025-01-09 16:47:56,130 INFO L125 PetriNetUnfolderBase]: For 2431/2431 co-relation queries the response was YES. [2025-01-09 16:47:56,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7037 conditions, 2315 events. 1334/2315 cut-off events. For 2431/2431 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 11916 event pairs, 96 based on Foata normal form. 3/2318 useless extension candidates. Maximal degree in co-relation 7024. Up to 684 conditions per place. [2025-01-09 16:47:56,142 INFO L140 encePairwiseOnDemand]: 14/28 looper letters, 230 selfloop transitions, 142 changer transitions 32/405 dead transitions. [2025-01-09 16:47:56,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 405 transitions, 2460 flow [2025-01-09 16:47:56,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-01-09 16:47:56,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2025-01-09 16:47:56,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 579 transitions. [2025-01-09 16:47:56,148 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30863539445628996 [2025-01-09 16:47:56,150 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 197 flow. Second operand 67 states and 579 transitions. [2025-01-09 16:47:56,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 405 transitions, 2460 flow [2025-01-09 16:47:56,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 405 transitions, 2440 flow, removed 7 selfloop flow, removed 2 redundant places. [2025-01-09 16:47:56,159 INFO L231 Difference]: Finished difference. Result has 133 places, 189 transitions, 1511 flow [2025-01-09 16:47:56,159 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=67, PETRI_FLOW=1511, PETRI_PLACES=133, PETRI_TRANSITIONS=189} [2025-01-09 16:47:56,160 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 105 predicate places. [2025-01-09 16:47:56,160 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 189 transitions, 1511 flow [2025-01-09 16:47:56,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 4.785714285714286) internal successors, (201), 42 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:56,160 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:56,160 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:47:56,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 16:47:56,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:47:56,365 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:47:56,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:56,365 INFO L85 PathProgramCache]: Analyzing trace with hash 394691113, now seen corresponding path program 2 times [2025-01-09 16:47:56,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:56,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763581775] [2025-01-09 16:47:56,366 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:47:56,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:56,372 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-01-09 16:47:56,407 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:47:56,408 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:47:56,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:57,126 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:47:57,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:57,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763581775] [2025-01-09 16:47:57,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763581775] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:47:57,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320605724] [2025-01-09 16:47:57,126 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:47:57,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:47:57,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:47:57,129 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:47:57,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 16:47:57,174 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-01-09 16:47:57,195 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:47:57,195 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:47:57,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:57,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-01-09 16:47:57,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:47:57,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-01-09 16:47:57,695 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:47:57,695 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:47:57,911 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:47:57,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2025-01-09 16:47:58,201 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:47:58,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320605724] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:47:58,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:47:58,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 40 [2025-01-09 16:47:58,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814221544] [2025-01-09 16:47:58,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:47:58,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-01-09 16:47:58,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:58,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-01-09 16:47:58,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1413, Unknown=0, NotChecked=0, Total=1640 [2025-01-09 16:47:58,239 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-01-09 16:47:58,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 189 transitions, 1511 flow. Second operand has 41 states, 41 states have (on average 4.780487804878049) internal successors, (196), 41 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:58,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:58,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-01-09 16:47:58,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:48:05,351 INFO L124 PetriNetUnfolderBase]: 3747/6488 cut-off events. [2025-01-09 16:48:05,351 INFO L125 PetriNetUnfolderBase]: For 30468/30468 co-relation queries the response was YES. [2025-01-09 16:48:05,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29365 conditions, 6488 events. 3747/6488 cut-off events. For 30468/30468 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 41400 event pairs, 102 based on Foata normal form. 16/6501 useless extension candidates. Maximal degree in co-relation 29330. Up to 1219 conditions per place. [2025-01-09 16:48:05,391 INFO L140 encePairwiseOnDemand]: 12/28 looper letters, 400 selfloop transitions, 544 changer transitions 109/1054 dead transitions. [2025-01-09 16:48:05,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 1054 transitions, 10182 flow [2025-01-09 16:48:05,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2025-01-09 16:48:05,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2025-01-09 16:48:05,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 1079 transitions. [2025-01-09 16:48:05,399 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33509316770186337 [2025-01-09 16:48:05,401 INFO L175 Difference]: Start difference. First operand has 133 places, 189 transitions, 1511 flow. Second operand 115 states and 1079 transitions. [2025-01-09 16:48:05,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 1054 transitions, 10182 flow [2025-01-09 16:48:05,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 1054 transitions, 9882 flow, removed 148 selfloop flow, removed 4 redundant places. [2025-01-09 16:48:05,647 INFO L231 Difference]: Finished difference. Result has 289 places, 638 transitions, 7812 flow [2025-01-09 16:48:05,647 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1353, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=158, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=115, PETRI_FLOW=7812, PETRI_PLACES=289, PETRI_TRANSITIONS=638} [2025-01-09 16:48:05,648 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 261 predicate places. [2025-01-09 16:48:05,648 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 638 transitions, 7812 flow [2025-01-09 16:48:05,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 4.780487804878049) internal successors, (196), 41 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:48:05,648 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:48:05,648 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:48:05,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 16:48:05,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-01-09 16:48:05,853 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:48:05,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:48:05,854 INFO L85 PathProgramCache]: Analyzing trace with hash -623329327, now seen corresponding path program 3 times [2025-01-09 16:48:05,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:48:05,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125620747] [2025-01-09 16:48:05,854 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:48:05,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:48:05,863 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-01-09 16:48:05,889 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:48:05,893 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:48:05,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:06,495 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:48:06,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:48:06,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125620747] [2025-01-09 16:48:06,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125620747] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:48:06,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216452950] [2025-01-09 16:48:06,495 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:48:06,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:48:06,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:48:06,498 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:48:06,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 16:48:06,542 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-01-09 16:48:06,558 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:48:06,559 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:48:06,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:06,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-01-09 16:48:06,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:48:06,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-01-09 16:48:06,976 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:48:06,976 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:48:07,172 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:48:07,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2025-01-09 16:48:07,435 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:48:07,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216452950] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:48:07,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:48:07,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 41 [2025-01-09 16:48:07,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025092201] [2025-01-09 16:48:07,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:48:07,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-01-09 16:48:07,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:48:07,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-01-09 16:48:07,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=1487, Unknown=0, NotChecked=0, Total=1722 [2025-01-09 16:48:07,450 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-01-09 16:48:07,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 638 transitions, 7812 flow. Second operand has 42 states, 42 states have (on average 4.785714285714286) internal successors, (201), 42 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:48:07,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:48:07,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-01-09 16:48:07,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:48:13,008 INFO L124 PetriNetUnfolderBase]: 5712/9870 cut-off events. [2025-01-09 16:48:13,008 INFO L125 PetriNetUnfolderBase]: For 235668/235668 co-relation queries the response was YES. [2025-01-09 16:48:13,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67527 conditions, 9870 events. 5712/9870 cut-off events. For 235668/235668 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 68560 event pairs, 370 based on Foata normal form. 37/9893 useless extension candidates. Maximal degree in co-relation 67443. Up to 2953 conditions per place. [2025-01-09 16:48:13,090 INFO L140 encePairwiseOnDemand]: 12/28 looper letters, 605 selfloop transitions, 905 changer transitions 95/1606 dead transitions. [2025-01-09 16:48:13,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 1606 transitions, 23092 flow [2025-01-09 16:48:13,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2025-01-09 16:48:13,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2025-01-09 16:48:13,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 783 transitions. [2025-01-09 16:48:13,093 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31420545746388445 [2025-01-09 16:48:13,093 INFO L175 Difference]: Start difference. First operand has 289 places, 638 transitions, 7812 flow. Second operand 89 states and 783 transitions. [2025-01-09 16:48:13,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 1606 transitions, 23092 flow [2025-01-09 16:48:14,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 1606 transitions, 19292 flow, removed 1828 selfloop flow, removed 28 redundant places. [2025-01-09 16:48:14,925 INFO L231 Difference]: Finished difference. Result has 388 places, 1170 transitions, 15900 flow [2025-01-09 16:48:14,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=6284, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=638, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=410, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=89, PETRI_FLOW=15900, PETRI_PLACES=388, PETRI_TRANSITIONS=1170} [2025-01-09 16:48:14,927 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 360 predicate places. [2025-01-09 16:48:14,927 INFO L471 AbstractCegarLoop]: Abstraction has has 388 places, 1170 transitions, 15900 flow [2025-01-09 16:48:14,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 4.785714285714286) internal successors, (201), 42 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:48:14,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:48:14,927 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:48:14,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 16:48:15,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 16:48:15,128 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:48:15,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:48:15,129 INFO L85 PathProgramCache]: Analyzing trace with hash -500653963, now seen corresponding path program 4 times [2025-01-09 16:48:15,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:48:15,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286058012] [2025-01-09 16:48:15,129 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:48:15,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:48:15,135 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-01-09 16:48:15,152 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:48:15,152 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:48:15,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:15,738 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:48:15,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:48:15,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286058012] [2025-01-09 16:48:15,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286058012] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:48:15,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422143544] [2025-01-09 16:48:15,738 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:48:15,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:48:15,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:48:15,741 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:48:15,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 16:48:15,800 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-01-09 16:48:15,822 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:48:15,823 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:48:15,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:15,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 16:48:15,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:48:16,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-01-09 16:48:16,249 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:48:16,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:48:16,527 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:48:16,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 21 [2025-01-09 16:48:16,921 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:48:16,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422143544] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:48:16,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:48:16,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 42 [2025-01-09 16:48:16,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217279137] [2025-01-09 16:48:16,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:48:16,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-01-09 16:48:16,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:48:16,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-01-09 16:48:16,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=1557, Unknown=0, NotChecked=0, Total=1806 [2025-01-09 16:48:16,953 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-01-09 16:48:16,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 1170 transitions, 15900 flow. Second operand has 43 states, 43 states have (on average 4.674418604651163) internal successors, (201), 43 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:48:16,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:48:16,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-01-09 16:48:16,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:48:21,199 INFO L124 PetriNetUnfolderBase]: 5650/9804 cut-off events. [2025-01-09 16:48:21,199 INFO L125 PetriNetUnfolderBase]: For 315506/315506 co-relation queries the response was YES. [2025-01-09 16:48:21,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73088 conditions, 9804 events. 5650/9804 cut-off events. For 315506/315506 co-relation queries the response was YES. Maximal size of possible extension queue 519. Compared 68697 event pairs, 285 based on Foata normal form. 73/9876 useless extension candidates. Maximal degree in co-relation 72968. Up to 4342 conditions per place. [2025-01-09 16:48:21,300 INFO L140 encePairwiseOnDemand]: 14/28 looper letters, 749 selfloop transitions, 715 changer transitions 97/1562 dead transitions. [2025-01-09 16:48:21,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 424 places, 1562 transitions, 23855 flow [2025-01-09 16:48:21,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-01-09 16:48:21,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2025-01-09 16:48:21,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 422 transitions. [2025-01-09 16:48:21,305 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32066869300911854 [2025-01-09 16:48:21,305 INFO L175 Difference]: Start difference. First operand has 388 places, 1170 transitions, 15900 flow. Second operand 47 states and 422 transitions. [2025-01-09 16:48:21,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 424 places, 1562 transitions, 23855 flow [2025-01-09 16:48:23,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 1562 transitions, 22983 flow, removed 400 selfloop flow, removed 21 redundant places. [2025-01-09 16:48:23,407 INFO L231 Difference]: Finished difference. Result has 423 places, 1259 transitions, 19329 flow [2025-01-09 16:48:23,408 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=15200, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=625, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=498, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=19329, PETRI_PLACES=423, PETRI_TRANSITIONS=1259} [2025-01-09 16:48:23,408 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 395 predicate places. [2025-01-09 16:48:23,408 INFO L471 AbstractCegarLoop]: Abstraction has has 423 places, 1259 transitions, 19329 flow [2025-01-09 16:48:23,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 4.674418604651163) internal successors, (201), 43 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:48:23,408 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:48:23,409 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:48:23,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 16:48:23,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 16:48:23,609 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:48:23,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:48:23,610 INFO L85 PathProgramCache]: Analyzing trace with hash -346935883, now seen corresponding path program 5 times [2025-01-09 16:48:23,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:48:23,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970930830] [2025-01-09 16:48:23,610 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:48:23,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:48:23,617 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-01-09 16:48:23,627 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:48:23,628 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:48:23,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:24,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:48:24,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:48:24,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970930830] [2025-01-09 16:48:24,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970930830] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:48:24,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128560368] [2025-01-09 16:48:24,166 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:48:24,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:48:24,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:48:24,168 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:48:24,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 16:48:24,218 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-01-09 16:48:24,238 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:48:24,238 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:48:24,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:24,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-01-09 16:48:24,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:48:24,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-01-09 16:48:24,750 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:48:24,750 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:48:24,908 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:48:24,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2025-01-09 16:48:25,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:48:25,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128560368] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:48:25,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:48:25,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 40 [2025-01-09 16:48:25,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002072472] [2025-01-09 16:48:25,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:48:25,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-01-09 16:48:25,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:48:25,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-01-09 16:48:25,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=1411, Unknown=0, NotChecked=0, Total=1640 [2025-01-09 16:48:25,197 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-01-09 16:48:25,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 423 places, 1259 transitions, 19329 flow. Second operand has 41 states, 41 states have (on average 4.7560975609756095) internal successors, (195), 41 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:48:25,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:48:25,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-01-09 16:48:25,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:48:29,252 INFO L124 PetriNetUnfolderBase]: 5769/10095 cut-off events. [2025-01-09 16:48:29,252 INFO L125 PetriNetUnfolderBase]: For 351131/351131 co-relation queries the response was YES. [2025-01-09 16:48:29,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81319 conditions, 10095 events. 5769/10095 cut-off events. For 351131/351131 co-relation queries the response was YES. Maximal size of possible extension queue 534. Compared 72012 event pairs, 482 based on Foata normal form. 153/10247 useless extension candidates. Maximal degree in co-relation 81187. Up to 5357 conditions per place. [2025-01-09 16:48:29,377 INFO L140 encePairwiseOnDemand]: 12/28 looper letters, 744 selfloop transitions, 691 changer transitions 129/1565 dead transitions. [2025-01-09 16:48:29,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 1565 transitions, 26492 flow [2025-01-09 16:48:29,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-01-09 16:48:29,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-01-09 16:48:29,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 379 transitions. [2025-01-09 16:48:29,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3007936507936508 [2025-01-09 16:48:29,598 INFO L175 Difference]: Start difference. First operand has 423 places, 1259 transitions, 19329 flow. Second operand 45 states and 379 transitions. [2025-01-09 16:48:29,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 1565 transitions, 26492 flow [2025-01-09 16:48:32,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 1565 transitions, 25693 flow, removed 192 selfloop flow, removed 29 redundant places. [2025-01-09 16:48:32,191 INFO L231 Difference]: Finished difference. Result has 446 places, 1268 transitions, 21643 flow [2025-01-09 16:48:32,192 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=18032, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=599, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=563, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=21643, PETRI_PLACES=446, PETRI_TRANSITIONS=1268} [2025-01-09 16:48:32,193 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 418 predicate places. [2025-01-09 16:48:32,193 INFO L471 AbstractCegarLoop]: Abstraction has has 446 places, 1268 transitions, 21643 flow [2025-01-09 16:48:32,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 4.7560975609756095) internal successors, (195), 41 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:48:32,193 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:48:32,193 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:48:32,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 16:48:32,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:48:32,394 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:48:32,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:48:32,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1170112979, now seen corresponding path program 6 times [2025-01-09 16:48:32,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:48:32,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659590115] [2025-01-09 16:48:32,395 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:48:32,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:48:32,401 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 3 equivalence classes. [2025-01-09 16:48:32,421 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:48:32,422 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-01-09 16:48:32,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:32,665 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 16:48:32,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:48:32,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659590115] [2025-01-09 16:48:32,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659590115] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:48:32,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430136546] [2025-01-09 16:48:32,665 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:48:32,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:48:32,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:48:32,668 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:48:32,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 16:48:32,716 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 3 equivalence classes. [2025-01-09 16:48:32,738 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:48:32,738 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-01-09 16:48:32,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:32,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-09 16:48:32,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:48:32,894 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:48:32,894 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:48:33,028 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:48:33,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 21 [2025-01-09 16:48:33,244 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 16:48:33,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430136546] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:48:33,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:48:33,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 11] total 23 [2025-01-09 16:48:33,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799597567] [2025-01-09 16:48:33,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:48:33,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-09 16:48:33,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:48:33,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-09 16:48:33,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2025-01-09 16:48:33,258 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-01-09 16:48:33,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 1268 transitions, 21643 flow. Second operand has 24 states, 24 states have (on average 5.083333333333333) internal successors, (122), 24 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:48:33,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:48:33,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-01-09 16:48:33,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:48:36,052 INFO L124 PetriNetUnfolderBase]: 5547/9588 cut-off events. [2025-01-09 16:48:36,052 INFO L125 PetriNetUnfolderBase]: For 344145/344145 co-relation queries the response was YES. [2025-01-09 16:48:36,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81138 conditions, 9588 events. 5547/9588 cut-off events. For 344145/344145 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 66304 event pairs, 349 based on Foata normal form. 1/9588 useless extension candidates. Maximal degree in co-relation 80998. Up to 3988 conditions per place. [2025-01-09 16:48:36,167 INFO L140 encePairwiseOnDemand]: 16/28 looper letters, 774 selfloop transitions, 668 changer transitions 21/1464 dead transitions. [2025-01-09 16:48:36,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 1464 transitions, 27139 flow [2025-01-09 16:48:36,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 16:48:36,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-01-09 16:48:36,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 188 transitions. [2025-01-09 16:48:36,169 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3357142857142857 [2025-01-09 16:48:36,169 INFO L175 Difference]: Start difference. First operand has 446 places, 1268 transitions, 21643 flow. Second operand 20 states and 188 transitions. [2025-01-09 16:48:36,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 1464 transitions, 27139 flow [2025-01-09 16:48:38,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 422 places, 1464 transitions, 26771 flow, removed 149 selfloop flow, removed 24 redundant places. [2025-01-09 16:48:38,939 INFO L231 Difference]: Finished difference. Result has 430 places, 1299 transitions, 24199 flow [2025-01-09 16:48:38,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=21325, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=636, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=617, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=24199, PETRI_PLACES=430, PETRI_TRANSITIONS=1299} [2025-01-09 16:48:38,940 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 402 predicate places. [2025-01-09 16:48:38,940 INFO L471 AbstractCegarLoop]: Abstraction has has 430 places, 1299 transitions, 24199 flow [2025-01-09 16:48:38,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.083333333333333) internal successors, (122), 24 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:48:38,940 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:48:38,940 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:48:38,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 16:48:39,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:48:39,141 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:48:39,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:48:39,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1335439839, now seen corresponding path program 7 times [2025-01-09 16:48:39,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:48:39,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603906873] [2025-01-09 16:48:39,142 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:48:39,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:48:39,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 16:48:39,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:48:39,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:48:39,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:39,989 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:48:39,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:48:39,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603906873] [2025-01-09 16:48:39,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603906873] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:48:39,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194187786] [2025-01-09 16:48:39,990 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:48:39,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:48:39,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:48:39,992 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:48:39,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 16:48:40,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 16:48:40,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:48:40,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:48:40,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:40,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 16:48:40,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:48:40,386 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:48:40,387 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:48:40,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:48:40,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2025-01-09 16:48:40,664 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 16:48:40,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194187786] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:48:40,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:48:40,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 10] total 34 [2025-01-09 16:48:40,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603363387] [2025-01-09 16:48:40,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:48:40,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-09 16:48:40,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:48:40,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-09 16:48:40,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1072, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 16:48:40,710 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-01-09 16:48:40,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 1299 transitions, 24199 flow. Second operand has 35 states, 35 states have (on average 4.885714285714286) internal successors, (171), 35 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:48:40,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:48:40,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-01-09 16:48:40,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:48:44,300 INFO L124 PetriNetUnfolderBase]: 5611/9701 cut-off events. [2025-01-09 16:48:44,301 INFO L125 PetriNetUnfolderBase]: For 355496/355496 co-relation queries the response was YES. [2025-01-09 16:48:44,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86038 conditions, 9701 events. 5611/9701 cut-off events. For 355496/355496 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 67115 event pairs, 516 based on Foata normal form. 1/9701 useless extension candidates. Maximal degree in co-relation 85902. Up to 4872 conditions per place. [2025-01-09 16:48:44,419 INFO L140 encePairwiseOnDemand]: 13/28 looper letters, 672 selfloop transitions, 782 changer transitions 25/1480 dead transitions. [2025-01-09 16:48:44,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 1480 transitions, 29291 flow [2025-01-09 16:48:44,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-09 16:48:44,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-01-09 16:48:44,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 276 transitions. [2025-01-09 16:48:44,420 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31797235023041476 [2025-01-09 16:48:44,420 INFO L175 Difference]: Start difference. First operand has 430 places, 1299 transitions, 24199 flow. Second operand 31 states and 276 transitions. [2025-01-09 16:48:44,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 1480 transitions, 29291 flow [2025-01-09 16:48:47,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 1480 transitions, 29247 flow, removed 10 selfloop flow, removed 7 redundant places. [2025-01-09 16:48:47,462 INFO L231 Difference]: Finished difference. Result has 456 places, 1332 transitions, 26400 flow [2025-01-09 16:48:47,463 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=24164, PETRI_DIFFERENCE_MINUEND_PLACES=422, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=748, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=26400, PETRI_PLACES=456, PETRI_TRANSITIONS=1332} [2025-01-09 16:48:47,463 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 428 predicate places. [2025-01-09 16:48:47,464 INFO L471 AbstractCegarLoop]: Abstraction has has 456 places, 1332 transitions, 26400 flow [2025-01-09 16:48:47,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 4.885714285714286) internal successors, (171), 35 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:48:47,464 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:48:47,464 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:48:47,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-09 16:48:47,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:48:47,665 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:48:47,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:48:47,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1380336933, now seen corresponding path program 8 times [2025-01-09 16:48:47,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:48:47,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507365066] [2025-01-09 16:48:47,666 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:48:47,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:48:47,674 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-01-09 16:48:47,683 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 28 statements. [2025-01-09 16:48:47,684 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:48:47,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:47,898 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 16:48:47,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:48:47,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507365066] [2025-01-09 16:48:47,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507365066] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:48:47,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:48:47,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 16:48:47,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044481264] [2025-01-09 16:48:47,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:48:47,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:48:47,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:48:47,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:48:47,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:48:47,927 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-01-09 16:48:47,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 1332 transitions, 26400 flow. Second operand has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:48:47,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:48:47,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-01-09 16:48:47,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:48:50,964 INFO L124 PetriNetUnfolderBase]: 5018/9051 cut-off events. [2025-01-09 16:48:50,964 INFO L125 PetriNetUnfolderBase]: For 341213/341652 co-relation queries the response was YES. [2025-01-09 16:48:51,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83215 conditions, 9051 events. 5018/9051 cut-off events. For 341213/341652 co-relation queries the response was YES. Maximal size of possible extension queue 462. Compared 65471 event pairs, 547 based on Foata normal form. 22/9025 useless extension candidates. Maximal degree in co-relation 83076. Up to 7813 conditions per place. [2025-01-09 16:48:51,087 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 1170 selfloop transitions, 52 changer transitions 17/1386 dead transitions. [2025-01-09 16:48:51,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 462 places, 1386 transitions, 29644 flow [2025-01-09 16:48:51,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:48:51,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 16:48:51,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 121 transitions. [2025-01-09 16:48:51,088 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3601190476190476 [2025-01-09 16:48:51,088 INFO L175 Difference]: Start difference. First operand has 456 places, 1332 transitions, 26400 flow. Second operand 12 states and 121 transitions. [2025-01-09 16:48:51,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 462 places, 1386 transitions, 29644 flow [2025-01-09 16:48:54,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 1386 transitions, 29072 flow, removed 16 selfloop flow, removed 13 redundant places. [2025-01-09 16:48:54,075 INFO L231 Difference]: Finished difference. Result has 454 places, 1343 transitions, 26254 flow [2025-01-09 16:48:54,076 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=25844, PETRI_DIFFERENCE_MINUEND_PLACES=438, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=26254, PETRI_PLACES=454, PETRI_TRANSITIONS=1343} [2025-01-09 16:48:54,076 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 426 predicate places. [2025-01-09 16:48:54,076 INFO L471 AbstractCegarLoop]: Abstraction has has 454 places, 1343 transitions, 26254 flow [2025-01-09 16:48:54,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:48:54,076 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:48:54,077 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:48:54,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 16:48:54,077 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:48:54,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:48:54,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1641696655, now seen corresponding path program 9 times [2025-01-09 16:48:54,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:48:54,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81955870] [2025-01-09 16:48:54,077 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:48:54,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:48:54,084 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 3 equivalence classes. [2025-01-09 16:48:54,091 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 28 statements. [2025-01-09 16:48:54,091 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:48:54,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:54,428 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 16:48:54,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:48:54,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81955870] [2025-01-09 16:48:54,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81955870] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:48:54,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:48:54,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 16:48:54,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454001726] [2025-01-09 16:48:54,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:48:54,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:48:54,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:48:54,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:48:54,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:48:54,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-01-09 16:48:54,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 1343 transitions, 26254 flow. Second operand has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:48:54,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:48:54,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-01-09 16:48:54,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:48:57,661 INFO L124 PetriNetUnfolderBase]: 5026/9068 cut-off events. [2025-01-09 16:48:57,661 INFO L125 PetriNetUnfolderBase]: For 344397/344829 co-relation queries the response was YES. [2025-01-09 16:48:57,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83195 conditions, 9068 events. 5026/9068 cut-off events. For 344397/344829 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 65999 event pairs, 555 based on Foata normal form. 18/9042 useless extension candidates. Maximal degree in co-relation 83054. Up to 7862 conditions per place. [2025-01-09 16:48:57,760 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 1189 selfloop transitions, 36 changer transitions 17/1389 dead transitions. [2025-01-09 16:48:57,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 462 places, 1389 transitions, 29366 flow [2025-01-09 16:48:57,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:48:57,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 16:48:57,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 117 transitions. [2025-01-09 16:48:57,762 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3482142857142857 [2025-01-09 16:48:57,762 INFO L175 Difference]: Start difference. First operand has 454 places, 1343 transitions, 26254 flow. Second operand 12 states and 117 transitions. [2025-01-09 16:48:57,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 462 places, 1389 transitions, 29366 flow [2025-01-09 16:49:00,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 1389 transitions, 29266 flow, removed 12 selfloop flow, removed 9 redundant places. [2025-01-09 16:49:00,465 INFO L231 Difference]: Finished difference. Result has 457 places, 1348 transitions, 26400 flow [2025-01-09 16:49:00,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=26160, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=26400, PETRI_PLACES=457, PETRI_TRANSITIONS=1348} [2025-01-09 16:49:00,467 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 429 predicate places. [2025-01-09 16:49:00,467 INFO L471 AbstractCegarLoop]: Abstraction has has 457 places, 1348 transitions, 26400 flow [2025-01-09 16:49:00,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:49:00,467 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:49:00,467 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:49:00,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 16:49:00,467 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:49:00,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:49:00,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1834182911, now seen corresponding path program 10 times [2025-01-09 16:49:00,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:49:00,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911665634] [2025-01-09 16:49:00,468 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:49:00,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:49:00,474 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-01-09 16:49:00,486 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:49:00,486 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:49:00,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:49:00,711 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 16:49:00,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:49:00,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911665634] [2025-01-09 16:49:00,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911665634] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:49:00,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507780813] [2025-01-09 16:49:00,712 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:49:00,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:49:00,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:49:00,714 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:49:00,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 16:49:00,763 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-01-09 16:49:00,786 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:49:00,786 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:49:00,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:49:00,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 16:49:00,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:49:01,026 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:49:01,026 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:49:01,148 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:49:01,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2025-01-09 16:49:01,203 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 16:49:01,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507780813] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:49:01,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:49:01,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 26 [2025-01-09 16:49:01,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910927585] [2025-01-09 16:49:01,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:49:01,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-09 16:49:01,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:49:01,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-09 16:49:01,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2025-01-09 16:49:01,218 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-01-09 16:49:01,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 1348 transitions, 26400 flow. Second operand has 27 states, 27 states have (on average 5.074074074074074) internal successors, (137), 27 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:49:01,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:49:01,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-01-09 16:49:01,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:49:04,793 INFO L124 PetriNetUnfolderBase]: 5653/9770 cut-off events. [2025-01-09 16:49:04,793 INFO L125 PetriNetUnfolderBase]: For 381905/381905 co-relation queries the response was YES. [2025-01-09 16:49:05,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90018 conditions, 9770 events. 5653/9770 cut-off events. For 381905/381905 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 67641 event pairs, 490 based on Foata normal form. 1/9771 useless extension candidates. Maximal degree in co-relation 89876. Up to 5927 conditions per place. [2025-01-09 16:49:05,073 INFO L140 encePairwiseOnDemand]: 14/28 looper letters, 739 selfloop transitions, 713 changer transitions 25/1478 dead transitions. [2025-01-09 16:49:05,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 470 places, 1478 transitions, 30788 flow [2025-01-09 16:49:05,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 16:49:05,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-01-09 16:49:05,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 157 transitions. [2025-01-09 16:49:05,074 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32983193277310924 [2025-01-09 16:49:05,074 INFO L175 Difference]: Start difference. First operand has 457 places, 1348 transitions, 26400 flow. Second operand 17 states and 157 transitions. [2025-01-09 16:49:05,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 470 places, 1478 transitions, 30788 flow