./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 1d936eafcc314e66bb4cd572754c58bf1f2fc59d35c83764f43dae769bce220a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:42:19,848 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:42:19,905 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:42:19,910 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:42:19,911 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:42:19,932 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:42:19,932 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:42:19,933 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:42:19,933 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:42:19,933 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:42:19,933 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:42:19,933 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:42:19,933 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:42:19,934 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:42:19,934 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:42:19,934 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:42:19,934 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:42:19,934 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:42:19,934 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:42:19,934 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:42:19,934 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:42:19,934 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:42:19,934 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:42:19,934 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:42:19,935 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:42:19,935 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:42:19,935 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:42:19,935 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:42:19,935 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:42:19,935 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:42:19,935 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:42:19,935 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:42:19,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:42:19,935 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:42:19,935 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:42:19,935 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:42:19,935 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:42:19,935 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:42:19,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:42:19,936 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:42:19,936 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:42:19,936 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:42:19,936 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:42:19,936 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/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 -> 1d936eafcc314e66bb4cd572754c58bf1f2fc59d35c83764f43dae769bce220a [2025-03-17 06:42:20,180 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:42:20,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:42:20,197 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:42:20,200 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:42:20,200 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:42:20,201 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c [2025-03-17 06:42:21,369 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1aa95d8d7/9c811ae435804109b8f3ced3e944afbc/FLAG4b88af0e0 [2025-03-17 06:42:21,618 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:42:21,618 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c [2025-03-17 06:42:21,624 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1aa95d8d7/9c811ae435804109b8f3ced3e944afbc/FLAG4b88af0e0 [2025-03-17 06:42:21,941 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1aa95d8d7/9c811ae435804109b8f3ced3e944afbc [2025-03-17 06:42:21,943 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:42:21,947 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:42:21,949 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:42:21,949 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:42:21,953 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:42:21,954 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:42:21" (1/1) ... [2025-03-17 06:42:21,956 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fc6400d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:42:21, skipping insertion in model container [2025-03-17 06:42:21,957 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:42:21" (1/1) ... [2025-03-17 06:42:21,971 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:42:22,118 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c[2564,2577] [2025-03-17 06:42:22,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:42:22,150 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:42:22,173 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c[2564,2577] [2025-03-17 06:42:22,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:42:22,195 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:42:22,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:42:22 WrapperNode [2025-03-17 06:42:22,196 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:42:22,197 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:42:22,197 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:42:22,197 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:42:22,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:42:22" (1/1) ... [2025-03-17 06:42:22,214 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:42:22" (1/1) ... [2025-03-17 06:42:22,238 INFO L138 Inliner]: procedures = 24, calls = 30, calls flagged for inlining = 12, calls inlined = 16, statements flattened = 170 [2025-03-17 06:42:22,240 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:42:22,240 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:42:22,240 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:42:22,240 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:42:22,246 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:42:22" (1/1) ... [2025-03-17 06:42:22,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:42:22" (1/1) ... [2025-03-17 06:42:22,250 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:42:22" (1/1) ... [2025-03-17 06:42:22,271 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-03-17 06:42:22,271 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:42:22" (1/1) ... [2025-03-17 06:42:22,272 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:42:22" (1/1) ... [2025-03-17 06:42:22,277 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:42:22" (1/1) ... [2025-03-17 06:42:22,278 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:42:22" (1/1) ... [2025-03-17 06:42:22,279 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:42:22" (1/1) ... [2025-03-17 06:42:22,280 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:42:22" (1/1) ... [2025-03-17 06:42:22,282 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:42:22,283 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:42:22,283 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:42:22,283 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:42:22,284 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:42:22" (1/1) ... [2025-03-17 06:42:22,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:42:22,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:42:22,312 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 06:42:22,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 06:42:22,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:42:22,335 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 06:42:22,336 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 06:42:22,336 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 06:42:22,336 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 06:42:22,336 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-17 06:42:22,336 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-17 06:42:22,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 06:42:22,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 06:42:22,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 06:42:22,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 06:42:22,336 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 06:42:22,336 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 06:42:22,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 06:42:22,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:42:22,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:42:22,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 06:42:22,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 06:42:22,337 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 06:42:22,432 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:42:22,434 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:42:22,715 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 06:42:22,715 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:42:22,899 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:42:22,900 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:42:22,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:42:22 BoogieIcfgContainer [2025-03-17 06:42:22,901 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:42:22,902 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:42:22,903 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:42:22,906 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:42:22,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:42:21" (1/3) ... [2025-03-17 06:42:22,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a6085d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:42:22, skipping insertion in model container [2025-03-17 06:42:22,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:42:22" (2/3) ... [2025-03-17 06:42:22,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a6085d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:42:22, skipping insertion in model container [2025-03-17 06:42:22,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:42:22" (3/3) ... [2025-03-17 06:42:22,908 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum-alt2.wvr.c [2025-03-17 06:42:22,918 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:42:22,919 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-array-sum-alt2.wvr.c that has 4 procedures, 30 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-17 06:42:22,920 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 06:42:22,978 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-17 06:42:23,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 33 transitions, 87 flow [2025-03-17 06:42:23,032 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2025-03-17 06:42:23,038 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 06:42:23,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 30 events. 4/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2025-03-17 06:42:23,040 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 33 transitions, 87 flow [2025-03-17 06:42:23,046 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 29 transitions, 76 flow [2025-03-17 06:42:23,051 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:42:23,062 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;@55e92502, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:42:23,062 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-17 06:42:23,071 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 06:42:23,071 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2025-03-17 06:42:23,071 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 06:42:23,071 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:42:23,072 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-03-17 06:42:23,072 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 06:42:23,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:42:23,077 INFO L85 PathProgramCache]: Analyzing trace with hash -313091042, now seen corresponding path program 1 times [2025-03-17 06:42:23,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:42:23,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226107129] [2025-03-17 06:42:23,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:42:23,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:42:23,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 06:42:23,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 06:42:23,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:42:23,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:42:23,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:42:23,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:42:23,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226107129] [2025-03-17 06:42:23,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226107129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:42:23,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:42:23,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 06:42:23,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255624480] [2025-03-17 06:42:23,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:42:23,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:42:23,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:42:23,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:42:23,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:42:23,428 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-17 06:42:23,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-03-17 06:42:23,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:42:23,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-17 06:42:23,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:42:23,592 INFO L124 PetriNetUnfolderBase]: 617/956 cut-off events. [2025-03-17 06:42:23,592 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2025-03-17 06:42:23,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1951 conditions, 956 events. 617/956 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3871 event pairs, 126 based on Foata normal form. 1/952 useless extension candidates. Maximal degree in co-relation 1717. Up to 677 conditions per place. [2025-03-17 06:42:23,605 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 37 selfloop transitions, 4 changer transitions 1/46 dead transitions. [2025-03-17 06:42:23,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 46 transitions, 209 flow [2025-03-17 06:42:23,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:42:23,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 06:42:23,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2025-03-17 06:42:23,616 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6464646464646465 [2025-03-17 06:42:23,617 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 76 flow. Second operand 3 states and 64 transitions. [2025-03-17 06:42:23,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 46 transitions, 209 flow [2025-03-17 06:42:23,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 46 transitions, 187 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-17 06:42:23,623 INFO L231 Difference]: Finished difference. Result has 32 places, 32 transitions, 90 flow [2025-03-17 06:42:23,625 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=32, PETRI_TRANSITIONS=32} [2025-03-17 06:42:23,627 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2025-03-17 06:42:23,627 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 32 transitions, 90 flow [2025-03-17 06:42:23,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-03-17 06:42:23,632 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:42:23,632 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] [2025-03-17 06:42:23,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 06:42:23,632 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 06:42:23,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:42:23,632 INFO L85 PathProgramCache]: Analyzing trace with hash 758293984, now seen corresponding path program 1 times [2025-03-17 06:42:23,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:42:23,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625346882] [2025-03-17 06:42:23,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:42:23,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:42:23,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 06:42:23,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 06:42:23,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:42:23,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:42:23,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:42:23,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:42:23,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625346882] [2025-03-17 06:42:23,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625346882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:42:23,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:42:23,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:42:23,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98531241] [2025-03-17 06:42:23,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:42:23,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:42:23,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:42:23,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:42:23,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:42:23,848 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-17 06:42:23,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 32 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-03-17 06:42:23,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:42:23,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-17 06:42:23,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:42:24,115 INFO L124 PetriNetUnfolderBase]: 1206/1894 cut-off events. [2025-03-17 06:42:24,116 INFO L125 PetriNetUnfolderBase]: For 348/348 co-relation queries the response was YES. [2025-03-17 06:42:24,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4216 conditions, 1894 events. 1206/1894 cut-off events. For 348/348 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 9243 event pairs, 745 based on Foata normal form. 0/1822 useless extension candidates. Maximal degree in co-relation 1088. Up to 1120 conditions per place. [2025-03-17 06:42:24,125 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 63 selfloop transitions, 5 changer transitions 0/71 dead transitions. [2025-03-17 06:42:24,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 71 transitions, 334 flow [2025-03-17 06:42:24,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:42:24,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 06:42:24,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2025-03-17 06:42:24,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5575757575757576 [2025-03-17 06:42:24,127 INFO L175 Difference]: Start difference. First operand has 32 places, 32 transitions, 90 flow. Second operand 5 states and 92 transitions. [2025-03-17 06:42:24,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 71 transitions, 334 flow [2025-03-17 06:42:24,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 71 transitions, 326 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 06:42:24,133 INFO L231 Difference]: Finished difference. Result has 38 places, 36 transitions, 122 flow [2025-03-17 06:42:24,133 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=122, PETRI_PLACES=38, PETRI_TRANSITIONS=36} [2025-03-17 06:42:24,133 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2025-03-17 06:42:24,133 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 36 transitions, 122 flow [2025-03-17 06:42:24,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-03-17 06:42:24,134 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:42:24,134 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] [2025-03-17 06:42:24,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 06:42:24,134 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 06:42:24,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:42:24,134 INFO L85 PathProgramCache]: Analyzing trace with hash 743471117, now seen corresponding path program 1 times [2025-03-17 06:42:24,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:42:24,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192504139] [2025-03-17 06:42:24,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:42:24,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:42:24,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 06:42:24,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 06:42:24,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:42:24,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:42:24,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:42:24,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:42:24,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192504139] [2025-03-17 06:42:24,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192504139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:42:24,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:42:24,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:42:24,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128664227] [2025-03-17 06:42:24,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:42:24,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:42:24,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:42:24,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:42:24,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:42:24,288 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-17 06:42:24,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 36 transitions, 122 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-03-17 06:42:24,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:42:24,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-17 06:42:24,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:42:24,468 INFO L124 PetriNetUnfolderBase]: 1047/1641 cut-off events. [2025-03-17 06:42:24,468 INFO L125 PetriNetUnfolderBase]: For 680/770 co-relation queries the response was YES. [2025-03-17 06:42:24,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3890 conditions, 1641 events. 1047/1641 cut-off events. For 680/770 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 7615 event pairs, 686 based on Foata normal form. 0/1568 useless extension candidates. Maximal degree in co-relation 2766. Up to 1133 conditions per place. [2025-03-17 06:42:24,478 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 56 selfloop transitions, 5 changer transitions 0/64 dead transitions. [2025-03-17 06:42:24,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 64 transitions, 326 flow [2025-03-17 06:42:24,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:42:24,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 06:42:24,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2025-03-17 06:42:24,480 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5272727272727272 [2025-03-17 06:42:24,481 INFO L175 Difference]: Start difference. First operand has 38 places, 36 transitions, 122 flow. Second operand 5 states and 87 transitions. [2025-03-17 06:42:24,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 64 transitions, 326 flow [2025-03-17 06:42:24,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 64 transitions, 322 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-17 06:42:24,484 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 143 flow [2025-03-17 06:42:24,484 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=143, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2025-03-17 06:42:24,485 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 8 predicate places. [2025-03-17 06:42:24,485 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 143 flow [2025-03-17 06:42:24,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-03-17 06:42:24,485 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:42:24,486 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] [2025-03-17 06:42:24,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 06:42:24,486 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 06:42:24,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:42:24,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1530266094, now seen corresponding path program 1 times [2025-03-17 06:42:24,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:42:24,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518689447] [2025-03-17 06:42:24,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:42:24,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:42:24,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 06:42:24,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 06:42:24,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:42:24,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:42:24,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:42:24,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:42:24,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518689447] [2025-03-17 06:42:24,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518689447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:42:24,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:42:24,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:42:24,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951345282] [2025-03-17 06:42:24,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:42:24,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:42:24,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:42:24,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:42:24,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:42:24,611 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-17 06:42:24,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 143 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-03-17 06:42:24,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:42:24,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-17 06:42:24,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:42:24,791 INFO L124 PetriNetUnfolderBase]: 882/1329 cut-off events. [2025-03-17 06:42:24,791 INFO L125 PetriNetUnfolderBase]: For 788/934 co-relation queries the response was YES. [2025-03-17 06:42:24,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3488 conditions, 1329 events. 882/1329 cut-off events. For 788/934 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5503 event pairs, 601 based on Foata normal form. 0/1263 useless extension candidates. Maximal degree in co-relation 2811. Up to 1095 conditions per place. [2025-03-17 06:42:24,802 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 28 selfloop transitions, 2 changer transitions 23/56 dead transitions. [2025-03-17 06:42:24,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 56 transitions, 309 flow [2025-03-17 06:42:24,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:42:24,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 06:42:24,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2025-03-17 06:42:24,804 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4909090909090909 [2025-03-17 06:42:24,804 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 143 flow. Second operand 5 states and 81 transitions. [2025-03-17 06:42:24,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 56 transitions, 309 flow [2025-03-17 06:42:24,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 56 transitions, 304 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 06:42:24,806 INFO L231 Difference]: Finished difference. Result has 47 places, 33 transitions, 116 flow [2025-03-17 06:42:24,807 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=116, PETRI_PLACES=47, PETRI_TRANSITIONS=33} [2025-03-17 06:42:24,807 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 12 predicate places. [2025-03-17 06:42:24,807 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 33 transitions, 116 flow [2025-03-17 06:42:24,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-03-17 06:42:24,808 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:42:24,808 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-03-17 06:42:24,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 06:42:24,808 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 06:42:24,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:42:24,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1757165282, now seen corresponding path program 1 times [2025-03-17 06:42:24,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:42:24,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396697924] [2025-03-17 06:42:24,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:42:24,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:42:24,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 06:42:24,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 06:42:24,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:42:24,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:42:24,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:42:24,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:42:24,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396697924] [2025-03-17 06:42:24,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396697924] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:42:24,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591645773] [2025-03-17 06:42:24,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:42:24,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:42:24,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:42:24,981 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:42:24,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 06:42:25,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 06:42:25,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 06:42:25,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:42:25,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:42:25,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 06:42:25,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:42:25,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:42:25,187 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:42:25,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:42:25,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591645773] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 06:42:25,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 06:42:25,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2025-03-17 06:42:25,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181761280] [2025-03-17 06:42:25,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:42:25,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:42:25,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:42:25,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:42:25,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:42:25,281 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-17 06:42:25,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 33 transitions, 116 flow. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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-03-17 06:42:25,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:42:25,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-17 06:42:25,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:42:25,656 INFO L124 PetriNetUnfolderBase]: 1468/2122 cut-off events. [2025-03-17 06:42:25,656 INFO L125 PetriNetUnfolderBase]: For 840/990 co-relation queries the response was YES. [2025-03-17 06:42:25,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5707 conditions, 2122 events. 1468/2122 cut-off events. For 840/990 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9268 event pairs, 293 based on Foata normal form. 0/1872 useless extension candidates. Maximal degree in co-relation 5688. Up to 668 conditions per place. [2025-03-17 06:42:25,670 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 87 selfloop transitions, 15 changer transitions 0/104 dead transitions. [2025-03-17 06:42:25,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 104 transitions, 559 flow [2025-03-17 06:42:25,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 06:42:25,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 06:42:25,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 137 transitions. [2025-03-17 06:42:25,673 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4612794612794613 [2025-03-17 06:42:25,673 INFO L175 Difference]: Start difference. First operand has 47 places, 33 transitions, 116 flow. Second operand 9 states and 137 transitions. [2025-03-17 06:42:25,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 104 transitions, 559 flow [2025-03-17 06:42:25,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 104 transitions, 489 flow, removed 33 selfloop flow, removed 8 redundant places. [2025-03-17 06:42:25,686 INFO L231 Difference]: Finished difference. Result has 45 places, 44 transitions, 178 flow [2025-03-17 06:42:25,687 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=178, PETRI_PLACES=45, PETRI_TRANSITIONS=44} [2025-03-17 06:42:25,688 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 10 predicate places. [2025-03-17 06:42:25,688 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 44 transitions, 178 flow [2025-03-17 06:42:25,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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-03-17 06:42:25,689 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:42:25,689 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-03-17 06:42:25,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 06:42:25,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:42:25,892 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 06:42:25,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:42:25,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1205944272, now seen corresponding path program 2 times [2025-03-17 06:42:25,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:42:25,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780365600] [2025-03-17 06:42:25,893 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:42:25,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:42:25,902 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-17 06:42:25,911 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 23 statements. [2025-03-17 06:42:25,911 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 06:42:25,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:42:25,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 06:42:25,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:42:25,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780365600] [2025-03-17 06:42:25,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780365600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:42:25,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:42:25,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 06:42:25,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602386974] [2025-03-17 06:42:25,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:42:25,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:42:25,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:42:25,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:42:25,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:42:26,010 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-17 06:42:26,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 44 transitions, 178 flow. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 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-03-17 06:42:26,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:42:26,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-17 06:42:26,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:42:26,531 INFO L124 PetriNetUnfolderBase]: 3201/4649 cut-off events. [2025-03-17 06:42:26,531 INFO L125 PetriNetUnfolderBase]: For 3553/3553 co-relation queries the response was YES. [2025-03-17 06:42:26,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13134 conditions, 4649 events. 3201/4649 cut-off events. For 3553/3553 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 24157 event pairs, 371 based on Foata normal form. 13/4403 useless extension candidates. Maximal degree in co-relation 13111. Up to 1405 conditions per place. [2025-03-17 06:42:26,553 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 196 selfloop transitions, 23 changer transitions 0/221 dead transitions. [2025-03-17 06:42:26,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 221 transitions, 1373 flow [2025-03-17 06:42:26,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 06:42:26,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 06:42:26,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 193 transitions. [2025-03-17 06:42:26,556 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5316804407713499 [2025-03-17 06:42:26,556 INFO L175 Difference]: Start difference. First operand has 45 places, 44 transitions, 178 flow. Second operand 11 states and 193 transitions. [2025-03-17 06:42:26,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 221 transitions, 1373 flow [2025-03-17 06:42:26,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 221 transitions, 1370 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 06:42:26,567 INFO L231 Difference]: Finished difference. Result has 62 places, 66 transitions, 405 flow [2025-03-17 06:42:26,567 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=405, PETRI_PLACES=62, PETRI_TRANSITIONS=66} [2025-03-17 06:42:26,568 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 27 predicate places. [2025-03-17 06:42:26,568 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 66 transitions, 405 flow [2025-03-17 06:42:26,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 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-03-17 06:42:26,568 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:42:26,568 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-03-17 06:42:26,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 06:42:26,569 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 06:42:26,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:42:26,569 INFO L85 PathProgramCache]: Analyzing trace with hash -129998672, now seen corresponding path program 3 times [2025-03-17 06:42:26,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:42:26,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075809221] [2025-03-17 06:42:26,569 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 06:42:26,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:42:26,577 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-03-17 06:42:26,585 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 06:42:26,585 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 06:42:26,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:42:26,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 06:42:26,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:42:26,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075809221] [2025-03-17 06:42:26,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075809221] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:42:26,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255251803] [2025-03-17 06:42:26,686 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 06:42:26,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:42:26,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:42:26,688 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:42:26,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 06:42:26,731 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-03-17 06:42:26,747 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 06:42:26,747 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 06:42:26,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:42:26,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 06:42:26,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:42:26,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 06:42:26,809 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:42:26,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 06:42:26,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255251803] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 06:42:26,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 06:42:26,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 14 [2025-03-17 06:42:26,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841012948] [2025-03-17 06:42:26,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:42:26,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:42:26,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:42:26,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:42:26,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-03-17 06:42:26,878 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-17 06:42:26,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 66 transitions, 405 flow. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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-03-17 06:42:26,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:42:26,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-17 06:42:26,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:42:27,481 INFO L124 PetriNetUnfolderBase]: 4349/6271 cut-off events. [2025-03-17 06:42:27,481 INFO L125 PetriNetUnfolderBase]: For 13022/13391 co-relation queries the response was YES. [2025-03-17 06:42:27,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22306 conditions, 6271 events. 4349/6271 cut-off events. For 13022/13391 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 32827 event pairs, 760 based on Foata normal form. 186/6452 useless extension candidates. Maximal degree in co-relation 22275. Up to 1984 conditions per place. [2025-03-17 06:42:27,513 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 125 selfloop transitions, 40 changer transitions 0/168 dead transitions. [2025-03-17 06:42:27,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 168 transitions, 1272 flow [2025-03-17 06:42:27,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 06:42:27,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 06:42:27,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2025-03-17 06:42:27,514 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2025-03-17 06:42:27,514 INFO L175 Difference]: Start difference. First operand has 62 places, 66 transitions, 405 flow. Second operand 9 states and 144 transitions. [2025-03-17 06:42:27,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 168 transitions, 1272 flow [2025-03-17 06:42:27,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 168 transitions, 1260 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 06:42:27,554 INFO L231 Difference]: Finished difference. Result has 74 places, 82 transitions, 681 flow [2025-03-17 06:42:27,554 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=681, PETRI_PLACES=74, PETRI_TRANSITIONS=82} [2025-03-17 06:42:27,555 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 39 predicate places. [2025-03-17 06:42:27,555 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 82 transitions, 681 flow [2025-03-17 06:42:27,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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-03-17 06:42:27,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:42:27,555 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-03-17 06:42:27,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 06:42:27,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-17 06:42:27,760 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 06:42:27,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:42:27,760 INFO L85 PathProgramCache]: Analyzing trace with hash 2092252378, now seen corresponding path program 1 times [2025-03-17 06:42:27,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:42:27,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748547814] [2025-03-17 06:42:27,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:42:27,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:42:27,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 06:42:27,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 06:42:27,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:42:27,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:42:27,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 06:42:27,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:42:27,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748547814] [2025-03-17 06:42:27,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748547814] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:42:27,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025293047] [2025-03-17 06:42:27,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:42:27,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:42:27,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:42:27,896 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:42:27,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 06:42:27,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 06:42:27,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 06:42:27,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:42:27,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:42:27,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 06:42:27,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:42:27,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 06:42:28,000 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:42:28,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 06:42:28,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025293047] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 06:42:28,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 06:42:28,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-03-17 06:42:28,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475444966] [2025-03-17 06:42:28,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:42:28,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:42:28,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:42:28,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:42:28,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:42:28,041 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-17 06:42:28,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 82 transitions, 681 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-03-17 06:42:28,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:42:28,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-17 06:42:28,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:42:28,482 INFO L124 PetriNetUnfolderBase]: 3725/5527 cut-off events. [2025-03-17 06:42:28,482 INFO L125 PetriNetUnfolderBase]: For 23808/23905 co-relation queries the response was YES. [2025-03-17 06:42:28,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23501 conditions, 5527 events. 3725/5527 cut-off events. For 23808/23905 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 30482 event pairs, 929 based on Foata normal form. 207/5469 useless extension candidates. Maximal degree in co-relation 23463. Up to 3107 conditions per place. [2025-03-17 06:42:28,572 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 101 selfloop transitions, 9 changer transitions 0/121 dead transitions. [2025-03-17 06:42:28,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 121 transitions, 1275 flow [2025-03-17 06:42:28,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:42:28,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 06:42:28,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2025-03-17 06:42:28,573 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2025-03-17 06:42:28,573 INFO L175 Difference]: Start difference. First operand has 74 places, 82 transitions, 681 flow. Second operand 5 states and 72 transitions. [2025-03-17 06:42:28,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 121 transitions, 1275 flow [2025-03-17 06:42:28,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 121 transitions, 1206 flow, removed 15 selfloop flow, removed 4 redundant places. [2025-03-17 06:42:28,630 INFO L231 Difference]: Finished difference. Result has 74 places, 81 transitions, 652 flow [2025-03-17 06:42:28,630 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=652, PETRI_PLACES=74, PETRI_TRANSITIONS=81} [2025-03-17 06:42:28,630 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 39 predicate places. [2025-03-17 06:42:28,630 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 81 transitions, 652 flow [2025-03-17 06:42:28,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-03-17 06:42:28,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:42:28,631 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-03-17 06:42:28,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 06:42:28,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:42:28,832 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 06:42:28,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:42:28,832 INFO L85 PathProgramCache]: Analyzing trace with hash 897369166, now seen corresponding path program 4 times [2025-03-17 06:42:28,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:42:28,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803389300] [2025-03-17 06:42:28,833 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 06:42:28,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:42:28,840 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-17 06:42:28,843 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-03-17 06:42:28,843 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 06:42:28,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:42:28,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 06:42:28,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:42:28,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803389300] [2025-03-17 06:42:28,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803389300] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:42:28,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739207202] [2025-03-17 06:42:28,899 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 06:42:28,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:42:28,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:42:28,902 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:42:28,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 06:42:28,950 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-17 06:42:28,960 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-03-17 06:42:28,960 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 06:42:28,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:42:28,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 06:42:28,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:42:29,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 06:42:29,019 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:42:29,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 06:42:29,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739207202] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:42:29,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:42:29,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-17 06:42:29,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669206486] [2025-03-17 06:42:29,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:42:29,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 06:42:29,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:42:29,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 06:42:29,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-03-17 06:42:29,127 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-03-17 06:42:29,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 81 transitions, 652 flow. Second operand has 15 states, 15 states have (on average 6.466666666666667) internal successors, (97), 15 states have internal predecessors, (97), 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-03-17 06:42:29,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:42:29,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-03-17 06:42:29,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:42:31,064 INFO L124 PetriNetUnfolderBase]: 9584/13587 cut-off events. [2025-03-17 06:42:31,064 INFO L125 PetriNetUnfolderBase]: For 52414/52414 co-relation queries the response was YES. [2025-03-17 06:42:31,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57773 conditions, 13587 events. 9584/13587 cut-off events. For 52414/52414 co-relation queries the response was YES. Maximal size of possible extension queue 534. Compared 73609 event pairs, 987 based on Foata normal form. 14/13600 useless extension candidates. Maximal degree in co-relation 57734. Up to 3373 conditions per place. [2025-03-17 06:42:31,204 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 342 selfloop transitions, 197 changer transitions 0/540 dead transitions. [2025-03-17 06:42:31,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 540 transitions, 4772 flow [2025-03-17 06:42:31,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-17 06:42:31,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-03-17 06:42:31,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 462 transitions. [2025-03-17 06:42:31,208 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2025-03-17 06:42:31,208 INFO L175 Difference]: Start difference. First operand has 74 places, 81 transitions, 652 flow. Second operand 33 states and 462 transitions. [2025-03-17 06:42:31,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 540 transitions, 4772 flow [2025-03-17 06:42:31,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 540 transitions, 4699 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 06:42:31,365 INFO L231 Difference]: Finished difference. Result has 122 places, 268 transitions, 2946 flow [2025-03-17 06:42:31,367 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=2946, PETRI_PLACES=122, PETRI_TRANSITIONS=268} [2025-03-17 06:42:31,368 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 87 predicate places. [2025-03-17 06:42:31,368 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 268 transitions, 2946 flow [2025-03-17 06:42:31,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.466666666666667) internal successors, (97), 15 states have internal predecessors, (97), 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-03-17 06:42:31,368 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:42:31,368 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-03-17 06:42:31,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 06:42:31,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:42:31,569 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 06:42:31,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:42:31,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1933568968, now seen corresponding path program 5 times [2025-03-17 06:42:31,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:42:31,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495814566] [2025-03-17 06:42:31,569 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 06:42:31,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:42:31,574 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-17 06:42:31,579 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 06:42:31,582 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 06:42:31,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:42:31,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:42:31,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:42:31,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495814566] [2025-03-17 06:42:31,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495814566] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:42:31,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510439737] [2025-03-17 06:42:31,671 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 06:42:31,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:42:31,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:42:31,673 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:42:31,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 06:42:31,713 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-17 06:42:31,728 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 06:42:31,728 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 06:42:31,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:42:31,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 06:42:31,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:42:31,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:42:31,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:42:31,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:42:31,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510439737] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 06:42:31,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 06:42:31,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2025-03-17 06:42:31,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213395733] [2025-03-17 06:42:31,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:42:31,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:42:31,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:42:31,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:42:31,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:42:31,826 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-17 06:42:31,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 268 transitions, 2946 flow. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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-03-17 06:42:31,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:42:31,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-17 06:42:31,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:42:33,083 INFO L124 PetriNetUnfolderBase]: 8251/11919 cut-off events. [2025-03-17 06:42:33,083 INFO L125 PetriNetUnfolderBase]: For 74544/75238 co-relation queries the response was YES. [2025-03-17 06:42:33,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59827 conditions, 11919 events. 8251/11919 cut-off events. For 74544/75238 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 68445 event pairs, 776 based on Foata normal form. 283/12170 useless extension candidates. Maximal degree in co-relation 59770. Up to 3663 conditions per place. [2025-03-17 06:42:33,218 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 186 selfloop transitions, 194 changer transitions 0/387 dead transitions. [2025-03-17 06:42:33,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 387 transitions, 4796 flow [2025-03-17 06:42:33,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 06:42:33,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 06:42:33,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 130 transitions. [2025-03-17 06:42:33,220 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4377104377104377 [2025-03-17 06:42:33,220 INFO L175 Difference]: Start difference. First operand has 122 places, 268 transitions, 2946 flow. Second operand 9 states and 130 transitions. [2025-03-17 06:42:33,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 387 transitions, 4796 flow [2025-03-17 06:42:34,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 387 transitions, 4484 flow, removed 156 selfloop flow, removed 0 redundant places. [2025-03-17 06:42:34,093 INFO L231 Difference]: Finished difference. Result has 132 places, 310 transitions, 3666 flow [2025-03-17 06:42:34,093 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2692, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=153, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3666, PETRI_PLACES=132, PETRI_TRANSITIONS=310} [2025-03-17 06:42:34,094 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 97 predicate places. [2025-03-17 06:42:34,094 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 310 transitions, 3666 flow [2025-03-17 06:42:34,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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-03-17 06:42:34,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:42:34,094 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-03-17 06:42:34,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 06:42:34,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-17 06:42:34,299 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 06:42:34,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:42:34,300 INFO L85 PathProgramCache]: Analyzing trace with hash -2028302134, now seen corresponding path program 6 times [2025-03-17 06:42:34,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:42:34,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231553853] [2025-03-17 06:42:34,300 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 06:42:34,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:42:34,308 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 2 equivalence classes. [2025-03-17 06:42:34,317 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 22 of 23 statements. [2025-03-17 06:42:34,318 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-17 06:42:34,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:42:34,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 06:42:34,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:42:34,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231553853] [2025-03-17 06:42:34,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231553853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:42:34,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:42:34,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 06:42:34,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654559098] [2025-03-17 06:42:34,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:42:34,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:42:34,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:42:34,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:42:34,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:42:34,417 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-03-17 06:42:34,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 310 transitions, 3666 flow. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 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-03-17 06:42:34,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:42:34,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-03-17 06:42:34,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:42:36,362 INFO L124 PetriNetUnfolderBase]: 12951/18335 cut-off events. [2025-03-17 06:42:36,362 INFO L125 PetriNetUnfolderBase]: For 130594/130594 co-relation queries the response was YES. [2025-03-17 06:42:36,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95157 conditions, 18335 events. 12951/18335 cut-off events. For 130594/130594 co-relation queries the response was YES. Maximal size of possible extension queue 755. Compared 105376 event pairs, 3033 based on Foata normal form. 13/18347 useless extension candidates. Maximal degree in co-relation 95095. Up to 9922 conditions per place. [2025-03-17 06:42:36,457 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 631 selfloop transitions, 149 changer transitions 0/781 dead transitions. [2025-03-17 06:42:36,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 781 transitions, 10449 flow [2025-03-17 06:42:36,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 06:42:36,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-17 06:42:36,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 209 transitions. [2025-03-17 06:42:36,459 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2025-03-17 06:42:36,459 INFO L175 Difference]: Start difference. First operand has 132 places, 310 transitions, 3666 flow. Second operand 12 states and 209 transitions. [2025-03-17 06:42:36,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 781 transitions, 10449 flow [2025-03-17 06:42:37,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 781 transitions, 10330 flow, removed 58 selfloop flow, removed 2 redundant places. [2025-03-17 06:42:37,560 INFO L231 Difference]: Finished difference. Result has 150 places, 451 transitions, 6144 flow [2025-03-17 06:42:37,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3617, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=6144, PETRI_PLACES=150, PETRI_TRANSITIONS=451} [2025-03-17 06:42:37,561 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 115 predicate places. [2025-03-17 06:42:37,561 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 451 transitions, 6144 flow [2025-03-17 06:42:37,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 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-03-17 06:42:37,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:42:37,561 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-03-17 06:42:37,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 06:42:37,561 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 06:42:37,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:42:37,562 INFO L85 PathProgramCache]: Analyzing trace with hash 145193106, now seen corresponding path program 7 times [2025-03-17 06:42:37,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:42:37,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729070887] [2025-03-17 06:42:37,562 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 06:42:37,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:42:37,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 06:42:37,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 06:42:37,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:42:37,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:42:37,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 06:42:37,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:42:37,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729070887] [2025-03-17 06:42:37,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729070887] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:42:37,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834973695] [2025-03-17 06:42:37,696 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 06:42:37,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:42:37,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:42:37,698 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:42:37,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 06:42:37,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 06:42:37,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 06:42:37,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:42:37,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:42:37,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 06:42:37,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:42:37,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 06:42:37,871 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:42:37,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 06:42:37,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834973695] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 06:42:37,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 06:42:37,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 15 [2025-03-17 06:42:37,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363252375] [2025-03-17 06:42:37,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:42:37,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:42:37,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:42:37,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:42:37,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-03-17 06:42:37,967 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-17 06:42:37,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 451 transitions, 6144 flow. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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-03-17 06:42:37,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:42:37,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-17 06:42:37,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:42:40,749 INFO L124 PetriNetUnfolderBase]: 12129/17351 cut-off events. [2025-03-17 06:42:40,749 INFO L125 PetriNetUnfolderBase]: For 143886/144781 co-relation queries the response was YES. [2025-03-17 06:42:40,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96037 conditions, 17351 events. 12129/17351 cut-off events. For 143886/144781 co-relation queries the response was YES. Maximal size of possible extension queue 864. Compared 103955 event pairs, 1883 based on Foata normal form. 293/17620 useless extension candidates. Maximal degree in co-relation 95967. Up to 5973 conditions per place. [2025-03-17 06:42:40,858 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 352 selfloop transitions, 306 changer transitions 0/665 dead transitions. [2025-03-17 06:42:40,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 665 transitions, 9507 flow [2025-03-17 06:42:40,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 06:42:40,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 06:42:40,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 143 transitions. [2025-03-17 06:42:40,860 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2025-03-17 06:42:40,860 INFO L175 Difference]: Start difference. First operand has 150 places, 451 transitions, 6144 flow. Second operand 9 states and 143 transitions. [2025-03-17 06:42:40,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 665 transitions, 9507 flow [2025-03-17 06:42:41,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 665 transitions, 9392 flow, removed 44 selfloop flow, removed 1 redundant places. [2025-03-17 06:42:41,957 INFO L231 Difference]: Finished difference. Result has 160 places, 526 transitions, 7986 flow [2025-03-17 06:42:41,957 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=6062, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=231, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7986, PETRI_PLACES=160, PETRI_TRANSITIONS=526} [2025-03-17 06:42:41,958 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 125 predicate places. [2025-03-17 06:42:41,958 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 526 transitions, 7986 flow [2025-03-17 06:42:41,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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-03-17 06:42:41,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:42:41,958 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-03-17 06:42:41,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 06:42:42,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:42:42,162 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 06:42:42,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:42:42,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1029219728, now seen corresponding path program 8 times [2025-03-17 06:42:42,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:42:42,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7635923] [2025-03-17 06:42:42,162 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:42:42,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:42:42,168 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-17 06:42:42,175 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 06:42:42,176 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 06:42:42,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:42:42,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 06:42:42,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:42:42,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7635923] [2025-03-17 06:42:42,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7635923] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:42:42,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807432740] [2025-03-17 06:42:42,275 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:42:42,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:42:42,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:42:42,278 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:42:42,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 06:42:42,333 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-17 06:42:42,354 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 06:42:42,354 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 06:42:42,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:42:42,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 06:42:42,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:42:42,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 06:42:42,412 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:42:42,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 06:42:42,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807432740] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 06:42:42,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 06:42:42,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 14 [2025-03-17 06:42:42,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400501169] [2025-03-17 06:42:42,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:42:42,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:42:42,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:42:42,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:42:42,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-03-17 06:42:42,490 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-17 06:42:42,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 526 transitions, 7986 flow. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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-03-17 06:42:42,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:42:42,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-17 06:42:42,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:42:44,868 INFO L124 PetriNetUnfolderBase]: 12118/17438 cut-off events. [2025-03-17 06:42:44,868 INFO L125 PetriNetUnfolderBase]: For 186417/187216 co-relation queries the response was YES. [2025-03-17 06:42:44,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101577 conditions, 17438 events. 12118/17438 cut-off events. For 186417/187216 co-relation queries the response was YES. Maximal size of possible extension queue 858. Compared 105068 event pairs, 1677 based on Foata normal form. 301/17709 useless extension candidates. Maximal degree in co-relation 101501. Up to 8798 conditions per place. [2025-03-17 06:42:45,021 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 342 selfloop transitions, 259 changer transitions 0/608 dead transitions. [2025-03-17 06:42:45,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 608 transitions, 9889 flow [2025-03-17 06:42:45,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:42:45,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 06:42:45,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 125 transitions. [2025-03-17 06:42:45,022 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4734848484848485 [2025-03-17 06:42:45,022 INFO L175 Difference]: Start difference. First operand has 160 places, 526 transitions, 7986 flow. Second operand 8 states and 125 transitions. [2025-03-17 06:42:45,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 608 transitions, 9889 flow [2025-03-17 06:42:46,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 608 transitions, 9798 flow, removed 44 selfloop flow, removed 2 redundant places. [2025-03-17 06:42:46,583 INFO L231 Difference]: Finished difference. Result has 167 places, 529 transitions, 8776 flow [2025-03-17 06:42:46,583 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=7903, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=256, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8776, PETRI_PLACES=167, PETRI_TRANSITIONS=529} [2025-03-17 06:42:46,584 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 132 predicate places. [2025-03-17 06:42:46,584 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 529 transitions, 8776 flow [2025-03-17 06:42:46,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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-03-17 06:42:46,584 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:42:46,584 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-03-17 06:42:46,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 06:42:46,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:42:46,785 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 06:42:46,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:42:46,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1748593428, now seen corresponding path program 9 times [2025-03-17 06:42:46,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:42:46,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753101501] [2025-03-17 06:42:46,785 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 06:42:46,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:42:46,791 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-03-17 06:42:46,797 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 22 of 23 statements. [2025-03-17 06:42:46,797 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 06:42:46,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:42:46,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 06:42:46,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:42:46,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753101501] [2025-03-17 06:42:46,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753101501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:42:46,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:42:46,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 06:42:46,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046622077] [2025-03-17 06:42:46,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:42:46,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:42:46,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:42:46,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:42:46,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:42:46,891 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-03-17 06:42:46,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 529 transitions, 8776 flow. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 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-03-17 06:42:46,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:42:46,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-03-17 06:42:46,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:42:50,373 INFO L124 PetriNetUnfolderBase]: 15666/22111 cut-off events. [2025-03-17 06:42:50,374 INFO L125 PetriNetUnfolderBase]: For 280873/280873 co-relation queries the response was YES. [2025-03-17 06:42:50,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135033 conditions, 22111 events. 15666/22111 cut-off events. For 280873/280873 co-relation queries the response was YES. Maximal size of possible extension queue 917. Compared 130385 event pairs, 1300 based on Foata normal form. 22/22132 useless extension candidates. Maximal degree in co-relation 134954. Up to 10936 conditions per place. [2025-03-17 06:42:50,579 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 902 selfloop transitions, 150 changer transitions 0/1053 dead transitions. [2025-03-17 06:42:50,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 1053 transitions, 18890 flow [2025-03-17 06:42:50,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 06:42:50,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-17 06:42:50,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 219 transitions. [2025-03-17 06:42:50,581 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5104895104895105 [2025-03-17 06:42:50,581 INFO L175 Difference]: Start difference. First operand has 167 places, 529 transitions, 8776 flow. Second operand 13 states and 219 transitions. [2025-03-17 06:42:50,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 1053 transitions, 18890 flow [2025-03-17 06:42:52,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 1053 transitions, 18476 flow, removed 41 selfloop flow, removed 3 redundant places. [2025-03-17 06:42:52,620 INFO L231 Difference]: Finished difference. Result has 184 places, 595 transitions, 10410 flow [2025-03-17 06:42:52,620 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=8581, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=529, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=10410, PETRI_PLACES=184, PETRI_TRANSITIONS=595} [2025-03-17 06:42:52,622 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 149 predicate places. [2025-03-17 06:42:52,622 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 595 transitions, 10410 flow [2025-03-17 06:42:52,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 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-03-17 06:42:52,622 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:42:52,622 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-03-17 06:42:52,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 06:42:52,622 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 06:42:52,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:42:52,622 INFO L85 PathProgramCache]: Analyzing trace with hash 490772284, now seen corresponding path program 10 times [2025-03-17 06:42:52,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:42:52,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348309187] [2025-03-17 06:42:52,623 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 06:42:52,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:42:52,628 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-17 06:42:52,631 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-03-17 06:42:52,631 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 06:42:52,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:42:52,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 06:42:52,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:42:52,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348309187] [2025-03-17 06:42:52,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348309187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:42:52,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:42:52,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 06:42:52,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610442008] [2025-03-17 06:42:52,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:42:52,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:42:52,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:42:52,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:42:52,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:42:52,677 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-03-17 06:42:52,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 595 transitions, 10410 flow. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 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-03-17 06:42:52,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:42:52,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-03-17 06:42:52,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:42:56,358 INFO L124 PetriNetUnfolderBase]: 16909/23858 cut-off events. [2025-03-17 06:42:56,359 INFO L125 PetriNetUnfolderBase]: For 310038/310038 co-relation queries the response was YES. [2025-03-17 06:42:56,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149470 conditions, 23858 events. 16909/23858 cut-off events. For 310038/310038 co-relation queries the response was YES. Maximal size of possible extension queue 992. Compared 139263 event pairs, 4861 based on Foata normal form. 2/23859 useless extension candidates. Maximal degree in co-relation 149384. Up to 10879 conditions per place. [2025-03-17 06:42:56,593 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 455 selfloop transitions, 288 changer transitions 2/746 dead transitions. [2025-03-17 06:42:56,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 746 transitions, 13847 flow [2025-03-17 06:42:56,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:42:56,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 06:42:56,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2025-03-17 06:42:56,595 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4805194805194805 [2025-03-17 06:42:56,595 INFO L175 Difference]: Start difference. First operand has 184 places, 595 transitions, 10410 flow. Second operand 7 states and 111 transitions. [2025-03-17 06:42:56,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 746 transitions, 13847 flow [2025-03-17 06:42:59,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 746 transitions, 13710 flow, removed 51 selfloop flow, removed 2 redundant places. [2025-03-17 06:42:59,750 INFO L231 Difference]: Finished difference. Result has 193 places, 656 transitions, 12525 flow [2025-03-17 06:42:59,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=10293, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=595, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=227, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=12525, PETRI_PLACES=193, PETRI_TRANSITIONS=656} [2025-03-17 06:42:59,751 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 158 predicate places. [2025-03-17 06:42:59,751 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 656 transitions, 12525 flow [2025-03-17 06:42:59,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 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-03-17 06:42:59,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:42:59,751 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-03-17 06:42:59,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 06:42:59,752 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 06:42:59,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:42:59,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1687977416, now seen corresponding path program 11 times [2025-03-17 06:42:59,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:42:59,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592479069] [2025-03-17 06:42:59,752 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 06:42:59,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:42:59,756 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-17 06:42:59,759 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 06:42:59,759 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 06:42:59,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:42:59,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 06:42:59,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:42:59,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592479069] [2025-03-17 06:42:59,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592479069] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:42:59,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131123214] [2025-03-17 06:42:59,809 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 06:42:59,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:42:59,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:42:59,811 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:42:59,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 06:42:59,855 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-17 06:42:59,868 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 06:42:59,869 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 06:42:59,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:42:59,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 06:42:59,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:42:59,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 06:42:59,932 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:43:00,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 06:43:00,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131123214] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:43:00,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:43:00,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2025-03-17 06:43:00,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456889913] [2025-03-17 06:43:00,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:43:00,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 06:43:00,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:43:00,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 06:43:00,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-03-17 06:43:00,021 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-03-17 06:43:00,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 656 transitions, 12525 flow. Second operand has 16 states, 16 states have (on average 7.125) internal successors, (114), 16 states have internal predecessors, (114), 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-03-17 06:43:00,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:43:00,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-03-17 06:43:00,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:43:05,497 INFO L124 PetriNetUnfolderBase]: 20247/28737 cut-off events. [2025-03-17 06:43:05,497 INFO L125 PetriNetUnfolderBase]: For 394426/394426 co-relation queries the response was YES. [2025-03-17 06:43:05,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183769 conditions, 28737 events. 20247/28737 cut-off events. For 394426/394426 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 172269 event pairs, 1024 based on Foata normal form. 74/28810 useless extension candidates. Maximal degree in co-relation 183678. Up to 6859 conditions per place. [2025-03-17 06:43:06,165 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 462 selfloop transitions, 945 changer transitions 0/1408 dead transitions. [2025-03-17 06:43:06,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 1408 transitions, 25223 flow [2025-03-17 06:43:06,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-17 06:43:06,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-17 06:43:06,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 595 transitions. [2025-03-17 06:43:06,168 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4006734006734007 [2025-03-17 06:43:06,168 INFO L175 Difference]: Start difference. First operand has 193 places, 656 transitions, 12525 flow. Second operand 45 states and 595 transitions. [2025-03-17 06:43:06,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 1408 transitions, 25223 flow [2025-03-17 06:43:10,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 1408 transitions, 24748 flow, removed 89 selfloop flow, removed 5 redundant places. [2025-03-17 06:43:10,235 INFO L231 Difference]: Finished difference. Result has 236 places, 1062 transitions, 21791 flow [2025-03-17 06:43:10,235 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=11996, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=647, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=530, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=21791, PETRI_PLACES=236, PETRI_TRANSITIONS=1062} [2025-03-17 06:43:10,236 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 201 predicate places. [2025-03-17 06:43:10,236 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 1062 transitions, 21791 flow [2025-03-17 06:43:10,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.125) internal successors, (114), 16 states have internal predecessors, (114), 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-03-17 06:43:10,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:43:10,236 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, 1, 1, 1] [2025-03-17 06:43:10,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 06:43:10,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 06:43:10,437 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 06:43:10,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:43:10,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1561850903, now seen corresponding path program 1 times [2025-03-17 06:43:10,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:43:10,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553445740] [2025-03-17 06:43:10,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:43:10,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:43:10,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 06:43:10,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 06:43:10,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:43:10,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:43:10,733 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 06:43:10,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:43:10,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553445740] [2025-03-17 06:43:10,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553445740] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:43:10,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014029347] [2025-03-17 06:43:10,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:43:10,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:43:10,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:43:10,736 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:43:10,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 06:43:10,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 06:43:10,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 06:43:10,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:43:10,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:43:10,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 06:43:10,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:43:10,926 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 15 treesize of output 7 [2025-03-17 06:43:10,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 06:43:10,936 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:43:11,001 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:43:11,001 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 19 treesize of output 16 [2025-03-17 06:43:11,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 06:43:11,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014029347] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:43:11,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:43:11,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 5] total 16 [2025-03-17 06:43:11,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537306847] [2025-03-17 06:43:11,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:43:11,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 06:43:11,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:43:11,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 06:43:11,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2025-03-17 06:43:11,065 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-17 06:43:11,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 1062 transitions, 21791 flow. Second operand has 17 states, 17 states have (on average 10.058823529411764) internal successors, (171), 17 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-03-17 06:43:11,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:43:11,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-17 06:43:11,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:43:15,757 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([475] L57-3-->L57: Formula: (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_9| 1) |v_thread2Thread1of1ForFork1_~i~1#1_10|) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_9|} OutVars{thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_1|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_10|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1][1679], [Black: 1145#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0))), Black: 234#(<= 1 ~N~0), Black: 239#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) (+ ~N~0 ~M~0))), Black: 232#(= |thread1Thread1of1ForFork2_~i~0#1| 0), 996#(<= 1 ~N~0), Black: 778#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| |thread2Thread1of1ForFork1_~i~1#1| 1) (+ ~N~0 ~M~0)) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), Black: 715#(and (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0)), Black: 722#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0)), Black: 718#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), Black: 619#(and (<= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0)), Black: 567#(<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0), Black: 737#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| |thread2Thread1of1ForFork1_~i~1#1| 1) (+ ~N~0 ~M~0)) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), Black: 742#(and (<= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), 1313#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0)), Black: 733#(and (<= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0)), Black: 1305#(and (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< 0 ~M~0)) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0))), Black: 770#(and (<= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), Black: 759#(and (<= (+ |thread3Thread1of1ForFork0_~i~2#1| |thread2Thread1of1ForFork1_~i~1#1| 1) (+ ~N~0 ~M~0)) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), Black: 762#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), Black: 407#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), Black: 750#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| |thread2Thread1of1ForFork1_~i~1#1| 1) (+ ~N~0 ~M~0)) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), Black: 415#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0))), Black: 605#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0)), Black: 263#(<= 1 ~N~0), Black: 728#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), Black: 724#(and (<= (+ |thread3Thread1of1ForFork0_~i~2#1| |thread2Thread1of1ForFork1_~i~1#1| 1) (+ ~N~0 ~M~0)) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), Black: 409#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0))), Black: 713#(and (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), 411#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), 6#L68true, 1596#true, 966#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0)), Black: 44#(and (= ~res1~0 0) (= ~res2~0 0)), 954#(and (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< 0 ~M~0)) (<= 1 ~N~0)), Black: 1567#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0) (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< 0 ~M~0)) (<= 1 ~N~0)), Black: 48#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 1327#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 1 ~M~0)), Black: 1517#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0)), Black: 1565#(and (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< 0 ~M~0)) (<= 1 ~N~0)), Black: 1331#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 1 ~M~0)), Black: 1319#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) (+ ~N~0 ~M~0))), 221#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), Black: 1515#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0) (<= 1 ~N~0)), 31#L48true, Black: 1323#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) (+ ~N~0 ~M~0))), Black: 1405#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0)), Black: 1321#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) (+ ~N~0 ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 1555#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0) (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< 0 ~M~0)) (<= 1 ~N~0)), Black: 1325#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) (+ ~N~0 ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 1 ~M~0)), Black: 1513#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0) (<= 1 ~N~0)), Black: 1333#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) (+ ~N~0 ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 1 ~M~0)), Black: 1329#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) (+ ~N~0 ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 956#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 960#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0) (<= 1 ~N~0) (<= 1 ~M~0)), 233#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0)), Black: 1346#(<= (+ ~N~0 |thread2Thread1of1ForFork1_~i~1#1|) ~M~0), Black: 1344#(<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0), Black: 1350#(and (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| |thread2Thread1of1ForFork1_~i~1#1|) ~M~0)), 1533#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< 0 ~M~0)) (<= 1 ~N~0)), Black: 982#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) (+ ~N~0 ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 1 ~M~0)), Black: 968#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 980#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) (+ ~N~0 ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 22#L57true, Black: 974#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 1 ~M~0)), Black: 978#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) (+ ~N~0 ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 1 ~M~0)), Black: 972#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 1 ~M~0)), Black: 967#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 976#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) (+ ~N~0 ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 225#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), Black: 219#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0)), Black: 223#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), Black: 217#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), 17#L89-1true, 571#(<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0), Black: 247#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 241#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (<= 1 ~M~0)), Black: 243#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) (+ ~N~0 ~M~0))), Black: 249#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 1 ~M~0)), Black: 1147#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0))), Black: 245#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 1 ~M~0))]) [2025-03-17 06:43:15,757 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-03-17 06:43:15,758 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-17 06:43:15,758 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-17 06:43:15,758 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-17 06:43:16,150 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([475] L57-3-->L57: Formula: (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_9| 1) |v_thread2Thread1of1ForFork1_~i~1#1_10|) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_9|} OutVars{thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_1|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_10|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1][1679], [Black: 234#(<= 1 ~N~0), Black: 1145#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0))), Black: 239#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) (+ ~N~0 ~M~0))), Black: 232#(= |thread1Thread1of1ForFork2_~i~0#1| 0), 996#(<= 1 ~N~0), Black: 778#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| |thread2Thread1of1ForFork1_~i~1#1| 1) (+ ~N~0 ~M~0)) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), Black: 715#(and (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0)), Black: 722#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0)), Black: 718#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), Black: 619#(and (<= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0)), Black: 567#(<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0), Black: 737#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| |thread2Thread1of1ForFork1_~i~1#1| 1) (+ ~N~0 ~M~0)) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), Black: 742#(and (<= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), 1313#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0)), Black: 733#(and (<= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0)), Black: 1305#(and (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< 0 ~M~0)) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0))), Black: 770#(and (<= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), Black: 759#(and (<= (+ |thread3Thread1of1ForFork0_~i~2#1| |thread2Thread1of1ForFork1_~i~1#1| 1) (+ ~N~0 ~M~0)) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), Black: 762#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), Black: 407#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), Black: 750#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| |thread2Thread1of1ForFork1_~i~1#1| 1) (+ ~N~0 ~M~0)) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), Black: 415#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0))), Black: 605#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0)), Black: 728#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), Black: 263#(<= 1 ~N~0), Black: 409#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0))), Black: 724#(and (<= (+ |thread3Thread1of1ForFork0_~i~2#1| |thread2Thread1of1ForFork1_~i~1#1| 1) (+ ~N~0 ~M~0)) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), Black: 713#(and (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), 411#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), 6#L68true, 1596#true, 966#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0)), Black: 44#(and (= ~res1~0 0) (= ~res2~0 0)), 954#(and (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< 0 ~M~0)) (<= 1 ~N~0)), Black: 1567#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0) (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< 0 ~M~0)) (<= 1 ~N~0)), Black: 48#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 1327#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 1 ~M~0)), Black: 1517#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0)), Black: 1331#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 1 ~M~0)), Black: 1565#(and (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< 0 ~M~0)) (<= 1 ~N~0)), Black: 1319#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) (+ ~N~0 ~M~0))), Black: 1515#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0) (<= 1 ~N~0)), 221#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), Black: 1323#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) (+ ~N~0 ~M~0))), Black: 1405#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0)), 31#L48true, Black: 1321#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) (+ ~N~0 ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 1555#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0) (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< 0 ~M~0)) (<= 1 ~N~0)), Black: 1325#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) (+ ~N~0 ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 1 ~M~0)), Black: 1513#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0) (<= 1 ~N~0)), Black: 1333#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) (+ ~N~0 ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 1 ~M~0)), Black: 1329#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) (+ ~N~0 ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 956#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 960#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0) (<= 1 ~N~0) (<= 1 ~M~0)), 233#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0)), Black: 1346#(<= (+ ~N~0 |thread2Thread1of1ForFork1_~i~1#1|) ~M~0), Black: 1344#(<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0), Black: 1350#(and (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| |thread2Thread1of1ForFork1_~i~1#1|) ~M~0)), 1533#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< 0 ~M~0)) (<= 1 ~N~0)), Black: 982#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) (+ ~N~0 ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 1 ~M~0)), Black: 968#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 980#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) (+ ~N~0 ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 974#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 1 ~M~0)), 22#L57true, Black: 978#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) (+ ~N~0 ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 1 ~M~0)), Black: 972#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 1 ~M~0)), Black: 967#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 976#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) (+ ~N~0 ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 225#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), Black: 219#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0)), Black: 223#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), Black: 217#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), 17#L89-1true, 571#(<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0), Black: 247#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 241#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (<= 1 ~M~0)), Black: 243#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) (+ ~N~0 ~M~0))), Black: 249#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 1 ~M~0)), Black: 1147#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0))), Black: 245#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 1 ~M~0))]) [2025-03-17 06:43:16,150 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-03-17 06:43:16,150 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-17 06:43:16,150 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-17 06:43:16,150 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-17 06:43:16,150 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-17 06:43:16,188 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([475] L57-3-->L57: Formula: (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_9| 1) |v_thread2Thread1of1ForFork1_~i~1#1_10|) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_9|} OutVars{thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_1|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_10|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1][1679], [Black: 1145#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0))), Black: 234#(<= 1 ~N~0), Black: 239#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) (+ ~N~0 ~M~0))), Black: 232#(= |thread1Thread1of1ForFork2_~i~0#1| 0), 996#(<= 1 ~N~0), Black: 778#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| |thread2Thread1of1ForFork1_~i~1#1| 1) (+ ~N~0 ~M~0)) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), Black: 715#(and (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0)), Black: 722#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0)), Black: 718#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), Black: 619#(and (<= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0)), Black: 567#(<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0), Black: 737#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| |thread2Thread1of1ForFork1_~i~1#1| 1) (+ ~N~0 ~M~0)) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), Black: 742#(and (<= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), 1313#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0)), Black: 733#(and (<= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0)), Black: 1305#(and (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< 0 ~M~0)) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0))), Black: 770#(and (<= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), Black: 759#(and (<= (+ |thread3Thread1of1ForFork0_~i~2#1| |thread2Thread1of1ForFork1_~i~1#1| 1) (+ ~N~0 ~M~0)) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), Black: 407#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), Black: 762#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), Black: 750#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| |thread2Thread1of1ForFork1_~i~1#1| 1) (+ ~N~0 ~M~0)) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), Black: 605#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0)), Black: 415#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0))), 26#L90true, Black: 728#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), Black: 263#(<= 1 ~N~0), Black: 724#(and (<= (+ |thread3Thread1of1ForFork0_~i~2#1| |thread2Thread1of1ForFork1_~i~1#1| 1) (+ ~N~0 ~M~0)) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), Black: 409#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0))), Black: 713#(and (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), 411#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), 6#L68true, 1596#true, Black: 44#(and (= ~res1~0 0) (= ~res2~0 0)), 966#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0)), 954#(and (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< 0 ~M~0)) (<= 1 ~N~0)), Black: 1567#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0) (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< 0 ~M~0)) (<= 1 ~N~0)), Black: 48#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 1327#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 1 ~M~0)), Black: 1517#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0)), Black: 1565#(and (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< 0 ~M~0)) (<= 1 ~N~0)), Black: 1331#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 1 ~M~0)), Black: 1319#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) (+ ~N~0 ~M~0))), 221#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), Black: 1515#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0) (<= 1 ~N~0)), Black: 1405#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0)), 31#L48true, Black: 1323#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) (+ ~N~0 ~M~0))), Black: 1321#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) (+ ~N~0 ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 1555#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0) (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< 0 ~M~0)) (<= 1 ~N~0)), Black: 1325#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) (+ ~N~0 ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 1 ~M~0)), Black: 1513#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0) (<= 1 ~N~0)), Black: 1333#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) (+ ~N~0 ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 1 ~M~0)), Black: 1329#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) (+ ~N~0 ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 956#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 960#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0) (<= 1 ~N~0) (<= 1 ~M~0)), 233#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0)), Black: 1346#(<= (+ ~N~0 |thread2Thread1of1ForFork1_~i~1#1|) ~M~0), Black: 1344#(<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0), Black: 1350#(and (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| |thread2Thread1of1ForFork1_~i~1#1|) ~M~0)), 1533#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< 0 ~M~0)) (<= 1 ~N~0)), Black: 982#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) (+ ~N~0 ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 1 ~M~0)), Black: 968#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 980#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) (+ ~N~0 ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 974#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 1 ~M~0)), 22#L57true, Black: 978#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) (+ ~N~0 ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 1 ~M~0)), Black: 972#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 1 ~M~0)), Black: 967#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 976#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) (+ ~N~0 ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 225#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), Black: 219#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0)), Black: 223#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), Black: 217#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), 571#(<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0), Black: 247#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 241#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (<= 1 ~M~0)), Black: 243#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) (+ ~N~0 ~M~0))), Black: 249#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 1 ~M~0)), Black: 1147#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0))), Black: 245#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 1 ~M~0))]) [2025-03-17 06:43:16,188 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-03-17 06:43:16,188 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-17 06:43:16,188 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-17 06:43:16,188 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-17 06:43:16,521 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([475] L57-3-->L57: Formula: (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_9| 1) |v_thread2Thread1of1ForFork1_~i~1#1_10|) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_9|} OutVars{thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_1|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_10|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1][1679], [Black: 234#(<= 1 ~N~0), Black: 1145#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0))), Black: 239#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) (+ ~N~0 ~M~0))), Black: 232#(= |thread1Thread1of1ForFork2_~i~0#1| 0), 996#(<= 1 ~N~0), Black: 778#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| |thread2Thread1of1ForFork1_~i~1#1| 1) (+ ~N~0 ~M~0)) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), Black: 715#(and (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0)), Black: 722#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0)), Black: 718#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), Black: 619#(and (<= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0)), Black: 567#(<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0), Black: 737#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| |thread2Thread1of1ForFork1_~i~1#1| 1) (+ ~N~0 ~M~0)) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), Black: 742#(and (<= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), 1313#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0)), Black: 733#(and (<= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0)), Black: 1305#(and (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< 0 ~M~0)) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0))), Black: 770#(and (<= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), Black: 759#(and (<= (+ |thread3Thread1of1ForFork0_~i~2#1| |thread2Thread1of1ForFork1_~i~1#1| 1) (+ ~N~0 ~M~0)) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), Black: 762#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), Black: 407#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), Black: 750#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| |thread2Thread1of1ForFork1_~i~1#1| 1) (+ ~N~0 ~M~0)) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), Black: 415#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0))), Black: 605#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0)), Black: 728#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), Black: 263#(<= 1 ~N~0), 26#L90true, Black: 724#(and (<= (+ |thread3Thread1of1ForFork0_~i~2#1| |thread2Thread1of1ForFork1_~i~1#1| 1) (+ ~N~0 ~M~0)) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), Black: 409#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0))), Black: 713#(and (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), 411#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), 6#L68true, 1596#true, 966#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0)), Black: 44#(and (= ~res1~0 0) (= ~res2~0 0)), 954#(and (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< 0 ~M~0)) (<= 1 ~N~0)), Black: 1567#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0) (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< 0 ~M~0)) (<= 1 ~N~0)), Black: 48#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 1327#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 1 ~M~0)), Black: 1517#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0)), Black: 1331#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 1 ~M~0)), Black: 1565#(and (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< 0 ~M~0)) (<= 1 ~N~0)), Black: 1515#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0) (<= 1 ~N~0)), 221#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), Black: 1319#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) (+ ~N~0 ~M~0))), 31#L48true, Black: 1323#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) (+ ~N~0 ~M~0))), Black: 1405#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0)), Black: 1321#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) (+ ~N~0 ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 1555#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0) (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< 0 ~M~0)) (<= 1 ~N~0)), Black: 1325#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) (+ ~N~0 ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 1 ~M~0)), Black: 1513#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0) (<= 1 ~N~0)), Black: 1333#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) (+ ~N~0 ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 1 ~M~0)), Black: 1329#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) (+ ~N~0 ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 956#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 960#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0) (<= 1 ~N~0) (<= 1 ~M~0)), 233#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0)), Black: 1346#(<= (+ ~N~0 |thread2Thread1of1ForFork1_~i~1#1|) ~M~0), Black: 1344#(<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0), Black: 1350#(and (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| |thread2Thread1of1ForFork1_~i~1#1|) ~M~0)), 1533#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< 0 ~M~0)) (<= 1 ~N~0)), Black: 982#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) (+ ~N~0 ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 1 ~M~0)), Black: 968#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 980#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) (+ ~N~0 ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 22#L57true, Black: 974#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 1 ~M~0)), Black: 978#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) (+ ~N~0 ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 1 ~M~0)), Black: 972#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 1 ~M~0)), Black: 967#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 976#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) (+ ~N~0 ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 225#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), Black: 219#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0)), Black: 223#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), Black: 217#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), 571#(<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0), Black: 247#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 241#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (<= 1 ~M~0)), Black: 243#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) (+ ~N~0 ~M~0))), Black: 1147#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0))), Black: 249#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 1 ~M~0)), Black: 245#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 1 ~M~0))]) [2025-03-17 06:43:16,521 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-03-17 06:43:16,521 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-17 06:43:16,521 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-17 06:43:16,521 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-17 06:43:16,521 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-17 06:43:17,207 INFO L124 PetriNetUnfolderBase]: 17493/26593 cut-off events. [2025-03-17 06:43:17,207 INFO L125 PetriNetUnfolderBase]: For 444754/447527 co-relation queries the response was YES. [2025-03-17 06:43:17,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180119 conditions, 26593 events. 17493/26593 cut-off events. For 444754/447527 co-relation queries the response was YES. Maximal size of possible extension queue 1539. Compared 190998 event pairs, 1593 based on Foata normal form. 913/27199 useless extension candidates. Maximal degree in co-relation 180021. Up to 19212 conditions per place. [2025-03-17 06:43:17,590 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 1149 selfloop transitions, 384 changer transitions 1/1807 dead transitions. [2025-03-17 06:43:17,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 1807 transitions, 39137 flow [2025-03-17 06:43:17,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 06:43:17,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-17 06:43:17,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 252 transitions. [2025-03-17 06:43:17,591 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.509090909090909 [2025-03-17 06:43:17,591 INFO L175 Difference]: Start difference. First operand has 236 places, 1062 transitions, 21791 flow. Second operand 15 states and 252 transitions. [2025-03-17 06:43:17,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 1807 transitions, 39137 flow [2025-03-17 06:43:24,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 1807 transitions, 36258 flow, removed 600 selfloop flow, removed 8 redundant places. [2025-03-17 06:43:24,651 INFO L231 Difference]: Finished difference. Result has 250 places, 1425 transitions, 29680 flow [2025-03-17 06:43:24,652 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=20142, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1062, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=784, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=29680, PETRI_PLACES=250, PETRI_TRANSITIONS=1425} [2025-03-17 06:43:24,652 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 215 predicate places. [2025-03-17 06:43:24,652 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 1425 transitions, 29680 flow [2025-03-17 06:43:24,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 10.058823529411764) internal successors, (171), 17 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-03-17 06:43:24,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:43:24,652 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, 1, 1, 1] [2025-03-17 06:43:24,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-17 06:43:24,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 06:43:24,854 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 06:43:24,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:43:24,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1373313250, now seen corresponding path program 1 times [2025-03-17 06:43:24,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:43:24,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678660573] [2025-03-17 06:43:24,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:43:24,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:43:24,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 06:43:24,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 06:43:24,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:43:24,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:43:25,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:43:25,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:43:25,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678660573] [2025-03-17 06:43:25,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678660573] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:43:25,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785269459] [2025-03-17 06:43:25,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:43:25,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:43:25,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:43:25,255 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:43:25,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 06:43:25,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 06:43:25,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 06:43:25,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:43:25,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:43:25,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 06:43:25,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:43:25,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 06:43:25,542 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 15 treesize of output 7 [2025-03-17 06:43:25,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:43:25,547 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:43:25,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 06:43:25,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785269459] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:43:25,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:43:25,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 24 [2025-03-17 06:43:25,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689056127] [2025-03-17 06:43:25,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:43:25,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-17 06:43:25,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:43:25,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 06:43:25,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2025-03-17 06:43:25,805 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-17 06:43:25,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 1425 transitions, 29680 flow. Second operand has 25 states, 25 states have (on average 7.56) internal successors, (189), 25 states have internal predecessors, (189), 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-03-17 06:43:25,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:43:25,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-17 06:43:25,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand