./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.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 1d936eafcc314e66bb4cd572754c58bf1f2fc59d35c83764f43dae769bce220a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:44:38,112 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:44:38,172 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:44:38,178 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:44:38,178 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:44:38,200 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:44:38,201 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:44:38,201 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:44:38,201 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:44:38,202 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:44:38,202 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:44:38,202 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:44:38,203 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:44:38,203 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:44:38,203 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:44:38,203 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:44:38,203 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:44:38,204 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:44:38,204 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:44:38,204 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:44:38,204 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:44:38,204 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:44:38,204 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:44:38,204 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:44:38,204 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:44:38,204 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:44:38,204 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:44:38,204 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:44:38,204 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:44:38,204 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:44:38,205 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:44:38,205 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:44:38,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:44:38,205 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:44:38,205 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:44:38,205 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:44:38,205 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:44:38,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:44:38,205 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:44:38,205 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:44:38,206 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:44:38,206 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:44:38,206 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:44:38,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:44:38,206 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:44:38,206 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:44:38,206 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:44:38,206 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:44:38,207 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 -> 1d936eafcc314e66bb4cd572754c58bf1f2fc59d35c83764f43dae769bce220a [2025-01-09 16:44:38,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:44:38,452 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:44:38,453 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:44:38,455 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:44:38,455 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:44:38,457 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c [2025-01-09 16:44:39,685 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6da300db8/6cdddadba0104f8fa7975824916f3f7d/FLAGcb6062e91 [2025-01-09 16:44:39,917 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:44:39,922 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c [2025-01-09 16:44:39,934 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6da300db8/6cdddadba0104f8fa7975824916f3f7d/FLAGcb6062e91 [2025-01-09 16:44:39,953 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6da300db8/6cdddadba0104f8fa7975824916f3f7d [2025-01-09 16:44:39,956 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:44:39,957 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:44:39,959 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:44:39,959 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:44:39,962 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:44:39,963 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:44:39" (1/1) ... [2025-01-09 16:44:39,964 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13e9db7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:39, skipping insertion in model container [2025-01-09 16:44:39,964 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:44:39" (1/1) ... [2025-01-09 16:44:39,980 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:44:40,112 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-array-sum-alt2.wvr.c[2564,2577] [2025-01-09 16:44:40,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:44:40,130 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:44:40,146 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-array-sum-alt2.wvr.c[2564,2577] [2025-01-09 16:44:40,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:44:40,169 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:44:40,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:40 WrapperNode [2025-01-09 16:44:40,171 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:44:40,172 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:44:40,173 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:44:40,173 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:44:40,178 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:40" (1/1) ... [2025-01-09 16:44:40,183 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:40" (1/1) ... [2025-01-09 16:44:40,203 INFO L138 Inliner]: procedures = 24, calls = 30, calls flagged for inlining = 12, calls inlined = 16, statements flattened = 170 [2025-01-09 16:44:40,206 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:44:40,207 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:44:40,207 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:44:40,207 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:44:40,214 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:40" (1/1) ... [2025-01-09 16:44:40,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:40" (1/1) ... [2025-01-09 16:44:40,220 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:40" (1/1) ... [2025-01-09 16:44:40,234 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-01-09 16:44:40,238 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:40" (1/1) ... [2025-01-09 16:44:40,238 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:40" (1/1) ... [2025-01-09 16:44:40,245 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:40" (1/1) ... [2025-01-09 16:44:40,247 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:40" (1/1) ... [2025-01-09 16:44:40,252 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:40" (1/1) ... [2025-01-09 16:44:40,253 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:40" (1/1) ... [2025-01-09 16:44:40,257 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:40" (1/1) ... [2025-01-09 16:44:40,259 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:44:40,260 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:44:40,260 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:44:40,260 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:44:40,264 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:40" (1/1) ... [2025-01-09 16:44:40,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:44:40,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:44:40,293 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:44:40,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:44:40,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:44:40,316 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:44:40,316 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:44:40,316 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:44:40,316 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:44:40,316 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 16:44:40,316 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 16:44:40,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:44:40,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:44:40,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:44:40,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:44:40,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 16:44:40,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 16:44:40,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 16:44:40,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:44:40,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:44:40,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:44:40,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:44:40,318 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:44:40,403 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:44:40,405 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:44:40,607 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:44:40,607 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:44:40,843 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:44:40,843 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:44:40,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:44:40 BoogieIcfgContainer [2025-01-09 16:44:40,843 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:44:40,846 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:44:40,846 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:44:40,850 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:44:40,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:44:39" (1/3) ... [2025-01-09 16:44:40,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69ef65e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:44:40, skipping insertion in model container [2025-01-09 16:44:40,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:40" (2/3) ... [2025-01-09 16:44:40,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69ef65e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:44:40, skipping insertion in model container [2025-01-09 16:44:40,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:44:40" (3/3) ... [2025-01-09 16:44:40,852 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum-alt2.wvr.c [2025-01-09 16:44:40,864 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:44:40,865 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-array-sum-alt2.wvr.c that has 4 procedures, 30 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-01-09 16:44:40,865 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:44:40,939 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 16:44:40,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 33 transitions, 87 flow [2025-01-09 16:44:40,989 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2025-01-09 16:44:40,991 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:44:40,995 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 39 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-01-09 16:44:40,995 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 33 transitions, 87 flow [2025-01-09 16:44:40,997 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 29 transitions, 76 flow [2025-01-09 16:44:41,007 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:44:41,016 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;@592ecd98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:44:41,017 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 16:44:41,030 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:44:41,032 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2025-01-09 16:44:41,032 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:44:41,032 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:44:41,032 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:44:41,033 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-01-09 16:44:41,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:44:41,038 INFO L85 PathProgramCache]: Analyzing trace with hash -34080488, now seen corresponding path program 1 times [2025-01-09 16:44:41,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:44:41,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313239280] [2025-01-09 16:44:41,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:44:41,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:44:41,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 16:44:41,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 16:44:41,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:44:41,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:44:41,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:44:41,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:44:41,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313239280] [2025-01-09 16:44:41,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313239280] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:44:41,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:44:41,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:44:41,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631729787] [2025-01-09 16:44:41,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:44:41,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:44:41,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:44:41,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:44:41,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:44:41,386 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-01-09 16:44:41,387 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-01-09 16:44:41,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:44:41,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-01-09 16:44:41,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:44:41,624 INFO L124 PetriNetUnfolderBase]: 617/944 cut-off events. [2025-01-09 16:44:41,624 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2025-01-09 16:44:41,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1939 conditions, 944 events. 617/944 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3726 event pairs, 126 based on Foata normal form. 1/931 useless extension candidates. Maximal degree in co-relation 1705. Up to 677 conditions per place. [2025-01-09 16:44:41,631 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 37 selfloop transitions, 4 changer transitions 1/46 dead transitions. [2025-01-09 16:44:41,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 46 transitions, 209 flow [2025-01-09 16:44:41,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:44:41,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:44:41,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2025-01-09 16:44:41,642 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6464646464646465 [2025-01-09 16:44:41,644 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 76 flow. Second operand 3 states and 64 transitions. [2025-01-09 16:44:41,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 46 transitions, 209 flow [2025-01-09 16:44:41,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 46 transitions, 187 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 16:44:41,653 INFO L231 Difference]: Finished difference. Result has 32 places, 32 transitions, 90 flow [2025-01-09 16:44:41,655 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-01-09 16:44:41,657 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2025-01-09 16:44:41,658 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 32 transitions, 90 flow [2025-01-09 16:44:41,659 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-01-09 16:44:41,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:44:41,659 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-01-09 16:44:41,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:44:41,659 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-01-09 16:44:41,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:44:41,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1101841572, now seen corresponding path program 1 times [2025-01-09 16:44:41,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:44:41,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543141291] [2025-01-09 16:44:41,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:44:41,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:44:41,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 16:44:41,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 16:44:41,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:44:41,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:44:41,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:44:41,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:44:41,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543141291] [2025-01-09 16:44:41,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543141291] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:44:41,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:44:41,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:44:41,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238845181] [2025-01-09 16:44:41,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:44:41,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:44:41,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:44:41,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:44:41,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:44:41,863 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-01-09 16:44:41,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 32 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:44:41,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:44:41,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-01-09 16:44:41,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:44:42,118 INFO L124 PetriNetUnfolderBase]: 1206/1844 cut-off events. [2025-01-09 16:44:42,118 INFO L125 PetriNetUnfolderBase]: For 341/341 co-relation queries the response was YES. [2025-01-09 16:44:42,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4166 conditions, 1844 events. 1206/1844 cut-off events. For 341/341 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 8678 event pairs, 745 based on Foata normal form. 0/1728 useless extension candidates. Maximal degree in co-relation 1064. Up to 1120 conditions per place. [2025-01-09 16:44:42,131 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 63 selfloop transitions, 5 changer transitions 0/71 dead transitions. [2025-01-09 16:44:42,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 71 transitions, 334 flow [2025-01-09 16:44:42,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:44:42,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:44:42,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2025-01-09 16:44:42,134 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5575757575757576 [2025-01-09 16:44:42,135 INFO L175 Difference]: Start difference. First operand has 32 places, 32 transitions, 90 flow. Second operand 5 states and 92 transitions. [2025-01-09 16:44:42,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 71 transitions, 334 flow [2025-01-09 16:44:42,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 71 transitions, 326 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:44:42,136 INFO L231 Difference]: Finished difference. Result has 38 places, 36 transitions, 122 flow [2025-01-09 16:44:42,136 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=122, PETRI_PLACES=38, PETRI_TRANSITIONS=36} [2025-01-09 16:44:42,138 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2025-01-09 16:44:42,139 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 36 transitions, 122 flow [2025-01-09 16:44:42,139 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-01-09 16:44:42,139 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:44:42,139 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-01-09 16:44:42,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:44:42,140 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-01-09 16:44:42,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:44:42,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1003093025, now seen corresponding path program 1 times [2025-01-09 16:44:42,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:44:42,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115172976] [2025-01-09 16:44:42,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:44:42,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:44:42,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 16:44:42,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 16:44:42,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:44:42,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:44:42,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:44:42,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:44:42,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115172976] [2025-01-09 16:44:42,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115172976] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:44:42,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:44:42,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:44:42,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811010457] [2025-01-09 16:44:42,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:44:42,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:44:42,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:44:42,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:44:42,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:44:42,292 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-01-09 16:44:42,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 36 transitions, 122 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:44:42,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:44:42,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-01-09 16:44:42,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:44:42,491 INFO L124 PetriNetUnfolderBase]: 1047/1614 cut-off events. [2025-01-09 16:44:42,491 INFO L125 PetriNetUnfolderBase]: For 681/759 co-relation queries the response was YES. [2025-01-09 16:44:42,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3863 conditions, 1614 events. 1047/1614 cut-off events. For 681/759 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 7310 event pairs, 686 based on Foata normal form. 0/1508 useless extension candidates. Maximal degree in co-relation 2745. Up to 1133 conditions per place. [2025-01-09 16:44:42,500 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 56 selfloop transitions, 5 changer transitions 0/64 dead transitions. [2025-01-09 16:44:42,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 64 transitions, 326 flow [2025-01-09 16:44:42,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:44:42,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:44:42,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2025-01-09 16:44:42,501 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5272727272727272 [2025-01-09 16:44:42,501 INFO L175 Difference]: Start difference. First operand has 38 places, 36 transitions, 122 flow. Second operand 5 states and 87 transitions. [2025-01-09 16:44:42,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 64 transitions, 326 flow [2025-01-09 16:44:42,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 64 transitions, 322 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 16:44:42,503 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 143 flow [2025-01-09 16:44:42,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=143, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2025-01-09 16:44:42,504 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 8 predicate places. [2025-01-09 16:44:42,504 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 143 flow [2025-01-09 16:44:42,504 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-01-09 16:44:42,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:44:42,505 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-01-09 16:44:42,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:44:42,505 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-01-09 16:44:42,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:44:42,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1065337476, now seen corresponding path program 1 times [2025-01-09 16:44:42,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:44:42,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293607447] [2025-01-09 16:44:42,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:44:42,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:44:42,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 16:44:42,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 16:44:42,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:44:42,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:44:42,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:44:42,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:44:42,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293607447] [2025-01-09 16:44:42,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293607447] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:44:42,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:44:42,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:44:42,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287832953] [2025-01-09 16:44:42,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:44:42,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:44:42,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:44:42,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:44:42,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:44:42,643 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-01-09 16:44:42,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 143 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:44:42,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:44:42,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-01-09 16:44:42,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:44:42,832 INFO L124 PetriNetUnfolderBase]: 882/1337 cut-off events. [2025-01-09 16:44:42,832 INFO L125 PetriNetUnfolderBase]: For 782/919 co-relation queries the response was YES. [2025-01-09 16:44:42,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3504 conditions, 1337 events. 882/1337 cut-off events. For 782/919 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5561 event pairs, 601 based on Foata normal form. 0/1270 useless extension candidates. Maximal degree in co-relation 2827. Up to 1095 conditions per place. [2025-01-09 16:44:42,839 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 28 selfloop transitions, 2 changer transitions 23/56 dead transitions. [2025-01-09 16:44:42,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 56 transitions, 309 flow [2025-01-09 16:44:42,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:44:42,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:44:42,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2025-01-09 16:44:42,842 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4909090909090909 [2025-01-09 16:44:42,842 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 143 flow. Second operand 5 states and 81 transitions. [2025-01-09 16:44:42,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 56 transitions, 309 flow [2025-01-09 16:44:42,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 56 transitions, 304 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:44:42,844 INFO L231 Difference]: Finished difference. Result has 47 places, 33 transitions, 116 flow [2025-01-09 16:44:42,844 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=116, PETRI_PLACES=47, PETRI_TRANSITIONS=33} [2025-01-09 16:44:42,846 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 12 predicate places. [2025-01-09 16:44:42,847 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 33 transitions, 116 flow [2025-01-09 16:44:42,847 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-01-09 16:44:42,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:44:42,847 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:44:42,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:44:42,847 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-01-09 16:44:42,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:44:42,848 INFO L85 PathProgramCache]: Analyzing trace with hash -995123571, now seen corresponding path program 1 times [2025-01-09 16:44:42,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:44:42,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477209301] [2025-01-09 16:44:42,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:44:42,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:44:42,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 16:44:42,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:44:42,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:44:42,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:44:42,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:44:42,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:44:42,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477209301] [2025-01-09 16:44:42,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477209301] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:44:42,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230123314] [2025-01-09 16:44:42,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:44:42,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:44:42,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:44:42,993 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:44:42,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 16:44:43,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 16:44:43,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:44:43,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:44:43,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:44:43,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:44:43,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:44:43,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:44:43,191 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:44:43,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:44:43,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230123314] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:44:43,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:44:43,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2025-01-09 16:44:43,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127195680] [2025-01-09 16:44:43,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:44:43,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:44:43,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:44:43,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:44:43,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-01-09 16:44:43,263 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-01-09 16:44:43,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 33 transitions, 116 flow. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:44:43,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:44:43,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-01-09 16:44:43,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:44:43,577 INFO L124 PetriNetUnfolderBase]: 1468/2122 cut-off events. [2025-01-09 16:44:43,577 INFO L125 PetriNetUnfolderBase]: For 836/986 co-relation queries the response was YES. [2025-01-09 16:44:43,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5707 conditions, 2122 events. 1468/2122 cut-off events. For 836/986 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9205 event pairs, 293 based on Foata normal form. 0/1872 useless extension candidates. Maximal degree in co-relation 5688. Up to 668 conditions per place. [2025-01-09 16:44:43,588 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 87 selfloop transitions, 15 changer transitions 0/104 dead transitions. [2025-01-09 16:44:43,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 104 transitions, 559 flow [2025-01-09 16:44:43,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:44:43,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 16:44:43,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 137 transitions. [2025-01-09 16:44:43,590 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4612794612794613 [2025-01-09 16:44:43,590 INFO L175 Difference]: Start difference. First operand has 47 places, 33 transitions, 116 flow. Second operand 9 states and 137 transitions. [2025-01-09 16:44:43,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 104 transitions, 559 flow [2025-01-09 16:44:43,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 104 transitions, 489 flow, removed 33 selfloop flow, removed 8 redundant places. [2025-01-09 16:44:43,599 INFO L231 Difference]: Finished difference. Result has 45 places, 44 transitions, 178 flow [2025-01-09 16:44:43,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=178, PETRI_PLACES=45, PETRI_TRANSITIONS=44} [2025-01-09 16:44:43,599 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 10 predicate places. [2025-01-09 16:44:43,599 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 44 transitions, 178 flow [2025-01-09 16:44:43,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:44:43,600 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:44:43,600 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:44:43,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 16:44:43,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:44:43,800 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-01-09 16:44:43,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:44:43,801 INFO L85 PathProgramCache]: Analyzing trace with hash 193095593, now seen corresponding path program 2 times [2025-01-09 16:44:43,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:44:43,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993378906] [2025-01-09 16:44:43,801 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:44:43,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:44:43,808 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-01-09 16:44:43,812 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 23 statements. [2025-01-09 16:44:43,812 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:44:43,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:44:43,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:44:43,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:44:43,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993378906] [2025-01-09 16:44:43,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993378906] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:44:43,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:44:43,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:44:43,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187905124] [2025-01-09 16:44:43,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:44:43,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:44:43,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:44:43,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:44:43,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:44:43,895 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-01-09 16:44:43,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 44 transitions, 178 flow. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:44:43,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:44:43,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-01-09 16:44:43,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:44:44,423 INFO L124 PetriNetUnfolderBase]: 3201/4655 cut-off events. [2025-01-09 16:44:44,423 INFO L125 PetriNetUnfolderBase]: For 3545/3545 co-relation queries the response was YES. [2025-01-09 16:44:44,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13140 conditions, 4655 events. 3201/4655 cut-off events. For 3545/3545 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 24253 event pairs, 371 based on Foata normal form. 13/4409 useless extension candidates. Maximal degree in co-relation 13117. Up to 1405 conditions per place. [2025-01-09 16:44:44,448 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 196 selfloop transitions, 23 changer transitions 0/221 dead transitions. [2025-01-09 16:44:44,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 221 transitions, 1373 flow [2025-01-09 16:44:44,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:44:44,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:44:44,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 193 transitions. [2025-01-09 16:44:44,451 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5316804407713499 [2025-01-09 16:44:44,451 INFO L175 Difference]: Start difference. First operand has 45 places, 44 transitions, 178 flow. Second operand 11 states and 193 transitions. [2025-01-09 16:44:44,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 221 transitions, 1373 flow [2025-01-09 16:44:44,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 221 transitions, 1370 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:44:44,464 INFO L231 Difference]: Finished difference. Result has 62 places, 66 transitions, 405 flow [2025-01-09 16:44:44,465 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=405, PETRI_PLACES=62, PETRI_TRANSITIONS=66} [2025-01-09 16:44:44,467 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 27 predicate places. [2025-01-09 16:44:44,467 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 66 transitions, 405 flow [2025-01-09 16:44:44,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:44:44,467 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:44:44,467 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:44:44,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:44:44,468 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-01-09 16:44:44,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:44:44,468 INFO L85 PathProgramCache]: Analyzing trace with hash -2020237469, now seen corresponding path program 3 times [2025-01-09 16:44:44,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:44:44,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390534681] [2025-01-09 16:44:44,468 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:44:44,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:44:44,476 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-01-09 16:44:44,487 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:44:44,487 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:44:44,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:44:44,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:44:44,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:44:44,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390534681] [2025-01-09 16:44:44,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390534681] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:44:44,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110864782] [2025-01-09 16:44:44,596 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:44:44,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:44:44,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:44:44,598 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:44:44,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 16:44:44,639 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-01-09 16:44:44,657 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:44:44,657 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:44:44,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:44:44,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:44:44,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:44:44,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:44:44,727 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:44:44,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:44:44,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110864782] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:44:44,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:44:44,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 14 [2025-01-09 16:44:44,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303476683] [2025-01-09 16:44:44,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:44:44,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:44:44,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:44:44,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:44:44,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-01-09 16:44:44,801 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-01-09 16:44:44,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 66 transitions, 405 flow. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:44:44,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:44:44,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-01-09 16:44:44,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:44:45,315 INFO L124 PetriNetUnfolderBase]: 4349/6271 cut-off events. [2025-01-09 16:44:45,315 INFO L125 PetriNetUnfolderBase]: For 13010/13379 co-relation queries the response was YES. [2025-01-09 16:44:45,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22306 conditions, 6271 events. 4349/6271 cut-off events. For 13010/13379 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 32722 event pairs, 760 based on Foata normal form. 186/6452 useless extension candidates. Maximal degree in co-relation 22275. Up to 1984 conditions per place. [2025-01-09 16:44:45,357 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 125 selfloop transitions, 40 changer transitions 0/168 dead transitions. [2025-01-09 16:44:45,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 168 transitions, 1272 flow [2025-01-09 16:44:45,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:44:45,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 16:44:45,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2025-01-09 16:44:45,359 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2025-01-09 16:44:45,359 INFO L175 Difference]: Start difference. First operand has 62 places, 66 transitions, 405 flow. Second operand 9 states and 144 transitions. [2025-01-09 16:44:45,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 168 transitions, 1272 flow [2025-01-09 16:44:45,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 168 transitions, 1260 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:44:45,402 INFO L231 Difference]: Finished difference. Result has 74 places, 82 transitions, 681 flow [2025-01-09 16:44:45,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=681, PETRI_PLACES=74, PETRI_TRANSITIONS=82} [2025-01-09 16:44:45,404 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 39 predicate places. [2025-01-09 16:44:45,404 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 82 transitions, 681 flow [2025-01-09 16:44:45,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:44:45,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:44:45,404 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:44:45,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 16:44:45,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:44:45,609 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-01-09 16:44:45,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:44:45,610 INFO L85 PathProgramCache]: Analyzing trace with hash -51491443, now seen corresponding path program 1 times [2025-01-09 16:44:45,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:44:45,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8641438] [2025-01-09 16:44:45,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:44:45,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:44:45,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 16:44:45,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:44:45,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:44:45,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:44:45,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:44:45,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:44:45,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8641438] [2025-01-09 16:44:45,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8641438] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:44:45,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620679962] [2025-01-09 16:44:45,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:44:45,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:44:45,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:44:45,707 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:44:45,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 16:44:45,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 16:44:45,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:44:45,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:44:45,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:44:45,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:44:45,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:44:45,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:44:45,797 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:44:45,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:44:45,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620679962] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:44:45,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:44:45,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-01-09 16:44:45,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73748246] [2025-01-09 16:44:45,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:44:45,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:44:45,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:44:45,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:44:45,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:44:45,826 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-01-09 16:44:45,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 82 transitions, 681 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:44:45,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:44:45,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-01-09 16:44:45,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:44:46,196 INFO L124 PetriNetUnfolderBase]: 3735/5525 cut-off events. [2025-01-09 16:44:46,196 INFO L125 PetriNetUnfolderBase]: For 23987/24094 co-relation queries the response was YES. [2025-01-09 16:44:46,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23478 conditions, 5525 events. 3735/5525 cut-off events. For 23987/24094 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 30355 event pairs, 929 based on Foata normal form. 215/5466 useless extension candidates. Maximal degree in co-relation 23440. Up to 3114 conditions per place. [2025-01-09 16:44:46,230 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 101 selfloop transitions, 9 changer transitions 0/121 dead transitions. [2025-01-09 16:44:46,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 121 transitions, 1275 flow [2025-01-09 16:44:46,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:44:46,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:44:46,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2025-01-09 16:44:46,231 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2025-01-09 16:44:46,231 INFO L175 Difference]: Start difference. First operand has 74 places, 82 transitions, 681 flow. Second operand 5 states and 72 transitions. [2025-01-09 16:44:46,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 121 transitions, 1275 flow [2025-01-09 16:44:46,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 121 transitions, 1206 flow, removed 15 selfloop flow, removed 4 redundant places. [2025-01-09 16:44:46,273 INFO L231 Difference]: Finished difference. Result has 74 places, 81 transitions, 652 flow [2025-01-09 16:44:46,273 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=652, PETRI_PLACES=74, PETRI_TRANSITIONS=81} [2025-01-09 16:44:46,274 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 39 predicate places. [2025-01-09 16:44:46,274 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 81 transitions, 652 flow [2025-01-09 16:44:46,274 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-01-09 16:44:46,274 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:44:46,274 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:44:46,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 16:44:46,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:44:46,478 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-01-09 16:44:46,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:44:46,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1834629903, now seen corresponding path program 4 times [2025-01-09 16:44:46,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:44:46,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282433207] [2025-01-09 16:44:46,479 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:44:46,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:44:46,484 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-01-09 16:44:46,487 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-01-09 16:44:46,487 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 16:44:46,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:44:46,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:44:46,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:44:46,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282433207] [2025-01-09 16:44:46,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282433207] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:44:46,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455720920] [2025-01-09 16:44:46,530 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:44:46,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:44:46,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:44:46,532 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:44:46,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 16:44:46,571 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-01-09 16:44:46,581 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-01-09 16:44:46,581 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 16:44:46,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:44:46,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:44:46,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:44:46,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:44:46,636 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:44:46,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:44:46,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455720920] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:44:46,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:44:46,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-01-09 16:44:46,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167923248] [2025-01-09 16:44:46,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:44:46,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 16:44:46,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:44:46,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 16:44:46,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-01-09 16:44:46,714 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-01-09 16:44:46,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 81 transitions, 652 flow. Second operand has 15 states, 15 states have (on average 6.533333333333333) internal successors, (98), 15 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:44:46,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:44:46,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-01-09 16:44:46,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:44:48,401 INFO L124 PetriNetUnfolderBase]: 9584/13587 cut-off events. [2025-01-09 16:44:48,401 INFO L125 PetriNetUnfolderBase]: For 52843/52843 co-relation queries the response was YES. [2025-01-09 16:44:48,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57773 conditions, 13587 events. 9584/13587 cut-off events. For 52843/52843 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 73547 event pairs, 997 based on Foata normal form. 14/13600 useless extension candidates. Maximal degree in co-relation 57734. Up to 3373 conditions per place. [2025-01-09 16:44:48,478 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 342 selfloop transitions, 197 changer transitions 0/540 dead transitions. [2025-01-09 16:44:48,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 540 transitions, 4772 flow [2025-01-09 16:44:48,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-01-09 16:44:48,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-01-09 16:44:48,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 462 transitions. [2025-01-09 16:44:48,484 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2025-01-09 16:44:48,484 INFO L175 Difference]: Start difference. First operand has 74 places, 81 transitions, 652 flow. Second operand 33 states and 462 transitions. [2025-01-09 16:44:48,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 540 transitions, 4772 flow [2025-01-09 16:44:48,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 540 transitions, 4699 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 16:44:48,647 INFO L231 Difference]: Finished difference. Result has 122 places, 268 transitions, 2946 flow [2025-01-09 16:44:48,647 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=2946, PETRI_PLACES=122, PETRI_TRANSITIONS=268} [2025-01-09 16:44:48,648 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 87 predicate places. [2025-01-09 16:44:48,648 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 268 transitions, 2946 flow [2025-01-09 16:44:48,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.533333333333333) internal successors, (98), 15 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:44:48,648 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:44:48,648 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:44:48,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 16:44:48,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-01-09 16:44:48,848 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-01-09 16:44:48,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:44:48,849 INFO L85 PathProgramCache]: Analyzing trace with hash 151215811, now seen corresponding path program 5 times [2025-01-09 16:44:48,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:44:48,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284479309] [2025-01-09 16:44:48,849 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:44:48,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:44:48,855 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-01-09 16:44:48,862 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:44:48,863 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:44:48,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:44:48,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:44:48,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:44:48,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284479309] [2025-01-09 16:44:48,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284479309] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:44:48,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272526924] [2025-01-09 16:44:48,969 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:44:48,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:44:48,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:44:48,971 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:44:48,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 16:44:49,011 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-01-09 16:44:49,025 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:44:49,025 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:44:49,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:44:49,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:44:49,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:44:49,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:44:49,080 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:44:49,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:44:49,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272526924] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:44:49,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:44:49,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2025-01-09 16:44:49,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949723404] [2025-01-09 16:44:49,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:44:49,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:44:49,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:44:49,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:44:49,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-01-09 16:44:49,134 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-01-09 16:44:49,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 268 transitions, 2946 flow. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:44:49,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:44:49,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-01-09 16:44:49,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:44:50,333 INFO L124 PetriNetUnfolderBase]: 8251/11919 cut-off events. [2025-01-09 16:44:50,333 INFO L125 PetriNetUnfolderBase]: For 74546/75240 co-relation queries the response was YES. [2025-01-09 16:44:50,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59827 conditions, 11919 events. 8251/11919 cut-off events. For 74546/75240 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 68473 event pairs, 780 based on Foata normal form. 283/12170 useless extension candidates. Maximal degree in co-relation 59770. Up to 3663 conditions per place. [2025-01-09 16:44:50,435 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 186 selfloop transitions, 194 changer transitions 0/387 dead transitions. [2025-01-09 16:44:50,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 387 transitions, 4796 flow [2025-01-09 16:44:50,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:44:50,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 16:44:50,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 130 transitions. [2025-01-09 16:44:50,436 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4377104377104377 [2025-01-09 16:44:50,436 INFO L175 Difference]: Start difference. First operand has 122 places, 268 transitions, 2946 flow. Second operand 9 states and 130 transitions. [2025-01-09 16:44:50,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 387 transitions, 4796 flow [2025-01-09 16:44:51,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 387 transitions, 4484 flow, removed 156 selfloop flow, removed 0 redundant places. [2025-01-09 16:44:51,089 INFO L231 Difference]: Finished difference. Result has 132 places, 310 transitions, 3666 flow [2025-01-09 16:44:51,089 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2692, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=153, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3666, PETRI_PLACES=132, PETRI_TRANSITIONS=310} [2025-01-09 16:44:51,089 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 97 predicate places. [2025-01-09 16:44:51,090 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 310 transitions, 3666 flow [2025-01-09 16:44:51,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:44:51,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:44:51,090 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:44:51,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 16:44:51,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 16:44:51,290 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-01-09 16:44:51,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:44:51,291 INFO L85 PathProgramCache]: Analyzing trace with hash 684783787, now seen corresponding path program 6 times [2025-01-09 16:44:51,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:44:51,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275320837] [2025-01-09 16:44:51,291 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:44:51,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:44:51,297 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 2 equivalence classes. [2025-01-09 16:44:51,302 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 22 of 23 statements. [2025-01-09 16:44:51,305 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 16:44:51,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:44:51,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:44:51,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:44:51,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275320837] [2025-01-09 16:44:51,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275320837] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:44:51,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:44:51,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:44:51,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854598198] [2025-01-09 16:44:51,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:44:51,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:44:51,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:44:51,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:44:51,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:44:51,405 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-01-09 16:44:51,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 310 transitions, 3666 flow. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:44:51,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:44:51,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-01-09 16:44:51,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:44:53,221 INFO L124 PetriNetUnfolderBase]: 12951/18335 cut-off events. [2025-01-09 16:44:53,221 INFO L125 PetriNetUnfolderBase]: For 130821/130821 co-relation queries the response was YES. [2025-01-09 16:44:53,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95157 conditions, 18335 events. 12951/18335 cut-off events. For 130821/130821 co-relation queries the response was YES. Maximal size of possible extension queue 754. Compared 105572 event pairs, 3018 based on Foata normal form. 13/18347 useless extension candidates. Maximal degree in co-relation 95095. Up to 9922 conditions per place. [2025-01-09 16:44:53,357 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 631 selfloop transitions, 149 changer transitions 0/781 dead transitions. [2025-01-09 16:44:53,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 781 transitions, 10449 flow [2025-01-09 16:44:53,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:44:53,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 16:44:53,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 209 transitions. [2025-01-09 16:44:53,358 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2025-01-09 16:44:53,358 INFO L175 Difference]: Start difference. First operand has 132 places, 310 transitions, 3666 flow. Second operand 12 states and 209 transitions. [2025-01-09 16:44:53,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 781 transitions, 10449 flow [2025-01-09 16:44:54,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 781 transitions, 10330 flow, removed 58 selfloop flow, removed 2 redundant places. [2025-01-09 16:44:54,491 INFO L231 Difference]: Finished difference. Result has 150 places, 451 transitions, 6144 flow [2025-01-09 16:44:54,491 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3617, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=6144, PETRI_PLACES=150, PETRI_TRANSITIONS=451} [2025-01-09 16:44:54,492 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 115 predicate places. [2025-01-09 16:44:54,492 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 451 transitions, 6144 flow [2025-01-09 16:44:54,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:44:54,492 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:44:54,492 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:44:54,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 16:44:54,492 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-01-09 16:44:54,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:44:54,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1167033795, now seen corresponding path program 7 times [2025-01-09 16:44:54,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:44:54,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680469957] [2025-01-09 16:44:54,493 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:44:54,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:44:54,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 16:44:54,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:44:54,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:44:54,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:44:54,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:44:54,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:44:54,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680469957] [2025-01-09 16:44:54,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680469957] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:44:54,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694242263] [2025-01-09 16:44:54,603 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:44:54,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:44:54,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:44:54,605 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:44:54,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 16:44:54,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 16:44:54,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:44:54,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:44:54,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:44:54,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:44:54,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:44:54,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:44:54,749 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:44:54,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:44:54,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694242263] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:44:54,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:44:54,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 15 [2025-01-09 16:44:54,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459937350] [2025-01-09 16:44:54,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:44:54,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:44:54,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:44:54,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:44:54,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-01-09 16:44:54,826 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-01-09 16:44:54,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 451 transitions, 6144 flow. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:44:54,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:44:54,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-01-09 16:44:54,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:44:56,998 INFO L124 PetriNetUnfolderBase]: 12139/17330 cut-off events. [2025-01-09 16:44:56,998 INFO L125 PetriNetUnfolderBase]: For 142997/143923 co-relation queries the response was YES. [2025-01-09 16:44:57,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95961 conditions, 17330 events. 12139/17330 cut-off events. For 142997/143923 co-relation queries the response was YES. Maximal size of possible extension queue 855. Compared 103717 event pairs, 1741 based on Foata normal form. 292/17594 useless extension candidates. Maximal degree in co-relation 95891. Up to 5989 conditions per place. [2025-01-09 16:44:57,168 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 352 selfloop transitions, 306 changer transitions 0/665 dead transitions. [2025-01-09 16:44:57,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 665 transitions, 9507 flow [2025-01-09 16:44:57,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:44:57,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 16:44:57,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 143 transitions. [2025-01-09 16:44:57,169 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2025-01-09 16:44:57,169 INFO L175 Difference]: Start difference. First operand has 150 places, 451 transitions, 6144 flow. Second operand 9 states and 143 transitions. [2025-01-09 16:44:57,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 665 transitions, 9507 flow [2025-01-09 16:44:58,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 665 transitions, 9392 flow, removed 44 selfloop flow, removed 1 redundant places. [2025-01-09 16:44:58,480 INFO L231 Difference]: Finished difference. Result has 160 places, 526 transitions, 7986 flow [2025-01-09 16:44:58,481 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=6062, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=231, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7986, PETRI_PLACES=160, PETRI_TRANSITIONS=526} [2025-01-09 16:44:58,481 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 125 predicate places. [2025-01-09 16:44:58,481 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 526 transitions, 7986 flow [2025-01-09 16:44:58,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:44:58,481 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:44:58,481 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:44:58,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 16:44:58,682 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,SelfDestructingSolverStorable11 [2025-01-09 16:44:58,682 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-01-09 16:44:58,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:44:58,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1436898251, now seen corresponding path program 8 times [2025-01-09 16:44:58,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:44:58,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113973156] [2025-01-09 16:44:58,683 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:44:58,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:44:58,690 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-01-09 16:44:58,695 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:44:58,695 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:44:58,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:44:58,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:44:58,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:44:58,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113973156] [2025-01-09 16:44:58,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113973156] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:44:58,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575826316] [2025-01-09 16:44:58,774 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:44:58,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:44:58,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:44:58,776 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:44:58,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 16:44:58,818 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-01-09 16:44:58,833 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:44:58,833 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:44:58,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:44:58,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:44:58,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:44:58,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:44:58,894 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:44:58,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:44:58,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575826316] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:44:58,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:44:58,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 14 [2025-01-09 16:44:58,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836820076] [2025-01-09 16:44:58,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:44:58,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:44:58,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:44:58,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:44:58,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-01-09 16:44:58,956 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-01-09 16:44:58,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 526 transitions, 7986 flow. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:44:58,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:44:58,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-01-09 16:44:58,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:45:00,961 INFO L124 PetriNetUnfolderBase]: 12106/17413 cut-off events. [2025-01-09 16:45:00,962 INFO L125 PetriNetUnfolderBase]: For 186133/186953 co-relation queries the response was YES. [2025-01-09 16:45:01,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101489 conditions, 17413 events. 12106/17413 cut-off events. For 186133/186953 co-relation queries the response was YES. Maximal size of possible extension queue 861. Compared 104865 event pairs, 1661 based on Foata normal form. 304/17689 useless extension candidates. Maximal degree in co-relation 101413. Up to 8786 conditions per place. [2025-01-09 16:45:01,127 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 342 selfloop transitions, 259 changer transitions 0/608 dead transitions. [2025-01-09 16:45:01,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 608 transitions, 9889 flow [2025-01-09 16:45:01,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:45:01,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:45:01,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 125 transitions. [2025-01-09 16:45:01,128 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4734848484848485 [2025-01-09 16:45:01,128 INFO L175 Difference]: Start difference. First operand has 160 places, 526 transitions, 7986 flow. Second operand 8 states and 125 transitions. [2025-01-09 16:45:01,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 608 transitions, 9889 flow [2025-01-09 16:45:02,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 608 transitions, 9798 flow, removed 44 selfloop flow, removed 2 redundant places. [2025-01-09 16:45:02,794 INFO L231 Difference]: Finished difference. Result has 167 places, 529 transitions, 8776 flow [2025-01-09 16:45:02,795 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=7903, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=256, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8776, PETRI_PLACES=167, PETRI_TRANSITIONS=529} [2025-01-09 16:45:02,795 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 132 predicate places. [2025-01-09 16:45:02,795 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 529 transitions, 8776 flow [2025-01-09 16:45:02,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:45:02,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:45:02,795 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:45:02,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 16:45:02,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:45:02,996 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-01-09 16:45:02,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:45:02,997 INFO L85 PathProgramCache]: Analyzing trace with hash -2062666465, now seen corresponding path program 9 times [2025-01-09 16:45:02,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:45:02,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609484907] [2025-01-09 16:45:02,997 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:45:02,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:45:03,002 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-01-09 16:45:03,006 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 22 of 23 statements. [2025-01-09 16:45:03,007 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:45:03,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:03,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:45:03,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:45:03,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609484907] [2025-01-09 16:45:03,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609484907] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:45:03,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:45:03,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:45:03,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859180503] [2025-01-09 16:45:03,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:45:03,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:45:03,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:45:03,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:45:03,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:45:03,091 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-01-09 16:45:03,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 529 transitions, 8776 flow. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:45:03,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:45:03,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-01-09 16:45:03,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:45:06,245 INFO L124 PetriNetUnfolderBase]: 15666/22111 cut-off events. [2025-01-09 16:45:06,245 INFO L125 PetriNetUnfolderBase]: For 280930/280930 co-relation queries the response was YES. [2025-01-09 16:45:06,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135033 conditions, 22111 events. 15666/22111 cut-off events. For 280930/280930 co-relation queries the response was YES. Maximal size of possible extension queue 909. Compared 130567 event pairs, 1309 based on Foata normal form. 22/22132 useless extension candidates. Maximal degree in co-relation 134954. Up to 10936 conditions per place. [2025-01-09 16:45:06,791 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 902 selfloop transitions, 150 changer transitions 0/1053 dead transitions. [2025-01-09 16:45:06,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 1053 transitions, 18890 flow [2025-01-09 16:45:06,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 16:45:06,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 16:45:06,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 219 transitions. [2025-01-09 16:45:06,792 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5104895104895105 [2025-01-09 16:45:06,792 INFO L175 Difference]: Start difference. First operand has 167 places, 529 transitions, 8776 flow. Second operand 13 states and 219 transitions. [2025-01-09 16:45:06,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 1053 transitions, 18890 flow [2025-01-09 16:45:08,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 1053 transitions, 18476 flow, removed 41 selfloop flow, removed 3 redundant places. [2025-01-09 16:45:08,651 INFO L231 Difference]: Finished difference. Result has 184 places, 595 transitions, 10410 flow [2025-01-09 16:45:08,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=8581, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=529, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=10410, PETRI_PLACES=184, PETRI_TRANSITIONS=595} [2025-01-09 16:45:08,652 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 149 predicate places. [2025-01-09 16:45:08,652 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 595 transitions, 10410 flow [2025-01-09 16:45:08,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:45:08,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:45:08,652 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:45:08,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 16:45:08,652 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-01-09 16:45:08,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:45:08,653 INFO L85 PathProgramCache]: Analyzing trace with hash -2080802233, now seen corresponding path program 10 times [2025-01-09 16:45:08,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:45:08,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296943785] [2025-01-09 16:45:08,653 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:45:08,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:45:08,657 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-01-09 16:45:08,658 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-01-09 16:45:08,659 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 16:45:08,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:08,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:45:08,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:45:08,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296943785] [2025-01-09 16:45:08,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296943785] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:45:08,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:45:08,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:45:08,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763379096] [2025-01-09 16:45:08,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:45:08,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:45:08,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:45:08,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:45:08,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:45:08,701 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-01-09 16:45:08,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 595 transitions, 10410 flow. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:45:08,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:45:08,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-01-09 16:45:08,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:45:11,815 INFO L124 PetriNetUnfolderBase]: 16909/23858 cut-off events. [2025-01-09 16:45:11,815 INFO L125 PetriNetUnfolderBase]: For 309489/309489 co-relation queries the response was YES. [2025-01-09 16:45:12,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149470 conditions, 23858 events. 16909/23858 cut-off events. For 309489/309489 co-relation queries the response was YES. Maximal size of possible extension queue 998. Compared 139297 event pairs, 4817 based on Foata normal form. 2/23859 useless extension candidates. Maximal degree in co-relation 149384. Up to 10879 conditions per place. [2025-01-09 16:45:12,595 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 455 selfloop transitions, 288 changer transitions 2/746 dead transitions. [2025-01-09 16:45:12,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 746 transitions, 13847 flow [2025-01-09 16:45:12,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:45:12,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:45:12,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2025-01-09 16:45:12,597 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4805194805194805 [2025-01-09 16:45:12,597 INFO L175 Difference]: Start difference. First operand has 184 places, 595 transitions, 10410 flow. Second operand 7 states and 111 transitions. [2025-01-09 16:45:12,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 746 transitions, 13847 flow [2025-01-09 16:45:15,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 746 transitions, 13710 flow, removed 51 selfloop flow, removed 2 redundant places. [2025-01-09 16:45:15,657 INFO L231 Difference]: Finished difference. Result has 193 places, 656 transitions, 12525 flow [2025-01-09 16:45:15,658 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=10293, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=595, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=227, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=12525, PETRI_PLACES=193, PETRI_TRANSITIONS=656} [2025-01-09 16:45:15,658 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 158 predicate places. [2025-01-09 16:45:15,658 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 656 transitions, 12525 flow [2025-01-09 16:45:15,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:45:15,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:45:15,658 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:45:15,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 16:45:15,658 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-01-09 16:45:15,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:45:15,659 INFO L85 PathProgramCache]: Analyzing trace with hash 665608833, now seen corresponding path program 11 times [2025-01-09 16:45:15,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:45:15,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667903008] [2025-01-09 16:45:15,659 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:45:15,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:45:15,664 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-01-09 16:45:15,668 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:45:15,669 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:45:15,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:15,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:45:15,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:45:15,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667903008] [2025-01-09 16:45:15,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667903008] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:45:15,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482615145] [2025-01-09 16:45:15,729 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:45:15,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:45:15,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:45:15,731 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:45:15,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 16:45:15,774 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-01-09 16:45:15,790 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:45:15,790 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:45:15,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:15,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:45:15,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:45:15,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:45:15,858 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:45:15,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:45:15,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482615145] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:45:15,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:45:15,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2025-01-09 16:45:15,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687295269] [2025-01-09 16:45:15,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:45:15,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 16:45:15,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:45:15,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 16:45:15,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-01-09 16:45:15,932 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-01-09 16:45:15,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 656 transitions, 12525 flow. Second operand has 16 states, 16 states have (on average 7.125) internal successors, (114), 16 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:45:15,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:45:15,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-01-09 16:45:15,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:45:21,233 INFO L124 PetriNetUnfolderBase]: 20247/28737 cut-off events. [2025-01-09 16:45:21,234 INFO L125 PetriNetUnfolderBase]: For 395292/395292 co-relation queries the response was YES. [2025-01-09 16:45:21,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183769 conditions, 28737 events. 20247/28737 cut-off events. For 395292/395292 co-relation queries the response was YES. Maximal size of possible extension queue 1086. Compared 172354 event pairs, 1114 based on Foata normal form. 74/28810 useless extension candidates. Maximal degree in co-relation 183678. Up to 6859 conditions per place. [2025-01-09 16:45:21,918 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 462 selfloop transitions, 945 changer transitions 0/1408 dead transitions. [2025-01-09 16:45:21,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 1408 transitions, 25223 flow [2025-01-09 16:45:21,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-01-09 16:45:21,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-01-09 16:45:21,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 595 transitions. [2025-01-09 16:45:21,920 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4006734006734007 [2025-01-09 16:45:21,920 INFO L175 Difference]: Start difference. First operand has 193 places, 656 transitions, 12525 flow. Second operand 45 states and 595 transitions. [2025-01-09 16:45:21,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 1408 transitions, 25223 flow [2025-01-09 16:45:26,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 1408 transitions, 24748 flow, removed 89 selfloop flow, removed 5 redundant places. [2025-01-09 16:45:26,058 INFO L231 Difference]: Finished difference. Result has 236 places, 1062 transitions, 21791 flow [2025-01-09 16:45:26,058 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=11996, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=647, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=530, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=21791, PETRI_PLACES=236, PETRI_TRANSITIONS=1062} [2025-01-09 16:45:26,059 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 201 predicate places. [2025-01-09 16:45:26,059 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 1062 transitions, 21791 flow [2025-01-09 16:45:26,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.125) internal successors, (114), 16 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:45:26,059 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:45:26,059 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-01-09 16:45:26,065 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-01-09 16:45:26,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-09 16:45:26,260 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-01-09 16:45:26,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:45:26,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1108570087, now seen corresponding path program 1 times [2025-01-09 16:45:26,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:45:26,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432712145] [2025-01-09 16:45:26,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:45:26,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:45:26,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:45:26,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:45:26,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:45:26,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:26,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:45:26,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:45:26,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432712145] [2025-01-09 16:45:26,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432712145] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:45:26,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716565362] [2025-01-09 16:45:26,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:45:26,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:45:26,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:45:26,760 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:45:26,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 16:45:26,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:45:26,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:45:26,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:45:26,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:26,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-01-09 16:45:26,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:45:26,862 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-01-09 16:45:27,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 16:45:27,082 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:45:27,082 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:45:27,384 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 33 treesize of output 29 [2025-01-09 16:45:27,397 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:45:27,397 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 70 treesize of output 62 [2025-01-09 16:45:27,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:45:27,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716565362] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:45:27,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:45:27,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24 [2025-01-09 16:45:27,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977078983] [2025-01-09 16:45:27,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:45:27,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 16:45:27,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:45:27,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 16:45:27,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2025-01-09 16:45:27,666 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-01-09 16:45:27,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 1062 transitions, 21791 flow. Second operand has 25 states, 25 states have (on average 8.24) internal successors, (206), 25 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-01-09 16:45:27,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:45:27,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-01-09 16:45:27,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:45:34,052 INFO L124 PetriNetUnfolderBase]: 20111/29715 cut-off events. [2025-01-09 16:45:34,052 INFO L125 PetriNetUnfolderBase]: For 475286/477931 co-relation queries the response was YES. [2025-01-09 16:45:34,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198398 conditions, 29715 events. 20111/29715 cut-off events. For 475286/477931 co-relation queries the response was YES. Maximal size of possible extension queue 1521. Compared 203923 event pairs, 1599 based on Foata normal form. 998/30549 useless extension candidates. Maximal degree in co-relation 194804. Up to 22873 conditions per place. [2025-01-09 16:45:34,588 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 1616 selfloop transitions, 160 changer transitions 1/1958 dead transitions. [2025-01-09 16:45:34,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 1958 transitions, 42362 flow [2025-01-09 16:45:34,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 16:45:34,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-09 16:45:34,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 244 transitions. [2025-01-09 16:45:34,589 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49292929292929294 [2025-01-09 16:45:34,589 INFO L175 Difference]: Start difference. First operand has 236 places, 1062 transitions, 21791 flow. Second operand 15 states and 244 transitions. [2025-01-09 16:45:34,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 1958 transitions, 42362 flow [2025-01-09 16:45:41,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 1958 transitions, 39431 flow, removed 525 selfloop flow, removed 8 redundant places. [2025-01-09 16:45:41,764 INFO L231 Difference]: Finished difference. Result has 250 places, 1217 transitions, 23335 flow [2025-01-09 16:45:41,765 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=20142, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1062, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=951, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=23335, PETRI_PLACES=250, PETRI_TRANSITIONS=1217} [2025-01-09 16:45:41,765 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 215 predicate places. [2025-01-09 16:45:41,765 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 1217 transitions, 23335 flow [2025-01-09 16:45:41,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.24) internal successors, (206), 25 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-01-09 16:45:41,765 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:45:41,766 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-01-09 16:45:41,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-09 16:45:41,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:45:41,966 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-01-09 16:45:41,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:45:41,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1354814739, now seen corresponding path program 2 times [2025-01-09 16:45:41,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:45:41,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982403253] [2025-01-09 16:45:41,967 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:45:41,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:45:41,971 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-01-09 16:45:41,977 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:45:41,977 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:45:41,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:42,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:45:42,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:45:42,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982403253] [2025-01-09 16:45:42,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982403253] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:45:42,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845512928] [2025-01-09 16:45:42,205 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:45:42,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:45:42,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:45:42,209 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:45:42,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 16:45:42,252 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-01-09 16:45:42,270 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:45:42,270 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:45:42,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:42,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-09 16:45:42,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:45:42,290 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-01-09 16:45:42,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 16:45:42,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:45:42,431 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:45:42,566 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:45:42,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845512928] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:45:42,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:45:42,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 24 [2025-01-09 16:45:42,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131330646] [2025-01-09 16:45:42,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:45:42,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 16:45:42,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:45:42,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 16:45:42,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2025-01-09 16:45:42,636 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-01-09 16:45:42,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 1217 transitions, 23335 flow. Second operand has 25 states, 25 states have (on average 8.2) internal successors, (205), 25 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:45:42,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:45:42,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-01-09 16:45:42,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:45:48,887 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L60-->L57-4: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_10| (+ |v_thread2Thread1of1ForFork0_~i~1#1_9| 1)) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_9|} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_10|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post6#1][1544], [Black: 234#(<= 1 ~N~0), Black: 239#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0))), Black: 232#(= |thread1Thread1of1ForFork2_~i~0#1| 0), Black: 733#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 745#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 739#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 1281#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 757#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 719#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 741#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 759#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 616#(and (<= 1 ~N~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 725#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), 1516#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), 1289#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0)), 972#(<= 1 ~N~0), Black: 1492#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 1299#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0))), Black: 1542#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1309#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 1 ~M~0)), Black: 1295#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0))), Black: 1490#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 407#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), Black: 1297#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0))), Black: 1381#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 1305#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0))), Black: 1544#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 415#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1494#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 1307#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 409#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1303#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 1 ~M~0)), Black: 263#(<= 1 ~N~0), Black: 1532#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 1301#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), 411#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 936#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0) (<= 1 ~M~0)), 6#L89-4true, Black: 932#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 44#(and (= ~res1~0 0) (= ~res2~0 0)), Black: 1320#(<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0), Black: 48#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 1326#(and (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| |thread3Thread1of1ForFork1_~i~2#1|) ~M~0)), 221#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 11#L57-4true, 942#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0)), Black: 954#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 956#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0))), Black: 950#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 1 ~M~0)), Black: 944#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 33#L48true, Black: 948#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 1 ~M~0)), Black: 943#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 952#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0))), 233#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0)), Black: 958#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), 1780#true, 930#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), 1573#true, Black: 225#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 219#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0)), Black: 223#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 217#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), Black: 1123#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1121#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1763#(and (= ~res1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (<= 0 ~M~0) (= ~A~0.offset 0) (<= ~M~0 ~N~0) (<= ~N~0 1) (= ~res2~0 0) (<= 0 |thread3Thread1of1ForFork1_~i~2#1|)), Black: 1771#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~res2~0 ~res1~0) (forall ((|v_thread3Thread1of1ForFork1_~i~2#1_39| Int)) (or (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* |v_thread3Thread1of1ForFork1_~i~2#1_39| 4))) ~res2~0) (+ ~res1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (< |v_thread3Thread1of1ForFork1_~i~2#1_39| ~M~0) (< ~N~0 (+ |v_thread3Thread1of1ForFork1_~i~2#1_39| 1))))), Black: 1753#(and (<= 0 ~M~0) (= ~A~0.offset 0) (<= ~M~0 ~N~0) (= ~res1~0 0) (<= ~N~0 1) (= ~res2~0 0)), Black: 1761#(and (= ~res1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (<= 0 ~M~0) (= ~A~0.offset 0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~M~0 ~N~0) (<= ~N~0 1) (= ~res2~0 0) (<= 0 |thread3Thread1of1ForFork1_~i~2#1|)), Black: 1759#(and (= ~res1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (<= 0 ~M~0) (= ~A~0.offset 0) (<= ~M~0 ~N~0) (<= ~N~0 1) (= ~res2~0 0)), Black: 1769#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (forall ((|v_thread3Thread1of1ForFork1_~i~2#1_39| Int)) (or (< |v_thread3Thread1of1ForFork1_~i~2#1_39| ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* |v_thread3Thread1of1ForFork1_~i~2#1_39| 4))) ~res2~0) (+ ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (< ~N~0 (+ |v_thread3Thread1of1ForFork1_~i~2#1_39| 1)))) (= ~res2~0 ~res1~0) (forall ((|v_thread3Thread1of1ForFork1_~i~2#1_39| Int)) (or (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* |v_thread3Thread1of1ForFork1_~i~2#1_39| 4))) ~res2~0) (+ ~res1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (< |v_thread3Thread1of1ForFork1_~i~2#1_39| ~M~0) (< ~N~0 (+ |v_thread3Thread1of1ForFork1_~i~2#1_39| 1))))), Black: 1757#(and (= ~res1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (<= 0 ~M~0) (= ~A~0.offset 0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~M~0 ~N~0) (<= ~N~0 1) (= ~res2~0 0)), Black: 1751#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (= ~N~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (= ~res1~0 0) (= ~res2~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 571#(<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0), Black: 723#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), 13#L68true, Black: 247#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 749#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 241#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (<= 1 ~M~0)), Black: 721#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 243#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0))), Black: 249#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 1 ~M~0)), Black: 729#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 602#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 245#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 1 ~M~0))]) [2025-01-09 16:45:48,887 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-01-09 16:45:48,887 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:45:48,887 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:45:48,887 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:45:49,235 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L60-->L57-4: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_10| (+ |v_thread2Thread1of1ForFork0_~i~1#1_9| 1)) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_9|} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_10|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post6#1][1544], [Black: 234#(<= 1 ~N~0), Black: 239#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0))), Black: 733#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 232#(= |thread1Thread1of1ForFork2_~i~0#1| 0), Black: 745#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 739#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 1281#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 757#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 719#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 741#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 759#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 616#(and (<= 1 ~N~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 725#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), 1516#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), 1289#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0)), 972#(<= 1 ~N~0), Black: 1492#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 1299#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0))), Black: 1542#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1309#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 1 ~M~0)), Black: 1295#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0))), Black: 1490#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 407#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), Black: 1297#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0))), Black: 1381#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 1305#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0))), Black: 415#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1544#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 1494#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 1307#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 409#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1303#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 1 ~M~0)), Black: 1532#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 263#(<= 1 ~N~0), Black: 1301#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), 411#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 936#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0) (<= 1 ~M~0)), Black: 932#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 44#(and (= ~res1~0 0) (= ~res2~0 0)), Black: 1320#(<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0), Black: 48#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 1326#(and (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| |thread3Thread1of1ForFork1_~i~2#1|) ~M~0)), 221#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 11#L57-4true, 942#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0)), Black: 954#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 956#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0))), Black: 950#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 1 ~M~0)), Black: 944#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 948#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 1 ~M~0)), 33#L48true, Black: 943#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 952#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0))), Black: 958#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), 233#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0)), 1780#true, 930#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), 1573#true, Black: 225#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 219#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0)), Black: 223#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 217#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), Black: 1123#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1121#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1763#(and (= ~res1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (<= 0 ~M~0) (= ~A~0.offset 0) (<= ~M~0 ~N~0) (<= ~N~0 1) (= ~res2~0 0) (<= 0 |thread3Thread1of1ForFork1_~i~2#1|)), Black: 1771#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~res2~0 ~res1~0) (forall ((|v_thread3Thread1of1ForFork1_~i~2#1_39| Int)) (or (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* |v_thread3Thread1of1ForFork1_~i~2#1_39| 4))) ~res2~0) (+ ~res1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (< |v_thread3Thread1of1ForFork1_~i~2#1_39| ~M~0) (< ~N~0 (+ |v_thread3Thread1of1ForFork1_~i~2#1_39| 1))))), Black: 1753#(and (<= 0 ~M~0) (= ~A~0.offset 0) (<= ~M~0 ~N~0) (= ~res1~0 0) (<= ~N~0 1) (= ~res2~0 0)), Black: 1761#(and (= ~res1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (<= 0 ~M~0) (= ~A~0.offset 0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~M~0 ~N~0) (<= ~N~0 1) (= ~res2~0 0) (<= 0 |thread3Thread1of1ForFork1_~i~2#1|)), Black: 1759#(and (= ~res1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (<= 0 ~M~0) (= ~A~0.offset 0) (<= ~M~0 ~N~0) (<= ~N~0 1) (= ~res2~0 0)), Black: 1769#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (forall ((|v_thread3Thread1of1ForFork1_~i~2#1_39| Int)) (or (< |v_thread3Thread1of1ForFork1_~i~2#1_39| ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* |v_thread3Thread1of1ForFork1_~i~2#1_39| 4))) ~res2~0) (+ ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (< ~N~0 (+ |v_thread3Thread1of1ForFork1_~i~2#1_39| 1)))) (= ~res2~0 ~res1~0) (forall ((|v_thread3Thread1of1ForFork1_~i~2#1_39| Int)) (or (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* |v_thread3Thread1of1ForFork1_~i~2#1_39| 4))) ~res2~0) (+ ~res1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (< |v_thread3Thread1of1ForFork1_~i~2#1_39| ~M~0) (< ~N~0 (+ |v_thread3Thread1of1ForFork1_~i~2#1_39| 1))))), 17#L90true, Black: 1757#(and (= ~res1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (<= 0 ~M~0) (= ~A~0.offset 0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~M~0 ~N~0) (<= ~N~0 1) (= ~res2~0 0)), Black: 1751#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (= ~N~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (= ~res1~0 0) (= ~res2~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 571#(<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0), Black: 723#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 247#(and (<= 1 ~N~0) (<= 1 ~M~0)), 13#L68true, Black: 749#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 241#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (<= 1 ~M~0)), Black: 721#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 243#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0))), Black: 249#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 1 ~M~0)), Black: 729#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 245#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 1 ~M~0)), Black: 602#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0))]) [2025-01-09 16:45:49,236 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-01-09 16:45:49,236 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-09 16:45:49,236 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-09 16:45:49,236 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-09 16:45:49,912 INFO L124 PetriNetUnfolderBase]: 23967/35519 cut-off events. [2025-01-09 16:45:49,913 INFO L125 PetriNetUnfolderBase]: For 445717/449062 co-relation queries the response was YES. [2025-01-09 16:45:50,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234369 conditions, 35519 events. 23967/35519 cut-off events. For 445717/449062 co-relation queries the response was YES. Maximal size of possible extension queue 1926. Compared 250804 event pairs, 1480 based on Foata normal form. 1137/36527 useless extension candidates. Maximal degree in co-relation 231943. Up to 26651 conditions per place. [2025-01-09 16:45:50,695 INFO L140 encePairwiseOnDemand]: 19/33 looper letters, 1275 selfloop transitions, 294 changer transitions 1/1691 dead transitions. [2025-01-09 16:45:50,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 1691 transitions, 34109 flow [2025-01-09 16:45:50,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 16:45:50,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-09 16:45:50,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 185 transitions. [2025-01-09 16:45:50,696 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4004329004329004 [2025-01-09 16:45:50,696 INFO L175 Difference]: Start difference. First operand has 250 places, 1217 transitions, 23335 flow. Second operand 14 states and 185 transitions. [2025-01-09 16:45:50,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 1691 transitions, 34109 flow