./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-array-int-subst.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/chl-array-int-subst.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 779f57e464f50d458e1b66270e0c9f2866c6247d4d7f63a3096c6ac13e286657 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:37:51,437 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:37:51,488 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:37:51,494 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:37:51,496 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:37:51,518 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:37:51,518 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:37:51,518 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:37:51,518 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:37:51,519 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:37:51,519 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:37:51,519 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:37:51,519 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:37:51,519 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:37:51,519 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:37:51,519 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:37:51,519 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:37:51,519 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:37:51,519 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:37:51,519 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:37:51,519 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:37:51,519 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:37:51,519 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:37:51,521 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:37:51,521 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:37:51,521 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:37:51,522 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:37:51,522 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:37:51,522 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:37:51,522 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:37:51,522 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:37:51,522 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:37:51,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:37:51,522 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:37:51,523 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:37:51,523 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:37:51,523 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:37:51,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:37:51,523 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:37:51,523 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:37:51,523 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:37:51,523 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:37:51,523 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:37:51,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:37:51,523 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:37:51,523 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:37:51,524 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:37:51,524 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:37:51,524 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 -> 779f57e464f50d458e1b66270e0c9f2866c6247d4d7f63a3096c6ac13e286657 [2025-01-09 16:37:51,717 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:37:51,722 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:37:51,724 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:37:51,726 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:37:51,726 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:37:51,727 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-array-int-subst.wvr.c [2025-01-09 16:37:52,840 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e42f206a6/e56328608a8540eeb87906012f68527d/FLAGb23936ac1 [2025-01-09 16:37:53,053 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:37:53,054 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-subst.wvr.c [2025-01-09 16:37:53,060 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e42f206a6/e56328608a8540eeb87906012f68527d/FLAGb23936ac1 [2025-01-09 16:37:53,408 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e42f206a6/e56328608a8540eeb87906012f68527d [2025-01-09 16:37:53,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:37:53,413 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:37:53,414 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:37:53,414 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:37:53,417 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:37:53,417 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:37:53" (1/1) ... [2025-01-09 16:37:53,418 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@413dff3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:37:53, skipping insertion in model container [2025-01-09 16:37:53,419 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:37:53" (1/1) ... [2025-01-09 16:37:53,434 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:37:53,565 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/chl-array-int-subst.wvr.c[2820,2833] [2025-01-09 16:37:53,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:37:53,585 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:37:53,608 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/chl-array-int-subst.wvr.c[2820,2833] [2025-01-09 16:37:53,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:37:53,625 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:37:53,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:37:53 WrapperNode [2025-01-09 16:37:53,627 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:37:53,628 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:37:53,629 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:37:53,629 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:37:53,634 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:37:53" (1/1) ... [2025-01-09 16:37:53,639 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:37:53" (1/1) ... [2025-01-09 16:37:53,665 INFO L138 Inliner]: procedures = 25, calls = 35, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 256 [2025-01-09 16:37:53,667 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:37:53,667 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:37:53,667 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:37:53,667 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:37:53,674 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:37:53" (1/1) ... [2025-01-09 16:37:53,674 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:37:53" (1/1) ... [2025-01-09 16:37:53,680 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:37:53" (1/1) ... [2025-01-09 16:37:53,696 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-01-09 16:37:53,696 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:37:53" (1/1) ... [2025-01-09 16:37:53,696 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:37:53" (1/1) ... [2025-01-09 16:37:53,702 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:37:53" (1/1) ... [2025-01-09 16:37:53,705 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:37:53" (1/1) ... [2025-01-09 16:37:53,707 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:37:53" (1/1) ... [2025-01-09 16:37:53,708 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:37:53" (1/1) ... [2025-01-09 16:37:53,709 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:37:53" (1/1) ... [2025-01-09 16:37:53,712 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:37:53,713 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:37:53,713 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:37:53,713 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:37:53,713 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:37:53" (1/1) ... [2025-01-09 16:37:53,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:37:53,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:37:53,735 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:37:53,737 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:37:53,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:37:53,755 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:37:53,755 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:37:53,755 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:37:53,755 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:37:53,755 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 16:37:53,755 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 16:37:53,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:37:53,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:37:53,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:37:53,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:37:53,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 16:37:53,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:37:53,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:37:53,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:37:53,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:37:53,757 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:37:53,854 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:37:53,856 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:37:54,167 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:37:54,167 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:37:54,391 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:37:54,392 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:37:54,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:37:54 BoogieIcfgContainer [2025-01-09 16:37:54,392 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:37:54,393 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:37:54,393 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:37:54,396 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:37:54,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:37:53" (1/3) ... [2025-01-09 16:37:54,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@376ed620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:37:54, skipping insertion in model container [2025-01-09 16:37:54,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:37:53" (2/3) ... [2025-01-09 16:37:54,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@376ed620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:37:54, skipping insertion in model container [2025-01-09 16:37:54,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:37:54" (3/3) ... [2025-01-09 16:37:54,398 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-array-int-subst.wvr.c [2025-01-09 16:37:54,409 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:37:54,410 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-array-int-subst.wvr.c that has 4 procedures, 32 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-01-09 16:37:54,411 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:37:54,458 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 16:37:54,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 40 transitions, 101 flow [2025-01-09 16:37:54,505 INFO L124 PetriNetUnfolderBase]: 9/37 cut-off events. [2025-01-09 16:37:54,506 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:37:54,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 37 events. 9/37 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 44 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-01-09 16:37:54,509 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 40 transitions, 101 flow [2025-01-09 16:37:54,511 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 36 transitions, 90 flow [2025-01-09 16:37:54,516 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:37:54,529 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;@525f891, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:37:54,529 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 16:37:54,541 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:37:54,541 INFO L124 PetriNetUnfolderBase]: 9/35 cut-off events. [2025-01-09 16:37:54,542 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:37:54,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:37:54,542 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] [2025-01-09 16:37:54,542 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:37:54,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:37:54,547 INFO L85 PathProgramCache]: Analyzing trace with hash 734666272, now seen corresponding path program 1 times [2025-01-09 16:37:54,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:37:54,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084412609] [2025-01-09 16:37:54,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:37:54,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:37:54,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 16:37:54,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:37:54,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:37:54,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:37:55,447 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:37:55,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:37:55,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084412609] [2025-01-09 16:37:55,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084412609] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:37:55,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:37:55,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:37:55,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680654383] [2025-01-09 16:37:55,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:37:55,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:37:55,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:37:55,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:37:55,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:37:55,524 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-01-09 16:37:55,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 36 transitions, 90 flow. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 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:37:55,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:37:55,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-01-09 16:37:55,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:37:56,124 INFO L124 PetriNetUnfolderBase]: 2215/3184 cut-off events. [2025-01-09 16:37:56,124 INFO L125 PetriNetUnfolderBase]: For 246/246 co-relation queries the response was YES. [2025-01-09 16:37:56,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6396 conditions, 3184 events. 2215/3184 cut-off events. For 246/246 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 14866 event pairs, 224 based on Foata normal form. 1/2713 useless extension candidates. Maximal degree in co-relation 3504. Up to 1042 conditions per place. [2025-01-09 16:37:56,161 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 116 selfloop transitions, 21 changer transitions 1/142 dead transitions. [2025-01-09 16:37:56,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 142 transitions, 638 flow [2025-01-09 16:37:56,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:37:56,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 16:37:56,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 223 transitions. [2025-01-09 16:37:56,173 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46458333333333335 [2025-01-09 16:37:56,175 INFO L175 Difference]: Start difference. First operand has 37 places, 36 transitions, 90 flow. Second operand 12 states and 223 transitions. [2025-01-09 16:37:56,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 142 transitions, 638 flow [2025-01-09 16:37:56,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 142 transitions, 586 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 16:37:56,186 INFO L231 Difference]: Finished difference. Result has 47 places, 57 transitions, 205 flow [2025-01-09 16:37:56,188 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=205, PETRI_PLACES=47, PETRI_TRANSITIONS=57} [2025-01-09 16:37:56,190 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 10 predicate places. [2025-01-09 16:37:56,191 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 57 transitions, 205 flow [2025-01-09 16:37:56,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 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:37:56,191 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:37:56,191 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] [2025-01-09 16:37:56,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:37:56,192 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:37:56,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:37:56,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1767869628, now seen corresponding path program 2 times [2025-01-09 16:37:56,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:37:56,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783943801] [2025-01-09 16:37:56,194 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:37:56,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:37:56,205 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 1 equivalence classes. [2025-01-09 16:37:56,218 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:37:56,218 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:37:56,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:37:56,596 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:37:56,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:37:56,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783943801] [2025-01-09 16:37:56,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783943801] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:37:56,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:37:56,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:37:56,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999739396] [2025-01-09 16:37:56,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:37:56,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:37:56,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:37:56,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:37:56,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:37:56,640 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-01-09 16:37:56,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 57 transitions, 205 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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:37:56,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:37:56,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-01-09 16:37:56,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:37:57,101 INFO L124 PetriNetUnfolderBase]: 2392/3442 cut-off events. [2025-01-09 16:37:57,101 INFO L125 PetriNetUnfolderBase]: For 480/480 co-relation queries the response was YES. [2025-01-09 16:37:57,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7512 conditions, 3442 events. 2392/3442 cut-off events. For 480/480 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 16412 event pairs, 696 based on Foata normal form. 1/3255 useless extension candidates. Maximal degree in co-relation 5034. Up to 1164 conditions per place. [2025-01-09 16:37:57,115 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 99 selfloop transitions, 16 changer transitions 1/120 dead transitions. [2025-01-09 16:37:57,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 120 transitions, 590 flow [2025-01-09 16:37:57,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:37:57,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 16:37:57,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2025-01-09 16:37:57,118 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.475 [2025-01-09 16:37:57,118 INFO L175 Difference]: Start difference. First operand has 47 places, 57 transitions, 205 flow. Second operand 9 states and 171 transitions. [2025-01-09 16:37:57,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 120 transitions, 590 flow [2025-01-09 16:37:57,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 120 transitions, 582 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-01-09 16:37:57,121 INFO L231 Difference]: Finished difference. Result has 56 places, 60 transitions, 252 flow [2025-01-09 16:37:57,121 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=252, PETRI_PLACES=56, PETRI_TRANSITIONS=60} [2025-01-09 16:37:57,121 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 19 predicate places. [2025-01-09 16:37:57,121 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 60 transitions, 252 flow [2025-01-09 16:37:57,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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:37:57,124 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:37:57,124 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] [2025-01-09 16:37:57,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:37:57,125 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:37:57,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:37:57,126 INFO L85 PathProgramCache]: Analyzing trace with hash -629194140, now seen corresponding path program 1 times [2025-01-09 16:37:57,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:37:57,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810432543] [2025-01-09 16:37:57,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:37:57,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:37:57,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 16:37:57,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:37:57,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:37:57,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:37:57,261 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:37:57,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:37:57,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810432543] [2025-01-09 16:37:57,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810432543] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:37:57,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510567699] [2025-01-09 16:37:57,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:37:57,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:37:57,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:37:57,264 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:37:57,265 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:37:57,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 16:37:57,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:37:57,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:37:57,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:37:57,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 16:37:57,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:37:57,439 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:37:57,440 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:37:57,518 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:37:57,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510567699] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:37:57,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:37:57,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 13 [2025-01-09 16:37:57,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754309175] [2025-01-09 16:37:57,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:37:57,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:37:57,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:37:57,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:37:57,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-01-09 16:37:57,534 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-01-09 16:37:57,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 60 transitions, 252 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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:37:57,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:37:57,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-01-09 16:37:57,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:37:58,047 INFO L124 PetriNetUnfolderBase]: 4223/6077 cut-off events. [2025-01-09 16:37:58,047 INFO L125 PetriNetUnfolderBase]: For 1696/1696 co-relation queries the response was YES. [2025-01-09 16:37:58,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13892 conditions, 6077 events. 4223/6077 cut-off events. For 1696/1696 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 31756 event pairs, 2197 based on Foata normal form. 1/5786 useless extension candidates. Maximal degree in co-relation 9093. Up to 3208 conditions per place. [2025-01-09 16:37:58,071 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 124 selfloop transitions, 8 changer transitions 4/140 dead transitions. [2025-01-09 16:37:58,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 140 transitions, 777 flow [2025-01-09 16:37:58,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:37:58,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:37:58,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 161 transitions. [2025-01-09 16:37:58,072 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.575 [2025-01-09 16:37:58,072 INFO L175 Difference]: Start difference. First operand has 56 places, 60 transitions, 252 flow. Second operand 7 states and 161 transitions. [2025-01-09 16:37:58,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 140 transitions, 777 flow [2025-01-09 16:37:58,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 140 transitions, 757 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 16:37:58,080 INFO L231 Difference]: Finished difference. Result has 61 places, 64 transitions, 282 flow [2025-01-09 16:37:58,080 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=282, PETRI_PLACES=61, PETRI_TRANSITIONS=64} [2025-01-09 16:37:58,080 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 24 predicate places. [2025-01-09 16:37:58,081 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 64 transitions, 282 flow [2025-01-09 16:37:58,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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:37:58,081 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:37:58,081 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] [2025-01-09 16:37:58,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 16:37:58,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:37:58,282 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:37:58,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:37:58,282 INFO L85 PathProgramCache]: Analyzing trace with hash 580682754, now seen corresponding path program 1 times [2025-01-09 16:37:58,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:37:58,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192045682] [2025-01-09 16:37:58,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:37:58,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:37:58,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 16:37:58,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:37:58,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:37:58,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:37:58,384 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:37:58,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:37:58,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192045682] [2025-01-09 16:37:58,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192045682] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:37:58,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379572278] [2025-01-09 16:37:58,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:37:58,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:37:58,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:37:58,386 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:37:58,388 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:37:58,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 16:37:58,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:37:58,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:37:58,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:37:58,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 16:37:58,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:37:58,557 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:37:58,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:37:58,627 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:37:58,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379572278] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:37:58,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:37:58,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2025-01-09 16:37:58,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755909439] [2025-01-09 16:37:58,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:37:58,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:37:58,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:37:58,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:37:58,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:37:58,643 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-01-09 16:37:58,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 64 transitions, 282 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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:37:58,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:37:58,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-01-09 16:37:58,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:37:59,298 INFO L124 PetriNetUnfolderBase]: 5190/7484 cut-off events. [2025-01-09 16:37:59,298 INFO L125 PetriNetUnfolderBase]: For 2638/2638 co-relation queries the response was YES. [2025-01-09 16:37:59,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17820 conditions, 7484 events. 5190/7484 cut-off events. For 2638/2638 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 40532 event pairs, 2789 based on Foata normal form. 1/7460 useless extension candidates. Maximal degree in co-relation 12396. Up to 3537 conditions per place. [2025-01-09 16:37:59,323 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 120 selfloop transitions, 8 changer transitions 4/136 dead transitions. [2025-01-09 16:37:59,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 136 transitions, 771 flow [2025-01-09 16:37:59,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:37:59,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:37:59,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2025-01-09 16:37:59,324 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6416666666666667 [2025-01-09 16:37:59,324 INFO L175 Difference]: Start difference. First operand has 61 places, 64 transitions, 282 flow. Second operand 6 states and 154 transitions. [2025-01-09 16:37:59,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 136 transitions, 771 flow [2025-01-09 16:37:59,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 136 transitions, 760 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-01-09 16:37:59,332 INFO L231 Difference]: Finished difference. Result has 66 places, 66 transitions, 306 flow [2025-01-09 16:37:59,332 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=306, PETRI_PLACES=66, PETRI_TRANSITIONS=66} [2025-01-09 16:37:59,333 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 29 predicate places. [2025-01-09 16:37:59,333 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 66 transitions, 306 flow [2025-01-09 16:37:59,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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:37:59,333 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:37:59,333 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] [2025-01-09 16:37:59,339 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:37:59,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:37:59,537 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:37:59,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:37:59,538 INFO L85 PathProgramCache]: Analyzing trace with hash -711262616, now seen corresponding path program 1 times [2025-01-09 16:37:59,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:37:59,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325292537] [2025-01-09 16:37:59,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:37:59,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:37:59,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 16:37:59,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:37:59,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:37:59,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:37:59,602 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:37:59,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:37:59,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325292537] [2025-01-09 16:37:59,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325292537] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:37:59,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:37:59,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:37:59,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946832033] [2025-01-09 16:37:59,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:37:59,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:37:59,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:37:59,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:37:59,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:37:59,611 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-01-09 16:37:59,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 66 transitions, 306 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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:37:59,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:37:59,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-01-09 16:37:59,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:37:59,993 INFO L124 PetriNetUnfolderBase]: 3672/5564 cut-off events. [2025-01-09 16:37:59,993 INFO L125 PetriNetUnfolderBase]: For 3011/3011 co-relation queries the response was YES. [2025-01-09 16:38:00,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13584 conditions, 5564 events. 3672/5564 cut-off events. For 3011/3011 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 31352 event pairs, 1537 based on Foata normal form. 230/5774 useless extension candidates. Maximal degree in co-relation 10597. Up to 2446 conditions per place. [2025-01-09 16:38:00,012 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 87 selfloop transitions, 15 changer transitions 0/106 dead transitions. [2025-01-09 16:38:00,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 106 transitions, 654 flow [2025-01-09 16:38:00,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:38:00,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:38:00,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2025-01-09 16:38:00,013 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2025-01-09 16:38:00,013 INFO L175 Difference]: Start difference. First operand has 66 places, 66 transitions, 306 flow. Second operand 6 states and 116 transitions. [2025-01-09 16:38:00,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 106 transitions, 654 flow [2025-01-09 16:38:00,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 106 transitions, 639 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-09 16:38:00,018 INFO L231 Difference]: Finished difference. Result has 70 places, 66 transitions, 348 flow [2025-01-09 16:38:00,018 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=348, PETRI_PLACES=70, PETRI_TRANSITIONS=66} [2025-01-09 16:38:00,019 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 33 predicate places. [2025-01-09 16:38:00,019 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 66 transitions, 348 flow [2025-01-09 16:38:00,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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:38:00,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:00,019 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] [2025-01-09 16:38:00,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:38:00,019 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:38:00,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:00,020 INFO L85 PathProgramCache]: Analyzing trace with hash 613101598, now seen corresponding path program 1 times [2025-01-09 16:38:00,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:00,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259005172] [2025-01-09 16:38:00,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:38:00,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:00,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 16:38:00,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:38:00,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:38:00,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:00,079 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:38:00,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:00,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259005172] [2025-01-09 16:38:00,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259005172] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:00,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:00,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:38:00,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869359216] [2025-01-09 16:38:00,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:00,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:38:00,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:00,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:38:00,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:38:00,084 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-01-09 16:38:00,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 66 transitions, 348 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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:38:00,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:00,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-01-09 16:38:00,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:00,355 INFO L124 PetriNetUnfolderBase]: 2524/3991 cut-off events. [2025-01-09 16:38:00,355 INFO L125 PetriNetUnfolderBase]: For 2629/2629 co-relation queries the response was YES. [2025-01-09 16:38:00,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10088 conditions, 3991 events. 2524/3991 cut-off events. For 2629/2629 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 22872 event pairs, 1166 based on Foata normal form. 176/4139 useless extension candidates. Maximal degree in co-relation 8611. Up to 2022 conditions per place. [2025-01-09 16:38:00,368 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 91 selfloop transitions, 5 changer transitions 5/105 dead transitions. [2025-01-09 16:38:00,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 105 transitions, 693 flow [2025-01-09 16:38:00,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:38:00,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:38:00,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2025-01-09 16:38:00,369 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-01-09 16:38:00,369 INFO L175 Difference]: Start difference. First operand has 70 places, 66 transitions, 348 flow. Second operand 5 states and 110 transitions. [2025-01-09 16:38:00,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 105 transitions, 693 flow [2025-01-09 16:38:00,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 105 transitions, 658 flow, removed 9 selfloop flow, removed 3 redundant places. [2025-01-09 16:38:00,376 INFO L231 Difference]: Finished difference. Result has 72 places, 60 transitions, 289 flow [2025-01-09 16:38:00,376 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=289, PETRI_PLACES=72, PETRI_TRANSITIONS=60} [2025-01-09 16:38:00,378 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 35 predicate places. [2025-01-09 16:38:00,378 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 60 transitions, 289 flow [2025-01-09 16:38:00,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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:38:00,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:00,379 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] [2025-01-09 16:38:00,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:38:00,379 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:38:00,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:00,379 INFO L85 PathProgramCache]: Analyzing trace with hash -984324154, now seen corresponding path program 1 times [2025-01-09 16:38:00,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:00,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206581886] [2025-01-09 16:38:00,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:38:00,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:00,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 16:38:00,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:38:00,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:38:00,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:00,563 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:38:00,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:00,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206581886] [2025-01-09 16:38:00,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206581886] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:38:00,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431227823] [2025-01-09 16:38:00,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:38:00,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:38:00,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:38:00,567 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:38:00,569 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:38:00,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 16:38:00,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:38:00,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:38:00,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:00,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 16:38:00,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:38:00,787 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:38:00,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:38:01,122 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:38:01,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431227823] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:38:01,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:38:01,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7, 8] total 20 [2025-01-09 16:38:01,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719204927] [2025-01-09 16:38:01,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:01,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:38:01,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:01,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:38:01,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2025-01-09 16:38:01,166 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-01-09 16:38:01,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 60 transitions, 289 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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:38:01,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:01,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-01-09 16:38:01,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:01,824 INFO L124 PetriNetUnfolderBase]: 3253/5168 cut-off events. [2025-01-09 16:38:01,824 INFO L125 PetriNetUnfolderBase]: For 3792/3792 co-relation queries the response was YES. [2025-01-09 16:38:01,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12855 conditions, 5168 events. 3253/5168 cut-off events. For 3792/3792 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 31650 event pairs, 800 based on Foata normal form. 1/4935 useless extension candidates. Maximal degree in co-relation 12786. Up to 1787 conditions per place. [2025-01-09 16:38:01,845 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 146 selfloop transitions, 40 changer transitions 4/194 dead transitions. [2025-01-09 16:38:01,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 194 transitions, 1191 flow [2025-01-09 16:38:01,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:38:01,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:38:01,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 231 transitions. [2025-01-09 16:38:01,846 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.525 [2025-01-09 16:38:01,846 INFO L175 Difference]: Start difference. First operand has 72 places, 60 transitions, 289 flow. Second operand 11 states and 231 transitions. [2025-01-09 16:38:01,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 194 transitions, 1191 flow [2025-01-09 16:38:01,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 194 transitions, 1166 flow, removed 10 selfloop flow, removed 4 redundant places. [2025-01-09 16:38:01,852 INFO L231 Difference]: Finished difference. Result has 79 places, 93 transitions, 651 flow [2025-01-09 16:38:01,853 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=651, PETRI_PLACES=79, PETRI_TRANSITIONS=93} [2025-01-09 16:38:01,853 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 42 predicate places. [2025-01-09 16:38:01,853 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 93 transitions, 651 flow [2025-01-09 16:38:01,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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:38:01,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:01,853 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] [2025-01-09 16:38:01,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 16:38:02,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:38:02,054 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:38:02,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:02,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1780702984, now seen corresponding path program 2 times [2025-01-09 16:38:02,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:02,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252216258] [2025-01-09 16:38:02,054 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:38:02,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:02,062 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-01-09 16:38:02,073 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 25 statements. [2025-01-09 16:38:02,073 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:38:02,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:02,310 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:38:02,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:02,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252216258] [2025-01-09 16:38:02,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252216258] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:02,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:02,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:38:02,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250464951] [2025-01-09 16:38:02,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:02,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:38:02,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:02,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:38:02,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:38:02,340 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-01-09 16:38:02,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 93 transitions, 651 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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:38:02,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:02,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-01-09 16:38:02,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:02,782 INFO L124 PetriNetUnfolderBase]: 3304/5312 cut-off events. [2025-01-09 16:38:02,782 INFO L125 PetriNetUnfolderBase]: For 7357/7357 co-relation queries the response was YES. [2025-01-09 16:38:02,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14751 conditions, 5312 events. 3304/5312 cut-off events. For 7357/7357 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 33200 event pairs, 535 based on Foata normal form. 3/5283 useless extension candidates. Maximal degree in co-relation 12518. Up to 3667 conditions per place. [2025-01-09 16:38:02,804 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 106 selfloop transitions, 27 changer transitions 16/153 dead transitions. [2025-01-09 16:38:02,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 153 transitions, 1189 flow [2025-01-09 16:38:02,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:38:02,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 16:38:02,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2025-01-09 16:38:02,806 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4275 [2025-01-09 16:38:02,806 INFO L175 Difference]: Start difference. First operand has 79 places, 93 transitions, 651 flow. Second operand 10 states and 171 transitions. [2025-01-09 16:38:02,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 153 transitions, 1189 flow [2025-01-09 16:38:02,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 153 transitions, 1158 flow, removed 13 selfloop flow, removed 1 redundant places. [2025-01-09 16:38:02,823 INFO L231 Difference]: Finished difference. Result has 90 places, 92 transitions, 684 flow [2025-01-09 16:38:02,823 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=684, PETRI_PLACES=90, PETRI_TRANSITIONS=92} [2025-01-09 16:38:02,823 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 53 predicate places. [2025-01-09 16:38:02,823 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 92 transitions, 684 flow [2025-01-09 16:38:02,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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:38:02,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:02,824 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] [2025-01-09 16:38:02,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:38:02,824 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:38:02,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:02,824 INFO L85 PathProgramCache]: Analyzing trace with hash 985592482, now seen corresponding path program 3 times [2025-01-09 16:38:02,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:02,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659979398] [2025-01-09 16:38:02,825 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:38:02,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:02,831 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-01-09 16:38:02,841 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 25 statements. [2025-01-09 16:38:02,841 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:38:02,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:03,118 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:38:03,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:03,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659979398] [2025-01-09 16:38:03,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659979398] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:03,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:03,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:38:03,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281943468] [2025-01-09 16:38:03,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:03,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:38:03,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:03,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:38:03,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:38:03,152 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-01-09 16:38:03,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 92 transitions, 684 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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:38:03,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:03,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-01-09 16:38:03,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:03,675 INFO L124 PetriNetUnfolderBase]: 3105/4936 cut-off events. [2025-01-09 16:38:03,675 INFO L125 PetriNetUnfolderBase]: For 8393/8393 co-relation queries the response was YES. [2025-01-09 16:38:03,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14056 conditions, 4936 events. 3105/4936 cut-off events. For 8393/8393 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 29858 event pairs, 521 based on Foata normal form. 2/4905 useless extension candidates. Maximal degree in co-relation 14000. Up to 3667 conditions per place. [2025-01-09 16:38:03,695 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 67 selfloop transitions, 20 changer transitions 45/136 dead transitions. [2025-01-09 16:38:03,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 136 transitions, 1098 flow [2025-01-09 16:38:03,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:38:03,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 16:38:03,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2025-01-09 16:38:03,696 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-01-09 16:38:03,696 INFO L175 Difference]: Start difference. First operand has 90 places, 92 transitions, 684 flow. Second operand 9 states and 150 transitions. [2025-01-09 16:38:03,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 136 transitions, 1098 flow [2025-01-09 16:38:03,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 136 transitions, 1059 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-01-09 16:38:03,711 INFO L231 Difference]: Finished difference. Result has 92 places, 80 transitions, 569 flow [2025-01-09 16:38:03,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=569, PETRI_PLACES=92, PETRI_TRANSITIONS=80} [2025-01-09 16:38:03,712 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 55 predicate places. [2025-01-09 16:38:03,713 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 80 transitions, 569 flow [2025-01-09 16:38:03,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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:38:03,713 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:03,713 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:38:03,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:38:03,714 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:38:03,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:03,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1185550000, now seen corresponding path program 1 times [2025-01-09 16:38:03,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:03,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109200086] [2025-01-09 16:38:03,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:38:03,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:03,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:38:03,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:38:03,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:38:03,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:03,773 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:38:03,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:03,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109200086] [2025-01-09 16:38:03,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109200086] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:03,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:03,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:38:03,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225140817] [2025-01-09 16:38:03,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:03,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:38:03,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:03,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:38:03,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:38:03,780 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-01-09 16:38:03,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 80 transitions, 569 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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:38:03,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:03,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-01-09 16:38:03,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:04,007 INFO L124 PetriNetUnfolderBase]: 1987/3122 cut-off events. [2025-01-09 16:38:04,007 INFO L125 PetriNetUnfolderBase]: For 5301/5301 co-relation queries the response was YES. [2025-01-09 16:38:04,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8836 conditions, 3122 events. 1987/3122 cut-off events. For 5301/5301 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 17099 event pairs, 928 based on Foata normal form. 116/3227 useless extension candidates. Maximal degree in co-relation 8795. Up to 1817 conditions per place. [2025-01-09 16:38:04,019 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 48 selfloop transitions, 4 changer transitions 49/105 dead transitions. [2025-01-09 16:38:04,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 105 transitions, 837 flow [2025-01-09 16:38:04,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:38:04,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:38:04,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2025-01-09 16:38:04,021 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4625 [2025-01-09 16:38:04,021 INFO L175 Difference]: Start difference. First operand has 92 places, 80 transitions, 569 flow. Second operand 6 states and 111 transitions. [2025-01-09 16:38:04,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 105 transitions, 837 flow [2025-01-09 16:38:04,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 105 transitions, 757 flow, removed 10 selfloop flow, removed 9 redundant places. [2025-01-09 16:38:04,031 INFO L231 Difference]: Finished difference. Result has 81 places, 56 transitions, 300 flow [2025-01-09 16:38:04,031 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=300, PETRI_PLACES=81, PETRI_TRANSITIONS=56} [2025-01-09 16:38:04,032 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 44 predicate places. [2025-01-09 16:38:04,032 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 56 transitions, 300 flow [2025-01-09 16:38:04,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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:38:04,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:04,033 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:38:04,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:38:04,033 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:38:04,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:04,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1125445146, now seen corresponding path program 1 times [2025-01-09 16:38:04,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:04,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253481299] [2025-01-09 16:38:04,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:38:04,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:04,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:38:04,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:38:04,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:38:04,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:04,122 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:38:04,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:04,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253481299] [2025-01-09 16:38:04,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253481299] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:38:04,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937359880] [2025-01-09 16:38:04,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:38:04,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:38:04,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:38:04,125 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:38:04,127 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:38:04,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:38:04,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:38:04,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:38:04,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:04,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 16:38:04,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:38:04,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:38:04,257 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:38:04,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:38:04,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937359880] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:38:04,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:38:04,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 13 [2025-01-09 16:38:04,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355821424] [2025-01-09 16:38:04,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:04,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:38:04,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:04,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:38:04,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-01-09 16:38:04,337 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2025-01-09 16:38:04,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 56 transitions, 300 flow. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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:38:04,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:04,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2025-01-09 16:38:04,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:04,654 INFO L124 PetriNetUnfolderBase]: 1862/2753 cut-off events. [2025-01-09 16:38:04,654 INFO L125 PetriNetUnfolderBase]: For 2506/2506 co-relation queries the response was YES. [2025-01-09 16:38:04,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7468 conditions, 2753 events. 1862/2753 cut-off events. For 2506/2506 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 12665 event pairs, 731 based on Foata normal form. 50/2796 useless extension candidates. Maximal degree in co-relation 7444. Up to 904 conditions per place. [2025-01-09 16:38:04,665 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 101 selfloop transitions, 11 changer transitions 5/120 dead transitions. [2025-01-09 16:38:04,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 120 transitions, 770 flow [2025-01-09 16:38:04,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:38:04,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:38:04,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2025-01-09 16:38:04,666 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.465625 [2025-01-09 16:38:04,666 INFO L175 Difference]: Start difference. First operand has 81 places, 56 transitions, 300 flow. Second operand 8 states and 149 transitions. [2025-01-09 16:38:04,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 120 transitions, 770 flow [2025-01-09 16:38:04,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 120 transitions, 696 flow, removed 29 selfloop flow, removed 12 redundant places. [2025-01-09 16:38:04,673 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 298 flow [2025-01-09 16:38:04,674 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=298, PETRI_PLACES=63, PETRI_TRANSITIONS=59} [2025-01-09 16:38:04,674 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 26 predicate places. [2025-01-09 16:38:04,674 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 298 flow [2025-01-09 16:38:04,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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:38:04,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:04,675 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:38:04,680 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:38:04,875 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,SelfDestructingSolverStorable10 [2025-01-09 16:38:04,875 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:38:04,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:04,876 INFO L85 PathProgramCache]: Analyzing trace with hash -113385708, now seen corresponding path program 1 times [2025-01-09 16:38:04,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:04,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60823299] [2025-01-09 16:38:04,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:38:04,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:04,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:38:04,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:38:04,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:38:04,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:04,928 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:38:04,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:04,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60823299] [2025-01-09 16:38:04,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60823299] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:04,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:04,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:38:04,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744471977] [2025-01-09 16:38:04,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:04,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:38:04,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:04,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:38:04,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:38:04,936 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-01-09 16:38:04,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 59 transitions, 298 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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:38:04,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:04,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-01-09 16:38:04,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:05,091 INFO L124 PetriNetUnfolderBase]: 1311/1977 cut-off events. [2025-01-09 16:38:05,092 INFO L125 PetriNetUnfolderBase]: For 1761/1807 co-relation queries the response was YES. [2025-01-09 16:38:05,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5118 conditions, 1977 events. 1311/1977 cut-off events. For 1761/1807 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 8696 event pairs, 701 based on Foata normal form. 32/1925 useless extension candidates. Maximal degree in co-relation 5102. Up to 1519 conditions per place. [2025-01-09 16:38:05,098 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 38 selfloop transitions, 2 changer transitions 43/87 dead transitions. [2025-01-09 16:38:05,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 87 transitions, 542 flow [2025-01-09 16:38:05,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:38:05,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:38:05,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2025-01-09 16:38:05,099 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.52 [2025-01-09 16:38:05,099 INFO L175 Difference]: Start difference. First operand has 63 places, 59 transitions, 298 flow. Second operand 5 states and 104 transitions. [2025-01-09 16:38:05,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 87 transitions, 542 flow [2025-01-09 16:38:05,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 87 transitions, 523 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-01-09 16:38:05,101 INFO L231 Difference]: Finished difference. Result has 61 places, 44 transitions, 183 flow [2025-01-09 16:38:05,101 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=183, PETRI_PLACES=61, PETRI_TRANSITIONS=44} [2025-01-09 16:38:05,102 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 24 predicate places. [2025-01-09 16:38:05,102 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 44 transitions, 183 flow [2025-01-09 16:38:05,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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:38:05,102 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:05,102 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:05,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 16:38:05,102 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:38:05,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:05,103 INFO L85 PathProgramCache]: Analyzing trace with hash 898866116, now seen corresponding path program 1 times [2025-01-09 16:38:05,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:05,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554118182] [2025-01-09 16:38:05,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:38:05,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:05,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 16:38:05,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:38:05,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:38:05,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:05,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:38:05,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:05,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554118182] [2025-01-09 16:38:05,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554118182] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:05,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:05,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:38:05,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205010297] [2025-01-09 16:38:05,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:05,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:38:05,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:05,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:38:05,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:38:05,172 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-01-09 16:38:05,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 44 transitions, 183 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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:38:05,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:05,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-01-09 16:38:05,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:05,323 INFO L124 PetriNetUnfolderBase]: 1192/1699 cut-off events. [2025-01-09 16:38:05,323 INFO L125 PetriNetUnfolderBase]: For 974/1019 co-relation queries the response was YES. [2025-01-09 16:38:05,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4263 conditions, 1699 events. 1192/1699 cut-off events. For 974/1019 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 7137 event pairs, 310 based on Foata normal form. 1/1606 useless extension candidates. Maximal degree in co-relation 4248. Up to 821 conditions per place. [2025-01-09 16:38:05,328 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 53 selfloop transitions, 3 changer transitions 22/82 dead transitions. [2025-01-09 16:38:05,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 82 transitions, 458 flow [2025-01-09 16:38:05,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:38:05,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:38:05,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2025-01-09 16:38:05,329 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59375 [2025-01-09 16:38:05,329 INFO L175 Difference]: Start difference. First operand has 61 places, 44 transitions, 183 flow. Second operand 4 states and 95 transitions. [2025-01-09 16:38:05,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 82 transitions, 458 flow [2025-01-09 16:38:05,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 82 transitions, 432 flow, removed 11 selfloop flow, removed 7 redundant places. [2025-01-09 16:38:05,331 INFO L231 Difference]: Finished difference. Result has 49 places, 43 transitions, 169 flow [2025-01-09 16:38:05,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=169, PETRI_PLACES=49, PETRI_TRANSITIONS=43} [2025-01-09 16:38:05,332 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 12 predicate places. [2025-01-09 16:38:05,332 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 169 flow [2025-01-09 16:38:05,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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:38:05,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:05,332 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:05,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 16:38:05,332 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:38:05,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:05,334 INFO L85 PathProgramCache]: Analyzing trace with hash 799878194, now seen corresponding path program 1 times [2025-01-09 16:38:05,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:05,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994963270] [2025-01-09 16:38:05,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:38:05,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:05,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 16:38:05,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:38:05,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:38:05,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:05,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:38:05,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:05,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994963270] [2025-01-09 16:38:05,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994963270] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:38:05,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188926002] [2025-01-09 16:38:05,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:38:05,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:38:05,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:38:05,524 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:38:05,526 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:38:05,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 16:38:05,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:38:05,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:38:05,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:05,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 16:38:05,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:38:05,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:38:05,748 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:38:05,977 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:38:05,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188926002] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:38:05,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:38:05,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 8] total 20 [2025-01-09 16:38:05,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025758178] [2025-01-09 16:38:05,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:05,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:38:05,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:05,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:38:05,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2025-01-09 16:38:06,023 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-01-09 16:38:06,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 43 transitions, 169 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 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:38:06,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:06,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-01-09 16:38:06,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:06,426 INFO L124 PetriNetUnfolderBase]: 2314/3374 cut-off events. [2025-01-09 16:38:06,426 INFO L125 PetriNetUnfolderBase]: For 2405/2521 co-relation queries the response was YES. [2025-01-09 16:38:06,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8507 conditions, 3374 events. 2314/3374 cut-off events. For 2405/2521 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 16415 event pairs, 359 based on Foata normal form. 1/3162 useless extension candidates. Maximal degree in co-relation 8496. Up to 1049 conditions per place. [2025-01-09 16:38:06,437 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 111 selfloop transitions, 18 changer transitions 1/134 dead transitions. [2025-01-09 16:38:06,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 134 transitions, 722 flow [2025-01-09 16:38:06,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:38:06,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:38:06,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 199 transitions. [2025-01-09 16:38:06,438 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45227272727272727 [2025-01-09 16:38:06,438 INFO L175 Difference]: Start difference. First operand has 49 places, 43 transitions, 169 flow. Second operand 11 states and 199 transitions. [2025-01-09 16:38:06,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 134 transitions, 722 flow [2025-01-09 16:38:06,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 134 transitions, 692 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-01-09 16:38:06,442 INFO L231 Difference]: Finished difference. Result has 60 places, 55 transitions, 292 flow [2025-01-09 16:38:06,442 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=292, PETRI_PLACES=60, PETRI_TRANSITIONS=55} [2025-01-09 16:38:06,442 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 23 predicate places. [2025-01-09 16:38:06,442 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 292 flow [2025-01-09 16:38:06,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 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:38:06,442 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:06,442 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:06,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 16:38:06,647 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,SelfDestructingSolverStorable13 [2025-01-09 16:38:06,647 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:38:06,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:06,647 INFO L85 PathProgramCache]: Analyzing trace with hash 413178184, now seen corresponding path program 2 times [2025-01-09 16:38:06,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:06,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784853908] [2025-01-09 16:38:06,647 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:38:06,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:06,654 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-01-09 16:38:06,675 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-01-09 16:38:06,675 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:38:06,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:07,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:38:07,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:07,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784853908] [2025-01-09 16:38:07,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784853908] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:07,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:07,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:38:07,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995907829] [2025-01-09 16:38:07,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:07,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:38:07,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:07,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:38:07,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:38:07,167 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-01-09 16:38:07,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 292 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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:38:07,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:07,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-01-09 16:38:07,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:07,836 INFO L124 PetriNetUnfolderBase]: 3018/4385 cut-off events. [2025-01-09 16:38:07,836 INFO L125 PetriNetUnfolderBase]: For 4092/4248 co-relation queries the response was YES. [2025-01-09 16:38:07,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11601 conditions, 4385 events. 3018/4385 cut-off events. For 4092/4248 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 22401 event pairs, 454 based on Foata normal form. 1/4368 useless extension candidates. Maximal degree in co-relation 11586. Up to 1730 conditions per place. [2025-01-09 16:38:07,850 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 111 selfloop transitions, 20 changer transitions 1/136 dead transitions. [2025-01-09 16:38:07,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 136 transitions, 817 flow [2025-01-09 16:38:07,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:38:07,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:38:07,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 196 transitions. [2025-01-09 16:38:07,851 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44545454545454544 [2025-01-09 16:38:07,852 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 292 flow. Second operand 11 states and 196 transitions. [2025-01-09 16:38:07,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 136 transitions, 817 flow [2025-01-09 16:38:07,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 136 transitions, 806 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-01-09 16:38:07,856 INFO L231 Difference]: Finished difference. Result has 71 places, 61 transitions, 391 flow [2025-01-09 16:38:07,856 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=391, PETRI_PLACES=71, PETRI_TRANSITIONS=61} [2025-01-09 16:38:07,856 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 34 predicate places. [2025-01-09 16:38:07,856 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 61 transitions, 391 flow [2025-01-09 16:38:07,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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:38:07,857 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:07,857 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:07,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 16:38:07,857 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:38:07,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:07,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1130457048, now seen corresponding path program 3 times [2025-01-09 16:38:07,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:07,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37169905] [2025-01-09 16:38:07,858 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:38:07,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:07,863 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-01-09 16:38:07,882 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-01-09 16:38:07,882 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:38:07,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:08,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:38:08,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:08,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37169905] [2025-01-09 16:38:08,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37169905] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:08,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:08,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:38:08,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538978602] [2025-01-09 16:38:08,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:08,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:38:08,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:08,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:38:08,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:38:08,431 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-01-09 16:38:08,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 61 transitions, 391 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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:38:08,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:08,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-01-09 16:38:08,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:09,000 INFO L124 PetriNetUnfolderBase]: 3508/5140 cut-off events. [2025-01-09 16:38:09,001 INFO L125 PetriNetUnfolderBase]: For 8327/8489 co-relation queries the response was YES. [2025-01-09 16:38:09,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14601 conditions, 5140 events. 3508/5140 cut-off events. For 8327/8489 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 27347 event pairs, 615 based on Foata normal form. 1/5130 useless extension candidates. Maximal degree in co-relation 14583. Up to 1715 conditions per place. [2025-01-09 16:38:09,020 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 115 selfloop transitions, 29 changer transitions 1/149 dead transitions. [2025-01-09 16:38:09,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 149 transitions, 1017 flow [2025-01-09 16:38:09,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:38:09,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:38:09,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 200 transitions. [2025-01-09 16:38:09,022 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2025-01-09 16:38:09,022 INFO L175 Difference]: Start difference. First operand has 71 places, 61 transitions, 391 flow. Second operand 11 states and 200 transitions. [2025-01-09 16:38:09,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 149 transitions, 1017 flow [2025-01-09 16:38:09,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 149 transitions, 984 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-01-09 16:38:09,031 INFO L231 Difference]: Finished difference. Result has 79 places, 71 transitions, 558 flow [2025-01-09 16:38:09,031 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=558, PETRI_PLACES=79, PETRI_TRANSITIONS=71} [2025-01-09 16:38:09,032 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 42 predicate places. [2025-01-09 16:38:09,032 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 71 transitions, 558 flow [2025-01-09 16:38:09,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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:38:09,032 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:09,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:09,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 16:38:09,032 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:38:09,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:09,032 INFO L85 PathProgramCache]: Analyzing trace with hash 946566900, now seen corresponding path program 4 times [2025-01-09 16:38:09,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:09,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524467985] [2025-01-09 16:38:09,032 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:38:09,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:09,038 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-01-09 16:38:09,040 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 23 of 28 statements. [2025-01-09 16:38:09,040 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 16:38:09,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:09,130 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:38:09,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:09,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524467985] [2025-01-09 16:38:09,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524467985] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:38:09,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195657004] [2025-01-09 16:38:09,130 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:38:09,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:38:09,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:38:09,132 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:38:09,134 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:38:09,183 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-01-09 16:38:09,193 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 23 of 28 statements. [2025-01-09 16:38:09,193 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 16:38:09,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:09,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:38:09,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:38:09,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:38:09,283 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:38:09,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:38:09,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195657004] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:38:09,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:38:09,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-01-09 16:38:09,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163785929] [2025-01-09 16:38:09,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:38:09,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 16:38:09,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:09,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 16:38:09,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-01-09 16:38:09,523 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 40 [2025-01-09 16:38:09,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 71 transitions, 558 flow. Second operand has 17 states, 17 states have (on average 8.176470588235293) internal successors, (139), 17 states have internal predecessors, (139), 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:38:09,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:09,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 40 [2025-01-09 16:38:09,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:10,469 INFO L124 PetriNetUnfolderBase]: 9910/13794 cut-off events. [2025-01-09 16:38:10,469 INFO L125 PetriNetUnfolderBase]: For 33496/33496 co-relation queries the response was YES. [2025-01-09 16:38:10,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41954 conditions, 13794 events. 9910/13794 cut-off events. For 33496/33496 co-relation queries the response was YES. Maximal size of possible extension queue 690. Compared 75022 event pairs, 1129 based on Foata normal form. 2/13083 useless extension candidates. Maximal degree in co-relation 41932. Up to 5730 conditions per place. [2025-01-09 16:38:10,519 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 168 selfloop transitions, 40 changer transitions 3/213 dead transitions. [2025-01-09 16:38:10,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 213 transitions, 1922 flow [2025-01-09 16:38:10,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:38:10,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 16:38:10,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2025-01-09 16:38:10,520 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4777777777777778 [2025-01-09 16:38:10,520 INFO L175 Difference]: Start difference. First operand has 79 places, 71 transitions, 558 flow. Second operand 9 states and 172 transitions. [2025-01-09 16:38:10,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 213 transitions, 1922 flow [2025-01-09 16:38:10,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 213 transitions, 1854 flow, removed 26 selfloop flow, removed 5 redundant places. [2025-01-09 16:38:10,560 INFO L231 Difference]: Finished difference. Result has 88 places, 89 transitions, 853 flow [2025-01-09 16:38:10,560 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=853, PETRI_PLACES=88, PETRI_TRANSITIONS=89} [2025-01-09 16:38:10,560 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 51 predicate places. [2025-01-09 16:38:10,560 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 89 transitions, 853 flow [2025-01-09 16:38:10,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.176470588235293) internal successors, (139), 17 states have internal predecessors, (139), 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:38:10,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:10,562 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:10,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 16:38:10,762 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,SelfDestructingSolverStorable16 [2025-01-09 16:38:10,762 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:38:10,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:10,763 INFO L85 PathProgramCache]: Analyzing trace with hash 2122022838, now seen corresponding path program 5 times [2025-01-09 16:38:10,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:10,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483728378] [2025-01-09 16:38:10,763 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:38:10,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:10,769 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-01-09 16:38:10,781 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:38:10,781 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:38:10,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:10,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:38:10,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:10,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483728378] [2025-01-09 16:38:10,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483728378] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:38:10,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723830664] [2025-01-09 16:38:10,922 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:38:10,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:38:10,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:38:10,926 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:38:10,927 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:38:10,980 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-01-09 16:38:11,004 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:38:11,004 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:38:11,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:11,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 16:38:11,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:38:11,164 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:38:11,164 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:38:11,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:38:11,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723830664] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:38:11,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:38:11,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8, 9] total 21 [2025-01-09 16:38:11,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372504161] [2025-01-09 16:38:11,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:11,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:38:11,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:11,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:38:11,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2025-01-09 16:38:11,432 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-01-09 16:38:11,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 89 transitions, 853 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 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:38:11,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:11,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-01-09 16:38:11,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:12,226 INFO L124 PetriNetUnfolderBase]: 7033/10326 cut-off events. [2025-01-09 16:38:12,226 INFO L125 PetriNetUnfolderBase]: For 36324/36656 co-relation queries the response was YES. [2025-01-09 16:38:12,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35667 conditions, 10326 events. 7033/10326 cut-off events. For 36324/36656 co-relation queries the response was YES. Maximal size of possible extension queue 609. Compared 61903 event pairs, 1403 based on Foata normal form. 2/10309 useless extension candidates. Maximal degree in co-relation 35640. Up to 2821 conditions per place. [2025-01-09 16:38:12,278 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 148 selfloop transitions, 33 changer transitions 1/187 dead transitions. [2025-01-09 16:38:12,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 187 transitions, 1711 flow [2025-01-09 16:38:12,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:38:12,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 16:38:12,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 210 transitions. [2025-01-09 16:38:12,280 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4375 [2025-01-09 16:38:12,280 INFO L175 Difference]: Start difference. First operand has 88 places, 89 transitions, 853 flow. Second operand 12 states and 210 transitions. [2025-01-09 16:38:12,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 187 transitions, 1711 flow [2025-01-09 16:38:12,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 187 transitions, 1678 flow, removed 12 selfloop flow, removed 1 redundant places. [2025-01-09 16:38:12,330 INFO L231 Difference]: Finished difference. Result has 100 places, 93 transitions, 968 flow [2025-01-09 16:38:12,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=968, PETRI_PLACES=100, PETRI_TRANSITIONS=93} [2025-01-09 16:38:12,331 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 63 predicate places. [2025-01-09 16:38:12,331 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 93 transitions, 968 flow [2025-01-09 16:38:12,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 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:38:12,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:12,331 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:12,337 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:38:12,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:38:12,532 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:38:12,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:12,532 INFO L85 PathProgramCache]: Analyzing trace with hash -566697992, now seen corresponding path program 6 times [2025-01-09 16:38:12,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:12,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166804988] [2025-01-09 16:38:12,533 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:38:12,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:12,538 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 2 equivalence classes. [2025-01-09 16:38:12,545 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-01-09 16:38:12,546 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 16:38:12,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:12,863 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:38:12,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:12,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166804988] [2025-01-09 16:38:12,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166804988] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:12,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:12,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:38:12,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916887245] [2025-01-09 16:38:12,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:12,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:38:12,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:12,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:38:12,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:38:12,935 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-01-09 16:38:12,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 93 transitions, 968 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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:38:12,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:12,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-01-09 16:38:12,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:13,898 INFO L124 PetriNetUnfolderBase]: 7243/10679 cut-off events. [2025-01-09 16:38:13,898 INFO L125 PetriNetUnfolderBase]: For 43396/43728 co-relation queries the response was YES. [2025-01-09 16:38:13,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38012 conditions, 10679 events. 7243/10679 cut-off events. For 43396/43728 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 64391 event pairs, 1244 based on Foata normal form. 3/10677 useless extension candidates. Maximal degree in co-relation 37982. Up to 2776 conditions per place. [2025-01-09 16:38:13,959 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 136 selfloop transitions, 45 changer transitions 1/187 dead transitions. [2025-01-09 16:38:13,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 187 transitions, 1853 flow [2025-01-09 16:38:13,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:38:13,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:38:13,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 198 transitions. [2025-01-09 16:38:13,960 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45 [2025-01-09 16:38:13,961 INFO L175 Difference]: Start difference. First operand has 100 places, 93 transitions, 968 flow. Second operand 11 states and 198 transitions. [2025-01-09 16:38:13,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 187 transitions, 1853 flow [2025-01-09 16:38:14,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 187 transitions, 1793 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-01-09 16:38:14,004 INFO L231 Difference]: Finished difference. Result has 106 places, 104 transitions, 1280 flow [2025-01-09 16:38:14,005 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1280, PETRI_PLACES=106, PETRI_TRANSITIONS=104} [2025-01-09 16:38:14,005 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 69 predicate places. [2025-01-09 16:38:14,005 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 104 transitions, 1280 flow [2025-01-09 16:38:14,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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:38:14,006 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:14,006 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:14,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 16:38:14,006 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:38:14,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:14,006 INFO L85 PathProgramCache]: Analyzing trace with hash 701024988, now seen corresponding path program 7 times [2025-01-09 16:38:14,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:14,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718452019] [2025-01-09 16:38:14,006 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:38:14,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:14,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 16:38:14,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:38:14,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:38:14,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:14,175 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:38:14,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:14,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718452019] [2025-01-09 16:38:14,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718452019] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:38:14,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007716191] [2025-01-09 16:38:14,176 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:38:14,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:38:14,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:38:14,178 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:38:14,180 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:38:14,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 16:38:14,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:38:14,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:38:14,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:14,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 16:38:14,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:38:14,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:38:14,397 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:38:14,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:38:14,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007716191] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:38:14,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:38:14,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 8] total 22 [2025-01-09 16:38:14,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397173220] [2025-01-09 16:38:14,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:14,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:38:14,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:14,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:38:14,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2025-01-09 16:38:14,724 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-01-09 16:38:14,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 104 transitions, 1280 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 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:38:14,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:14,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-01-09 16:38:14,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:15,623 INFO L124 PetriNetUnfolderBase]: 7247/10690 cut-off events. [2025-01-09 16:38:15,623 INFO L125 PetriNetUnfolderBase]: For 54423/54772 co-relation queries the response was YES. [2025-01-09 16:38:15,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39241 conditions, 10690 events. 7247/10690 cut-off events. For 54423/54772 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 64623 event pairs, 960 based on Foata normal form. 3/10666 useless extension candidates. Maximal degree in co-relation 39207. Up to 3691 conditions per place. [2025-01-09 16:38:15,675 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 139 selfloop transitions, 51 changer transitions 2/197 dead transitions. [2025-01-09 16:38:15,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 197 transitions, 2106 flow [2025-01-09 16:38:15,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:38:15,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:38:15,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 202 transitions. [2025-01-09 16:38:15,676 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4590909090909091 [2025-01-09 16:38:15,676 INFO L175 Difference]: Start difference. First operand has 106 places, 104 transitions, 1280 flow. Second operand 11 states and 202 transitions. [2025-01-09 16:38:15,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 197 transitions, 2106 flow [2025-01-09 16:38:15,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 197 transitions, 2028 flow, removed 31 selfloop flow, removed 5 redundant places. [2025-01-09 16:38:15,750 INFO L231 Difference]: Finished difference. Result has 114 places, 111 transitions, 1482 flow [2025-01-09 16:38:15,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1214, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1482, PETRI_PLACES=114, PETRI_TRANSITIONS=111} [2025-01-09 16:38:15,750 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 77 predicate places. [2025-01-09 16:38:15,750 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 111 transitions, 1482 flow [2025-01-09 16:38:15,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 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:38:15,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:15,750 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:15,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 16:38:15,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:38:15,951 INFO L396 AbstractCegarLoop]: === Iteration 21 === 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:38:15,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:15,951 INFO L85 PathProgramCache]: Analyzing trace with hash -283473810, now seen corresponding path program 1 times [2025-01-09 16:38:15,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:15,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438400969] [2025-01-09 16:38:15,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:38:15,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:15,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 16:38:15,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:38:15,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:38:15,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:16,033 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:38:16,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:16,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438400969] [2025-01-09 16:38:16,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438400969] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:38:16,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086088258] [2025-01-09 16:38:16,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:38:16,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:38:16,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:38:16,035 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:38:16,037 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:38:16,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 16:38:16,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:38:16,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:38:16,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:16,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 16:38:16,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:38:16,172 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:38:16,172 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:38:16,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:38:16,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086088258] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:38:16,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:38:16,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2025-01-09 16:38:16,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103845986] [2025-01-09 16:38:16,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:16,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:38:16,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:16,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:38:16,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-01-09 16:38:16,237 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2025-01-09 16:38:16,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 111 transitions, 1482 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:38:16,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:16,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2025-01-09 16:38:16,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:17,329 INFO L124 PetriNetUnfolderBase]: 9380/13538 cut-off events. [2025-01-09 16:38:17,329 INFO L125 PetriNetUnfolderBase]: For 71781/72325 co-relation queries the response was YES. [2025-01-09 16:38:17,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50165 conditions, 13538 events. 9380/13538 cut-off events. For 71781/72325 co-relation queries the response was YES. Maximal size of possible extension queue 715. Compared 80556 event pairs, 4102 based on Foata normal form. 0/12888 useless extension candidates. Maximal degree in co-relation 50128. Up to 6078 conditions per place. [2025-01-09 16:38:17,416 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 193 selfloop transitions, 13 changer transitions 0/210 dead transitions. [2025-01-09 16:38:17,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 210 transitions, 2923 flow [2025-01-09 16:38:17,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:38:17,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:38:17,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2025-01-09 16:38:17,417 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45 [2025-01-09 16:38:17,417 INFO L175 Difference]: Start difference. First operand has 114 places, 111 transitions, 1482 flow. Second operand 8 states and 144 transitions. [2025-01-09 16:38:17,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 210 transitions, 2923 flow [2025-01-09 16:38:17,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 210 transitions, 2802 flow, removed 53 selfloop flow, removed 4 redundant places. [2025-01-09 16:38:17,557 INFO L231 Difference]: Finished difference. Result has 118 places, 114 transitions, 1451 flow [2025-01-09 16:38:17,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1409, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1451, PETRI_PLACES=118, PETRI_TRANSITIONS=114} [2025-01-09 16:38:17,558 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 81 predicate places. [2025-01-09 16:38:17,558 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 114 transitions, 1451 flow [2025-01-09 16:38:17,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:38:17,558 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:17,558 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:17,564 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:38:17,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:38:17,758 INFO L396 AbstractCegarLoop]: === Iteration 22 === 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:38:17,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:17,759 INFO L85 PathProgramCache]: Analyzing trace with hash 468820840, now seen corresponding path program 1 times [2025-01-09 16:38:17,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:17,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323311011] [2025-01-09 16:38:17,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:38:17,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:17,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 16:38:17,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:38:17,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:38:17,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:17,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:38:17,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:17,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323311011] [2025-01-09 16:38:17,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323311011] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:17,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:17,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:38:17,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565899499] [2025-01-09 16:38:17,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:17,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:38:17,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:17,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:38:17,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:38:17,808 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-01-09 16:38:17,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 114 transitions, 1451 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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:38:17,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:17,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-01-09 16:38:17,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:18,264 INFO L124 PetriNetUnfolderBase]: 4212/6502 cut-off events. [2025-01-09 16:38:18,264 INFO L125 PetriNetUnfolderBase]: For 31462/31792 co-relation queries the response was YES. [2025-01-09 16:38:18,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23647 conditions, 6502 events. 4212/6502 cut-off events. For 31462/31792 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 38803 event pairs, 2143 based on Foata normal form. 242/6731 useless extension candidates. Maximal degree in co-relation 23609. Up to 3065 conditions per place. [2025-01-09 16:38:18,302 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 102 selfloop transitions, 10 changer transitions 0/117 dead transitions. [2025-01-09 16:38:18,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 117 transitions, 1340 flow [2025-01-09 16:38:18,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:38:18,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:38:18,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2025-01-09 16:38:18,303 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.51 [2025-01-09 16:38:18,303 INFO L175 Difference]: Start difference. First operand has 118 places, 114 transitions, 1451 flow. Second operand 5 states and 102 transitions. [2025-01-09 16:38:18,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 117 transitions, 1340 flow [2025-01-09 16:38:18,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 117 transitions, 1250 flow, removed 15 selfloop flow, removed 8 redundant places. [2025-01-09 16:38:18,364 INFO L231 Difference]: Finished difference. Result has 115 places, 90 transitions, 951 flow [2025-01-09 16:38:18,364 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=922, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=951, PETRI_PLACES=115, PETRI_TRANSITIONS=90} [2025-01-09 16:38:18,364 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 78 predicate places. [2025-01-09 16:38:18,364 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 90 transitions, 951 flow [2025-01-09 16:38:18,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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:38:18,365 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:18,365 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:18,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 16:38:18,365 INFO L396 AbstractCegarLoop]: === Iteration 23 === 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:38:18,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:18,365 INFO L85 PathProgramCache]: Analyzing trace with hash -5742430, now seen corresponding path program 1 times [2025-01-09 16:38:18,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:18,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614222015] [2025-01-09 16:38:18,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:38:18,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:18,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 16:38:18,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:38:18,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:38:18,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:18,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:38:18,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:18,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614222015] [2025-01-09 16:38:18,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614222015] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:18,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:18,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:38:18,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845172643] [2025-01-09 16:38:18,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:18,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:38:18,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:18,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:38:18,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:38:18,417 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-01-09 16:38:18,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 90 transitions, 951 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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:38:18,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:18,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-01-09 16:38:18,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:18,719 INFO L124 PetriNetUnfolderBase]: 3072/4883 cut-off events. [2025-01-09 16:38:18,719 INFO L125 PetriNetUnfolderBase]: For 17407/17704 co-relation queries the response was YES. [2025-01-09 16:38:18,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16659 conditions, 4883 events. 3072/4883 cut-off events. For 17407/17704 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 29164 event pairs, 1779 based on Foata normal form. 224/5091 useless extension candidates. Maximal degree in co-relation 16624. Up to 3065 conditions per place. [2025-01-09 16:38:18,742 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 46 selfloop transitions, 2 changer transitions 46/99 dead transitions. [2025-01-09 16:38:18,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 99 transitions, 1012 flow [2025-01-09 16:38:18,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:38:18,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:38:18,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2025-01-09 16:38:18,743 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48 [2025-01-09 16:38:18,743 INFO L175 Difference]: Start difference. First operand has 115 places, 90 transitions, 951 flow. Second operand 5 states and 96 transitions. [2025-01-09 16:38:18,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 99 transitions, 1012 flow [2025-01-09 16:38:18,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 99 transitions, 976 flow, removed 2 selfloop flow, removed 7 redundant places. [2025-01-09 16:38:18,765 INFO L231 Difference]: Finished difference. Result has 111 places, 53 transitions, 335 flow [2025-01-09 16:38:18,765 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=335, PETRI_PLACES=111, PETRI_TRANSITIONS=53} [2025-01-09 16:38:18,765 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 74 predicate places. [2025-01-09 16:38:18,765 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 53 transitions, 335 flow [2025-01-09 16:38:18,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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:38:18,766 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:18,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, 1, 1, 1, 1] [2025-01-09 16:38:18,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 16:38:18,766 INFO L396 AbstractCegarLoop]: === Iteration 24 === 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:38:18,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:18,766 INFO L85 PathProgramCache]: Analyzing trace with hash 428426054, now seen corresponding path program 1 times [2025-01-09 16:38:18,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:18,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750720164] [2025-01-09 16:38:18,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:38:18,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:18,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 16:38:18,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 16:38:18,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:38:18,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:18,878 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:38:18,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:18,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750720164] [2025-01-09 16:38:18,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750720164] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:38:18,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925054540] [2025-01-09 16:38:18,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:38:18,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:38:18,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:38:18,881 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:38:18,892 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:38:18,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 16:38:18,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 16:38:18,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:38:18,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:18,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 16:38:18,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:38:19,037 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:38:19,037 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:38:19,104 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:38:19,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925054540] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:38:19,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:38:19,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 7] total 18 [2025-01-09 16:38:19,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709588420] [2025-01-09 16:38:19,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:19,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:38:19,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:19,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:38:19,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-01-09 16:38:19,114 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2025-01-09 16:38:19,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 53 transitions, 335 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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:38:19,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:19,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2025-01-09 16:38:19,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:19,296 INFO L124 PetriNetUnfolderBase]: 1952/2786 cut-off events. [2025-01-09 16:38:19,296 INFO L125 PetriNetUnfolderBase]: For 7662/7876 co-relation queries the response was YES. [2025-01-09 16:38:19,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9842 conditions, 2786 events. 1952/2786 cut-off events. For 7662/7876 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 11924 event pairs, 611 based on Foata normal form. 79/2861 useless extension candidates. Maximal degree in co-relation 9808. Up to 1433 conditions per place. [2025-01-09 16:38:19,308 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 52 selfloop transitions, 10 changer transitions 0/65 dead transitions. [2025-01-09 16:38:19,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 65 transitions, 510 flow [2025-01-09 16:38:19,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:38:19,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:38:19,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 93 transitions. [2025-01-09 16:38:19,309 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33214285714285713 [2025-01-09 16:38:19,309 INFO L175 Difference]: Start difference. First operand has 111 places, 53 transitions, 335 flow. Second operand 7 states and 93 transitions. [2025-01-09 16:38:19,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 65 transitions, 510 flow [2025-01-09 16:38:19,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 65 transitions, 450 flow, removed 28 selfloop flow, removed 16 redundant places. [2025-01-09 16:38:19,315 INFO L231 Difference]: Finished difference. Result has 71 places, 48 transitions, 279 flow [2025-01-09 16:38:19,315 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=279, PETRI_PLACES=71, PETRI_TRANSITIONS=48} [2025-01-09 16:38:19,316 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 34 predicate places. [2025-01-09 16:38:19,316 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 48 transitions, 279 flow [2025-01-09 16:38:19,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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:38:19,316 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:19,316 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:19,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-09 16:38:19,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-01-09 16:38:19,517 INFO L396 AbstractCegarLoop]: === Iteration 25 === 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:38:19,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:19,517 INFO L85 PathProgramCache]: Analyzing trace with hash 900495598, now seen corresponding path program 1 times [2025-01-09 16:38:19,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:19,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30568027] [2025-01-09 16:38:19,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:38:19,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:19,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 16:38:19,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:38:19,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:38:19,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:20,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:38:20,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:20,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30568027] [2025-01-09 16:38:20,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30568027] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:20,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:20,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 16:38:20,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709224632] [2025-01-09 16:38:20,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:20,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 16:38:20,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:20,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 16:38:20,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:38:20,066 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-01-09 16:38:20,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 48 transitions, 279 flow. Second operand has 13 states, 13 states have (on average 9.23076923076923) internal successors, (120), 13 states have internal predecessors, (120), 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:38:20,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:20,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-01-09 16:38:20,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:20,721 INFO L124 PetriNetUnfolderBase]: 2826/4195 cut-off events. [2025-01-09 16:38:20,721 INFO L125 PetriNetUnfolderBase]: For 7266/7486 co-relation queries the response was YES. [2025-01-09 16:38:20,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13818 conditions, 4195 events. 2826/4195 cut-off events. For 7266/7486 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 21360 event pairs, 307 based on Foata normal form. 1/4193 useless extension candidates. Maximal degree in co-relation 13798. Up to 1661 conditions per place. [2025-01-09 16:38:20,735 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 148 selfloop transitions, 22 changer transitions 10/184 dead transitions. [2025-01-09 16:38:20,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 184 transitions, 1300 flow [2025-01-09 16:38:20,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 16:38:20,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-01-09 16:38:20,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 269 transitions. [2025-01-09 16:38:20,736 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4203125 [2025-01-09 16:38:20,736 INFO L175 Difference]: Start difference. First operand has 71 places, 48 transitions, 279 flow. Second operand 16 states and 269 transitions. [2025-01-09 16:38:20,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 184 transitions, 1300 flow [2025-01-09 16:38:20,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 184 transitions, 1266 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 16:38:20,741 INFO L231 Difference]: Finished difference. Result has 89 places, 60 transitions, 445 flow [2025-01-09 16:38:20,741 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=445, PETRI_PLACES=89, PETRI_TRANSITIONS=60} [2025-01-09 16:38:20,741 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 52 predicate places. [2025-01-09 16:38:20,741 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 60 transitions, 445 flow [2025-01-09 16:38:20,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.23076923076923) internal successors, (120), 13 states have internal predecessors, (120), 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:38:20,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:20,742 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:20,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 16:38:20,742 INFO L396 AbstractCegarLoop]: === Iteration 26 === 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:38:20,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:20,742 INFO L85 PathProgramCache]: Analyzing trace with hash -108589370, now seen corresponding path program 2 times [2025-01-09 16:38:20,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:20,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632749331] [2025-01-09 16:38:20,743 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:38:20,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:20,748 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:38:20,781 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:38:20,781 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:38:20,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:21,221 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:38:21,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:21,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632749331] [2025-01-09 16:38:21,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632749331] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:38:21,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885992661] [2025-01-09 16:38:21,221 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:38:21,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:38:21,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:38:21,223 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:38:21,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 16:38:21,280 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:38:21,304 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:38:21,304 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:38:21,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:21,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-01-09 16:38:21,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:38:21,532 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-01-09 16:38:21,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 26 [2025-01-09 16:38:21,556 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:38:21,556 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:38:22,141 INFO L349 Elim1Store]: treesize reduction 28, result has 88.8 percent of original size [2025-01-09 16:38:22,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 114 treesize of output 254 [2025-01-09 16:38:22,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:38:22,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885992661] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:38:22,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:38:22,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 10] total 27 [2025-01-09 16:38:22,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349524825] [2025-01-09 16:38:22,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:38:22,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-09 16:38:22,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:22,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-09 16:38:22,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=590, Unknown=0, NotChecked=0, Total=702 [2025-01-09 16:38:22,497 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-01-09 16:38:22,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 60 transitions, 445 flow. Second operand has 27 states, 27 states have (on average 9.592592592592593) internal successors, (259), 27 states have internal predecessors, (259), 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:38:22,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:22,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-01-09 16:38:22,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:24,154 INFO L124 PetriNetUnfolderBase]: 3620/5373 cut-off events. [2025-01-09 16:38:24,154 INFO L125 PetriNetUnfolderBase]: For 15205/15525 co-relation queries the response was YES. [2025-01-09 16:38:24,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19688 conditions, 5373 events. 3620/5373 cut-off events. For 15205/15525 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 28445 event pairs, 288 based on Foata normal form. 33/5404 useless extension candidates. Maximal degree in co-relation 19661. Up to 1731 conditions per place. [2025-01-09 16:38:24,179 INFO L140 encePairwiseOnDemand]: 25/40 looper letters, 215 selfloop transitions, 45 changer transitions 38/302 dead transitions. [2025-01-09 16:38:24,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 302 transitions, 2215 flow [2025-01-09 16:38:24,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-09 16:38:24,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-01-09 16:38:24,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 474 transitions. [2025-01-09 16:38:24,180 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4232142857142857 [2025-01-09 16:38:24,180 INFO L175 Difference]: Start difference. First operand has 89 places, 60 transitions, 445 flow. Second operand 28 states and 474 transitions. [2025-01-09 16:38:24,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 302 transitions, 2215 flow [2025-01-09 16:38:24,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 302 transitions, 2115 flow, removed 14 selfloop flow, removed 9 redundant places. [2025-01-09 16:38:24,192 INFO L231 Difference]: Finished difference. Result has 119 places, 83 transitions, 758 flow [2025-01-09 16:38:24,192 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=758, PETRI_PLACES=119, PETRI_TRANSITIONS=83} [2025-01-09 16:38:24,192 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 82 predicate places. [2025-01-09 16:38:24,192 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 83 transitions, 758 flow [2025-01-09 16:38:24,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 9.592592592592593) internal successors, (259), 27 states have internal predecessors, (259), 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:38:24,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:24,192 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:24,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-09 16:38:24,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-01-09 16:38:24,393 INFO L396 AbstractCegarLoop]: === Iteration 27 === 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:38:24,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:24,393 INFO L85 PathProgramCache]: Analyzing trace with hash 339305860, now seen corresponding path program 3 times [2025-01-09 16:38:24,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:24,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110785973] [2025-01-09 16:38:24,393 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:38:24,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:24,399 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:38:24,432 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:38:24,432 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:38:24,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:24,882 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:38:24,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:24,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110785973] [2025-01-09 16:38:24,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110785973] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:38:24,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698402140] [2025-01-09 16:38:24,882 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:38:24,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:38:24,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:38:24,885 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:38:24,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-09 16:38:24,942 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:38:24,967 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:38:24,967 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:38:24,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:24,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-01-09 16:38:24,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:38:25,143 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-01-09 16:38:25,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 26 [2025-01-09 16:38:25,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:38:25,160 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:38:25,670 INFO L349 Elim1Store]: treesize reduction 28, result has 88.8 percent of original size [2025-01-09 16:38:25,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 114 treesize of output 254 [2025-01-09 16:38:26,295 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:38:26,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698402140] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:38:26,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:38:26,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 10] total 24 [2025-01-09 16:38:26,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896837040] [2025-01-09 16:38:26,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:38:26,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-09 16:38:26,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:26,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-09 16:38:26,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2025-01-09 16:38:26,389 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-01-09 16:38:26,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 83 transitions, 758 flow. Second operand has 24 states, 24 states have (on average 9.708333333333334) internal successors, (233), 24 states have internal predecessors, (233), 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:38:26,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:26,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-01-09 16:38:26,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:27,459 INFO L124 PetriNetUnfolderBase]: 3623/5360 cut-off events. [2025-01-09 16:38:27,459 INFO L125 PetriNetUnfolderBase]: For 23839/24155 co-relation queries the response was YES. [2025-01-09 16:38:27,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22799 conditions, 5360 events. 3623/5360 cut-off events. For 23839/24155 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 28147 event pairs, 368 based on Foata normal form. 1/5359 useless extension candidates. Maximal degree in co-relation 22762. Up to 1745 conditions per place. [2025-01-09 16:38:27,488 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 170 selfloop transitions, 42 changer transitions 12/228 dead transitions. [2025-01-09 16:38:27,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 228 transitions, 2119 flow [2025-01-09 16:38:27,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 16:38:27,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-01-09 16:38:27,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 304 transitions. [2025-01-09 16:38:27,489 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2025-01-09 16:38:27,489 INFO L175 Difference]: Start difference. First operand has 119 places, 83 transitions, 758 flow. Second operand 18 states and 304 transitions. [2025-01-09 16:38:27,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 228 transitions, 2119 flow [2025-01-09 16:38:27,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 228 transitions, 1980 flow, removed 41 selfloop flow, removed 14 redundant places. [2025-01-09 16:38:27,522 INFO L231 Difference]: Finished difference. Result has 121 places, 90 transitions, 829 flow [2025-01-09 16:38:27,523 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=829, PETRI_PLACES=121, PETRI_TRANSITIONS=90} [2025-01-09 16:38:27,523 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 84 predicate places. [2025-01-09 16:38:27,523 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 90 transitions, 829 flow [2025-01-09 16:38:27,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.708333333333334) internal successors, (233), 24 states have internal predecessors, (233), 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:38:27,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:27,523 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:27,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-09 16:38:27,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:38:27,724 INFO L396 AbstractCegarLoop]: === Iteration 28 === 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:38:27,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:27,724 INFO L85 PathProgramCache]: Analyzing trace with hash 435638786, now seen corresponding path program 4 times [2025-01-09 16:38:27,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:27,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719679981] [2025-01-09 16:38:27,724 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:38:27,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:27,730 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:38:27,736 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:38:27,736 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:38:27,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:27,990 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:38:27,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:27,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719679981] [2025-01-09 16:38:27,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719679981] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:38:27,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740942930] [2025-01-09 16:38:27,991 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:38:27,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:38:27,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:38:27,993 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:38:27,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-09 16:38:28,052 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:38:28,076 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:38:28,076 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:38:28,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:28,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-01-09 16:38:28,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:38:28,343 INFO L349 Elim1Store]: treesize reduction 14, result has 57.6 percent of original size [2025-01-09 16:38:28,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 40 [2025-01-09 16:38:28,362 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:38:28,362 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:38:28,875 INFO L349 Elim1Store]: treesize reduction 28, result has 84.5 percent of original size [2025-01-09 16:38:28,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 94 treesize of output 182 [2025-01-09 16:38:29,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:38:29,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740942930] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:38:29,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:38:29,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 11] total 28 [2025-01-09 16:38:29,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470539098] [2025-01-09 16:38:29,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:38:29,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 16:38:29,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:29,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 16:38:29,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2025-01-09 16:38:29,866 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-01-09 16:38:29,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 90 transitions, 829 flow. Second operand has 28 states, 28 states have (on average 9.464285714285714) internal successors, (265), 28 states have internal predecessors, (265), 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:38:29,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:29,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-01-09 16:38:29,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:31,593 INFO L124 PetriNetUnfolderBase]: 4396/6538 cut-off events. [2025-01-09 16:38:31,594 INFO L125 PetriNetUnfolderBase]: For 27556/27976 co-relation queries the response was YES. [2025-01-09 16:38:31,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27086 conditions, 6538 events. 4396/6538 cut-off events. For 27556/27976 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 36141 event pairs, 328 based on Foata normal form. 19/6555 useless extension candidates. Maximal degree in co-relation 27048. Up to 1853 conditions per place. [2025-01-09 16:38:31,682 INFO L140 encePairwiseOnDemand]: 25/40 looper letters, 230 selfloop transitions, 62 changer transitions 27/323 dead transitions. [2025-01-09 16:38:31,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 323 transitions, 2732 flow [2025-01-09 16:38:31,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-09 16:38:31,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-01-09 16:38:31,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 469 transitions. [2025-01-09 16:38:31,683 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43425925925925923 [2025-01-09 16:38:31,683 INFO L175 Difference]: Start difference. First operand has 121 places, 90 transitions, 829 flow. Second operand 27 states and 469 transitions. [2025-01-09 16:38:31,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 323 transitions, 2732 flow [2025-01-09 16:38:31,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 323 transitions, 2675 flow, removed 6 selfloop flow, removed 12 redundant places. [2025-01-09 16:38:31,729 INFO L231 Difference]: Finished difference. Result has 142 places, 110 transitions, 1175 flow [2025-01-09 16:38:31,730 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1175, PETRI_PLACES=142, PETRI_TRANSITIONS=110} [2025-01-09 16:38:31,730 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 105 predicate places. [2025-01-09 16:38:31,730 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 110 transitions, 1175 flow [2025-01-09 16:38:31,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.464285714285714) internal successors, (265), 28 states have internal predecessors, (265), 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:38:31,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:31,730 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:31,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-01-09 16:38:31,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-01-09 16:38:31,931 INFO L396 AbstractCegarLoop]: === Iteration 29 === 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:38:31,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:31,931 INFO L85 PathProgramCache]: Analyzing trace with hash 365443014, now seen corresponding path program 5 times [2025-01-09 16:38:31,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:31,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466041041] [2025-01-09 16:38:31,932 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:38:31,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:31,937 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:38:31,952 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:38:31,952 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:38:31,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:32,634 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:38:32,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:32,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466041041] [2025-01-09 16:38:32,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466041041] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:38:32,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262085421] [2025-01-09 16:38:32,634 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:38:32,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:38:32,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:38:32,637 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:38:32,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-09 16:38:32,698 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:38:32,724 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:38:32,724 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:38:32,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:32,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 16:38:32,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:38:32,874 INFO L349 Elim1Store]: treesize reduction 18, result has 51.4 percent of original size [2025-01-09 16:38:32,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 36 [2025-01-09 16:38:32,896 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:38:32,896 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:38:57,288 INFO L349 Elim1Store]: treesize reduction 28, result has 59.4 percent of original size [2025-01-09 16:38:57,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 48 [2025-01-09 16:38:57,298 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:38:57,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262085421] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:38:57,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:38:57,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 27 [2025-01-09 16:38:57,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948441947] [2025-01-09 16:38:57,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:38:57,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-09 16:38:57,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:57,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-09 16:38:57,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=598, Unknown=6, NotChecked=0, Total=702 [2025-01-09 16:39:01,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 16:39:05,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 16:39:09,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 16:39:09,370 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 40 [2025-01-09 16:39:09,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 110 transitions, 1175 flow. Second operand has 27 states, 27 states have (on average 6.62962962962963) internal successors, (179), 27 states have internal predecessors, (179), 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:39:09,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:09,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 40 [2025-01-09 16:39:09,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:11,169 INFO L124 PetriNetUnfolderBase]: 7621/10846 cut-off events. [2025-01-09 16:39:11,169 INFO L125 PetriNetUnfolderBase]: For 62368/62368 co-relation queries the response was YES. [2025-01-09 16:39:11,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49045 conditions, 10846 events. 7621/10846 cut-off events. For 62368/62368 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 57381 event pairs, 801 based on Foata normal form. 19/10865 useless extension candidates. Maximal degree in co-relation 49000. Up to 6033 conditions per place. [2025-01-09 16:39:11,237 INFO L140 encePairwiseOnDemand]: 21/40 looper letters, 202 selfloop transitions, 42 changer transitions 27/272 dead transitions. [2025-01-09 16:39:11,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 272 transitions, 2830 flow [2025-01-09 16:39:11,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 16:39:11,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-01-09 16:39:11,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 267 transitions. [2025-01-09 16:39:11,238 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3513157894736842 [2025-01-09 16:39:11,238 INFO L175 Difference]: Start difference. First operand has 142 places, 110 transitions, 1175 flow. Second operand 19 states and 267 transitions. [2025-01-09 16:39:11,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 272 transitions, 2830 flow [2025-01-09 16:39:11,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 272 transitions, 2704 flow, removed 36 selfloop flow, removed 14 redundant places. [2025-01-09 16:39:11,458 INFO L231 Difference]: Finished difference. Result has 150 places, 114 transitions, 1278 flow [2025-01-09 16:39:11,458 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1069, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1278, PETRI_PLACES=150, PETRI_TRANSITIONS=114} [2025-01-09 16:39:11,459 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 113 predicate places. [2025-01-09 16:39:11,459 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 114 transitions, 1278 flow [2025-01-09 16:39:11,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 6.62962962962963) internal successors, (179), 27 states have internal predecessors, (179), 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:39:11,459 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:11,460 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:11,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-01-09 16:39:11,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-01-09 16:39:11,664 INFO L396 AbstractCegarLoop]: === Iteration 30 === 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:39:11,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:11,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1198791616, now seen corresponding path program 6 times [2025-01-09 16:39:11,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:11,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356293861] [2025-01-09 16:39:11,665 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:39:11,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:11,673 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:39:11,699 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:39:11,699 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-01-09 16:39:11,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:12,215 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:39:12,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:12,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356293861] [2025-01-09 16:39:12,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356293861] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:39:12,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269622762] [2025-01-09 16:39:12,216 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:39:12,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:39:12,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:39:12,218 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:39:12,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-09 16:39:12,281 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:39:12,307 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:39:12,307 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-01-09 16:39:12,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:12,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-01-09 16:39:12,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:39:12,536 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-01-09 16:39:12,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 26 [2025-01-09 16:39:12,560 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:39:12,560 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:39:13,182 INFO L349 Elim1Store]: treesize reduction 28, result has 88.8 percent of original size [2025-01-09 16:39:13,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 114 treesize of output 254 [2025-01-09 16:39:13,496 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:39:13,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269622762] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:39:13,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:39:13,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 10] total 26 [2025-01-09 16:39:13,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360744034] [2025-01-09 16:39:13,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:39:13,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 16:39:13,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:13,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 16:39:13,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2025-01-09 16:39:13,618 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-01-09 16:39:13,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 114 transitions, 1278 flow. Second operand has 26 states, 26 states have (on average 9.653846153846153) internal successors, (251), 26 states have internal predecessors, (251), 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:39:13,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:13,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-01-09 16:39:13,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:15,445 INFO L124 PetriNetUnfolderBase]: 5115/7602 cut-off events. [2025-01-09 16:39:15,445 INFO L125 PetriNetUnfolderBase]: For 50813/51321 co-relation queries the response was YES. [2025-01-09 16:39:15,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35850 conditions, 7602 events. 5115/7602 cut-off events. For 50813/51321 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 43332 event pairs, 557 based on Foata normal form. 1/7594 useless extension candidates. Maximal degree in co-relation 35801. Up to 3822 conditions per place. [2025-01-09 16:39:15,490 INFO L140 encePairwiseOnDemand]: 25/40 looper letters, 197 selfloop transitions, 40 changer transitions 11/252 dead transitions. [2025-01-09 16:39:15,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 252 transitions, 2799 flow [2025-01-09 16:39:15,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 16:39:15,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-01-09 16:39:15,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 302 transitions. [2025-01-09 16:39:15,491 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41944444444444445 [2025-01-09 16:39:15,491 INFO L175 Difference]: Start difference. First operand has 150 places, 114 transitions, 1278 flow. Second operand 18 states and 302 transitions. [2025-01-09 16:39:15,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 252 transitions, 2799 flow [2025-01-09 16:39:15,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 252 transitions, 2716 flow, removed 25 selfloop flow, removed 13 redundant places. [2025-01-09 16:39:15,577 INFO L231 Difference]: Finished difference. Result has 157 places, 123 transitions, 1501 flow [2025-01-09 16:39:15,577 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1229, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1501, PETRI_PLACES=157, PETRI_TRANSITIONS=123} [2025-01-09 16:39:15,578 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 120 predicate places. [2025-01-09 16:39:15,578 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 123 transitions, 1501 flow [2025-01-09 16:39:15,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.653846153846153) internal successors, (251), 26 states have internal predecessors, (251), 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:39:15,578 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:15,578 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:15,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-01-09 16:39:15,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:39:15,779 INFO L396 AbstractCegarLoop]: === Iteration 31 === 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:39:15,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:15,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1712573770, now seen corresponding path program 7 times [2025-01-09 16:39:15,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:15,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315249528] [2025-01-09 16:39:15,780 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:39:15,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:15,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 16:39:15,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:39:15,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:15,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:16,294 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:39:16,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:16,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315249528] [2025-01-09 16:39:16,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315249528] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:39:16,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641056074] [2025-01-09 16:39:16,295 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:39:16,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:39:16,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:39:16,297 INFO L229 MonitoredProcess]: Starting monitored process 17 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:39:16,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-01-09 16:39:16,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 16:39:16,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:39:16,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:16,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:16,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 16:39:16,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:39:16,532 INFO L349 Elim1Store]: treesize reduction 18, result has 51.4 percent of original size [2025-01-09 16:39:16,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 36 [2025-01-09 16:39:16,563 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:39:16,563 INFO L312 TraceCheckSpWp]: Computing backward predicates...