./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-max-array.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-max-array.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 573af40880ce1d61666f10a2729c7d6ecdb02e81781df2543efcfdd5788ab6d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:18:06,264 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:18:06,299 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 01:18:06,302 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:18:06,303 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:18:06,319 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:18:06,320 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:18:06,320 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:18:06,320 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:18:06,320 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:18:06,321 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:18:06,321 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:18:06,321 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:18:06,321 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:18:06,321 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:18:06,321 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:18:06,321 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:18:06,321 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 01:18:06,321 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:18:06,322 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 01:18:06,322 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:18:06,322 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:18:06,322 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:18:06,322 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:18:06,322 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 01:18:06,322 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:18:06,322 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:18:06,322 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:18:06,322 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:18:06,322 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:18:06,323 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:18:06,323 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:18:06,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:18:06,323 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:18:06,323 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:18:06,323 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:18:06,323 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:18:06,323 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:18:06,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:18:06,323 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:18:06,323 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:18:06,324 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:18:06,324 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:18:06,324 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 573af40880ce1d61666f10a2729c7d6ecdb02e81781df2543efcfdd5788ab6d6 [2025-02-08 01:18:06,554 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:18:06,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:18:06,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:18:06,567 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:18:06,568 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:18:06,569 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-max-array.wvr.c [2025-02-08 01:18:07,760 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ef630fb63/3ae87d8e6abd43f4a6d65e337785cc0c/FLAGf76aa40b2 [2025-02-08 01:18:08,030 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:18:08,030 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-max-array.wvr.c [2025-02-08 01:18:08,038 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ef630fb63/3ae87d8e6abd43f4a6d65e337785cc0c/FLAGf76aa40b2 [2025-02-08 01:18:08,339 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ef630fb63/3ae87d8e6abd43f4a6d65e337785cc0c [2025-02-08 01:18:08,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:18:08,342 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:18:08,343 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:18:08,343 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:18:08,346 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:18:08,347 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:18:08" (1/1) ... [2025-02-08 01:18:08,347 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ed78ba6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:08, skipping insertion in model container [2025-02-08 01:18:08,348 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:18:08" (1/1) ... [2025-02-08 01:18:08,358 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:18:08,484 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-max-array.wvr.c[2592,2605] [2025-02-08 01:18:08,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:18:08,502 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:18:08,519 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-max-array.wvr.c[2592,2605] [2025-02-08 01:18:08,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:18:08,535 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:18:08,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:08 WrapperNode [2025-02-08 01:18:08,536 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:18:08,537 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:18:08,537 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:18:08,537 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:18:08,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:08" (1/1) ... [2025-02-08 01:18:08,546 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:08" (1/1) ... [2025-02-08 01:18:08,556 INFO L138 Inliner]: procedures = 23, calls = 28, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 83 [2025-02-08 01:18:08,557 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:18:08,557 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:18:08,557 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:18:08,557 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:18:08,563 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:08" (1/1) ... [2025-02-08 01:18:08,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:08" (1/1) ... [2025-02-08 01:18:08,565 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:08" (1/1) ... [2025-02-08 01:18:08,574 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 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-02-08 01:18:08,574 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:08" (1/1) ... [2025-02-08 01:18:08,574 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:08" (1/1) ... [2025-02-08 01:18:08,579 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:08" (1/1) ... [2025-02-08 01:18:08,579 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:08" (1/1) ... [2025-02-08 01:18:08,580 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:08" (1/1) ... [2025-02-08 01:18:08,581 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:08" (1/1) ... [2025-02-08 01:18:08,582 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:18:08,582 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:18:08,583 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:18:08,583 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:18:08,583 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:08" (1/1) ... [2025-02-08 01:18:08,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:18:08,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:18:08,611 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 01:18:08,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 01:18:08,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:18:08,648 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 01:18:08,648 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 01:18:08,648 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 01:18:08,648 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 01:18:08,648 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 01:18:08,648 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 01:18:08,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:18:08,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 01:18:08,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 01:18:08,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 01:18:08,648 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 01:18:08,648 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 01:18:08,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 01:18:08,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:18:08,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:18:08,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 01:18:08,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 01:18:08,649 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 01:18:08,721 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:18:08,722 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:18:08,891 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 01:18:08,892 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:18:09,054 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:18:09,054 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:18:09,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:18:09 BoogieIcfgContainer [2025-02-08 01:18:09,054 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:18:09,056 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:18:09,056 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:18:09,059 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:18:09,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:18:08" (1/3) ... [2025-02-08 01:18:09,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a846087 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:18:09, skipping insertion in model container [2025-02-08 01:18:09,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:08" (2/3) ... [2025-02-08 01:18:09,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a846087 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:18:09, skipping insertion in model container [2025-02-08 01:18:09,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:18:09" (3/3) ... [2025-02-08 01:18:09,061 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array.wvr.c [2025-02-08 01:18:09,071 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:18:09,072 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-max-array.wvr.c that has 4 procedures, 30 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-02-08 01:18:09,072 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 01:18:09,131 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 01:18:09,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 33 transitions, 87 flow [2025-02-08 01:18:09,191 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2025-02-08 01:18:09,194 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 01:18:09,199 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-02-08 01:18:09,199 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 33 transitions, 87 flow [2025-02-08 01:18:09,201 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 29 transitions, 76 flow [2025-02-08 01:18:09,211 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:18:09,224 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;@862b21a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:18:09,225 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-08 01:18:09,239 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 01:18:09,240 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2025-02-08 01:18:09,240 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 01:18:09,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:09,240 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-02-08 01:18:09,241 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-02-08 01:18:09,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:09,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1979131608, now seen corresponding path program 1 times [2025-02-08 01:18:09,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:09,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449616079] [2025-02-08 01:18:09,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:18:09,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:09,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 01:18:09,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 01:18:09,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:18:09,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:09,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:18:09,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:09,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449616079] [2025-02-08 01:18:09,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449616079] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:18:09,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:18:09,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 01:18:09,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106847518] [2025-02-08 01:18:09,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:18:09,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:18:09,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:09,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:18:09,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:18:09,527 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-02-08 01:18:09,528 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-02-08 01:18:09,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:09,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-02-08 01:18:09,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:18:09,673 INFO L124 PetriNetUnfolderBase]: 617/954 cut-off events. [2025-02-08 01:18:09,674 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-02-08 01:18:09,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1949 conditions, 954 events. 617/954 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3786 event pairs, 126 based on Foata normal form. 1/950 useless extension candidates. Maximal degree in co-relation 1715. Up to 677 conditions per place. [2025-02-08 01:18:09,684 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 37 selfloop transitions, 4 changer transitions 1/46 dead transitions. [2025-02-08 01:18:09,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 46 transitions, 209 flow [2025-02-08 01:18:09,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:18:09,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:18:09,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2025-02-08 01:18:09,693 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6464646464646465 [2025-02-08 01:18:09,694 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 76 flow. Second operand 3 states and 64 transitions. [2025-02-08 01:18:09,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 46 transitions, 209 flow [2025-02-08 01:18:09,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 46 transitions, 187 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 01:18:09,699 INFO L231 Difference]: Finished difference. Result has 32 places, 32 transitions, 90 flow [2025-02-08 01:18:09,701 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-02-08 01:18:09,703 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2025-02-08 01:18:09,703 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 32 transitions, 90 flow [2025-02-08 01:18:09,703 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-02-08 01:18:09,703 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:09,703 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-02-08 01:18:09,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 01:18:09,708 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-02-08 01:18:09,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:09,708 INFO L85 PathProgramCache]: Analyzing trace with hash 413226038, now seen corresponding path program 1 times [2025-02-08 01:18:09,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:09,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990835598] [2025-02-08 01:18:09,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:18:09,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:09,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 01:18:09,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 01:18:09,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:18:09,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:09,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:18:09,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:09,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990835598] [2025-02-08 01:18:09,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990835598] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:18:09,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:18:09,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 01:18:09,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851639147] [2025-02-08 01:18:09,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:18:09,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:18:09,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:09,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:18:09,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:18:09,837 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-02-08 01:18:09,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 32 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-02-08 01:18:09,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:09,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-02-08 01:18:09,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:18:09,989 INFO L124 PetriNetUnfolderBase]: 617/965 cut-off events. [2025-02-08 01:18:09,990 INFO L125 PetriNetUnfolderBase]: For 199/199 co-relation queries the response was YES. [2025-02-08 01:18:09,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2170 conditions, 965 events. 617/965 cut-off events. For 199/199 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4084 event pairs, 407 based on Foata normal form. 0/957 useless extension candidates. Maximal degree in co-relation 802. Up to 895 conditions per place. [2025-02-08 01:18:09,996 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 27 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2025-02-08 01:18:09,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 33 transitions, 150 flow [2025-02-08 01:18:09,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:18:09,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:18:09,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2025-02-08 01:18:09,997 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2025-02-08 01:18:09,997 INFO L175 Difference]: Start difference. First operand has 32 places, 32 transitions, 90 flow. Second operand 3 states and 48 transitions. [2025-02-08 01:18:09,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 33 transitions, 150 flow [2025-02-08 01:18:09,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 146 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 01:18:09,998 INFO L231 Difference]: Finished difference. Result has 34 places, 33 transitions, 98 flow [2025-02-08 01:18:09,998 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=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=34, PETRI_TRANSITIONS=33} [2025-02-08 01:18:09,999 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2025-02-08 01:18:09,999 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 33 transitions, 98 flow [2025-02-08 01:18:09,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-02-08 01:18:09,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:09,999 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-02-08 01:18:09,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:18:09,999 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-02-08 01:18:09,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:09,999 INFO L85 PathProgramCache]: Analyzing trace with hash 116750022, now seen corresponding path program 1 times [2025-02-08 01:18:10,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:10,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366724250] [2025-02-08 01:18:10,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:18:10,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:10,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 01:18:10,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 01:18:10,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:18:10,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:10,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:18:10,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:10,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366724250] [2025-02-08 01:18:10,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366724250] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:18:10,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:18:10,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:18:10,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39183140] [2025-02-08 01:18:10,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:18:10,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:18:10,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:10,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:18:10,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:18:10,125 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-02-08 01:18:10,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 33 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-02-08 01:18:10,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:10,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-02-08 01:18:10,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:18:10,293 INFO L124 PetriNetUnfolderBase]: 790/1161 cut-off events. [2025-02-08 01:18:10,294 INFO L125 PetriNetUnfolderBase]: For 187/187 co-relation queries the response was YES. [2025-02-08 01:18:10,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2575 conditions, 1161 events. 790/1161 cut-off events. For 187/187 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4573 event pairs, 246 based on Foata normal form. 0/1118 useless extension candidates. Maximal degree in co-relation 2562. Up to 576 conditions per place. [2025-02-08 01:18:10,300 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 40 selfloop transitions, 4 changer transitions 0/47 dead transitions. [2025-02-08 01:18:10,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 47 transitions, 224 flow [2025-02-08 01:18:10,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:18:10,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:18:10,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2025-02-08 01:18:10,301 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4772727272727273 [2025-02-08 01:18:10,301 INFO L175 Difference]: Start difference. First operand has 34 places, 33 transitions, 98 flow. Second operand 4 states and 63 transitions. [2025-02-08 01:18:10,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 47 transitions, 224 flow [2025-02-08 01:18:10,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 47 transitions, 218 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-08 01:18:10,303 INFO L231 Difference]: Finished difference. Result has 38 places, 34 transitions, 113 flow [2025-02-08 01:18:10,303 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=38, PETRI_TRANSITIONS=34} [2025-02-08 01:18:10,303 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2025-02-08 01:18:10,303 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 34 transitions, 113 flow [2025-02-08 01:18:10,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-02-08 01:18:10,303 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:10,303 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-02-08 01:18:10,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 01:18:10,304 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-02-08 01:18:10,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:10,304 INFO L85 PathProgramCache]: Analyzing trace with hash 380540752, now seen corresponding path program 1 times [2025-02-08 01:18:10,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:10,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672846094] [2025-02-08 01:18:10,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:18:10,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:10,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 01:18:10,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 01:18:10,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:18:10,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:10,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:18:10,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:10,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672846094] [2025-02-08 01:18:10,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672846094] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:18:10,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955363922] [2025-02-08 01:18:10,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:18:10,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:18:10,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:18:10,455 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:18:10,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 01:18:10,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 01:18:10,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 01:18:10,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:18:10,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:10,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 01:18:10,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:18:10,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:18:10,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:18:10,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:18:10,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955363922] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 01:18:10,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 01:18:10,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2025-02-08 01:18:10,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435472834] [2025-02-08 01:18:10,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:18:10,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:18:10,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:10,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:18:10,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-08 01:18:10,626 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-02-08 01:18:10,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 113 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-02-08 01:18:10,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:10,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-02-08 01:18:10,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:18:10,767 INFO L124 PetriNetUnfolderBase]: 855/1295 cut-off events. [2025-02-08 01:18:10,769 INFO L125 PetriNetUnfolderBase]: For 505/505 co-relation queries the response was YES. [2025-02-08 01:18:10,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3247 conditions, 1295 events. 855/1295 cut-off events. For 505/505 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5382 event pairs, 256 based on Foata normal form. 0/1230 useless extension candidates. Maximal degree in co-relation 3227. Up to 670 conditions per place. [2025-02-08 01:18:10,776 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 41 selfloop transitions, 5 changer transitions 0/50 dead transitions. [2025-02-08 01:18:10,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 50 transitions, 257 flow [2025-02-08 01:18:10,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:18:10,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:18:10,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2025-02-08 01:18:10,778 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2025-02-08 01:18:10,779 INFO L175 Difference]: Start difference. First operand has 38 places, 34 transitions, 113 flow. Second operand 5 states and 72 transitions. [2025-02-08 01:18:10,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 50 transitions, 257 flow [2025-02-08 01:18:10,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 251 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 01:18:10,782 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 132 flow [2025-02-08 01:18:10,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=132, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2025-02-08 01:18:10,783 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2025-02-08 01:18:10,784 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 132 flow [2025-02-08 01:18:10,784 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-02-08 01:18:10,784 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:10,784 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-02-08 01:18:10,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 01:18:10,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:18:10,985 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-02-08 01:18:10,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:10,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1625612328, now seen corresponding path program 1 times [2025-02-08 01:18:10,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:10,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849344694] [2025-02-08 01:18:10,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:18:10,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:10,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 01:18:11,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 01:18:11,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:18:11,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:11,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:18:11,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:11,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849344694] [2025-02-08 01:18:11,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849344694] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:18:11,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997794757] [2025-02-08 01:18:11,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:18:11,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:18:11,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:18:11,481 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:18:11,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 01:18:11,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 01:18:11,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 01:18:11,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:18:11,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:11,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-08 01:18:11,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:18:11,601 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-02-08 01:18:11,796 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 55 treesize of output 31 [2025-02-08 01:18:11,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:18:11,898 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:18:12,666 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 117 treesize of output 105 [2025-02-08 01:18:12,688 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:18:12,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 149 [2025-02-08 01:18:13,350 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 93 treesize of output 85 [2025-02-08 01:18:13,375 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-02-08 01:18:13,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 103 [2025-02-08 01:18:13,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:18:13,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997794757] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:18:13,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:18:13,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 23 [2025-02-08 01:18:13,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912629331] [2025-02-08 01:18:13,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:18:13,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-08 01:18:13,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:13,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-08 01:18:13,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2025-02-08 01:18:13,840 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-02-08 01:18:13,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 132 flow. Second operand has 24 states, 24 states have (on average 8.666666666666666) internal successors, (208), 24 states have internal predecessors, (208), 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-02-08 01:18:13,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:13,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-02-08 01:18:13,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:18:15,213 INFO L124 PetriNetUnfolderBase]: 1841/2761 cut-off events. [2025-02-08 01:18:15,215 INFO L125 PetriNetUnfolderBase]: For 1721/1721 co-relation queries the response was YES. [2025-02-08 01:18:15,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7669 conditions, 2761 events. 1841/2761 cut-off events. For 1721/1721 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 12699 event pairs, 106 based on Foata normal form. 1/2761 useless extension candidates. Maximal degree in co-relation 5614. Up to 1375 conditions per place. [2025-02-08 01:18:15,231 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 137 selfloop transitions, 57 changer transitions 1/199 dead transitions. [2025-02-08 01:18:15,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 199 transitions, 1067 flow [2025-02-08 01:18:15,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-08 01:18:15,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-02-08 01:18:15,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 321 transitions. [2025-02-08 01:18:15,235 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46320346320346323 [2025-02-08 01:18:15,235 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 132 flow. Second operand 21 states and 321 transitions. [2025-02-08 01:18:15,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 199 transitions, 1067 flow [2025-02-08 01:18:15,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 199 transitions, 1050 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 01:18:15,242 INFO L231 Difference]: Finished difference. Result has 64 places, 91 transitions, 543 flow [2025-02-08 01:18:15,243 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=543, PETRI_PLACES=64, PETRI_TRANSITIONS=91} [2025-02-08 01:18:15,244 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 29 predicate places. [2025-02-08 01:18:15,245 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 91 transitions, 543 flow [2025-02-08 01:18:15,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.666666666666666) internal successors, (208), 24 states have internal predecessors, (208), 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-02-08 01:18:15,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:15,245 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-02-08 01:18:15,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 01:18:15,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:18:15,446 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-02-08 01:18:15,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:15,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1300411264, now seen corresponding path program 2 times [2025-02-08 01:18:15,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:15,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909832309] [2025-02-08 01:18:15,448 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:18:15,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:15,456 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-02-08 01:18:15,482 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 01:18:15,483 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:18:15,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:15,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:18:15,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:15,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909832309] [2025-02-08 01:18:15,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909832309] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:18:15,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290226473] [2025-02-08 01:18:15,918 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:18:15,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:18:15,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:18:15,923 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:18:15,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 01:18:15,963 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-02-08 01:18:15,979 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 01:18:15,979 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:18:15,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:15,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-08 01:18:15,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:18:16,035 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-02-08 01:18:16,273 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 54 treesize of output 30 [2025-02-08 01:18:16,315 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:18:16,316 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:18:17,048 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 117 treesize of output 105 [2025-02-08 01:18:17,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:18:17,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 149 [2025-02-08 01:18:17,639 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 93 treesize of output 85 [2025-02-08 01:18:17,659 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-02-08 01:18:17,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 103 [2025-02-08 01:18:17,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:18:17,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290226473] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:18:17,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:18:17,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2025-02-08 01:18:17,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947973130] [2025-02-08 01:18:17,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:18:17,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-08 01:18:17,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:17,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 01:18:17,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2025-02-08 01:18:18,028 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-02-08 01:18:18,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 91 transitions, 543 flow. Second operand has 21 states, 21 states have (on average 9.80952380952381) internal successors, (206), 21 states have internal predecessors, (206), 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-02-08 01:18:18,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:18,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-02-08 01:18:18,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:18:19,417 INFO L124 PetriNetUnfolderBase]: 2050/3333 cut-off events. [2025-02-08 01:18:19,418 INFO L125 PetriNetUnfolderBase]: For 4846/4846 co-relation queries the response was YES. [2025-02-08 01:18:19,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10794 conditions, 3333 events. 2050/3333 cut-off events. For 4846/4846 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 18097 event pairs, 124 based on Foata normal form. 3/3334 useless extension candidates. Maximal degree in co-relation 10232. Up to 1815 conditions per place. [2025-02-08 01:18:19,439 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 193 selfloop transitions, 121 changer transitions 2/322 dead transitions. [2025-02-08 01:18:19,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 322 transitions, 2167 flow [2025-02-08 01:18:19,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-02-08 01:18:19,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-02-08 01:18:19,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 474 transitions. [2025-02-08 01:18:19,443 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4633431085043988 [2025-02-08 01:18:19,444 INFO L175 Difference]: Start difference. First operand has 64 places, 91 transitions, 543 flow. Second operand 31 states and 474 transitions. [2025-02-08 01:18:19,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 322 transitions, 2167 flow [2025-02-08 01:18:19,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 322 transitions, 1959 flow, removed 77 selfloop flow, removed 3 redundant places. [2025-02-08 01:18:19,460 INFO L231 Difference]: Finished difference. Result has 105 places, 182 transitions, 1307 flow [2025-02-08 01:18:19,461 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=1307, PETRI_PLACES=105, PETRI_TRANSITIONS=182} [2025-02-08 01:18:19,463 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 70 predicate places. [2025-02-08 01:18:19,463 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 182 transitions, 1307 flow [2025-02-08 01:18:19,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 9.80952380952381) internal successors, (206), 21 states have internal predecessors, (206), 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-02-08 01:18:19,463 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:19,464 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-02-08 01:18:19,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 01:18:19,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:18:19,664 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-02-08 01:18:19,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:19,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1331844146, now seen corresponding path program 3 times [2025-02-08 01:18:19,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:19,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189656593] [2025-02-08 01:18:19,665 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:18:19,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:19,675 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-02-08 01:18:19,691 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 01:18:19,691 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 01:18:19,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:20,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:18:20,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:20,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189656593] [2025-02-08 01:18:20,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189656593] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:18:20,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933590657] [2025-02-08 01:18:20,055 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:18:20,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:18:20,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:18:20,057 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:18:20,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 01:18:20,108 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-02-08 01:18:20,124 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 01:18:20,125 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 01:18:20,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:20,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-08 01:18:20,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:18:20,320 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 55 treesize of output 31 [2025-02-08 01:18:20,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:18:20,367 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:18:20,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:18:20,434 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 89 treesize of output 49 [2025-02-08 01:18:20,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:18:20,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933590657] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:18:20,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:18:20,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 21 [2025-02-08 01:18:20,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79487706] [2025-02-08 01:18:20,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:18:20,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-08 01:18:20,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:20,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-08 01:18:20,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2025-02-08 01:18:20,667 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-02-08 01:18:20,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 182 transitions, 1307 flow. Second operand has 22 states, 22 states have (on average 9.681818181818182) internal successors, (213), 22 states have internal predecessors, (213), 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-02-08 01:18:20,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:20,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-02-08 01:18:20,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:18:21,536 INFO L124 PetriNetUnfolderBase]: 2937/4769 cut-off events. [2025-02-08 01:18:21,536 INFO L125 PetriNetUnfolderBase]: For 14204/14224 co-relation queries the response was YES. [2025-02-08 01:18:21,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18565 conditions, 4769 events. 2937/4769 cut-off events. For 14204/14224 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 28158 event pairs, 400 based on Foata normal form. 19/4784 useless extension candidates. Maximal degree in co-relation 17983. Up to 3122 conditions per place. [2025-02-08 01:18:21,575 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 219 selfloop transitions, 104 changer transitions 1/330 dead transitions. [2025-02-08 01:18:21,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 330 transitions, 2821 flow [2025-02-08 01:18:21,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-08 01:18:21,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-02-08 01:18:21,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 323 transitions. [2025-02-08 01:18:21,577 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44490358126721763 [2025-02-08 01:18:21,577 INFO L175 Difference]: Start difference. First operand has 105 places, 182 transitions, 1307 flow. Second operand 22 states and 323 transitions. [2025-02-08 01:18:21,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 330 transitions, 2821 flow [2025-02-08 01:18:21,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 330 transitions, 2688 flow, removed 64 selfloop flow, removed 2 redundant places. [2025-02-08 01:18:21,609 INFO L231 Difference]: Finished difference. Result has 129 places, 243 transitions, 1954 flow [2025-02-08 01:18:21,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1222, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1954, PETRI_PLACES=129, PETRI_TRANSITIONS=243} [2025-02-08 01:18:21,610 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 94 predicate places. [2025-02-08 01:18:21,610 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 243 transitions, 1954 flow [2025-02-08 01:18:21,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.681818181818182) internal successors, (213), 22 states have internal predecessors, (213), 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-02-08 01:18:21,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:21,610 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-02-08 01:18:21,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 01:18:21,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-02-08 01:18:21,811 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-02-08 01:18:21,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:21,811 INFO L85 PathProgramCache]: Analyzing trace with hash 565926660, now seen corresponding path program 4 times [2025-02-08 01:18:21,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:21,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821644576] [2025-02-08 01:18:21,811 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:18:21,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:21,821 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-02-08 01:18:21,831 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 01:18:21,831 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:18:21,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:22,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:18:22,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:22,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821644576] [2025-02-08 01:18:22,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821644576] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:18:22,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457044261] [2025-02-08 01:18:22,124 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:18:22,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:18:22,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:18:22,127 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:18:22,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 01:18:22,166 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-02-08 01:18:22,182 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 01:18:22,182 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:18:22,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:22,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-08 01:18:22,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:18:22,344 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 55 treesize of output 31 [2025-02-08 01:18:22,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:18:22,385 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:18:22,441 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:18:22,442 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 89 treesize of output 49 [2025-02-08 01:18:22,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:18:22,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457044261] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:18:22,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:18:22,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 24 [2025-02-08 01:18:22,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972841019] [2025-02-08 01:18:22,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:18:22,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-08 01:18:22,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:22,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-08 01:18:22,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2025-02-08 01:18:22,655 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-02-08 01:18:22,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 243 transitions, 1954 flow. Second operand has 25 states, 25 states have (on average 8.52) internal successors, (213), 25 states have internal predecessors, (213), 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-02-08 01:18:22,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:22,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-02-08 01:18:22,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:18:23,663 INFO L124 PetriNetUnfolderBase]: 4642/7254 cut-off events. [2025-02-08 01:18:23,663 INFO L125 PetriNetUnfolderBase]: For 24829/24845 co-relation queries the response was YES. [2025-02-08 01:18:23,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30315 conditions, 7254 events. 4642/7254 cut-off events. For 24829/24845 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 43868 event pairs, 677 based on Foata normal form. 13/7265 useless extension candidates. Maximal degree in co-relation 29437. Up to 5406 conditions per place. [2025-02-08 01:18:23,709 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 266 selfloop transitions, 194 changer transitions 1/466 dead transitions. [2025-02-08 01:18:23,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 466 transitions, 4565 flow [2025-02-08 01:18:23,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 01:18:23,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-08 01:18:23,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 192 transitions. [2025-02-08 01:18:23,711 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3878787878787879 [2025-02-08 01:18:23,711 INFO L175 Difference]: Start difference. First operand has 129 places, 243 transitions, 1954 flow. Second operand 15 states and 192 transitions. [2025-02-08 01:18:23,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 466 transitions, 4565 flow [2025-02-08 01:18:23,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 466 transitions, 4431 flow, removed 9 selfloop flow, removed 12 redundant places. [2025-02-08 01:18:23,782 INFO L231 Difference]: Finished difference. Result has 140 places, 386 transitions, 3893 flow [2025-02-08 01:18:23,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1844, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3893, PETRI_PLACES=140, PETRI_TRANSITIONS=386} [2025-02-08 01:18:23,783 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 105 predicate places. [2025-02-08 01:18:23,783 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 386 transitions, 3893 flow [2025-02-08 01:18:23,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.52) internal successors, (213), 25 states have internal predecessors, (213), 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-02-08 01:18:23,784 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:23,784 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-02-08 01:18:23,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 01:18:23,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:18:23,985 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-02-08 01:18:23,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:23,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1890032000, now seen corresponding path program 5 times [2025-02-08 01:18:23,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:23,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118875720] [2025-02-08 01:18:23,985 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:18:23,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:23,991 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-02-08 01:18:23,999 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 01:18:24,000 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:18:24,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:24,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:18:24,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:24,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118875720] [2025-02-08 01:18:24,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118875720] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:18:24,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660347090] [2025-02-08 01:18:24,403 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:18:24,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:18:24,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:18:24,405 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:18:24,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 01:18:24,441 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-02-08 01:18:24,457 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 01:18:24,457 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:18:24,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:24,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-08 01:18:24,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:18:24,481 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-02-08 01:18:24,591 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 54 treesize of output 30 [2025-02-08 01:18:24,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:18:24,628 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:18:25,200 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 66 treesize of output 58 [2025-02-08 01:18:25,207 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-08 01:18:25,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 100 treesize of output 79 [2025-02-08 01:18:25,244 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 53 treesize of output 47 [2025-02-08 01:18:25,251 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 01:18:25,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 64 treesize of output 54 [2025-02-08 01:18:25,338 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 69 treesize of output 61 [2025-02-08 01:18:25,349 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 01:18:25,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 83 treesize of output 75 [2025-02-08 01:18:25,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:18:25,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660347090] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:18:25,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:18:25,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 22 [2025-02-08 01:18:25,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825725051] [2025-02-08 01:18:25,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:18:25,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-08 01:18:25,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:25,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-08 01:18:25,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2025-02-08 01:18:25,581 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-02-08 01:18:25,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 386 transitions, 3893 flow. Second operand has 23 states, 23 states have (on average 8.695652173913043) internal successors, (200), 23 states have internal predecessors, (200), 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-02-08 01:18:25,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:25,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-02-08 01:18:25,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:18:27,536 INFO L124 PetriNetUnfolderBase]: 5562/8828 cut-off events. [2025-02-08 01:18:27,537 INFO L125 PetriNetUnfolderBase]: For 41142/41174 co-relation queries the response was YES. [2025-02-08 01:18:27,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41569 conditions, 8828 events. 5562/8828 cut-off events. For 41142/41174 co-relation queries the response was YES. Maximal size of possible extension queue 521. Compared 56080 event pairs, 806 based on Foata normal form. 12/8838 useless extension candidates. Maximal degree in co-relation 40903. Up to 5025 conditions per place. [2025-02-08 01:18:27,604 INFO L140 encePairwiseOnDemand]: 19/33 looper letters, 318 selfloop transitions, 328 changer transitions 1/652 dead transitions. [2025-02-08 01:18:27,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 652 transitions, 7318 flow [2025-02-08 01:18:27,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-02-08 01:18:27,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-02-08 01:18:27,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 462 transitions. [2025-02-08 01:18:27,606 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2025-02-08 01:18:27,606 INFO L175 Difference]: Start difference. First operand has 140 places, 386 transitions, 3893 flow. Second operand 33 states and 462 transitions. [2025-02-08 01:18:27,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 652 transitions, 7318 flow [2025-02-08 01:18:27,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 652 transitions, 7157 flow, removed 53 selfloop flow, removed 2 redundant places. [2025-02-08 01:18:27,711 INFO L231 Difference]: Finished difference. Result has 184 places, 523 transitions, 6330 flow [2025-02-08 01:18:27,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3774, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=213, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=6330, PETRI_PLACES=184, PETRI_TRANSITIONS=523} [2025-02-08 01:18:27,712 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 149 predicate places. [2025-02-08 01:18:27,712 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 523 transitions, 6330 flow [2025-02-08 01:18:27,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.695652173913043) internal successors, (200), 23 states have internal predecessors, (200), 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-02-08 01:18:27,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:27,712 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-02-08 01:18:27,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 01:18:27,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-02-08 01:18:27,916 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-02-08 01:18:27,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:27,917 INFO L85 PathProgramCache]: Analyzing trace with hash -2037868248, now seen corresponding path program 6 times [2025-02-08 01:18:27,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:27,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986696199] [2025-02-08 01:18:27,917 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:18:27,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:27,922 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-02-08 01:18:27,928 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 25 of 26 statements. [2025-02-08 01:18:27,928 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 01:18:27,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:28,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:18:28,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:28,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986696199] [2025-02-08 01:18:28,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986696199] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:18:28,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:18:28,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:18:28,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130912896] [2025-02-08 01:18:28,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:18:28,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:18:28,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:28,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:18:28,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:18:28,242 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-02-08 01:18:28,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 523 transitions, 6330 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 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-02-08 01:18:28,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:28,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-02-08 01:18:28,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:18:30,167 INFO L124 PetriNetUnfolderBase]: 10387/15001 cut-off events. [2025-02-08 01:18:30,168 INFO L125 PetriNetUnfolderBase]: For 89744/90426 co-relation queries the response was YES. [2025-02-08 01:18:30,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76648 conditions, 15001 events. 10387/15001 cut-off events. For 89744/90426 co-relation queries the response was YES. Maximal size of possible extension queue 677. Compared 87089 event pairs, 1222 based on Foata normal form. 612/15574 useless extension candidates. Maximal degree in co-relation 75473. Up to 9975 conditions per place. [2025-02-08 01:18:30,262 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 400 selfloop transitions, 476 changer transitions 1/880 dead transitions. [2025-02-08 01:18:30,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 880 transitions, 12130 flow [2025-02-08 01:18:30,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 01:18:30,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-08 01:18:30,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 206 transitions. [2025-02-08 01:18:30,264 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4161616161616162 [2025-02-08 01:18:30,264 INFO L175 Difference]: Start difference. First operand has 184 places, 523 transitions, 6330 flow. Second operand 15 states and 206 transitions. [2025-02-08 01:18:30,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 880 transitions, 12130 flow [2025-02-08 01:18:30,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 880 transitions, 11523 flow, removed 254 selfloop flow, removed 9 redundant places. [2025-02-08 01:18:30,597 INFO L231 Difference]: Finished difference. Result has 198 places, 790 transitions, 11199 flow [2025-02-08 01:18:30,597 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=5922, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=523, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=225, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=11199, PETRI_PLACES=198, PETRI_TRANSITIONS=790} [2025-02-08 01:18:30,598 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 163 predicate places. [2025-02-08 01:18:30,598 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 790 transitions, 11199 flow [2025-02-08 01:18:30,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 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-02-08 01:18:30,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:30,598 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-02-08 01:18:30,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 01:18:30,598 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-02-08 01:18:30,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:30,599 INFO L85 PathProgramCache]: Analyzing trace with hash 920428136, now seen corresponding path program 7 times [2025-02-08 01:18:30,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:30,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550200108] [2025-02-08 01:18:30,599 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:18:30,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:30,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 01:18:30,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 01:18:30,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:18:30,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:30,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:18:30,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:30,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550200108] [2025-02-08 01:18:30,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550200108] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:18:30,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063958680] [2025-02-08 01:18:30,881 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:18:30,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:18:30,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:18:30,883 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:18:30,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 01:18:31,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 01:18:31,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 01:18:31,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:18:31,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:31,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-08 01:18:31,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:18:31,046 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-02-08 01:18:31,179 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 55 treesize of output 31 [2025-02-08 01:18:31,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:18:31,222 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:18:31,714 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 66 treesize of output 58 [2025-02-08 01:18:31,732 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-08 01:18:31,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 100 treesize of output 79 [2025-02-08 01:18:31,821 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 53 treesize of output 47 [2025-02-08 01:18:31,838 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 01:18:31,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 64 treesize of output 54 [2025-02-08 01:18:31,942 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 69 treesize of output 61 [2025-02-08 01:18:31,961 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 01:18:31,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 83 treesize of output 75 [2025-02-08 01:18:32,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:18:32,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063958680] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:18:32,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:18:32,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 24 [2025-02-08 01:18:32,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448524301] [2025-02-08 01:18:32,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:18:32,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-08 01:18:32,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:32,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-08 01:18:32,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2025-02-08 01:18:32,348 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-02-08 01:18:32,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 790 transitions, 11199 flow. Second operand has 25 states, 25 states have (on average 8.64) internal successors, (216), 25 states have internal predecessors, (216), 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-02-08 01:18:32,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:32,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-02-08 01:18:32,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:18:35,311 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([337] L47-->L46-3: Formula: (let ((.cse0 (select (select |v_#memory_int#1_51| v_~A~0.base_63) (+ v_~A~0.offset_63 (* v_thread1Thread1of1ForFork1_~i~0_7 4))))) (or (and (< v_~max1~0_29 .cse0) (= v_~max1~0_28 .cse0)) (and (= |v_thread1Thread1of1ForFork1_#t~mem2_2| |v_thread1Thread1of1ForFork1_#t~mem2_1|) (= v_~max1~0_29 v_~max1~0_28) (<= .cse0 v_~max1~0_29)))) InVars {~max1~0=v_~max1~0_29, ~A~0.base=v_~A~0.base_63, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_7, ~A~0.offset=v_~A~0.offset_63, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_1|, #memory_int#1=|v_#memory_int#1_51|} OutVars{~max1~0=v_~max1~0_28, ~A~0.base=v_~A~0.base_63, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_1|, ~A~0.offset=v_~A~0.offset_63, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_2|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_7, #memory_int#1=|v_#memory_int#1_51|} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2][259], [Black: 909#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), Black: 1022#(and (or (and (= ~max1~0 ~A~0.offset) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 ~max1~0) (= thread1Thread1of1ForFork1_~i~0 0) (or (= ~max2~0 0) (< 0 ~max2~0))), Black: 1020#(and (or (and (= ~max2~0 0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 0)) (and (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= 1 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= thread3Thread1of1ForFork2_~i~2 0) (or (= ~A~0.offset 0) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1014#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1028#(and (or (= ~max1~0 0) (< 0 ~max2~0)) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 ~max1~0)), Black: 989#(or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (and (= ~max2~0 ~max1~0) (= ~M~0 0))), Black: 1016#(and (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1026#(and (or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))) (or (and (= ~max1~0 ~A~0.offset) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1282#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= ~max2~0 ~max1~0)), Black: 1289#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1295#(and (= ~A~0.offset 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= 0 thread3Thread1of1ForFork2_~i~2) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0))) (or (< 0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (= ~max2~0 0)) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (< (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)) 1)) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1279#(and (= ~A~0.offset 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= 0 thread3Thread1of1ForFork2_~i~2) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0))) (or (< 0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (= ~max2~0 0)) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (< (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)) 1)) (= ~max1~0 0)), Black: 1297#(and (or (= ~max2~0 0) (< 0 ~N~0)) (= ~A~0.offset 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= 0 thread3Thread1of1ForFork2_~i~2) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0))) (or (< 0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (= ~max2~0 0)) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (< (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)) 1)) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1283#(= ~max2~0 ~max1~0), Black: 1281#(and (or (= ~max2~0 ~max1~0) (< 1 ~N~0)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 408#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), Black: 1287#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= 0 thread3Thread1of1ForFork2_~i~2)), 21#L46-3true, Black: 378#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 347#(and (or (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0))) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 48#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 637#true, 1307#true, Black: 52#(<= (+ ~M~0 1) ~N~0), 12#L71true, 11#L94-1true, Black: 709#(or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))), Black: 826#(and (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0) (= thread1Thread1of1ForFork1_~i~0 0) (or (= ~max1~0 0) (< 0 ~max1~0))), Black: 645#(and (= (select (select |#memory_int#1| ~A~0.base) 0) (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (= ~A~0.offset 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (or (and (<= (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)) 0) (= ~max2~0 0)) (and (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (<= 1 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)))))), Black: 643#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 646#(and (= ~A~0.offset 0) (or (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max2~0 0)) (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) 0)))) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 61#(<= 1 ~N~0), 1038#true, 1273#true, 834#true, 29#L59true, Black: 1236#(and (<= 0 ~M~0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (or (< 0 ~M~0) (= thread3Thread1of1ForFork2_~i~2 0))), Black: 1224#(and (<= 0 ~M~0) (= ~max2~0 0) (= ~max1~0 0) (or (< 0 ~M~0) (= thread3Thread1of1ForFork2_~i~2 0))), Black: 1218#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1238#(and (<= 0 ~M~0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (or (< 0 ~M~0) (= thread3Thread1of1ForFork2_~i~2 0))), 203#true, Black: 1048#(and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= ~max1~0 0) (or (< 0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 0)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 418#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 592#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 1250#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0) (= thread1Thread1of1ForFork1_~i~0 0) (or (= ~max2~0 0) (< 0 ~max2~0))), Black: 612#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0) (or (= ~max2~0 0) (< 0 ~max1~0))), Black: 1226#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 602#(and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0)), Black: 1232#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (or (and (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)) (= ~max1~0 0) (or (< 0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 0)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 622#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0)), Black: 1230#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)))) (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)))), Black: 1228#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1))) (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))), Black: 422#(and (or (< 0 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 0)) (= ~A~0.offset 0) (= ~max2~0 0) (or (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< (select (select |#memory_int#1| ~A~0.base) 0) 1)) (= ~M~0 0)), Black: 1222#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), 414#true, Black: 586#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1234#(and (<= 0 ~M~0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (or (< 0 ~M~0) (= thread3Thread1of1ForFork2_~i~2 0))), Black: 588#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 1220#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 417#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 1258#(and (or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), Black: 552#(and (or (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0))) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 590#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 421#(and (or (< 0 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 0)) (= ~A~0.offset 0) (= ~max2~0 0) (or (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< (select (select |#memory_int#1| ~A~0.base) 0) 1)) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 596#(and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~max1~0))]) [2025-02-08 01:18:35,316 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-02-08 01:18:35,316 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-02-08 01:18:35,316 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-02-08 01:18:35,316 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-02-08 01:18:35,316 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([342] L59-->L58-3: Formula: (let ((.cse0 (select (select |v_#memory_int#1_59| v_~A~0.base_83) (+ (* v_thread2Thread1of1ForFork0_~i~1_7 4) v_~A~0.offset_83)))) (or (and (< v_~max2~0_62 .cse0) (= v_~max2~0_61 .cse0)) (and (= v_~max2~0_62 v_~max2~0_61) (= |v_thread2Thread1of1ForFork0_#t~mem5_2| |v_thread2Thread1of1ForFork0_#t~mem5_1|) (<= .cse0 v_~max2~0_62)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_7, ~A~0.base=v_~A~0.base_83, ~A~0.offset=v_~A~0.offset_83, #memory_int#1=|v_#memory_int#1_59|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_1|, ~max2~0=v_~max2~0_62} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_7, ~A~0.base=v_~A~0.base_83, ~A~0.offset=v_~A~0.offset_83, ~max2~0=v_~max2~0_61, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_1|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_2|, #memory_int#1=|v_#memory_int#1_59|} AuxVars[] AssignedVars[~max2~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5][260], [Black: 909#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), Black: 1022#(and (or (and (= ~max1~0 ~A~0.offset) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 ~max1~0) (= thread1Thread1of1ForFork1_~i~0 0) (or (= ~max2~0 0) (< 0 ~max2~0))), Black: 1020#(and (or (and (= ~max2~0 0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 0)) (and (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= 1 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= thread3Thread1of1ForFork2_~i~2 0) (or (= ~A~0.offset 0) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1014#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1028#(and (or (= ~max1~0 0) (< 0 ~max2~0)) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 ~max1~0)), Black: 989#(or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (and (= ~max2~0 ~max1~0) (= ~M~0 0))), Black: 1016#(and (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1026#(and (or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))) (or (and (= ~max1~0 ~A~0.offset) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1282#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= ~max2~0 ~max1~0)), Black: 1289#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1295#(and (= ~A~0.offset 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= 0 thread3Thread1of1ForFork2_~i~2) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0))) (or (< 0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (= ~max2~0 0)) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (< (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)) 1)) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1279#(and (= ~A~0.offset 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= 0 thread3Thread1of1ForFork2_~i~2) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0))) (or (< 0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (= ~max2~0 0)) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (< (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)) 1)) (= ~max1~0 0)), Black: 1297#(and (or (= ~max2~0 0) (< 0 ~N~0)) (= ~A~0.offset 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= 0 thread3Thread1of1ForFork2_~i~2) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0))) (or (< 0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (= ~max2~0 0)) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (< (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)) 1)) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1283#(= ~max2~0 ~max1~0), Black: 1281#(and (or (= ~max2~0 ~max1~0) (< 1 ~N~0)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 408#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), Black: 1287#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 378#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 347#(and (or (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0))) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), 9#L47true, Black: 48#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 637#true, 1307#true, Black: 52#(<= (+ ~M~0 1) ~N~0), 12#L71true, 11#L94-1true, Black: 709#(or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))), Black: 826#(and (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0) (= thread1Thread1of1ForFork1_~i~0 0) (or (= ~max1~0 0) (< 0 ~max1~0))), Black: 645#(and (= (select (select |#memory_int#1| ~A~0.base) 0) (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (= ~A~0.offset 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (or (and (<= (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)) 0) (= ~max2~0 0)) (and (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (<= 1 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)))))), Black: 643#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 646#(and (= ~A~0.offset 0) (or (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max2~0 0)) (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) 0)))) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 61#(<= 1 ~N~0), 1038#true, 1273#true, 834#true, 19#L58-3true, Black: 1236#(and (<= 0 ~M~0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (or (< 0 ~M~0) (= thread3Thread1of1ForFork2_~i~2 0))), Black: 1224#(and (<= 0 ~M~0) (= ~max2~0 0) (= ~max1~0 0) (or (< 0 ~M~0) (= thread3Thread1of1ForFork2_~i~2 0))), Black: 1218#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1238#(and (<= 0 ~M~0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (or (< 0 ~M~0) (= thread3Thread1of1ForFork2_~i~2 0))), 203#true, Black: 1048#(and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= ~max1~0 0) (or (< 0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 0)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 418#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 592#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 1250#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0) (= thread1Thread1of1ForFork1_~i~0 0) (or (= ~max2~0 0) (< 0 ~max2~0))), Black: 612#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0) (or (= ~max2~0 0) (< 0 ~max1~0))), Black: 1226#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 602#(and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0)), Black: 1232#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (or (and (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)) (= ~max1~0 0) (or (< 0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 0)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 622#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0)), Black: 1230#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)))) (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)))), Black: 1228#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1))) (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))), Black: 422#(and (or (< 0 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 0)) (= ~A~0.offset 0) (= ~max2~0 0) (or (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< (select (select |#memory_int#1| ~A~0.base) 0) 1)) (= ~M~0 0)), Black: 1222#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), 414#true, Black: 586#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1234#(and (<= 0 ~M~0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (or (< 0 ~M~0) (= thread3Thread1of1ForFork2_~i~2 0))), Black: 588#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 1220#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 417#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 1258#(and (or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), Black: 552#(and (or (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0))) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 590#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 421#(and (or (< 0 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 0)) (= ~A~0.offset 0) (= ~max2~0 0) (or (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< (select (select |#memory_int#1| ~A~0.base) 0) 1)) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 596#(and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~max1~0))]) [2025-02-08 01:18:35,318 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-02-08 01:18:35,318 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-02-08 01:18:35,318 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-02-08 01:18:35,318 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-02-08 01:18:35,318 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([347] L71-->L70-3: Formula: (let ((.cse0 (select (select |v_#memory_int#1_55| v_~A~0.base_71) (+ v_~A~0.offset_71 (* v_thread3Thread1of1ForFork2_~i~2_7 4))))) (or (and (= v_~max2~0_49 .cse0) (< v_~max2~0_50 .cse0)) (and (<= .cse0 v_~max2~0_50) (= v_~max2~0_49 v_~max2~0_50) (= |v_thread3Thread1of1ForFork2_#t~mem8_2| |v_thread3Thread1of1ForFork2_#t~mem8_1|)))) InVars {thread3Thread1of1ForFork2_#t~mem8=|v_thread3Thread1of1ForFork2_#t~mem8_1|, ~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, #memory_int#1=|v_#memory_int#1_55|, ~max2~0=v_~max2~0_50, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} OutVars{~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, ~max2~0=v_~max2~0_49, thread3Thread1of1ForFork2_#t~mem8=|v_thread3Thread1of1ForFork2_#t~mem8_2|, thread3Thread1of1ForFork2_#t~mem7=|v_thread3Thread1of1ForFork2_#t~mem7_1|, #memory_int#1=|v_#memory_int#1_55|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} AuxVars[] AssignedVars[~max2~0, thread3Thread1of1ForFork2_#t~mem8, thread3Thread1of1ForFork2_#t~mem7][583], [Black: 909#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), Black: 1022#(and (or (and (= ~max1~0 ~A~0.offset) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 ~max1~0) (= thread1Thread1of1ForFork1_~i~0 0) (or (= ~max2~0 0) (< 0 ~max2~0))), Black: 1020#(and (or (and (= ~max2~0 0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 0)) (and (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= 1 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= thread3Thread1of1ForFork2_~i~2 0) (or (= ~A~0.offset 0) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1014#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1028#(and (or (= ~max1~0 0) (< 0 ~max2~0)) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 ~max1~0)), Black: 989#(or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (and (= ~max2~0 ~max1~0) (= ~M~0 0))), Black: 1016#(and (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1026#(and (or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))) (or (and (= ~max1~0 ~A~0.offset) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1282#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= ~max2~0 ~max1~0)), Black: 1289#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1295#(and (= ~A~0.offset 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= 0 thread3Thread1of1ForFork2_~i~2) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0))) (or (< 0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (= ~max2~0 0)) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (< (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)) 1)) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1279#(and (= ~A~0.offset 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= 0 thread3Thread1of1ForFork2_~i~2) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0))) (or (< 0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (= ~max2~0 0)) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (< (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)) 1)) (= ~max1~0 0)), Black: 1297#(and (or (= ~max2~0 0) (< 0 ~N~0)) (= ~A~0.offset 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= 0 thread3Thread1of1ForFork2_~i~2) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0))) (or (< 0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (= ~max2~0 0)) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (< (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)) 1)) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1283#(= ~max2~0 ~max1~0), Black: 1281#(and (or (= ~max2~0 ~max1~0) (< 1 ~N~0)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 408#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), Black: 1287#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 378#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 347#(and (or (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0))) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), 9#L47true, Black: 48#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 637#true, 1307#true, Black: 52#(<= (+ ~M~0 1) ~N~0), 11#L94-1true, Black: 709#(or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))), Black: 826#(and (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0) (= thread1Thread1of1ForFork1_~i~0 0) (or (= ~max1~0 0) (< 0 ~max1~0))), Black: 645#(and (= (select (select |#memory_int#1| ~A~0.base) 0) (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (= ~A~0.offset 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (or (and (<= (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)) 0) (= ~max2~0 0)) (and (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (<= 1 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)))))), Black: 643#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 646#(and (= ~A~0.offset 0) (or (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max2~0 0)) (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) 0)))) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 61#(<= 1 ~N~0), 1038#true, 1273#true, 834#true, 29#L59true, Black: 1236#(and (<= 0 ~M~0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (or (< 0 ~M~0) (= thread3Thread1of1ForFork2_~i~2 0))), Black: 1224#(and (<= 0 ~M~0) (= ~max2~0 0) (= ~max1~0 0) (or (< 0 ~M~0) (= thread3Thread1of1ForFork2_~i~2 0))), Black: 1218#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1238#(and (<= 0 ~M~0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (or (< 0 ~M~0) (= thread3Thread1of1ForFork2_~i~2 0))), 203#true, Black: 1048#(and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= ~max1~0 0) (or (< 0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 0)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 418#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 592#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 1250#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0) (= thread1Thread1of1ForFork1_~i~0 0) (or (= ~max2~0 0) (< 0 ~max2~0))), Black: 612#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0) (or (= ~max2~0 0) (< 0 ~max1~0))), Black: 1226#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), 34#L70-3true, Black: 602#(and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0)), Black: 1232#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (or (and (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)) (= ~max1~0 0) (or (< 0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 0)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 622#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0)), Black: 1230#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)))) (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)))), Black: 1228#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1))) (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))), Black: 422#(and (or (< 0 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 0)) (= ~A~0.offset 0) (= ~max2~0 0) (or (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< (select (select |#memory_int#1| ~A~0.base) 0) 1)) (= ~M~0 0)), Black: 1222#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), 414#true, Black: 586#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1234#(and (<= 0 ~M~0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (or (< 0 ~M~0) (= thread3Thread1of1ForFork2_~i~2 0))), Black: 588#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 1220#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 417#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 1258#(and (or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), Black: 552#(and (or (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0))) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 590#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 421#(and (or (< 0 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 0)) (= ~A~0.offset 0) (= ~max2~0 0) (or (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< (select (select |#memory_int#1| ~A~0.base) 0) 1)) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 596#(and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~max1~0))]) [2025-02-08 01:18:35,319 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-02-08 01:18:35,319 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-02-08 01:18:35,319 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-02-08 01:18:35,319 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-02-08 01:18:35,481 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([337] L47-->L46-3: Formula: (let ((.cse0 (select (select |v_#memory_int#1_51| v_~A~0.base_63) (+ v_~A~0.offset_63 (* v_thread1Thread1of1ForFork1_~i~0_7 4))))) (or (and (< v_~max1~0_29 .cse0) (= v_~max1~0_28 .cse0)) (and (= |v_thread1Thread1of1ForFork1_#t~mem2_2| |v_thread1Thread1of1ForFork1_#t~mem2_1|) (= v_~max1~0_29 v_~max1~0_28) (<= .cse0 v_~max1~0_29)))) InVars {~max1~0=v_~max1~0_29, ~A~0.base=v_~A~0.base_63, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_7, ~A~0.offset=v_~A~0.offset_63, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_1|, #memory_int#1=|v_#memory_int#1_51|} OutVars{~max1~0=v_~max1~0_28, ~A~0.base=v_~A~0.base_63, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_1|, ~A~0.offset=v_~A~0.offset_63, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_2|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_7, #memory_int#1=|v_#memory_int#1_51|} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2][259], [Black: 909#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), Black: 1022#(and (or (and (= ~max1~0 ~A~0.offset) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 ~max1~0) (= thread1Thread1of1ForFork1_~i~0 0) (or (= ~max2~0 0) (< 0 ~max2~0))), Black: 1020#(and (or (and (= ~max2~0 0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 0)) (and (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= 1 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= thread3Thread1of1ForFork2_~i~2 0) (or (= ~A~0.offset 0) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1014#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1028#(and (or (= ~max1~0 0) (< 0 ~max2~0)) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 ~max1~0)), Black: 989#(or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (and (= ~max2~0 ~max1~0) (= ~M~0 0))), Black: 1016#(and (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1026#(and (or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))) (or (and (= ~max1~0 ~A~0.offset) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1282#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= ~max2~0 ~max1~0)), Black: 1289#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1295#(and (= ~A~0.offset 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= 0 thread3Thread1of1ForFork2_~i~2) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0))) (or (< 0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (= ~max2~0 0)) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (< (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)) 1)) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1279#(and (= ~A~0.offset 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= 0 thread3Thread1of1ForFork2_~i~2) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0))) (or (< 0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (= ~max2~0 0)) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (< (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)) 1)) (= ~max1~0 0)), Black: 1297#(and (or (= ~max2~0 0) (< 0 ~N~0)) (= ~A~0.offset 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= 0 thread3Thread1of1ForFork2_~i~2) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0))) (or (< 0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (= ~max2~0 0)) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (< (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)) 1)) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1283#(= ~max2~0 ~max1~0), Black: 1281#(and (or (= ~max2~0 ~max1~0) (< 1 ~N~0)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 408#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), Black: 1287#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= 0 thread3Thread1of1ForFork2_~i~2)), 21#L46-3true, Black: 378#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 347#(and (or (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0))) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 48#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 25#L95true, 637#true, 1307#true, Black: 52#(<= (+ ~M~0 1) ~N~0), 12#L71true, Black: 709#(or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))), Black: 826#(and (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0) (= thread1Thread1of1ForFork1_~i~0 0) (or (= ~max1~0 0) (< 0 ~max1~0))), Black: 645#(and (= (select (select |#memory_int#1| ~A~0.base) 0) (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (= ~A~0.offset 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (or (and (<= (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)) 0) (= ~max2~0 0)) (and (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (<= 1 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)))))), Black: 643#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 646#(and (= ~A~0.offset 0) (or (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max2~0 0)) (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) 0)))) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 61#(<= 1 ~N~0), 1038#true, 1273#true, 834#true, 29#L59true, Black: 1236#(and (<= 0 ~M~0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (or (< 0 ~M~0) (= thread3Thread1of1ForFork2_~i~2 0))), Black: 1224#(and (<= 0 ~M~0) (= ~max2~0 0) (= ~max1~0 0) (or (< 0 ~M~0) (= thread3Thread1of1ForFork2_~i~2 0))), Black: 1218#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1238#(and (<= 0 ~M~0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (or (< 0 ~M~0) (= thread3Thread1of1ForFork2_~i~2 0))), 203#true, Black: 1048#(and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= ~max1~0 0) (or (< 0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 0)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 418#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 592#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 1250#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0) (= thread1Thread1of1ForFork1_~i~0 0) (or (= ~max2~0 0) (< 0 ~max2~0))), Black: 612#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0) (or (= ~max2~0 0) (< 0 ~max1~0))), Black: 1226#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 602#(and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0)), Black: 1232#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (or (and (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)) (= ~max1~0 0) (or (< 0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 0)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 622#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0)), Black: 1230#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)))) (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)))), Black: 1228#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1))) (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))), Black: 422#(and (or (< 0 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 0)) (= ~A~0.offset 0) (= ~max2~0 0) (or (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< (select (select |#memory_int#1| ~A~0.base) 0) 1)) (= ~M~0 0)), Black: 1222#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), 414#true, Black: 586#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1234#(and (<= 0 ~M~0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (or (< 0 ~M~0) (= thread3Thread1of1ForFork2_~i~2 0))), Black: 588#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 1220#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 417#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 1258#(and (or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), Black: 552#(and (or (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0))) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 590#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 421#(and (or (< 0 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 0)) (= ~A~0.offset 0) (= ~max2~0 0) (or (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< (select (select |#memory_int#1| ~A~0.base) 0) 1)) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 596#(and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~max1~0))]) [2025-02-08 01:18:35,482 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-02-08 01:18:35,482 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:18:35,482 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:18:35,482 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:18:35,482 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([342] L59-->L58-3: Formula: (let ((.cse0 (select (select |v_#memory_int#1_59| v_~A~0.base_83) (+ (* v_thread2Thread1of1ForFork0_~i~1_7 4) v_~A~0.offset_83)))) (or (and (< v_~max2~0_62 .cse0) (= v_~max2~0_61 .cse0)) (and (= v_~max2~0_62 v_~max2~0_61) (= |v_thread2Thread1of1ForFork0_#t~mem5_2| |v_thread2Thread1of1ForFork0_#t~mem5_1|) (<= .cse0 v_~max2~0_62)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_7, ~A~0.base=v_~A~0.base_83, ~A~0.offset=v_~A~0.offset_83, #memory_int#1=|v_#memory_int#1_59|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_1|, ~max2~0=v_~max2~0_62} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_7, ~A~0.base=v_~A~0.base_83, ~A~0.offset=v_~A~0.offset_83, ~max2~0=v_~max2~0_61, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_1|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_2|, #memory_int#1=|v_#memory_int#1_59|} AuxVars[] AssignedVars[~max2~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5][260], [Black: 909#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), Black: 1022#(and (or (and (= ~max1~0 ~A~0.offset) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 ~max1~0) (= thread1Thread1of1ForFork1_~i~0 0) (or (= ~max2~0 0) (< 0 ~max2~0))), Black: 1020#(and (or (and (= ~max2~0 0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 0)) (and (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= 1 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= thread3Thread1of1ForFork2_~i~2 0) (or (= ~A~0.offset 0) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1014#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1028#(and (or (= ~max1~0 0) (< 0 ~max2~0)) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 ~max1~0)), Black: 989#(or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (and (= ~max2~0 ~max1~0) (= ~M~0 0))), Black: 1016#(and (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1026#(and (or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))) (or (and (= ~max1~0 ~A~0.offset) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1282#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= ~max2~0 ~max1~0)), Black: 1289#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1295#(and (= ~A~0.offset 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= 0 thread3Thread1of1ForFork2_~i~2) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0))) (or (< 0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (= ~max2~0 0)) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (< (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)) 1)) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1279#(and (= ~A~0.offset 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= 0 thread3Thread1of1ForFork2_~i~2) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0))) (or (< 0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (= ~max2~0 0)) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (< (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)) 1)) (= ~max1~0 0)), Black: 1297#(and (or (= ~max2~0 0) (< 0 ~N~0)) (= ~A~0.offset 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= 0 thread3Thread1of1ForFork2_~i~2) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0))) (or (< 0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (= ~max2~0 0)) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (< (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)) 1)) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1283#(= ~max2~0 ~max1~0), Black: 1281#(and (or (= ~max2~0 ~max1~0) (< 1 ~N~0)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 408#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), Black: 1287#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 378#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 347#(and (or (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0))) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), 9#L47true, Black: 48#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 25#L95true, 637#true, 1307#true, Black: 52#(<= (+ ~M~0 1) ~N~0), 12#L71true, Black: 709#(or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))), Black: 826#(and (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0) (= thread1Thread1of1ForFork1_~i~0 0) (or (= ~max1~0 0) (< 0 ~max1~0))), Black: 645#(and (= (select (select |#memory_int#1| ~A~0.base) 0) (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (= ~A~0.offset 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (or (and (<= (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)) 0) (= ~max2~0 0)) (and (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (<= 1 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)))))), Black: 643#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 646#(and (= ~A~0.offset 0) (or (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max2~0 0)) (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) 0)))) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 61#(<= 1 ~N~0), 1038#true, 1273#true, 19#L58-3true, 834#true, Black: 1236#(and (<= 0 ~M~0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (or (< 0 ~M~0) (= thread3Thread1of1ForFork2_~i~2 0))), Black: 1224#(and (<= 0 ~M~0) (= ~max2~0 0) (= ~max1~0 0) (or (< 0 ~M~0) (= thread3Thread1of1ForFork2_~i~2 0))), Black: 1218#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1238#(and (<= 0 ~M~0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (or (< 0 ~M~0) (= thread3Thread1of1ForFork2_~i~2 0))), 203#true, Black: 1048#(and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= ~max1~0 0) (or (< 0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 0)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 418#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 592#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 1250#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0) (= thread1Thread1of1ForFork1_~i~0 0) (or (= ~max2~0 0) (< 0 ~max2~0))), Black: 612#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0) (or (= ~max2~0 0) (< 0 ~max1~0))), Black: 1226#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 602#(and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0)), Black: 1232#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (or (and (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)) (= ~max1~0 0) (or (< 0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 0)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 622#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0)), Black: 1230#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)))) (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)))), Black: 1228#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1))) (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))), Black: 422#(and (or (< 0 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 0)) (= ~A~0.offset 0) (= ~max2~0 0) (or (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< (select (select |#memory_int#1| ~A~0.base) 0) 1)) (= ~M~0 0)), Black: 1222#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), 414#true, Black: 586#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1234#(and (<= 0 ~M~0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (or (< 0 ~M~0) (= thread3Thread1of1ForFork2_~i~2 0))), Black: 588#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 1220#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 1258#(and (or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), Black: 417#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 552#(and (or (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0))) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 590#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 421#(and (or (< 0 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 0)) (= ~A~0.offset 0) (= ~max2~0 0) (or (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< (select (select |#memory_int#1| ~A~0.base) 0) 1)) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 596#(and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~max1~0))]) [2025-02-08 01:18:35,482 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-02-08 01:18:35,482 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:18:35,482 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:18:35,482 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:18:35,482 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([347] L71-->L70-3: Formula: (let ((.cse0 (select (select |v_#memory_int#1_55| v_~A~0.base_71) (+ v_~A~0.offset_71 (* v_thread3Thread1of1ForFork2_~i~2_7 4))))) (or (and (= v_~max2~0_49 .cse0) (< v_~max2~0_50 .cse0)) (and (<= .cse0 v_~max2~0_50) (= v_~max2~0_49 v_~max2~0_50) (= |v_thread3Thread1of1ForFork2_#t~mem8_2| |v_thread3Thread1of1ForFork2_#t~mem8_1|)))) InVars {thread3Thread1of1ForFork2_#t~mem8=|v_thread3Thread1of1ForFork2_#t~mem8_1|, ~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, #memory_int#1=|v_#memory_int#1_55|, ~max2~0=v_~max2~0_50, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} OutVars{~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, ~max2~0=v_~max2~0_49, thread3Thread1of1ForFork2_#t~mem8=|v_thread3Thread1of1ForFork2_#t~mem8_2|, thread3Thread1of1ForFork2_#t~mem7=|v_thread3Thread1of1ForFork2_#t~mem7_1|, #memory_int#1=|v_#memory_int#1_55|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} AuxVars[] AssignedVars[~max2~0, thread3Thread1of1ForFork2_#t~mem8, thread3Thread1of1ForFork2_#t~mem7][583], [Black: 909#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), Black: 1022#(and (or (and (= ~max1~0 ~A~0.offset) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 ~max1~0) (= thread1Thread1of1ForFork1_~i~0 0) (or (= ~max2~0 0) (< 0 ~max2~0))), Black: 1020#(and (or (and (= ~max2~0 0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 0)) (and (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= 1 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= thread3Thread1of1ForFork2_~i~2 0) (or (= ~A~0.offset 0) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1014#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1028#(and (or (= ~max1~0 0) (< 0 ~max2~0)) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 ~max1~0)), Black: 989#(or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (and (= ~max2~0 ~max1~0) (= ~M~0 0))), Black: 1016#(and (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1026#(and (or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))) (or (and (= ~max1~0 ~A~0.offset) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1282#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= ~max2~0 ~max1~0)), Black: 1289#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1295#(and (= ~A~0.offset 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= 0 thread3Thread1of1ForFork2_~i~2) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0))) (or (< 0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (= ~max2~0 0)) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (< (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)) 1)) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1279#(and (= ~A~0.offset 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= 0 thread3Thread1of1ForFork2_~i~2) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0))) (or (< 0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (= ~max2~0 0)) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (< (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)) 1)) (= ~max1~0 0)), Black: 1297#(and (or (= ~max2~0 0) (< 0 ~N~0)) (= ~A~0.offset 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= 0 thread3Thread1of1ForFork2_~i~2) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0))) (or (< 0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (= ~max2~0 0)) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (< (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)) 1)) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1283#(= ~max2~0 ~max1~0), Black: 1281#(and (or (= ~max2~0 ~max1~0) (< 1 ~N~0)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 408#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), Black: 1287#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 378#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 347#(and (or (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0))) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), 9#L47true, Black: 48#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 25#L95true, 637#true, 1307#true, Black: 52#(<= (+ ~M~0 1) ~N~0), Black: 709#(or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))), Black: 826#(and (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0) (= thread1Thread1of1ForFork1_~i~0 0) (or (= ~max1~0 0) (< 0 ~max1~0))), Black: 645#(and (= (select (select |#memory_int#1| ~A~0.base) 0) (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (= ~A~0.offset 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (or (and (<= (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)) 0) (= ~max2~0 0)) (and (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (<= 1 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)))))), Black: 643#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 646#(and (= ~A~0.offset 0) (or (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max2~0 0)) (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) 0)))) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 61#(<= 1 ~N~0), 1038#true, 1273#true, 834#true, 29#L59true, Black: 1236#(and (<= 0 ~M~0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (or (< 0 ~M~0) (= thread3Thread1of1ForFork2_~i~2 0))), Black: 1224#(and (<= 0 ~M~0) (= ~max2~0 0) (= ~max1~0 0) (or (< 0 ~M~0) (= thread3Thread1of1ForFork2_~i~2 0))), Black: 1218#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1238#(and (<= 0 ~M~0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (or (< 0 ~M~0) (= thread3Thread1of1ForFork2_~i~2 0))), 203#true, Black: 1048#(and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= ~max1~0 0) (or (< 0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 0)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 418#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 592#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 1250#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0) (= thread1Thread1of1ForFork1_~i~0 0) (or (= ~max2~0 0) (< 0 ~max2~0))), Black: 612#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0) (or (= ~max2~0 0) (< 0 ~max1~0))), Black: 1226#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), 34#L70-3true, Black: 602#(and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0)), Black: 1232#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (or (and (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)) (= ~max1~0 0) (or (< 0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 0)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 622#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0)), Black: 1230#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)))) (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)))), Black: 1228#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1))) (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))), Black: 422#(and (or (< 0 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 0)) (= ~A~0.offset 0) (= ~max2~0 0) (or (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< (select (select |#memory_int#1| ~A~0.base) 0) 1)) (= ~M~0 0)), Black: 1222#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), 414#true, Black: 586#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1234#(and (<= 0 ~M~0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (or (< 0 ~M~0) (= thread3Thread1of1ForFork2_~i~2 0))), Black: 588#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 1220#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 1258#(and (or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), Black: 417#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 552#(and (or (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0))) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 590#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 421#(and (or (< 0 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 0)) (= ~A~0.offset 0) (= ~max2~0 0) (or (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< (select (select |#memory_int#1| ~A~0.base) 0) 1)) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 596#(and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~max1~0))]) [2025-02-08 01:18:35,483 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-02-08 01:18:35,483 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:18:35,483 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:18:35,483 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:18:35,635 INFO L124 PetriNetUnfolderBase]: 9254/13680 cut-off events. [2025-02-08 01:18:35,636 INFO L125 PetriNetUnfolderBase]: For 116676/117976 co-relation queries the response was YES. [2025-02-08 01:18:35,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82007 conditions, 13680 events. 9254/13680 cut-off events. For 116676/117976 co-relation queries the response was YES. Maximal size of possible extension queue 675. Compared 82076 event pairs, 1127 based on Foata normal form. 1156/14729 useless extension candidates. Maximal degree in co-relation 81165. Up to 8901 conditions per place. [2025-02-08 01:18:35,857 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 476 selfloop transitions, 448 changer transitions 2/934 dead transitions. [2025-02-08 01:18:35,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 934 transitions, 14152 flow [2025-02-08 01:18:35,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-08 01:18:35,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-02-08 01:18:35,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 346 transitions. [2025-02-08 01:18:35,860 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45586297760210803 [2025-02-08 01:18:35,860 INFO L175 Difference]: Start difference. First operand has 198 places, 790 transitions, 11199 flow. Second operand 23 states and 346 transitions. [2025-02-08 01:18:35,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 934 transitions, 14152 flow [2025-02-08 01:18:36,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 934 transitions, 14035 flow, removed 41 selfloop flow, removed 3 redundant places. [2025-02-08 01:18:36,472 INFO L231 Difference]: Finished difference. Result has 219 places, 830 transitions, 12762 flow [2025-02-08 01:18:36,472 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=11088, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=790, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=412, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=12762, PETRI_PLACES=219, PETRI_TRANSITIONS=830} [2025-02-08 01:18:36,473 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 184 predicate places. [2025-02-08 01:18:36,473 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 830 transitions, 12762 flow [2025-02-08 01:18:36,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.64) internal successors, (216), 25 states have internal predecessors, (216), 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-02-08 01:18:36,473 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:36,473 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:18:36,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 01:18:36,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:18:36,676 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-02-08 01:18:36,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:36,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1761182114, now seen corresponding path program 8 times [2025-02-08 01:18:36,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:36,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953315625] [2025-02-08 01:18:36,677 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:18:36,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:36,683 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-02-08 01:18:36,689 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 01:18:36,689 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:18:36,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:36,754 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:18:36,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:36,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953315625] [2025-02-08 01:18:36,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953315625] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:18:36,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110607947] [2025-02-08 01:18:36,754 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:18:36,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:18:36,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:18:36,760 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:18:36,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 01:18:36,809 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-02-08 01:18:36,824 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 01:18:36,824 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:18:36,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:36,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 01:18:36,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:18:36,899 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:18:36,899 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:18:36,965 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:18:36,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110607947] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:18:36,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:18:36,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-02-08 01:18:36,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377271068] [2025-02-08 01:18:36,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:18:36,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 01:18:36,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:36,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 01:18:36,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2025-02-08 01:18:37,007 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-02-08 01:18:37,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 830 transitions, 12762 flow. Second operand has 18 states, 18 states have (on average 7.222222222222222) internal successors, (130), 18 states have internal predecessors, (130), 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-02-08 01:18:37,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:37,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-02-08 01:18:37,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:18:39,941 INFO L124 PetriNetUnfolderBase]: 12914/18871 cut-off events. [2025-02-08 01:18:39,942 INFO L125 PetriNetUnfolderBase]: For 192504/193626 co-relation queries the response was YES. [2025-02-08 01:18:40,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115800 conditions, 18871 events. 12914/18871 cut-off events. For 192504/193626 co-relation queries the response was YES. Maximal size of possible extension queue 913. Compared 116876 event pairs, 2703 based on Foata normal form. 1006/19774 useless extension candidates. Maximal degree in co-relation 114557. Up to 6324 conditions per place. [2025-02-08 01:18:40,088 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 1275 selfloop transitions, 110 changer transitions 0/1391 dead transitions. [2025-02-08 01:18:40,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 1391 transitions, 23473 flow [2025-02-08 01:18:40,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 01:18:40,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-02-08 01:18:40,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 219 transitions. [2025-02-08 01:18:40,089 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.474025974025974 [2025-02-08 01:18:40,090 INFO L175 Difference]: Start difference. First operand has 219 places, 830 transitions, 12762 flow. Second operand 14 states and 219 transitions. [2025-02-08 01:18:40,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 1391 transitions, 23473 flow [2025-02-08 01:18:40,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 1391 transitions, 23028 flow, removed 94 selfloop flow, removed 11 redundant places. [2025-02-08 01:18:40,898 INFO L231 Difference]: Finished difference. Result has 227 places, 875 transitions, 13247 flow [2025-02-08 01:18:40,899 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=12387, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=830, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=757, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=13247, PETRI_PLACES=227, PETRI_TRANSITIONS=875} [2025-02-08 01:18:40,899 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 192 predicate places. [2025-02-08 01:18:40,900 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 875 transitions, 13247 flow [2025-02-08 01:18:40,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.222222222222222) internal successors, (130), 18 states have internal predecessors, (130), 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-02-08 01:18:40,900 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:40,900 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:18:40,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-08 01:18:41,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:18:41,101 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-02-08 01:18:41,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:41,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1657839660, now seen corresponding path program 9 times [2025-02-08 01:18:41,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:41,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310605926] [2025-02-08 01:18:41,101 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:18:41,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:41,111 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-02-08 01:18:41,117 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 01:18:41,117 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 01:18:41,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:41,165 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:18:41,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:41,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310605926] [2025-02-08 01:18:41,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310605926] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:18:41,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298839768] [2025-02-08 01:18:41,166 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:18:41,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:18:41,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:18:41,170 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:18:41,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 01:18:41,212 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-02-08 01:18:41,228 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 01:18:41,228 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 01:18:41,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:41,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 01:18:41,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:18:41,278 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:18:41,279 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:18:41,323 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:18:41,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298839768] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 01:18:41,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 01:18:41,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 13 [2025-02-08 01:18:41,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790232025] [2025-02-08 01:18:41,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:18:41,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:18:41,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:41,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:18:41,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-02-08 01:18:41,331 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-02-08 01:18:41,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 875 transitions, 13247 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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-02-08 01:18:41,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:41,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-02-08 01:18:41,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:18:44,540 INFO L124 PetriNetUnfolderBase]: 11588/17335 cut-off events. [2025-02-08 01:18:44,545 INFO L125 PetriNetUnfolderBase]: For 191416/193055 co-relation queries the response was YES. [2025-02-08 01:18:44,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115809 conditions, 17335 events. 11588/17335 cut-off events. For 191416/193055 co-relation queries the response was YES. Maximal size of possible extension queue 879. Compared 111220 event pairs, 1992 based on Foata normal form. 1199/18442 useless extension candidates. Maximal degree in co-relation 114896. Up to 5756 conditions per place. [2025-02-08 01:18:44,717 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 1009 selfloop transitions, 77 changer transitions 0/1109 dead transitions. [2025-02-08 01:18:44,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 1109 transitions, 18777 flow [2025-02-08 01:18:44,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:18:44,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:18:44,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2025-02-08 01:18:44,719 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2025-02-08 01:18:44,719 INFO L175 Difference]: Start difference. First operand has 227 places, 875 transitions, 13247 flow. Second operand 8 states and 144 transitions. [2025-02-08 01:18:44,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 1109 transitions, 18777 flow [2025-02-08 01:18:45,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 1109 transitions, 18624 flow, removed 73 selfloop flow, removed 3 redundant places. [2025-02-08 01:18:45,920 INFO L231 Difference]: Finished difference. Result has 234 places, 877 transitions, 13405 flow [2025-02-08 01:18:45,921 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=13042, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=867, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=794, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=13405, PETRI_PLACES=234, PETRI_TRANSITIONS=877} [2025-02-08 01:18:45,921 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 199 predicate places. [2025-02-08 01:18:45,922 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 877 transitions, 13405 flow [2025-02-08 01:18:45,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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-02-08 01:18:45,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:45,922 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:18:45,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-08 01:18:46,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:18:46,126 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-02-08 01:18:46,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:46,127 INFO L85 PathProgramCache]: Analyzing trace with hash -484103150, now seen corresponding path program 10 times [2025-02-08 01:18:46,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:46,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645524547] [2025-02-08 01:18:46,127 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:18:46,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:46,131 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-02-08 01:18:46,133 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 27 of 29 statements. [2025-02-08 01:18:46,134 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 01:18:46,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:46,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:18:46,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:46,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645524547] [2025-02-08 01:18:46,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645524547] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:18:46,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653488859] [2025-02-08 01:18:46,185 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:18:46,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:18:46,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:18:46,187 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:18:46,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 01:18:46,229 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-02-08 01:18:46,242 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 27 of 29 statements. [2025-02-08 01:18:46,243 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 01:18:46,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:46,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 01:18:46,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:18:46,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:18:46,314 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:18:46,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:18:46,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653488859] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:18:46,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:18:46,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-02-08 01:18:46,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35675557] [2025-02-08 01:18:46,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:18:46,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 01:18:46,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:46,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 01:18:46,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-02-08 01:18:46,373 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-02-08 01:18:46,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 877 transitions, 13405 flow. Second operand has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 14 states have internal predecessors, (99), 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-02-08 01:18:46,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:46,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-02-08 01:18:46,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:18:50,951 INFO L124 PetriNetUnfolderBase]: 18724/27131 cut-off events. [2025-02-08 01:18:50,951 INFO L125 PetriNetUnfolderBase]: For 306722/306722 co-relation queries the response was YES. [2025-02-08 01:18:51,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177950 conditions, 27131 events. 18724/27131 cut-off events. For 306722/306722 co-relation queries the response was YES. Maximal size of possible extension queue 1208. Compared 170673 event pairs, 2631 based on Foata normal form. 14/27145 useless extension candidates. Maximal degree in co-relation 176715. Up to 7853 conditions per place. [2025-02-08 01:18:51,400 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 1736 selfloop transitions, 370 changer transitions 0/2107 dead transitions. [2025-02-08 01:18:51,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 2107 transitions, 36097 flow [2025-02-08 01:18:51,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-08 01:18:51,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-02-08 01:18:51,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 261 transitions. [2025-02-08 01:18:51,401 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41626794258373206 [2025-02-08 01:18:51,401 INFO L175 Difference]: Start difference. First operand has 234 places, 877 transitions, 13405 flow. Second operand 19 states and 261 transitions. [2025-02-08 01:18:51,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 2107 transitions, 36097 flow [2025-02-08 01:18:53,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 2107 transitions, 35592 flow, removed 51 selfloop flow, removed 3 redundant places. [2025-02-08 01:18:53,599 INFO L231 Difference]: Finished difference. Result has 263 places, 1116 transitions, 18481 flow [2025-02-08 01:18:53,600 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=13244, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=877, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=692, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=18481, PETRI_PLACES=263, PETRI_TRANSITIONS=1116} [2025-02-08 01:18:53,601 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 228 predicate places. [2025-02-08 01:18:53,601 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 1116 transitions, 18481 flow [2025-02-08 01:18:53,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 14 states have internal predecessors, (99), 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-02-08 01:18:53,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:53,602 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:18:53,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-08 01:18:53,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-08 01:18:53,803 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-02-08 01:18:53,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:53,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1438717286, now seen corresponding path program 11 times [2025-02-08 01:18:53,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:53,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995638438] [2025-02-08 01:18:53,804 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:18:53,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:53,808 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-02-08 01:18:53,813 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 01:18:53,813 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:18:53,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:53,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:18:53,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:53,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995638438] [2025-02-08 01:18:53,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995638438] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:18:53,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013752080] [2025-02-08 01:18:53,853 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:18:53,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:18:53,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:18:53,855 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:18:53,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 01:18:53,897 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-02-08 01:18:53,911 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 01:18:53,911 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:18:53,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:53,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 01:18:53,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:18:53,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:18:53,961 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:18:53,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:18:53,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013752080] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:18:53,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:18:53,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-02-08 01:18:53,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423527150] [2025-02-08 01:18:53,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:18:53,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 01:18:53,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:53,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 01:18:53,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-02-08 01:18:54,013 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-02-08 01:18:54,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 1116 transitions, 18481 flow. Second operand has 14 states, 14 states have (on average 9.5) internal successors, (133), 14 states have internal predecessors, (133), 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-02-08 01:18:54,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:54,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-02-08 01:18:54,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:18:57,722 INFO L124 PetriNetUnfolderBase]: 11754/18144 cut-off events. [2025-02-08 01:18:57,722 INFO L125 PetriNetUnfolderBase]: For 298381/299935 co-relation queries the response was YES. [2025-02-08 01:18:57,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137264 conditions, 18144 events. 11754/18144 cut-off events. For 298381/299935 co-relation queries the response was YES. Maximal size of possible extension queue 997. Compared 124120 event pairs, 3170 based on Foata normal form. 1211/19198 useless extension candidates. Maximal degree in co-relation 136186. Up to 7195 conditions per place. [2025-02-08 01:18:57,926 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 994 selfloop transitions, 89 changer transitions 0/1141 dead transitions. [2025-02-08 01:18:57,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 1141 transitions, 20737 flow [2025-02-08 01:18:57,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:18:57,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:18:57,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2025-02-08 01:18:57,927 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2025-02-08 01:18:57,927 INFO L175 Difference]: Start difference. First operand has 263 places, 1116 transitions, 18481 flow. Second operand 7 states and 121 transitions. [2025-02-08 01:18:57,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 1141 transitions, 20737 flow [2025-02-08 01:18:59,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 1141 transitions, 20506 flow, removed 114 selfloop flow, removed 1 redundant places. [2025-02-08 01:18:59,986 INFO L231 Difference]: Finished difference. Result has 269 places, 972 transitions, 16177 flow [2025-02-08 01:18:59,986 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=15914, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=971, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=882, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=16177, PETRI_PLACES=269, PETRI_TRANSITIONS=972} [2025-02-08 01:18:59,986 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 234 predicate places. [2025-02-08 01:18:59,987 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 972 transitions, 16177 flow [2025-02-08 01:18:59,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.5) internal successors, (133), 14 states have internal predecessors, (133), 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-02-08 01:18:59,987 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:59,987 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, 1, 1, 1] [2025-02-08 01:18:59,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-08 01:19:00,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-08 01:19:00,191 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-02-08 01:19:00,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:19:00,191 INFO L85 PathProgramCache]: Analyzing trace with hash -606958121, now seen corresponding path program 1 times [2025-02-08 01:19:00,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:19:00,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666925494] [2025-02-08 01:19:00,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:19:00,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:19:00,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 01:19:00,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 01:19:00,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:19:00,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:19:00,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:19:00,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:19:00,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666925494] [2025-02-08 01:19:00,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666925494] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:19:00,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409306501] [2025-02-08 01:19:00,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:19:00,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:19:00,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:19:00,254 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:19:00,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-08 01:19:00,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 01:19:00,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 01:19:00,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:19:00,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:19:00,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 01:19:00,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:19:00,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:19:00,346 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:19:00,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:19:00,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409306501] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:19:00,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:19:00,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-02-08 01:19:00,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250323516] [2025-02-08 01:19:00,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:19:00,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 01:19:00,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:19:00,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 01:19:00,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-02-08 01:19:00,408 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-02-08 01:19:00,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 972 transitions, 16177 flow. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 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-02-08 01:19:00,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:19:00,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-02-08 01:19:00,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:19:02,852 INFO L124 PetriNetUnfolderBase]: 7291/11585 cut-off events. [2025-02-08 01:19:02,853 INFO L125 PetriNetUnfolderBase]: For 197801/199185 co-relation queries the response was YES. [2025-02-08 01:19:02,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88254 conditions, 11585 events. 7291/11585 cut-off events. For 197801/199185 co-relation queries the response was YES. Maximal size of possible extension queue 675. Compared 77596 event pairs, 2790 based on Foata normal form. 687/12100 useless extension candidates. Maximal degree in co-relation 88118. Up to 6638 conditions per place. [2025-02-08 01:19:02,996 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 707 selfloop transitions, 28 changer transitions 0/804 dead transitions. [2025-02-08 01:19:02,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 804 transitions, 15211 flow [2025-02-08 01:19:02,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:19:02,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:19:02,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2025-02-08 01:19:03,001 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.494949494949495 [2025-02-08 01:19:03,001 INFO L175 Difference]: Start difference. First operand has 269 places, 972 transitions, 16177 flow. Second operand 6 states and 98 transitions. [2025-02-08 01:19:03,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 804 transitions, 15211 flow [2025-02-08 01:19:04,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 804 transitions, 14798 flow, removed 123 selfloop flow, removed 10 redundant places. [2025-02-08 01:19:04,178 INFO L231 Difference]: Finished difference. Result has 255 places, 712 transitions, 12095 flow [2025-02-08 01:19:04,182 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=12011, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=712, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=684, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=12095, PETRI_PLACES=255, PETRI_TRANSITIONS=712} [2025-02-08 01:19:04,183 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 220 predicate places. [2025-02-08 01:19:04,183 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 712 transitions, 12095 flow [2025-02-08 01:19:04,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 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-02-08 01:19:04,183 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:19:04,184 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:19:04,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-08 01:19:04,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:19:04,384 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-02-08 01:19:04,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:19:04,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1613080208, now seen corresponding path program 12 times [2025-02-08 01:19:04,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:19:04,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485580110] [2025-02-08 01:19:04,386 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:19:04,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:19:04,393 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 2 equivalence classes. [2025-02-08 01:19:04,396 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 01:19:04,396 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-02-08 01:19:04,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:19:04,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:19:04,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:19:04,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485580110] [2025-02-08 01:19:04,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485580110] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:19:04,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:19:04,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:19:04,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342405777] [2025-02-08 01:19:04,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:19:04,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:19:04,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:19:04,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:19:04,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:19:04,459 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-02-08 01:19:04,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 712 transitions, 12095 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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-02-08 01:19:04,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:19:04,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-02-08 01:19:04,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:19:06,989 INFO L124 PetriNetUnfolderBase]: 10273/15496 cut-off events. [2025-02-08 01:19:06,990 INFO L125 PetriNetUnfolderBase]: For 224690/225063 co-relation queries the response was YES. [2025-02-08 01:19:07,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113273 conditions, 15496 events. 10273/15496 cut-off events. For 224690/225063 co-relation queries the response was YES. Maximal size of possible extension queue 708. Compared 97131 event pairs, 1427 based on Foata normal form. 244/15727 useless extension candidates. Maximal degree in co-relation 112350. Up to 5656 conditions per place. [2025-02-08 01:19:07,147 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 730 selfloop transitions, 145 changer transitions 25/903 dead transitions. [2025-02-08 01:19:07,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 903 transitions, 16599 flow [2025-02-08 01:19:07,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:19:07,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:19:07,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2025-02-08 01:19:07,148 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5037878787878788 [2025-02-08 01:19:07,148 INFO L175 Difference]: Start difference. First operand has 255 places, 712 transitions, 12095 flow. Second operand 8 states and 133 transitions. [2025-02-08 01:19:07,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 903 transitions, 16599 flow [2025-02-08 01:19:08,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 903 transitions, 16375 flow, removed 46 selfloop flow, removed 7 redundant places. [2025-02-08 01:19:08,384 INFO L231 Difference]: Finished difference. Result has 259 places, 713 transitions, 12424 flow [2025-02-08 01:19:08,385 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=11995, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=712, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=567, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12424, PETRI_PLACES=259, PETRI_TRANSITIONS=713} [2025-02-08 01:19:08,385 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 224 predicate places. [2025-02-08 01:19:08,385 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 713 transitions, 12424 flow [2025-02-08 01:19:08,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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-02-08 01:19:08,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:19:08,386 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:19:08,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 01:19:08,386 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-02-08 01:19:08,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:19:08,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1642131354, now seen corresponding path program 13 times [2025-02-08 01:19:08,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:19:08,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140667569] [2025-02-08 01:19:08,387 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:19:08,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:19:08,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 01:19:08,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 01:19:08,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:19:08,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:19:08,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:19:08,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:19:08,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140667569] [2025-02-08 01:19:08,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140667569] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:19:08,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925353679] [2025-02-08 01:19:08,449 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:19:08,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:19:08,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:19:08,456 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:19:08,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-08 01:19:08,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 01:19:08,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 01:19:08,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:19:08,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:19:08,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 01:19:08,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:19:08,716 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:19:08,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:19:08,757 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:19:08,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925353679] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:19:08,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:19:08,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-02-08 01:19:08,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455774405] [2025-02-08 01:19:08,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:19:08,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 01:19:08,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:19:08,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 01:19:08,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-02-08 01:19:08,778 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-02-08 01:19:08,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 713 transitions, 12424 flow. Second operand has 14 states, 14 states have (on average 9.5) internal successors, (133), 14 states have internal predecessors, (133), 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-02-08 01:19:08,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:19:08,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-02-08 01:19:08,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:19:10,409 INFO L124 PetriNetUnfolderBase]: 7466/11628 cut-off events. [2025-02-08 01:19:10,410 INFO L125 PetriNetUnfolderBase]: For 194167/194943 co-relation queries the response was YES. [2025-02-08 01:19:10,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87095 conditions, 11628 events. 7466/11628 cut-off events. For 194167/194943 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 74602 event pairs, 2882 based on Foata normal form. 903/12421 useless extension candidates. Maximal degree in co-relation 86395. Up to 8299 conditions per place. [2025-02-08 01:19:10,562 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 407 selfloop transitions, 3 changer transitions 285/708 dead transitions. [2025-02-08 01:19:10,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 708 transitions, 13618 flow [2025-02-08 01:19:10,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:19:10,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:19:10,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2025-02-08 01:19:10,563 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2025-02-08 01:19:10,563 INFO L175 Difference]: Start difference. First operand has 259 places, 713 transitions, 12424 flow. Second operand 7 states and 110 transitions. [2025-02-08 01:19:10,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 708 transitions, 13618 flow [2025-02-08 01:19:11,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 708 transitions, 13279 flow, removed 23 selfloop flow, removed 7 redundant places. [2025-02-08 01:19:11,891 INFO L231 Difference]: Finished difference. Result has 257 places, 423 transitions, 6759 flow [2025-02-08 01:19:11,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=10991, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=651, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=648, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6759, PETRI_PLACES=257, PETRI_TRANSITIONS=423} [2025-02-08 01:19:11,892 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 222 predicate places. [2025-02-08 01:19:11,892 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 423 transitions, 6759 flow [2025-02-08 01:19:11,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.5) internal successors, (133), 14 states have internal predecessors, (133), 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-02-08 01:19:11,892 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:19:11,892 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:19:11,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-08 01:19:12,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-08 01:19:12,095 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:19:12,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:19:12,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1741249556, now seen corresponding path program 14 times [2025-02-08 01:19:12,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:19:12,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837799232] [2025-02-08 01:19:12,096 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:19:12,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:19:12,102 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:19:12,109 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:19:12,110 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:19:12,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:19:12,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 01:19:12,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:19:12,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837799232] [2025-02-08 01:19:12,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837799232] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:19:12,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456573315] [2025-02-08 01:19:12,175 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:19:12,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:19:12,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:19:12,177 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:19:12,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-08 01:19:12,227 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:19:12,254 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:19:12,254 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:19:12,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:19:12,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 01:19:12,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:19:12,331 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 01:19:12,332 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:19:12,413 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 01:19:12,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456573315] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:19:12,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:19:12,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-02-08 01:19:12,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393202080] [2025-02-08 01:19:12,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:19:12,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 01:19:12,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:19:12,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 01:19:12,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2025-02-08 01:19:12,424 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-02-08 01:19:12,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 423 transitions, 6759 flow. Second operand has 19 states, 19 states have (on average 6.947368421052632) internal successors, (132), 19 states have internal predecessors, (132), 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-02-08 01:19:12,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:19:12,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-02-08 01:19:12,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:19:19,970 INFO L124 PetriNetUnfolderBase]: 24150/34348 cut-off events. [2025-02-08 01:19:19,971 INFO L125 PetriNetUnfolderBase]: For 467901/467901 co-relation queries the response was YES. [2025-02-08 01:19:20,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247732 conditions, 34348 events. 24150/34348 cut-off events. For 467901/467901 co-relation queries the response was YES. Maximal size of possible extension queue 845. Compared 200818 event pairs, 318 based on Foata normal form. 58/34406 useless extension candidates. Maximal degree in co-relation 247646. Up to 14182 conditions per place. [2025-02-08 01:19:20,513 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 1544 selfloop transitions, 864 changer transitions 0/2409 dead transitions. [2025-02-08 01:19:20,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 2409 transitions, 37257 flow [2025-02-08 01:19:20,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2025-02-08 01:19:20,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2025-02-08 01:19:20,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 1685 transitions. [2025-02-08 01:19:20,517 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3897756187832524 [2025-02-08 01:19:20,517 INFO L175 Difference]: Start difference. First operand has 257 places, 423 transitions, 6759 flow. Second operand 131 states and 1685 transitions. [2025-02-08 01:19:20,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 2409 transitions, 37257 flow [2025-02-08 01:19:22,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 2409 transitions, 34115 flow, removed 1064 selfloop flow, removed 29 redundant places. [2025-02-08 01:19:22,560 INFO L231 Difference]: Finished difference. Result has 382 places, 1197 transitions, 18305 flow [2025-02-08 01:19:22,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=6013, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=189, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=131, PETRI_FLOW=18305, PETRI_PLACES=382, PETRI_TRANSITIONS=1197} [2025-02-08 01:19:22,561 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 347 predicate places. [2025-02-08 01:19:22,561 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 1197 transitions, 18305 flow [2025-02-08 01:19:22,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.947368421052632) internal successors, (132), 19 states have internal predecessors, (132), 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-02-08 01:19:22,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:19:22,561 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:19:22,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-02-08 01:19:22,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:19:22,762 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:19:22,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:19:22,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1499032248, now seen corresponding path program 15 times [2025-02-08 01:19:22,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:19:22,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730972197] [2025-02-08 01:19:22,763 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:19:22,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:19:22,768 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:19:22,771 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:19:22,772 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 01:19:22,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:19:22,840 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:19:22,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:19:22,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730972197] [2025-02-08 01:19:22,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730972197] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:19:22,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282014774] [2025-02-08 01:19:22,840 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:19:22,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:19:22,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:19:22,845 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:19:22,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-08 01:19:22,883 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:19:22,899 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:19:22,899 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 01:19:22,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:19:22,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 01:19:22,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:19:22,996 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:19:22,997 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:19:23,081 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:19:23,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282014774] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:19:23,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:19:23,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-02-08 01:19:23,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99815527] [2025-02-08 01:19:23,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:19:23,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 01:19:23,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:19:23,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 01:19:23,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2025-02-08 01:19:23,111 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-02-08 01:19:23,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 1197 transitions, 18305 flow. Second operand has 20 states, 20 states have (on average 7.45) internal successors, (149), 20 states have internal predecessors, (149), 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-02-08 01:19:23,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:19:23,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-02-08 01:19:23,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand