./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-min-array.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-min-array.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2261d9b3f7623cbd5155b35c39657066d179b87a48a9848bd1f196c713477a75 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:25:02,370 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:25:02,434 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:25:02,440 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:25:02,440 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:25:02,461 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:25:02,461 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:25:02,461 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:25:02,462 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:25:02,462 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:25:02,462 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:25:02,462 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:25:02,462 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:25:02,462 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:25:02,462 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:25:02,463 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:25:02,463 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:25:02,463 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:25:02,463 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:25:02,463 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:25:02,463 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:25:02,463 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:25:02,463 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:25:02,463 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:25:02,463 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:25:02,463 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:25:02,464 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:25:02,464 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:25:02,464 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:25:02,464 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:25:02,464 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:25:02,464 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:25:02,464 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:25:02,464 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:25:02,464 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:25:02,464 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:25:02,465 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:25:02,465 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:25:02,465 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:25:02,465 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:25:02,465 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:25:02,465 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:25:02,465 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:25:02,465 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2261d9b3f7623cbd5155b35c39657066d179b87a48a9848bd1f196c713477a75 [2025-03-04 02:25:02,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:25:02,698 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:25:02,700 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:25:02,701 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:25:02,701 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:25:02,702 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-min-array.wvr.c [2025-03-04 02:25:03,834 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/483a6ccfb/e5033b5ed8404dad9d869099bb199ca8/FLAGa1adb3e11 [2025-03-04 02:25:04,042 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:25:04,051 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-min-array.wvr.c [2025-03-04 02:25:04,060 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/483a6ccfb/e5033b5ed8404dad9d869099bb199ca8/FLAGa1adb3e11 [2025-03-04 02:25:04,075 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/483a6ccfb/e5033b5ed8404dad9d869099bb199ca8 [2025-03-04 02:25:04,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:25:04,078 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:25:04,079 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:25:04,079 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:25:04,082 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:25:04,082 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:25:04" (1/1) ... [2025-03-04 02:25:04,083 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64c3a7e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:04, skipping insertion in model container [2025-03-04 02:25:04,083 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:25:04" (1/1) ... [2025-03-04 02:25:04,093 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:25:04,229 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-min-array.wvr.c[2592,2605] [2025-03-04 02:25:04,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:25:04,247 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:25:04,268 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-min-array.wvr.c[2592,2605] [2025-03-04 02:25:04,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:25:04,287 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:25:04,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:04 WrapperNode [2025-03-04 02:25:04,288 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:25:04,289 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:25:04,289 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:25:04,290 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:25:04,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:04" (1/1) ... [2025-03-04 02:25:04,302 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:04" (1/1) ... [2025-03-04 02:25:04,316 INFO L138 Inliner]: procedures = 23, calls = 28, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 83 [2025-03-04 02:25:04,317 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:25:04,318 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:25:04,318 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:25:04,318 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:25:04,324 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:04" (1/1) ... [2025-03-04 02:25:04,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:04" (1/1) ... [2025-03-04 02:25:04,330 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:04" (1/1) ... [2025-03-04 02:25:04,350 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-04 02:25:04,350 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:04" (1/1) ... [2025-03-04 02:25:04,350 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:04" (1/1) ... [2025-03-04 02:25:04,354 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:04" (1/1) ... [2025-03-04 02:25:04,355 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:04" (1/1) ... [2025-03-04 02:25:04,355 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:04" (1/1) ... [2025-03-04 02:25:04,362 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:04" (1/1) ... [2025-03-04 02:25:04,364 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:25:04,364 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:25:04,364 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:25:04,364 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:25:04,365 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:04" (1/1) ... [2025-03-04 02:25:04,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:25:04,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:25:04,394 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:25:04,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:25:04,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:25:04,420 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 02:25:04,420 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 02:25:04,420 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 02:25:04,420 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 02:25:04,420 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 02:25:04,420 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 02:25:04,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:25:04,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:25:04,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:25:04,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:25:04,421 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 02:25:04,421 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 02:25:04,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:25:04,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:25:04,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:25:04,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:25:04,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:25:04,423 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:25:04,503 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:25:04,504 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:25:04,700 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:25:04,700 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:25:04,835 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:25:04,835 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:25:04,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:25:04 BoogieIcfgContainer [2025-03-04 02:25:04,836 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:25:04,837 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:25:04,838 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:25:04,841 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:25:04,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:25:04" (1/3) ... [2025-03-04 02:25:04,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cb58fa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:25:04, skipping insertion in model container [2025-03-04 02:25:04,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:04" (2/3) ... [2025-03-04 02:25:04,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cb58fa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:25:04, skipping insertion in model container [2025-03-04 02:25:04,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:25:04" (3/3) ... [2025-03-04 02:25:04,843 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array.wvr.c [2025-03-04 02:25:04,855 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:25:04,856 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-min-array.wvr.c that has 4 procedures, 30 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-04 02:25:04,856 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:25:04,901 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 02:25:04,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 33 transitions, 87 flow [2025-03-04 02:25:04,957 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2025-03-04 02:25:04,958 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 02:25:04,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 30 events. 4/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2025-03-04 02:25:04,962 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 33 transitions, 87 flow [2025-03-04 02:25:04,965 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 29 transitions, 76 flow [2025-03-04 02:25:04,973 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:25:04,981 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;@646f00df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:25:04,981 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 02:25:04,992 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:25:04,992 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2025-03-04 02:25:04,993 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 02:25:04,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:04,993 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:04,994 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:25:04,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:04,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1132871695, now seen corresponding path program 1 times [2025-03-04 02:25:05,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:05,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464265854] [2025-03-04 02:25:05,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:25:05,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:05,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 02:25:05,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:25:05,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:25:05,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:05,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:05,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:05,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464265854] [2025-03-04 02:25:05,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464265854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:05,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:05,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:25:05,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535319999] [2025-03-04 02:25:05,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:05,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:25:05,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:05,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:25:05,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:25:05,347 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-04 02:25:05,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:05,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:05,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-04 02:25:05,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:05,572 INFO L124 PetriNetUnfolderBase]: 617/954 cut-off events. [2025-03-04 02:25:05,572 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-03-04 02:25:05,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1949 conditions, 954 events. 617/954 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3774 event pairs, 126 based on Foata normal form. 1/950 useless extension candidates. Maximal degree in co-relation 1715. Up to 677 conditions per place. [2025-03-04 02:25:05,583 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 37 selfloop transitions, 4 changer transitions 1/46 dead transitions. [2025-03-04 02:25:05,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 46 transitions, 209 flow [2025-03-04 02:25:05,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:25:05,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:25:05,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2025-03-04 02:25:05,594 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6464646464646465 [2025-03-04 02:25:05,595 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 76 flow. Second operand 3 states and 64 transitions. [2025-03-04 02:25:05,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 46 transitions, 209 flow [2025-03-04 02:25:05,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 46 transitions, 187 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 02:25:05,605 INFO L231 Difference]: Finished difference. Result has 32 places, 32 transitions, 90 flow [2025-03-04 02:25:05,607 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=32, PETRI_TRANSITIONS=32} [2025-03-04 02:25:05,610 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2025-03-04 02:25:05,611 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 32 transitions, 90 flow [2025-03-04 02:25:05,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:05,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:05,611 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:05,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:25:05,611 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:25:05,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:05,612 INFO L85 PathProgramCache]: Analyzing trace with hash -110190373, now seen corresponding path program 1 times [2025-03-04 02:25:05,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:05,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702183740] [2025-03-04 02:25:05,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:25:05,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:05,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 02:25:05,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:25:05,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:25:05,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:05,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:05,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:05,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702183740] [2025-03-04 02:25:05,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702183740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:05,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:05,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:25:05,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887046688] [2025-03-04 02:25:05,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:05,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:25:05,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:05,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:25:05,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:25:05,786 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-04 02:25:05,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 32 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:05,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:05,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-04 02:25:05,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:05,913 INFO L124 PetriNetUnfolderBase]: 617/965 cut-off events. [2025-03-04 02:25:05,913 INFO L125 PetriNetUnfolderBase]: For 199/199 co-relation queries the response was YES. [2025-03-04 02:25:05,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2170 conditions, 965 events. 617/965 cut-off events. For 199/199 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4078 event pairs, 407 based on Foata normal form. 0/957 useless extension candidates. Maximal degree in co-relation 802. Up to 895 conditions per place. [2025-03-04 02:25:05,919 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 27 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2025-03-04 02:25:05,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 33 transitions, 150 flow [2025-03-04 02:25:05,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:25:05,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:25:05,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2025-03-04 02:25:05,920 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2025-03-04 02:25:05,920 INFO L175 Difference]: Start difference. First operand has 32 places, 32 transitions, 90 flow. Second operand 3 states and 48 transitions. [2025-03-04 02:25:05,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 33 transitions, 150 flow [2025-03-04 02:25:05,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 146 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:25:05,921 INFO L231 Difference]: Finished difference. Result has 34 places, 33 transitions, 98 flow [2025-03-04 02:25:05,922 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=34, PETRI_TRANSITIONS=33} [2025-03-04 02:25:05,922 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2025-03-04 02:25:05,922 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 33 transitions, 98 flow [2025-03-04 02:25:05,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:05,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:05,923 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:05,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:25:05,923 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:25:05,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:05,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1070716047, now seen corresponding path program 1 times [2025-03-04 02:25:05,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:05,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246020420] [2025-03-04 02:25:05,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:25:05,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:05,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 02:25:05,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:25:05,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:25:05,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:06,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:06,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:06,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246020420] [2025-03-04 02:25:06,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246020420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:06,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:06,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:25:06,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062061033] [2025-03-04 02:25:06,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:06,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:25:06,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:06,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:25:06,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:25:06,015 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-04 02:25:06,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 33 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:06,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:06,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-04 02:25:06,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:06,143 INFO L124 PetriNetUnfolderBase]: 790/1161 cut-off events. [2025-03-04 02:25:06,143 INFO L125 PetriNetUnfolderBase]: For 187/187 co-relation queries the response was YES. [2025-03-04 02:25:06,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2575 conditions, 1161 events. 790/1161 cut-off events. For 187/187 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4572 event pairs, 246 based on Foata normal form. 0/1118 useless extension candidates. Maximal degree in co-relation 2562. Up to 576 conditions per place. [2025-03-04 02:25:06,149 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 40 selfloop transitions, 4 changer transitions 0/47 dead transitions. [2025-03-04 02:25:06,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 47 transitions, 224 flow [2025-03-04 02:25:06,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:25:06,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:25:06,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2025-03-04 02:25:06,150 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4772727272727273 [2025-03-04 02:25:06,150 INFO L175 Difference]: Start difference. First operand has 34 places, 33 transitions, 98 flow. Second operand 4 states and 63 transitions. [2025-03-04 02:25:06,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 47 transitions, 224 flow [2025-03-04 02:25:06,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 47 transitions, 218 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-04 02:25:06,152 INFO L231 Difference]: Finished difference. Result has 38 places, 34 transitions, 113 flow [2025-03-04 02:25:06,152 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=38, PETRI_TRANSITIONS=34} [2025-03-04 02:25:06,153 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2025-03-04 02:25:06,153 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 34 transitions, 113 flow [2025-03-04 02:25:06,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:06,153 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:06,153 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:06,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:25:06,153 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:25:06,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:06,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1334506777, now seen corresponding path program 1 times [2025-03-04 02:25:06,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:06,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240654472] [2025-03-04 02:25:06,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:25:06,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:06,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 02:25:06,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:25:06,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:25:06,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:06,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:06,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:06,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240654472] [2025-03-04 02:25:06,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240654472] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:25:06,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446587975] [2025-03-04 02:25:06,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:25:06,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:25:06,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:25:06,276 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:25:06,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 02:25:06,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 02:25:06,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:25:06,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:25:06,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:06,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 02:25:06,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:25:06,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:06,406 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:25:06,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:06,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446587975] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:25:06,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:25:06,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2025-03-04 02:25:06,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213396119] [2025-03-04 02:25:06,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:06,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:25:06,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:06,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:25:06,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:25:06,457 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-04 02:25:06,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:06,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:06,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-04 02:25:06,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:06,610 INFO L124 PetriNetUnfolderBase]: 855/1295 cut-off events. [2025-03-04 02:25:06,610 INFO L125 PetriNetUnfolderBase]: For 505/505 co-relation queries the response was YES. [2025-03-04 02:25:06,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3247 conditions, 1295 events. 855/1295 cut-off events. For 505/505 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5382 event pairs, 256 based on Foata normal form. 0/1230 useless extension candidates. Maximal degree in co-relation 3227. Up to 670 conditions per place. [2025-03-04 02:25:06,619 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 41 selfloop transitions, 5 changer transitions 0/50 dead transitions. [2025-03-04 02:25:06,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 50 transitions, 257 flow [2025-03-04 02:25:06,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:25:06,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:25:06,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2025-03-04 02:25:06,621 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2025-03-04 02:25:06,621 INFO L175 Difference]: Start difference. First operand has 38 places, 34 transitions, 113 flow. Second operand 5 states and 72 transitions. [2025-03-04 02:25:06,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 50 transitions, 257 flow [2025-03-04 02:25:06,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 251 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:25:06,624 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 132 flow [2025-03-04 02:25:06,625 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=132, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2025-03-04 02:25:06,625 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2025-03-04 02:25:06,625 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 132 flow [2025-03-04 02:25:06,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:06,626 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:06,626 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:06,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 02:25:06,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:25:06,826 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:25:06,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:06,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1434408397, now seen corresponding path program 1 times [2025-03-04 02:25:06,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:06,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993267745] [2025-03-04 02:25:06,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:25:06,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:06,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 02:25:06,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:25:06,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:25:06,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:07,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:07,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:07,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993267745] [2025-03-04 02:25:07,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993267745] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:25:07,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042534584] [2025-03-04 02:25:07,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:25:07,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:25:07,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:25:07,408 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:25:07,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 02:25:07,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 02:25:07,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:25:07,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:25:07,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:07,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 02:25:07,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:25:07,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 02:25:07,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2025-03-04 02:25:07,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:07,799 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:25:08,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 105 [2025-03-04 02:25:08,587 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:25:08,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 149 [2025-03-04 02:25:09,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 85 [2025-03-04 02:25:09,192 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-03-04 02:25:09,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 103 [2025-03-04 02:25:09,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:09,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042534584] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:25:09,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:25:09,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 23 [2025-03-04 02:25:09,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744756921] [2025-03-04 02:25:09,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:25:09,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 02:25:09,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:09,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 02:25:09,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2025-03-04 02:25:09,585 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-04 02:25:09,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 132 flow. Second operand has 24 states, 24 states have (on average 8.666666666666666) internal successors, (208), 24 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:09,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:09,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-04 02:25:09,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:10,945 INFO L124 PetriNetUnfolderBase]: 1841/2761 cut-off events. [2025-03-04 02:25:10,946 INFO L125 PetriNetUnfolderBase]: For 1721/1721 co-relation queries the response was YES. [2025-03-04 02:25:10,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7669 conditions, 2761 events. 1841/2761 cut-off events. For 1721/1721 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 12690 event pairs, 106 based on Foata normal form. 1/2761 useless extension candidates. Maximal degree in co-relation 5614. Up to 1375 conditions per place. [2025-03-04 02:25:10,961 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 137 selfloop transitions, 57 changer transitions 1/199 dead transitions. [2025-03-04 02:25:10,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 199 transitions, 1067 flow [2025-03-04 02:25:10,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 02:25:10,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 02:25:10,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 321 transitions. [2025-03-04 02:25:10,963 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46320346320346323 [2025-03-04 02:25:10,963 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 132 flow. Second operand 21 states and 321 transitions. [2025-03-04 02:25:10,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 199 transitions, 1067 flow [2025-03-04 02:25:10,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 199 transitions, 1050 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 02:25:10,968 INFO L231 Difference]: Finished difference. Result has 64 places, 91 transitions, 543 flow [2025-03-04 02:25:10,969 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=543, PETRI_PLACES=64, PETRI_TRANSITIONS=91} [2025-03-04 02:25:10,969 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 29 predicate places. [2025-03-04 02:25:10,969 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 91 transitions, 543 flow [2025-03-04 02:25:10,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.666666666666666) internal successors, (208), 24 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:10,969 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:10,969 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:10,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 02:25:11,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:25:11,170 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:25:11,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:11,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1109207333, now seen corresponding path program 2 times [2025-03-04 02:25:11,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:11,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738845959] [2025-03-04 02:25:11,171 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:25:11,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:11,178 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:25:11,202 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:25:11,202 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:25:11,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:11,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:11,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:11,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738845959] [2025-03-04 02:25:11,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738845959] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:25:11,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450976830] [2025-03-04 02:25:11,587 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:25:11,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:25:11,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:25:11,590 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:25:11,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 02:25:11,628 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:25:11,645 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:25:11,645 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:25:11,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:11,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 02:25:11,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:25:11,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 02:25:11,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 34 [2025-03-04 02:25:11,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:11,872 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:25:12,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 105 [2025-03-04 02:25:12,429 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:25:12,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 149 [2025-03-04 02:25:13,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 85 [2025-03-04 02:25:13,041 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-03-04 02:25:13,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 103 [2025-03-04 02:25:13,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:13,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450976830] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:25:13,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:25:13,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2025-03-04 02:25:13,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390346576] [2025-03-04 02:25:13,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:25:13,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 02:25:13,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:13,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 02:25:13,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2025-03-04 02:25:13,433 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-04 02:25:13,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 91 transitions, 543 flow. Second operand has 21 states, 21 states have (on average 9.80952380952381) internal successors, (206), 21 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:13,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:13,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-04 02:25:13,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:14,685 INFO L124 PetriNetUnfolderBase]: 2050/3333 cut-off events. [2025-03-04 02:25:14,685 INFO L125 PetriNetUnfolderBase]: For 4846/4846 co-relation queries the response was YES. [2025-03-04 02:25:14,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10794 conditions, 3333 events. 2050/3333 cut-off events. For 4846/4846 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 18119 event pairs, 124 based on Foata normal form. 3/3334 useless extension candidates. Maximal degree in co-relation 10232. Up to 1815 conditions per place. [2025-03-04 02:25:14,707 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 193 selfloop transitions, 121 changer transitions 2/322 dead transitions. [2025-03-04 02:25:14,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 322 transitions, 2167 flow [2025-03-04 02:25:14,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-04 02:25:14,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-03-04 02:25:14,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 474 transitions. [2025-03-04 02:25:14,711 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4633431085043988 [2025-03-04 02:25:14,711 INFO L175 Difference]: Start difference. First operand has 64 places, 91 transitions, 543 flow. Second operand 31 states and 474 transitions. [2025-03-04 02:25:14,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 322 transitions, 2167 flow [2025-03-04 02:25:14,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 322 transitions, 1959 flow, removed 77 selfloop flow, removed 3 redundant places. [2025-03-04 02:25:14,728 INFO L231 Difference]: Finished difference. Result has 105 places, 182 transitions, 1307 flow [2025-03-04 02:25:14,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=1307, PETRI_PLACES=105, PETRI_TRANSITIONS=182} [2025-03-04 02:25:14,729 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 70 predicate places. [2025-03-04 02:25:14,731 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 182 transitions, 1307 flow [2025-03-04 02:25:14,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 9.80952380952381) internal successors, (206), 21 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:14,731 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:14,731 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:14,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 02:25:14,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:25:14,932 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:25:14,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:14,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1523048077, now seen corresponding path program 3 times [2025-03-04 02:25:14,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:14,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883190188] [2025-03-04 02:25:14,933 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:25:14,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:14,941 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:25:14,951 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:25:14,951 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:25:14,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:15,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:15,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:15,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883190188] [2025-03-04 02:25:15,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883190188] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:25:15,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836853865] [2025-03-04 02:25:15,246 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:25:15,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:25:15,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:25:15,248 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:25:15,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 02:25:15,285 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:25:15,301 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:25:15,301 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:25:15,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:15,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 02:25:15,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:25:15,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2025-03-04 02:25:15,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:15,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:25:15,546 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:25:15,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 49 [2025-03-04 02:25:15,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:15,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836853865] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:25:15,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:25:15,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 21 [2025-03-04 02:25:15,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630343864] [2025-03-04 02:25:15,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:25:15,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 02:25:15,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:15,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 02:25:15,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2025-03-04 02:25:15,748 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-04 02:25:15,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 182 transitions, 1307 flow. Second operand has 22 states, 22 states have (on average 9.681818181818182) internal successors, (213), 22 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:15,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:15,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-04 02:25:15,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:16,612 INFO L124 PetriNetUnfolderBase]: 2937/4763 cut-off events. [2025-03-04 02:25:16,612 INFO L125 PetriNetUnfolderBase]: For 14138/14158 co-relation queries the response was YES. [2025-03-04 02:25:16,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18563 conditions, 4763 events. 2937/4763 cut-off events. For 14138/14158 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 28030 event pairs, 400 based on Foata normal form. 19/4778 useless extension candidates. Maximal degree in co-relation 17981. Up to 3122 conditions per place. [2025-03-04 02:25:16,650 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 219 selfloop transitions, 104 changer transitions 1/330 dead transitions. [2025-03-04 02:25:16,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 330 transitions, 2821 flow [2025-03-04 02:25:16,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 02:25:16,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-04 02:25:16,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 323 transitions. [2025-03-04 02:25:16,652 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44490358126721763 [2025-03-04 02:25:16,652 INFO L175 Difference]: Start difference. First operand has 105 places, 182 transitions, 1307 flow. Second operand 22 states and 323 transitions. [2025-03-04 02:25:16,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 330 transitions, 2821 flow [2025-03-04 02:25:16,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 330 transitions, 2688 flow, removed 64 selfloop flow, removed 2 redundant places. [2025-03-04 02:25:16,681 INFO L231 Difference]: Finished difference. Result has 129 places, 243 transitions, 1954 flow [2025-03-04 02:25:16,681 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1222, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1954, PETRI_PLACES=129, PETRI_TRANSITIONS=243} [2025-03-04 02:25:16,683 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 94 predicate places. [2025-03-04 02:25:16,683 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 243 transitions, 1954 flow [2025-03-04 02:25:16,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.681818181818182) internal successors, (213), 22 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:16,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:16,683 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:16,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 02:25:16,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:25:16,884 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:25:16,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:16,884 INFO L85 PathProgramCache]: Analyzing trace with hash 953343603, now seen corresponding path program 4 times [2025-03-04 02:25:16,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:16,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019075810] [2025-03-04 02:25:16,885 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:25:16,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:16,895 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:25:16,913 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:25:16,914 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:25:16,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:17,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:17,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:17,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019075810] [2025-03-04 02:25:17,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019075810] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:25:17,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786095133] [2025-03-04 02:25:17,201 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:25:17,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:25:17,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:25:17,205 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:25:17,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 02:25:17,243 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:25:17,259 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:25:17,259 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:25:17,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:17,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 02:25:17,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:25:17,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 02:25:17,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2025-03-04 02:25:17,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:17,478 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:25:17,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2025-03-04 02:25:17,992 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:25:17,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 58 [2025-03-04 02:25:18,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 61 [2025-03-04 02:25:18,038 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 02:25:18,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 75 [2025-03-04 02:25:18,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2025-03-04 02:25:18,100 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-04 02:25:18,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 1 [2025-03-04 02:25:18,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:18,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786095133] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:25:18,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:25:18,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 23 [2025-03-04 02:25:18,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200535426] [2025-03-04 02:25:18,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:25:18,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 02:25:18,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:18,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 02:25:18,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2025-03-04 02:25:18,229 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-04 02:25:18,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 243 transitions, 1954 flow. Second operand has 24 states, 24 states have (on average 8.625) internal successors, (207), 24 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:18,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:18,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-04 02:25:18,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:19,852 INFO L124 PetriNetUnfolderBase]: 4624/7387 cut-off events. [2025-03-04 02:25:19,852 INFO L125 PetriNetUnfolderBase]: For 23405/23417 co-relation queries the response was YES. [2025-03-04 02:25:19,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29952 conditions, 7387 events. 4624/7387 cut-off events. For 23405/23417 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 46337 event pairs, 760 based on Foata normal form. 15/7401 useless extension candidates. Maximal degree in co-relation 29227. Up to 5088 conditions per place. [2025-03-04 02:25:19,900 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 280 selfloop transitions, 156 changer transitions 2/443 dead transitions. [2025-03-04 02:25:19,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 443 transitions, 4031 flow [2025-03-04 02:25:19,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-04 02:25:19,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-03-04 02:25:19,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 435 transitions. [2025-03-04 02:25:19,902 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39944903581267216 [2025-03-04 02:25:19,902 INFO L175 Difference]: Start difference. First operand has 129 places, 243 transitions, 1954 flow. Second operand 33 states and 435 transitions. [2025-03-04 02:25:19,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 443 transitions, 4031 flow [2025-03-04 02:25:19,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 443 transitions, 3906 flow, removed 9 selfloop flow, removed 12 redundant places. [2025-03-04 02:25:19,970 INFO L231 Difference]: Finished difference. Result has 160 places, 328 transitions, 3077 flow [2025-03-04 02:25:19,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1844, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=3077, PETRI_PLACES=160, PETRI_TRANSITIONS=328} [2025-03-04 02:25:19,971 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 125 predicate places. [2025-03-04 02:25:19,971 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 328 transitions, 3077 flow [2025-03-04 02:25:19,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.625) internal successors, (207), 24 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:19,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:19,972 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:19,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 02:25:20,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:25:20,176 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:25:20,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:20,177 INFO L85 PathProgramCache]: Analyzing trace with hash -2102871861, now seen corresponding path program 5 times [2025-03-04 02:25:20,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:20,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9221152] [2025-03-04 02:25:20,177 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:25:20,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:20,181 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:25:20,187 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:25:20,187 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:25:20,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:20,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:20,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:20,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9221152] [2025-03-04 02:25:20,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9221152] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:25:20,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246159603] [2025-03-04 02:25:20,590 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:25:20,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:25:20,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:25:20,593 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:25:20,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 02:25:20,634 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:25:20,650 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:25:20,650 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:25:20,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:20,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 02:25:20,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:25:20,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 02:25:20,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2025-03-04 02:25:20,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:20,961 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:25:21,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 60 [2025-03-04 02:25:21,436 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:25:21,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 81 [2025-03-04 02:25:21,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2025-03-04 02:25:21,615 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-04 02:25:21,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 1 [2025-03-04 02:25:21,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2025-03-04 02:25:21,625 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-04 02:25:21,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 1 [2025-03-04 02:25:21,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 60 [2025-03-04 02:25:21,635 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-04 02:25:21,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 1 [2025-03-04 02:25:21,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:21,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246159603] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:25:21,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:25:21,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 23 [2025-03-04 02:25:21,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779580533] [2025-03-04 02:25:21,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:25:21,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 02:25:21,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:21,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 02:25:21,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2025-03-04 02:25:21,808 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-04 02:25:21,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 328 transitions, 3077 flow. Second operand has 24 states, 24 states have (on average 9.541666666666666) internal successors, (229), 24 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:21,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:21,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-04 02:25:21,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:23,715 INFO L124 PetriNetUnfolderBase]: 4420/7158 cut-off events. [2025-03-04 02:25:23,716 INFO L125 PetriNetUnfolderBase]: For 30510/30534 co-relation queries the response was YES. [2025-03-04 02:25:23,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32031 conditions, 7158 events. 4420/7158 cut-off events. For 30510/30534 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 45376 event pairs, 514 based on Foata normal form. 8/7163 useless extension candidates. Maximal degree in co-relation 31762. Up to 4439 conditions per place. [2025-03-04 02:25:23,766 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 326 selfloop transitions, 228 changer transitions 2/562 dead transitions. [2025-03-04 02:25:23,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 562 transitions, 5797 flow [2025-03-04 02:25:23,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-04 02:25:23,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-03-04 02:25:23,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 511 transitions. [2025-03-04 02:25:23,768 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44242424242424244 [2025-03-04 02:25:23,769 INFO L175 Difference]: Start difference. First operand has 160 places, 328 transitions, 3077 flow. Second operand 35 states and 511 transitions. [2025-03-04 02:25:23,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 562 transitions, 5797 flow [2025-03-04 02:25:23,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 562 transitions, 5571 flow, removed 95 selfloop flow, removed 6 redundant places. [2025-03-04 02:25:23,877 INFO L231 Difference]: Finished difference. Result has 196 places, 430 transitions, 4508 flow [2025-03-04 02:25:23,877 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2851, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=4508, PETRI_PLACES=196, PETRI_TRANSITIONS=430} [2025-03-04 02:25:23,878 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 161 predicate places. [2025-03-04 02:25:23,878 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 430 transitions, 4508 flow [2025-03-04 02:25:23,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.541666666666666) internal successors, (229), 24 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:23,879 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:23,879 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:23,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 02:25:24,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:25:24,080 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:25:24,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:24,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1349442861, now seen corresponding path program 6 times [2025-03-04 02:25:24,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:24,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545655474] [2025-03-04 02:25:24,081 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:25:24,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:24,087 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:25:24,095 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:25:24,099 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:25:24,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:24,176 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:24,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:24,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545655474] [2025-03-04 02:25:24,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545655474] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:25:24,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368978743] [2025-03-04 02:25:24,176 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:25:24,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:25:24,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:25:24,178 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:25:24,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 02:25:24,215 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:25:24,230 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:25:24,230 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:25:24,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:24,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 02:25:24,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:25:24,321 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:24,321 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:25:24,403 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:24,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368978743] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:25:24,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:25:24,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-03-04 02:25:24,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232391186] [2025-03-04 02:25:24,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:25:24,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 02:25:24,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:24,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 02:25:24,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2025-03-04 02:25:24,440 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-04 02:25:24,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 430 transitions, 4508 flow. Second operand has 19 states, 19 states have (on average 7.578947368421052) internal successors, (144), 19 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:24,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:24,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-04 02:25:24,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:26,455 INFO L124 PetriNetUnfolderBase]: 12060/17601 cut-off events. [2025-03-04 02:25:26,455 INFO L125 PetriNetUnfolderBase]: For 99786/99786 co-relation queries the response was YES. [2025-03-04 02:25:26,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84079 conditions, 17601 events. 12060/17601 cut-off events. For 99786/99786 co-relation queries the response was YES. Maximal size of possible extension queue 882. Compared 109207 event pairs, 1644 based on Foata normal form. 12/17610 useless extension candidates. Maximal degree in co-relation 83889. Up to 5046 conditions per place. [2025-03-04 02:25:26,603 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 1152 selfloop transitions, 134 changer transitions 0/1289 dead transitions. [2025-03-04 02:25:26,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 1289 transitions, 15717 flow [2025-03-04 02:25:26,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 02:25:26,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-04 02:25:26,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 314 transitions. [2025-03-04 02:25:26,604 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47575757575757577 [2025-03-04 02:25:26,604 INFO L175 Difference]: Start difference. First operand has 196 places, 430 transitions, 4508 flow. Second operand 20 states and 314 transitions. [2025-03-04 02:25:26,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 1289 transitions, 15717 flow [2025-03-04 02:25:27,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 1289 transitions, 14308 flow, removed 593 selfloop flow, removed 13 redundant places. [2025-03-04 02:25:27,091 INFO L231 Difference]: Finished difference. Result has 209 places, 521 transitions, 5236 flow [2025-03-04 02:25:27,091 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4019, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=5236, PETRI_PLACES=209, PETRI_TRANSITIONS=521} [2025-03-04 02:25:27,092 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 174 predicate places. [2025-03-04 02:25:27,092 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 521 transitions, 5236 flow [2025-03-04 02:25:27,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.578947368421052) internal successors, (144), 19 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:27,092 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:27,092 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:27,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 02:25:27,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:25:27,294 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:25:27,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:27,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1746032903, now seen corresponding path program 7 times [2025-03-04 02:25:27,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:27,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675264672] [2025-03-04 02:25:27,295 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:25:27,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:27,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 02:25:27,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:25:27,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:25:27,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:27,364 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:27,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:27,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675264672] [2025-03-04 02:25:27,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675264672] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:25:27,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308220750] [2025-03-04 02:25:27,365 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:25:27,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:25:27,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:25:27,367 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:25:27,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 02:25:27,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 02:25:27,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:25:27,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:25:27,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:27,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 02:25:27,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:25:27,479 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:27,479 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:25:27,522 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:27,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308220750] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:25:27,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:25:27,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 13 [2025-03-04 02:25:27,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444570178] [2025-03-04 02:25:27,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:27,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:25:27,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:27,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:25:27,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-04 02:25:27,530 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-04 02:25:27,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 521 transitions, 5236 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:27,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:27,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-04 02:25:27,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:29,386 INFO L124 PetriNetUnfolderBase]: 11905/17901 cut-off events. [2025-03-04 02:25:29,386 INFO L125 PetriNetUnfolderBase]: For 123676/124227 co-relation queries the response was YES. [2025-03-04 02:25:29,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92381 conditions, 17901 events. 11905/17901 cut-off events. For 123676/124227 co-relation queries the response was YES. Maximal size of possible extension queue 982. Compared 118194 event pairs, 2115 based on Foata normal form. 303/18075 useless extension candidates. Maximal degree in co-relation 92183. Up to 5826 conditions per place. [2025-03-04 02:25:29,705 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 692 selfloop transitions, 61 changer transitions 0/773 dead transitions. [2025-03-04 02:25:29,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 773 transitions, 9323 flow [2025-03-04 02:25:29,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:25:29,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:25:29,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2025-03-04 02:25:29,706 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2025-03-04 02:25:29,706 INFO L175 Difference]: Start difference. First operand has 209 places, 521 transitions, 5236 flow. Second operand 8 states and 144 transitions. [2025-03-04 02:25:29,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 773 transitions, 9323 flow [2025-03-04 02:25:30,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 773 transitions, 9113 flow, removed 96 selfloop flow, removed 5 redundant places. [2025-03-04 02:25:30,244 INFO L231 Difference]: Finished difference. Result has 214 places, 528 transitions, 5402 flow [2025-03-04 02:25:30,244 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=5142, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=464, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5402, PETRI_PLACES=214, PETRI_TRANSITIONS=528} [2025-03-04 02:25:30,244 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 179 predicate places. [2025-03-04 02:25:30,245 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 528 transitions, 5402 flow [2025-03-04 02:25:30,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:30,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:30,245 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:30,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 02:25:30,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 02:25:30,449 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:25:30,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:30,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1755230751, now seen corresponding path program 8 times [2025-03-04 02:25:30,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:30,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021794575] [2025-03-04 02:25:30,449 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:25:30,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:30,466 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-04 02:25:30,476 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:25:30,477 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:25:30,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:30,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:30,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:30,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021794575] [2025-03-04 02:25:30,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021794575] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:25:30,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693667108] [2025-03-04 02:25:30,544 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:25:30,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:25:30,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:25:30,546 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:25:30,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 02:25:30,587 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-04 02:25:30,602 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:25:30,602 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:25:30,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:30,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 02:25:30,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:25:30,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:30,680 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:25:30,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693667108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:30,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:25:30,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 15 [2025-03-04 02:25:30,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517434084] [2025-03-04 02:25:30,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:30,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:25:30,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:30,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:25:30,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-04 02:25:30,698 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-04 02:25:30,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 528 transitions, 5402 flow. Second operand has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:30,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:30,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-04 02:25:30,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:33,884 INFO L124 PetriNetUnfolderBase]: 17736/26476 cut-off events. [2025-03-04 02:25:33,884 INFO L125 PetriNetUnfolderBase]: For 153672/154276 co-relation queries the response was YES. [2025-03-04 02:25:34,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137019 conditions, 26476 events. 17736/26476 cut-off events. For 153672/154276 co-relation queries the response was YES. Maximal size of possible extension queue 1260. Compared 177998 event pairs, 4629 based on Foata normal form. 147/26535 useless extension candidates. Maximal degree in co-relation 136798. Up to 12121 conditions per place. [2025-03-04 02:25:34,119 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 1014 selfloop transitions, 108 changer transitions 0/1134 dead transitions. [2025-03-04 02:25:34,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 1134 transitions, 14244 flow [2025-03-04 02:25:34,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:25:34,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:25:34,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 187 transitions. [2025-03-04 02:25:34,121 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2025-03-04 02:25:34,121 INFO L175 Difference]: Start difference. First operand has 214 places, 528 transitions, 5402 flow. Second operand 12 states and 187 transitions. [2025-03-04 02:25:34,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 1134 transitions, 14244 flow [2025-03-04 02:25:34,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 1134 transitions, 14227 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-03-04 02:25:34,808 INFO L231 Difference]: Finished difference. Result has 233 places, 593 transitions, 6699 flow [2025-03-04 02:25:34,808 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=5395, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=6699, PETRI_PLACES=233, PETRI_TRANSITIONS=593} [2025-03-04 02:25:34,809 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 198 predicate places. [2025-03-04 02:25:34,809 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 593 transitions, 6699 flow [2025-03-04 02:25:34,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:34,809 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:34,809 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-03-04 02:25:34,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 02:25:35,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:25:35,009 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:25:35,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:35,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1484168210, now seen corresponding path program 1 times [2025-03-04 02:25:35,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:35,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767788394] [2025-03-04 02:25:35,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:25:35,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:35,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 02:25:35,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:25:35,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:25:35,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:35,066 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:35,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:35,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767788394] [2025-03-04 02:25:35,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767788394] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:25:35,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923750744] [2025-03-04 02:25:35,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:25:35,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:25:35,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:25:35,069 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:25:35,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 02:25:35,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 02:25:35,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:25:35,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:25:35,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:35,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 02:25:35,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:25:35,171 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:35,171 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:25:35,215 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:35,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923750744] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:25:35,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:25:35,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-04 02:25:35,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936851607] [2025-03-04 02:25:35,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:25:35,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 02:25:35,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:35,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 02:25:35,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:25:35,244 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-04 02:25:35,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 593 transitions, 6699 flow. Second operand has 13 states, 13 states have (on average 9.923076923076923) internal successors, (129), 13 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:35,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:35,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-04 02:25:35,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:36,616 INFO L124 PetriNetUnfolderBase]: 7340/11644 cut-off events. [2025-03-04 02:25:36,617 INFO L125 PetriNetUnfolderBase]: For 104382/104967 co-relation queries the response was YES. [2025-03-04 02:25:36,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70442 conditions, 11644 events. 7340/11644 cut-off events. For 104382/104967 co-relation queries the response was YES. Maximal size of possible extension queue 648. Compared 78003 event pairs, 3369 based on Foata normal form. 429/11977 useless extension candidates. Maximal degree in co-relation 70370. Up to 7160 conditions per place. [2025-03-04 02:25:36,723 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 471 selfloop transitions, 16 changer transitions 0/504 dead transitions. [2025-03-04 02:25:36,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 504 transitions, 6810 flow [2025-03-04 02:25:36,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:25:36,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:25:36,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2025-03-04 02:25:36,724 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.494949494949495 [2025-03-04 02:25:36,724 INFO L175 Difference]: Start difference. First operand has 233 places, 593 transitions, 6699 flow. Second operand 6 states and 98 transitions. [2025-03-04 02:25:36,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 504 transitions, 6810 flow [2025-03-04 02:25:37,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 504 transitions, 6577 flow, removed 82 selfloop flow, removed 10 redundant places. [2025-03-04 02:25:37,105 INFO L231 Difference]: Finished difference. Result has 216 places, 380 transitions, 4370 flow [2025-03-04 02:25:37,106 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4278, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4370, PETRI_PLACES=216, PETRI_TRANSITIONS=380} [2025-03-04 02:25:37,106 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 181 predicate places. [2025-03-04 02:25:37,106 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 380 transitions, 4370 flow [2025-03-04 02:25:37,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.923076923076923) internal successors, (129), 13 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:37,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:37,106 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:37,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 02:25:37,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 02:25:37,308 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:25:37,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:37,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1654838709, now seen corresponding path program 9 times [2025-03-04 02:25:37,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:37,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494882724] [2025-03-04 02:25:37,309 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:25:37,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:37,312 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 2 equivalence classes. [2025-03-04 02:25:37,316 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:25:37,316 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:25:37,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:37,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:37,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:37,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494882724] [2025-03-04 02:25:37,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494882724] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:25:37,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397601790] [2025-03-04 02:25:37,373 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:25:37,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:25:37,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:25:37,375 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:25:37,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 02:25:37,425 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 2 equivalence classes. [2025-03-04 02:25:37,441 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:25:37,441 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:25:37,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:37,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 02:25:37,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:25:37,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:37,503 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:25:37,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:37,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397601790] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:25:37,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:25:37,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-04 02:25:37,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394271463] [2025-03-04 02:25:37,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:25:37,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 02:25:37,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:37,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 02:25:37,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-03-04 02:25:37,570 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-04 02:25:37,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 380 transitions, 4370 flow. Second operand has 14 states, 14 states have (on average 9.714285714285714) internal successors, (136), 14 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:37,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:37,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-04 02:25:37,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:38,807 INFO L124 PetriNetUnfolderBase]: 8034/12459 cut-off events. [2025-03-04 02:25:38,808 INFO L125 PetriNetUnfolderBase]: For 114577/115150 co-relation queries the response was YES. [2025-03-04 02:25:38,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74045 conditions, 12459 events. 8034/12459 cut-off events. For 114577/115150 co-relation queries the response was YES. Maximal size of possible extension queue 660. Compared 80437 event pairs, 3586 based on Foata normal form. 272/12591 useless extension candidates. Maximal degree in co-relation 73980. Up to 8389 conditions per place. [2025-03-04 02:25:38,930 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 331 selfloop transitions, 60 changer transitions 0/407 dead transitions. [2025-03-04 02:25:38,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 407 transitions, 5329 flow [2025-03-04 02:25:38,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:25:38,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:25:38,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2025-03-04 02:25:38,931 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49783549783549785 [2025-03-04 02:25:38,931 INFO L175 Difference]: Start difference. First operand has 216 places, 380 transitions, 4370 flow. Second operand 7 states and 115 transitions. [2025-03-04 02:25:38,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 407 transitions, 5329 flow [2025-03-04 02:25:39,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 407 transitions, 5189 flow, removed 40 selfloop flow, removed 6 redundant places. [2025-03-04 02:25:39,490 INFO L231 Difference]: Finished difference. Result has 217 places, 354 transitions, 4158 flow [2025-03-04 02:25:39,490 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3964, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4158, PETRI_PLACES=217, PETRI_TRANSITIONS=354} [2025-03-04 02:25:39,491 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 182 predicate places. [2025-03-04 02:25:39,491 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 354 transitions, 4158 flow [2025-03-04 02:25:39,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.714285714285714) internal successors, (136), 14 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:39,491 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:39,491 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:39,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 02:25:39,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 02:25:39,692 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:25:39,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:39,692 INFO L85 PathProgramCache]: Analyzing trace with hash 651317553, now seen corresponding path program 10 times [2025-03-04 02:25:39,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:39,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914777209] [2025-03-04 02:25:39,692 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:25:39,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:39,698 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-03-04 02:25:39,699 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 27 of 29 statements. [2025-03-04 02:25:39,699 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 02:25:39,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:39,740 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:39,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:39,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914777209] [2025-03-04 02:25:39,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914777209] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:25:39,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182436963] [2025-03-04 02:25:39,741 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:25:39,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:25:39,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:25:39,743 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:25:39,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 02:25:39,782 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-03-04 02:25:39,792 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 27 of 29 statements. [2025-03-04 02:25:39,793 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 02:25:39,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:39,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 02:25:39,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:25:39,885 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:39,885 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:25:39,956 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:39,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182436963] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:25:39,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:25:39,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 8] total 19 [2025-03-04 02:25:39,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979749299] [2025-03-04 02:25:39,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:39,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:25:39,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:39,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:25:39,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-03-04 02:25:39,966 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-04 02:25:39,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 354 transitions, 4158 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:39,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:39,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-04 02:25:39,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:41,756 INFO L124 PetriNetUnfolderBase]: 11888/17674 cut-off events. [2025-03-04 02:25:41,756 INFO L125 PetriNetUnfolderBase]: For 134146/134251 co-relation queries the response was YES. [2025-03-04 02:25:41,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99904 conditions, 17674 events. 11888/17674 cut-off events. For 134146/134251 co-relation queries the response was YES. Maximal size of possible extension queue 774. Compared 110014 event pairs, 1414 based on Foata normal form. 56/17710 useless extension candidates. Maximal degree in co-relation 99841. Up to 4809 conditions per place. [2025-03-04 02:25:41,918 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 645 selfloop transitions, 138 changer transitions 6/796 dead transitions. [2025-03-04 02:25:41,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 796 transitions, 9855 flow [2025-03-04 02:25:41,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:25:41,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:25:41,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 194 transitions. [2025-03-04 02:25:41,919 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5344352617079889 [2025-03-04 02:25:41,919 INFO L175 Difference]: Start difference. First operand has 217 places, 354 transitions, 4158 flow. Second operand 11 states and 194 transitions. [2025-03-04 02:25:41,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 796 transitions, 9855 flow [2025-03-04 02:25:42,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 796 transitions, 9738 flow, removed 23 selfloop flow, removed 5 redundant places. [2025-03-04 02:25:42,812 INFO L231 Difference]: Finished difference. Result has 228 places, 404 transitions, 5125 flow [2025-03-04 02:25:42,813 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4069, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5125, PETRI_PLACES=228, PETRI_TRANSITIONS=404} [2025-03-04 02:25:42,813 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 193 predicate places. [2025-03-04 02:25:42,813 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 404 transitions, 5125 flow [2025-03-04 02:25:42,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:42,813 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:42,813 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:42,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 02:25:43,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 02:25:43,014 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:25:43,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:43,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1485278771, now seen corresponding path program 11 times [2025-03-04 02:25:43,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:43,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247010167] [2025-03-04 02:25:43,015 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:25:43,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:43,019 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-04 02:25:43,023 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:25:43,023 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:25:43,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:43,075 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:43,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:43,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247010167] [2025-03-04 02:25:43,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247010167] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:25:43,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86151805] [2025-03-04 02:25:43,076 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:25:43,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:25:43,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:25:43,077 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:25:43,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 02:25:43,117 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-04 02:25:43,132 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:25:43,132 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:25:43,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:43,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 02:25:43,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:25:43,226 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:43,227 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:25:43,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:43,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86151805] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:25:43,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:25:43,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-04 02:25:43,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125351461] [2025-03-04 02:25:43,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:25:43,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 02:25:43,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:43,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 02:25:43,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-03-04 02:25:43,310 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-04 02:25:43,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 404 transitions, 5125 flow. Second operand has 14 states, 14 states have (on average 9.714285714285714) internal successors, (136), 14 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:43,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:43,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-04 02:25:43,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:44,985 INFO L124 PetriNetUnfolderBase]: 8839/13856 cut-off events. [2025-03-04 02:25:44,985 INFO L125 PetriNetUnfolderBase]: For 140221/140368 co-relation queries the response was YES. [2025-03-04 02:25:45,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85805 conditions, 13856 events. 8839/13856 cut-off events. For 140221/140368 co-relation queries the response was YES. Maximal size of possible extension queue 627. Compared 90147 event pairs, 4076 based on Foata normal form. 282/14084 useless extension candidates. Maximal degree in co-relation 85737. Up to 10218 conditions per place. [2025-03-04 02:25:45,141 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 225 selfloop transitions, 3 changer transitions 181/429 dead transitions. [2025-03-04 02:25:45,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 429 transitions, 6329 flow [2025-03-04 02:25:45,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:25:45,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:25:45,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2025-03-04 02:25:45,142 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2025-03-04 02:25:45,142 INFO L175 Difference]: Start difference. First operand has 228 places, 404 transitions, 5125 flow. Second operand 7 states and 110 transitions. [2025-03-04 02:25:45,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 429 transitions, 6329 flow [2025-03-04 02:25:46,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 429 transitions, 6234 flow, removed 30 selfloop flow, removed 2 redundant places. [2025-03-04 02:25:46,173 INFO L231 Difference]: Finished difference. Result has 233 places, 248 transitions, 2781 flow [2025-03-04 02:25:46,174 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4753, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2781, PETRI_PLACES=233, PETRI_TRANSITIONS=248} [2025-03-04 02:25:46,174 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 198 predicate places. [2025-03-04 02:25:46,174 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 248 transitions, 2781 flow [2025-03-04 02:25:46,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.714285714285714) internal successors, (136), 14 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:46,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:46,174 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:46,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 02:25:46,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 02:25:46,375 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:25:46,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:46,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1567106173, now seen corresponding path program 12 times [2025-03-04 02:25:46,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:46,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282112945] [2025-03-04 02:25:46,376 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:25:46,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:46,381 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 2 equivalence classes. [2025-03-04 02:25:46,385 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 28 of 30 statements. [2025-03-04 02:25:46,385 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:25:46,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:46,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:25:46,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:46,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282112945] [2025-03-04 02:25:46,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282112945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:46,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:46,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:25:46,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446779233] [2025-03-04 02:25:46,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:46,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:25:46,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:46,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:25:46,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:25:46,477 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-04 02:25:46,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 248 transitions, 2781 flow. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:46,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:46,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-04 02:25:46,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:48,595 INFO L124 PetriNetUnfolderBase]: 11194/16183 cut-off events. [2025-03-04 02:25:48,595 INFO L125 PetriNetUnfolderBase]: For 140330/140394 co-relation queries the response was YES. [2025-03-04 02:25:48,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98348 conditions, 16183 events. 11194/16183 cut-off events. For 140330/140394 co-relation queries the response was YES. Maximal size of possible extension queue 609. Compared 91989 event pairs, 285 based on Foata normal form. 18/16193 useless extension candidates. Maximal degree in co-relation 98280. Up to 5459 conditions per place. [2025-03-04 02:25:48,810 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 513 selfloop transitions, 269 changer transitions 0/789 dead transitions. [2025-03-04 02:25:48,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 789 transitions, 9675 flow [2025-03-04 02:25:48,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-04 02:25:48,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-03-04 02:25:48,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 408 transitions. [2025-03-04 02:25:48,811 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45791245791245794 [2025-03-04 02:25:48,811 INFO L175 Difference]: Start difference. First operand has 233 places, 248 transitions, 2781 flow. Second operand 27 states and 408 transitions. [2025-03-04 02:25:48,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 789 transitions, 9675 flow [2025-03-04 02:25:50,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 789 transitions, 8986 flow, removed 144 selfloop flow, removed 22 redundant places. [2025-03-04 02:25:50,035 INFO L231 Difference]: Finished difference. Result has 206 places, 431 transitions, 5565 flow [2025-03-04 02:25:50,035 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2497, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=5565, PETRI_PLACES=206, PETRI_TRANSITIONS=431} [2025-03-04 02:25:50,035 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 171 predicate places. [2025-03-04 02:25:50,035 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 431 transitions, 5565 flow [2025-03-04 02:25:50,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:50,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:50,036 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:50,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 02:25:50,036 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:25:50,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:50,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1283508375, now seen corresponding path program 13 times [2025-03-04 02:25:50,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:50,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666299007] [2025-03-04 02:25:50,036 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:25:50,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:50,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 02:25:50,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 02:25:50,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:25:50,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:50,136 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:25:50,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:50,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666299007] [2025-03-04 02:25:50,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666299007] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:25:50,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035773121] [2025-03-04 02:25:50,137 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:25:50,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:25:50,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:25:50,138 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:25:50,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 02:25:50,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 02:25:50,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 02:25:50,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:25:50,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:50,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 02:25:50,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:25:50,284 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:25:50,284 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:25:50,362 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:25:50,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035773121] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:25:50,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:25:50,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-03-04 02:25:50,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139454331] [2025-03-04 02:25:50,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:25:50,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 02:25:50,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:50,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 02:25:50,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2025-03-04 02:25:50,402 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-04 02:25:50,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 431 transitions, 5565 flow. Second operand has 20 states, 20 states have (on average 7.45) internal successors, (149), 20 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:50,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:50,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-04 02:25:50,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:53,573 INFO L124 PetriNetUnfolderBase]: 18488/26905 cut-off events. [2025-03-04 02:25:53,574 INFO L125 PetriNetUnfolderBase]: For 313141/313585 co-relation queries the response was YES. [2025-03-04 02:25:53,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177991 conditions, 26905 events. 18488/26905 cut-off events. For 313141/313585 co-relation queries the response was YES. Maximal size of possible extension queue 838. Compared 164937 event pairs, 1148 based on Foata normal form. 104/26988 useless extension candidates. Maximal degree in co-relation 177920. Up to 10381 conditions per place. [2025-03-04 02:25:54,119 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 748 selfloop transitions, 430 changer transitions 0/1198 dead transitions. [2025-03-04 02:25:54,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 1198 transitions, 17129 flow [2025-03-04 02:25:54,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-04 02:25:54,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-03-04 02:25:54,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 573 transitions. [2025-03-04 02:25:54,120 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4692874692874693 [2025-03-04 02:25:54,121 INFO L175 Difference]: Start difference. First operand has 206 places, 431 transitions, 5565 flow. Second operand 37 states and 573 transitions. [2025-03-04 02:25:54,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 1198 transitions, 17129 flow [2025-03-04 02:25:58,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 1198 transitions, 16263 flow, removed 325 selfloop flow, removed 2 redundant places. [2025-03-04 02:25:58,329 INFO L231 Difference]: Finished difference. Result has 248 places, 668 transitions, 9495 flow [2025-03-04 02:25:58,329 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=5132, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=215, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=9495, PETRI_PLACES=248, PETRI_TRANSITIONS=668} [2025-03-04 02:25:58,329 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 213 predicate places. [2025-03-04 02:25:58,329 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 668 transitions, 9495 flow [2025-03-04 02:25:58,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.45) internal successors, (149), 20 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:58,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:58,329 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:58,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 02:25:58,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:25:58,530 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-03-04 02:25:58,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:58,531 INFO L85 PathProgramCache]: Analyzing trace with hash 271767211, now seen corresponding path program 14 times [2025-03-04 02:25:58,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:58,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014380989] [2025-03-04 02:25:58,531 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:25:58,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:58,535 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 02:25:58,540 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 02:25:58,540 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:25:58,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:58,613 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:58,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:58,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014380989] [2025-03-04 02:25:58,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014380989] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:25:58,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099037485] [2025-03-04 02:25:58,614 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:25:58,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:25:58,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:25:58,616 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:25:58,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 02:25:58,656 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 02:25:58,671 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 02:25:58,671 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:25:58,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:58,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 02:25:58,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:25:58,736 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:58,736 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:25:58,788 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:58,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099037485] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:25:58,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:25:58,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-04 02:25:58,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029177073] [2025-03-04 02:25:58,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:25:58,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 02:25:58,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:58,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 02:25:58,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2025-03-04 02:25:58,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-04 02:25:58,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 668 transitions, 9495 flow. Second operand has 18 states, 18 states have (on average 7.333333333333333) internal successors, (132), 18 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:58,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:58,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-04 02:25:58,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:02,101 INFO L124 PetriNetUnfolderBase]: 18476/27057 cut-off events. [2025-03-04 02:26:02,101 INFO L125 PetriNetUnfolderBase]: For 337841/337899 co-relation queries the response was YES. [2025-03-04 02:26:02,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184942 conditions, 27057 events. 18476/27057 cut-off events. For 337841/337899 co-relation queries the response was YES. Maximal size of possible extension queue 870. Compared 169095 event pairs, 2198 based on Foata normal form. 130/27182 useless extension candidates. Maximal degree in co-relation 184863. Up to 10576 conditions per place. [2025-03-04 02:26:02,612 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 422 selfloop transitions, 552 changer transitions 0/994 dead transitions. [2025-03-04 02:26:02,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 994 transitions, 15967 flow [2025-03-04 02:26:02,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:26:02,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 02:26:02,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 177 transitions. [2025-03-04 02:26:02,613 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4125874125874126 [2025-03-04 02:26:02,613 INFO L175 Difference]: Start difference. First operand has 248 places, 668 transitions, 9495 flow. Second operand 13 states and 177 transitions. [2025-03-04 02:26:02,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 994 transitions, 15967 flow [2025-03-04 02:26:06,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 994 transitions, 14466 flow, removed 398 selfloop flow, removed 10 redundant places. [2025-03-04 02:26:06,916 INFO L231 Difference]: Finished difference. Result has 252 places, 831 transitions, 12166 flow [2025-03-04 02:26:06,916 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=8407, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=668, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=405, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=12166, PETRI_PLACES=252, PETRI_TRANSITIONS=831} [2025-03-04 02:26:06,917 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 217 predicate places. [2025-03-04 02:26:06,917 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 831 transitions, 12166 flow [2025-03-04 02:26:06,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.333333333333333) internal successors, (132), 18 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:06,917 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:06,917 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:26:06,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 02:26:07,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:26:07,118 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-03-04 02:26:07,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:07,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1025575163, now seen corresponding path program 15 times [2025-03-04 02:26:07,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:07,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010282596] [2025-03-04 02:26:07,118 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:26:07,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:07,124 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-03-04 02:26:07,127 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 02:26:07,128 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:26:07,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:07,189 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:26:07,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:07,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010282596] [2025-03-04 02:26:07,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010282596] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:26:07,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490000399] [2025-03-04 02:26:07,189 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:26:07,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:26:07,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:26:07,192 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:26:07,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 02:26:07,237 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-03-04 02:26:07,252 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 02:26:07,253 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:26:07,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:07,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 02:26:07,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:26:07,355 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:26:07,355 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:26:07,442 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:26:07,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490000399] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:26:07,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:26:07,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2025-03-04 02:26:07,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808776921] [2025-03-04 02:26:07,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:26:07,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 02:26:07,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:07,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 02:26:07,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2025-03-04 02:26:07,464 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-03-04 02:26:07,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 831 transitions, 12166 flow. Second operand has 22 states, 22 states have (on average 7.090909090909091) internal successors, (156), 22 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:07,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:07,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-03-04 02:26:07,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:14,819 INFO L124 PetriNetUnfolderBase]: 32529/45695 cut-off events. [2025-03-04 02:26:14,820 INFO L125 PetriNetUnfolderBase]: For 404540/404540 co-relation queries the response was YES. [2025-03-04 02:26:15,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281353 conditions, 45695 events. 32529/45695 cut-off events. For 404540/404540 co-relation queries the response was YES. Maximal size of possible extension queue 1247. Compared 274692 event pairs, 1244 based on Foata normal form. 19/45714 useless extension candidates. Maximal degree in co-relation 281274. Up to 16262 conditions per place. [2025-03-04 02:26:15,695 INFO L140 encePairwiseOnDemand]: 19/33 looper letters, 1153 selfloop transitions, 1274 changer transitions 0/2428 dead transitions. [2025-03-04 02:26:15,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 2428 transitions, 36078 flow [2025-03-04 02:26:15,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-03-04 02:26:15,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2025-03-04 02:26:15,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 996 transitions. [2025-03-04 02:26:15,697 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44385026737967914 [2025-03-04 02:26:15,697 INFO L175 Difference]: Start difference. First operand has 252 places, 831 transitions, 12166 flow. Second operand 68 states and 996 transitions. [2025-03-04 02:26:15,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 2428 transitions, 36078 flow [2025-03-04 02:26:21,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 2428 transitions, 35032 flow, removed 114 selfloop flow, removed 5 redundant places. [2025-03-04 02:26:21,485 INFO L231 Difference]: Finished difference. Result has 341 places, 1596 transitions, 26639 flow [2025-03-04 02:26:21,485 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=11686, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=831, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=539, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=68, PETRI_FLOW=26639, PETRI_PLACES=341, PETRI_TRANSITIONS=1596} [2025-03-04 02:26:21,486 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 306 predicate places. [2025-03-04 02:26:21,486 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 1596 transitions, 26639 flow [2025-03-04 02:26:21,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.090909090909091) internal successors, (156), 22 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:21,486 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:21,486 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:26:21,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 02:26:21,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:26:21,688 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-03-04 02:26:21,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:21,688 INFO L85 PathProgramCache]: Analyzing trace with hash -341038065, now seen corresponding path program 16 times [2025-03-04 02:26:21,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:21,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850901898] [2025-03-04 02:26:21,688 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:26:21,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:21,697 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-04 02:26:21,699 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 27 of 30 statements. [2025-03-04 02:26:21,699 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 02:26:21,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:21,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:26:21,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:21,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850901898] [2025-03-04 02:26:21,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850901898] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:26:21,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046416030] [2025-03-04 02:26:21,740 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:26:21,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:26:21,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:26:21,741 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:26:21,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 02:26:21,780 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-04 02:26:21,789 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 27 of 30 statements. [2025-03-04 02:26:21,789 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 02:26:21,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:21,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 02:26:21,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:26:21,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:26:21,862 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:26:21,912 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:26:21,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046416030] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:26:21,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:26:21,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-03-04 02:26:21,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182150457] [2025-03-04 02:26:21,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:26:21,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 02:26:21,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:21,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 02:26:21,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-04 02:26:21,925 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-03-04 02:26:21,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 1596 transitions, 26639 flow. Second operand has 16 states, 16 states have (on average 6.8125) internal successors, (109), 16 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:21,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:21,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-03-04 02:26:21,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand