./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-chromosome-opt-symm.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/chl-chromosome-opt-symm.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 b034d85232772d264d33ccb960d3ce3e7bf57df858fd0c6fd0b22127388c3f9a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:17:59,864 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:17:59,918 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:17:59,925 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:17:59,925 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:17:59,946 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:17:59,947 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:17:59,947 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:17:59,947 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:17:59,948 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:17:59,948 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:17:59,948 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:17:59,948 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:17:59,948 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:17:59,948 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:17:59,948 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:17:59,948 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:17:59,948 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:17:59,948 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:17:59,948 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:17:59,948 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:17:59,948 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:17:59,948 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:17:59,948 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:17:59,948 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:17:59,948 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:17:59,949 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:17:59,949 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:17:59,949 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:17:59,949 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:17:59,949 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:17:59,949 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:17:59,949 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:17:59,949 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:17:59,949 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:17:59,949 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:17:59,949 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:17:59,949 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:17:59,949 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:17:59,949 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:17:59,949 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:17:59,949 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:17:59,949 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:17:59,949 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 -> b034d85232772d264d33ccb960d3ce3e7bf57df858fd0c6fd0b22127388c3f9a [2025-03-04 02:18:00,176 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:18:00,185 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:18:00,186 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:18:00,187 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:18:00,187 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:18:00,188 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c [2025-03-04 02:18:01,238 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c2b1bbc0/a359693cb70e452fa6cd811328276b1a/FLAG56dbf3b77 [2025-03-04 02:18:01,448 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:18:01,453 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c [2025-03-04 02:18:01,459 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c2b1bbc0/a359693cb70e452fa6cd811328276b1a/FLAG56dbf3b77 [2025-03-04 02:18:01,790 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c2b1bbc0/a359693cb70e452fa6cd811328276b1a [2025-03-04 02:18:01,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:18:01,792 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:18:01,793 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:18:01,793 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:18:01,796 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:18:01,796 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:18:01" (1/1) ... [2025-03-04 02:18:01,797 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a690dbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:01, skipping insertion in model container [2025-03-04 02:18:01,797 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:18:01" (1/1) ... [2025-03-04 02:18:01,809 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:18:01,928 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/chl-chromosome-opt-symm.wvr.c[2592,2605] [2025-03-04 02:18:01,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:18:01,943 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:18:01,961 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/chl-chromosome-opt-symm.wvr.c[2592,2605] [2025-03-04 02:18:01,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:18:01,977 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:18:01,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:01 WrapperNode [2025-03-04 02:18:01,979 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:18:01,980 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:18:01,980 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:18:01,980 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:18:01,985 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:18:01" (1/1) ... [2025-03-04 02:18:01,991 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:18:01" (1/1) ... [2025-03-04 02:18:02,010 INFO L138 Inliner]: procedures = 23, calls = 25, calls flagged for inlining = 9, calls inlined = 11, statements flattened = 157 [2025-03-04 02:18:02,010 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:18:02,011 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:18:02,012 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:18:02,012 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:18:02,018 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:01" (1/1) ... [2025-03-04 02:18:02,018 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:01" (1/1) ... [2025-03-04 02:18:02,020 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:01" (1/1) ... [2025-03-04 02:18:02,036 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-04 02:18:02,038 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:01" (1/1) ... [2025-03-04 02:18:02,038 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:01" (1/1) ... [2025-03-04 02:18:02,043 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:01" (1/1) ... [2025-03-04 02:18:02,047 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:01" (1/1) ... [2025-03-04 02:18:02,047 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:01" (1/1) ... [2025-03-04 02:18:02,048 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:01" (1/1) ... [2025-03-04 02:18:02,049 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:18:02,049 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:18:02,050 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:18:02,050 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:18:02,050 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:01" (1/1) ... [2025-03-04 02:18:02,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:18:02,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:02,076 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:18:02,078 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:18:02,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:18:02,092 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 02:18:02,092 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 02:18:02,092 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 02:18:02,093 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 02:18:02,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:18:02,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:18:02,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:18:02,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:18:02,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:18:02,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:18:02,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:18:02,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:18:02,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:18:02,094 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:18:02,161 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:18:02,162 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:18:02,359 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:18:02,359 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:18:02,526 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:18:02,526 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:18:02,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:18:02 BoogieIcfgContainer [2025-03-04 02:18:02,526 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:18:02,528 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:18:02,528 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:18:02,532 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:18:02,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:18:01" (1/3) ... [2025-03-04 02:18:02,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1edc8844 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:18:02, skipping insertion in model container [2025-03-04 02:18:02,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:01" (2/3) ... [2025-03-04 02:18:02,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1edc8844 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:18:02, skipping insertion in model container [2025-03-04 02:18:02,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:18:02" (3/3) ... [2025-03-04 02:18:02,534 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-chromosome-opt-symm.wvr.c [2025-03-04 02:18:02,545 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:18:02,546 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-chromosome-opt-symm.wvr.c that has 3 procedures, 23 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-04 02:18:02,546 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:18:02,586 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 02:18:02,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 70 flow [2025-03-04 02:18:02,653 INFO L124 PetriNetUnfolderBase]: 6/26 cut-off events. [2025-03-04 02:18:02,654 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:18:02,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 26 events. 6/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2025-03-04 02:18:02,656 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 28 transitions, 70 flow [2025-03-04 02:18:02,658 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 25 transitions, 62 flow [2025-03-04 02:18:02,662 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:18:02,669 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;@74e6ff09, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:18:02,669 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-04 02:18:02,675 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:18:02,675 INFO L124 PetriNetUnfolderBase]: 6/24 cut-off events. [2025-03-04 02:18:02,676 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:18:02,676 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:02,676 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:02,676 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:02,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:02,681 INFO L85 PathProgramCache]: Analyzing trace with hash 799210622, now seen corresponding path program 1 times [2025-03-04 02:18:02,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:02,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043944643] [2025-03-04 02:18:02,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:02,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:02,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 02:18:02,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:18:02,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:02,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:02,946 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:18:02,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:02,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043944643] [2025-03-04 02:18:02,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043944643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:02,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:02,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:18:02,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718265139] [2025-03-04 02:18:02,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:02,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:18:02,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:02,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:18:02,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:18:02,969 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-03-04 02:18:02,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 25 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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:18:02,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:02,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-03-04 02:18:02,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:03,141 INFO L124 PetriNetUnfolderBase]: 232/391 cut-off events. [2025-03-04 02:18:03,141 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-04 02:18:03,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 391 events. 232/391 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1495 event pairs, 64 based on Foata normal form. 5/320 useless extension candidates. Maximal degree in co-relation 708. Up to 177 conditions per place. [2025-03-04 02:18:03,147 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 43 selfloop transitions, 5 changer transitions 2/52 dead transitions. [2025-03-04 02:18:03,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 52 transitions, 234 flow [2025-03-04 02:18:03,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:18:03,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:18:03,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2025-03-04 02:18:03,158 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5071428571428571 [2025-03-04 02:18:03,159 INFO L175 Difference]: Start difference. First operand has 26 places, 25 transitions, 62 flow. Second operand 5 states and 71 transitions. [2025-03-04 02:18:03,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 52 transitions, 234 flow [2025-03-04 02:18:03,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 52 transitions, 214 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 02:18:03,167 INFO L231 Difference]: Finished difference. Result has 28 places, 27 transitions, 78 flow [2025-03-04 02:18:03,168 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=78, PETRI_PLACES=28, PETRI_TRANSITIONS=27} [2025-03-04 02:18:03,170 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 2 predicate places. [2025-03-04 02:18:03,171 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 78 flow [2025-03-04 02:18:03,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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:18:03,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:03,172 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:03,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:18:03,173 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:03,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:03,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1590349240, now seen corresponding path program 2 times [2025-03-04 02:18:03,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:03,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430899124] [2025-03-04 02:18:03,174 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:18:03,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:03,184 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-03-04 02:18:03,197 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:18:03,198 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:18:03,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:03,275 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:18:03,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:03,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430899124] [2025-03-04 02:18:03,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430899124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:03,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:03,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:18:03,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578974701] [2025-03-04 02:18:03,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:03,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:18:03,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:03,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:18:03,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:18:03,281 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-03-04 02:18:03,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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:18:03,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:03,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-03-04 02:18:03,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:03,420 INFO L124 PetriNetUnfolderBase]: 422/728 cut-off events. [2025-03-04 02:18:03,420 INFO L125 PetriNetUnfolderBase]: For 159/159 co-relation queries the response was YES. [2025-03-04 02:18:03,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1578 conditions, 728 events. 422/728 cut-off events. For 159/159 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3145 event pairs, 156 based on Foata normal form. 4/637 useless extension candidates. Maximal degree in co-relation 587. Up to 358 conditions per place. [2025-03-04 02:18:03,425 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 44 selfloop transitions, 5 changer transitions 0/52 dead transitions. [2025-03-04 02:18:03,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 52 transitions, 243 flow [2025-03-04 02:18:03,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:18:03,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:18:03,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2025-03-04 02:18:03,427 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4785714285714286 [2025-03-04 02:18:03,427 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 78 flow. Second operand 5 states and 67 transitions. [2025-03-04 02:18:03,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 52 transitions, 243 flow [2025-03-04 02:18:03,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 52 transitions, 234 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:18:03,428 INFO L231 Difference]: Finished difference. Result has 32 places, 29 transitions, 96 flow [2025-03-04 02:18:03,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=96, PETRI_PLACES=32, PETRI_TRANSITIONS=29} [2025-03-04 02:18:03,429 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 6 predicate places. [2025-03-04 02:18:03,429 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 29 transitions, 96 flow [2025-03-04 02:18:03,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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:18:03,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:03,429 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:03,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:18:03,429 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:03,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:03,431 INFO L85 PathProgramCache]: Analyzing trace with hash -678935278, now seen corresponding path program 3 times [2025-03-04 02:18:03,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:03,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797408617] [2025-03-04 02:18:03,432 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:18:03,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:03,443 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 1 equivalence classes. [2025-03-04 02:18:03,453 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:18:03,456 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:18:03,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:03,520 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:18:03,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:03,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797408617] [2025-03-04 02:18:03,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797408617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:03,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:03,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:18:03,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575866197] [2025-03-04 02:18:03,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:03,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:18:03,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:03,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:18:03,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:18:03,525 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-03-04 02:18:03,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 29 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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:18:03,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:03,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-03-04 02:18:03,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:03,640 INFO L124 PetriNetUnfolderBase]: 544/948 cut-off events. [2025-03-04 02:18:03,640 INFO L125 PetriNetUnfolderBase]: For 340/340 co-relation queries the response was YES. [2025-03-04 02:18:03,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2227 conditions, 948 events. 544/948 cut-off events. For 340/340 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4486 event pairs, 185 based on Foata normal form. 21/968 useless extension candidates. Maximal degree in co-relation 1260. Up to 691 conditions per place. [2025-03-04 02:18:03,643 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 41 selfloop transitions, 4 changer transitions 2/50 dead transitions. [2025-03-04 02:18:03,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 50 transitions, 255 flow [2025-03-04 02:18:03,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:18:03,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:18:03,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2025-03-04 02:18:03,646 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2025-03-04 02:18:03,646 INFO L175 Difference]: Start difference. First operand has 32 places, 29 transitions, 96 flow. Second operand 4 states and 60 transitions. [2025-03-04 02:18:03,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 50 transitions, 255 flow [2025-03-04 02:18:03,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 50 transitions, 247 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:18:03,649 INFO L231 Difference]: Finished difference. Result has 36 places, 33 transitions, 134 flow [2025-03-04 02:18:03,649 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=36, PETRI_TRANSITIONS=33} [2025-03-04 02:18:03,650 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 10 predicate places. [2025-03-04 02:18:03,650 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 33 transitions, 134 flow [2025-03-04 02:18:03,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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:18:03,650 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:03,650 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:03,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:18:03,651 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:03,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:03,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1748402252, now seen corresponding path program 4 times [2025-03-04 02:18:03,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:03,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840184931] [2025-03-04 02:18:03,652 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:18:03,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:03,662 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-03-04 02:18:03,664 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 14 of 17 statements. [2025-03-04 02:18:03,666 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 02:18:03,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:03,691 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:18:03,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:03,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840184931] [2025-03-04 02:18:03,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840184931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:03,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:03,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:18:03,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788611481] [2025-03-04 02:18:03,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:03,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:18:03,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:03,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:18:03,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:18:03,696 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-03-04 02:18:03,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 33 transitions, 134 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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:18:03,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:03,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-03-04 02:18:03,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:03,801 INFO L124 PetriNetUnfolderBase]: 542/957 cut-off events. [2025-03-04 02:18:03,801 INFO L125 PetriNetUnfolderBase]: For 627/627 co-relation queries the response was YES. [2025-03-04 02:18:03,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2418 conditions, 957 events. 542/957 cut-off events. For 627/627 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4501 event pairs, 215 based on Foata normal form. 16/971 useless extension candidates. Maximal degree in co-relation 1387. Up to 689 conditions per place. [2025-03-04 02:18:03,805 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 43 selfloop transitions, 6 changer transitions 3/55 dead transitions. [2025-03-04 02:18:03,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 55 transitions, 316 flow [2025-03-04 02:18:03,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:18:03,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:18:03,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2025-03-04 02:18:03,806 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5446428571428571 [2025-03-04 02:18:03,806 INFO L175 Difference]: Start difference. First operand has 36 places, 33 transitions, 134 flow. Second operand 4 states and 61 transitions. [2025-03-04 02:18:03,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 55 transitions, 316 flow [2025-03-04 02:18:03,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 55 transitions, 316 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:18:03,811 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 194 flow [2025-03-04 02:18:03,811 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2025-03-04 02:18:03,812 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 16 predicate places. [2025-03-04 02:18:03,812 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 194 flow [2025-03-04 02:18:03,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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:18:03,812 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:03,812 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:03,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:18:03,812 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:03,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:03,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1481537830, now seen corresponding path program 1 times [2025-03-04 02:18:03,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:03,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617678538] [2025-03-04 02:18:03,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:03,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:03,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 02:18:03,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:18:03,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:03,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:03,880 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:18:03,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:03,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617678538] [2025-03-04 02:18:03,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617678538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:03,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:03,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:18:03,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721264295] [2025-03-04 02:18:03,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:03,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:18:03,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:03,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:18:03,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:18:03,883 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-03-04 02:18:03,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 194 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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:18:03,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:03,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-03-04 02:18:03,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:04,016 INFO L124 PetriNetUnfolderBase]: 501/869 cut-off events. [2025-03-04 02:18:04,017 INFO L125 PetriNetUnfolderBase]: For 993/993 co-relation queries the response was YES. [2025-03-04 02:18:04,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2369 conditions, 869 events. 501/869 cut-off events. For 993/993 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3977 event pairs, 186 based on Foata normal form. 14/880 useless extension candidates. Maximal degree in co-relation 999. Up to 443 conditions per place. [2025-03-04 02:18:04,022 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 50 selfloop transitions, 8 changer transitions 3/64 dead transitions. [2025-03-04 02:18:04,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 64 transitions, 411 flow [2025-03-04 02:18:04,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:18:04,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:18:04,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2025-03-04 02:18:04,024 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5982142857142857 [2025-03-04 02:18:04,024 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 194 flow. Second operand 4 states and 67 transitions. [2025-03-04 02:18:04,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 64 transitions, 411 flow [2025-03-04 02:18:04,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 64 transitions, 405 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-04 02:18:04,027 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 210 flow [2025-03-04 02:18:04,027 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=210, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2025-03-04 02:18:04,027 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 20 predicate places. [2025-03-04 02:18:04,027 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 210 flow [2025-03-04 02:18:04,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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:18:04,027 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:04,029 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:04,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:18:04,030 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:04,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:04,031 INFO L85 PathProgramCache]: Analyzing trace with hash 2003053229, now seen corresponding path program 1 times [2025-03-04 02:18:04,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:04,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919375078] [2025-03-04 02:18:04,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:04,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:04,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 02:18:04,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:18:04,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:04,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:04,089 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:18:04,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:04,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919375078] [2025-03-04 02:18:04,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919375078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:04,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:04,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:18:04,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794818013] [2025-03-04 02:18:04,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:04,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:18:04,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:04,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:18:04,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:18:04,092 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-03-04 02:18:04,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 210 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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:18:04,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:04,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-03-04 02:18:04,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:04,187 INFO L124 PetriNetUnfolderBase]: 481/815 cut-off events. [2025-03-04 02:18:04,188 INFO L125 PetriNetUnfolderBase]: For 1361/1361 co-relation queries the response was YES. [2025-03-04 02:18:04,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2377 conditions, 815 events. 481/815 cut-off events. For 1361/1361 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3478 event pairs, 175 based on Foata normal form. 16/828 useless extension candidates. Maximal degree in co-relation 2213. Up to 433 conditions per place. [2025-03-04 02:18:04,192 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 49 selfloop transitions, 8 changer transitions 2/61 dead transitions. [2025-03-04 02:18:04,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 61 transitions, 433 flow [2025-03-04 02:18:04,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:18:04,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:18:04,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2025-03-04 02:18:04,193 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5625 [2025-03-04 02:18:04,193 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 210 flow. Second operand 4 states and 63 transitions. [2025-03-04 02:18:04,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 61 transitions, 433 flow [2025-03-04 02:18:04,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 61 transitions, 407 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-04 02:18:04,196 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 214 flow [2025-03-04 02:18:04,196 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=214, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2025-03-04 02:18:04,196 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 20 predicate places. [2025-03-04 02:18:04,196 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 214 flow [2025-03-04 02:18:04,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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:18:04,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:04,197 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:18:04,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:18:04,197 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:04,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:04,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1582690021, now seen corresponding path program 1 times [2025-03-04 02:18:04,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:04,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914299563] [2025-03-04 02:18:04,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:04,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:04,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 02:18:04,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:18:04,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:04,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:04,269 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:18:04,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:04,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914299563] [2025-03-04 02:18:04,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914299563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:04,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:04,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:18:04,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133736476] [2025-03-04 02:18:04,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:04,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:18:04,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:04,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:18:04,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:18:04,271 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:04,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:18:04,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:04,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:04,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:04,359 INFO L124 PetriNetUnfolderBase]: 444/776 cut-off events. [2025-03-04 02:18:04,360 INFO L125 PetriNetUnfolderBase]: For 1136/1136 co-relation queries the response was YES. [2025-03-04 02:18:04,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2299 conditions, 776 events. 444/776 cut-off events. For 1136/1136 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3433 event pairs, 287 based on Foata normal form. 0/772 useless extension candidates. Maximal degree in co-relation 2129. Up to 736 conditions per place. [2025-03-04 02:18:04,364 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 32 selfloop transitions, 4 changer transitions 0/39 dead transitions. [2025-03-04 02:18:04,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 39 transitions, 290 flow [2025-03-04 02:18:04,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:18:04,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:18:04,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2025-03-04 02:18:04,364 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4880952380952381 [2025-03-04 02:18:04,364 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 214 flow. Second operand 3 states and 41 transitions. [2025-03-04 02:18:04,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 39 transitions, 290 flow [2025-03-04 02:18:04,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 39 transitions, 278 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-04 02:18:04,367 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 224 flow [2025-03-04 02:18:04,367 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2025-03-04 02:18:04,367 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 19 predicate places. [2025-03-04 02:18:04,367 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 224 flow [2025-03-04 02:18:04,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:18:04,368 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:04,368 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:04,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 02:18:04,368 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:04,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:04,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1864720955, now seen corresponding path program 1 times [2025-03-04 02:18:04,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:04,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421065973] [2025-03-04 02:18:04,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:04,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:04,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 02:18:04,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:18:04,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:04,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:04,433 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:18:04,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:04,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421065973] [2025-03-04 02:18:04,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421065973] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:04,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264387004] [2025-03-04 02:18:04,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:04,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:04,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:04,436 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:18:04,437 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:18:04,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 02:18:04,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:18:04,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:04,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:04,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 02:18:04,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:04,552 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:18:04,554 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:04,572 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:18:04,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264387004] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:18:04,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:18:04,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-03-04 02:18:04,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854011026] [2025-03-04 02:18:04,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:18:04,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:18:04,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:04,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:18:04,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:18:04,574 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:04,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 224 flow. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 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:18:04,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:04,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:04,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:04,677 INFO L124 PetriNetUnfolderBase]: 447/785 cut-off events. [2025-03-04 02:18:04,678 INFO L125 PetriNetUnfolderBase]: For 936/936 co-relation queries the response was YES. [2025-03-04 02:18:04,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2282 conditions, 785 events. 447/785 cut-off events. For 936/936 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3477 event pairs, 290 based on Foata normal form. 3/785 useless extension candidates. Maximal degree in co-relation 2242. Up to 741 conditions per place. [2025-03-04 02:18:04,682 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 32 selfloop transitions, 10 changer transitions 0/45 dead transitions. [2025-03-04 02:18:04,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 45 transitions, 332 flow [2025-03-04 02:18:04,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:18:04,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:18:04,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2025-03-04 02:18:04,683 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2025-03-04 02:18:04,683 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 224 flow. Second operand 6 states and 66 transitions. [2025-03-04 02:18:04,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 45 transitions, 332 flow [2025-03-04 02:18:04,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 45 transitions, 328 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:18:04,685 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 286 flow [2025-03-04 02:18:04,685 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=286, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2025-03-04 02:18:04,686 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 26 predicate places. [2025-03-04 02:18:04,686 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 286 flow [2025-03-04 02:18:04,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 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:18:04,686 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:04,686 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:04,693 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:18:04,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:04,887 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:04,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:04,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1801215179, now seen corresponding path program 2 times [2025-03-04 02:18:04,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:04,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855545159] [2025-03-04 02:18:04,888 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:18:04,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:04,899 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:18:04,920 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 27 statements. [2025-03-04 02:18:04,921 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:18:04,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:05,556 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-04 02:18:05,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:05,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855545159] [2025-03-04 02:18:05,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855545159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:05,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:05,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:18:05,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632879992] [2025-03-04 02:18:05,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:05,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:18:05,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:05,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:18:05,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:18:05,572 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:05,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 286 flow. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:18:05,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:05,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:05,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:06,270 INFO L124 PetriNetUnfolderBase]: 588/1096 cut-off events. [2025-03-04 02:18:06,270 INFO L125 PetriNetUnfolderBase]: For 1314/1314 co-relation queries the response was YES. [2025-03-04 02:18:06,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3105 conditions, 1096 events. 588/1096 cut-off events. For 1314/1314 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5711 event pairs, 42 based on Foata normal form. 2/1097 useless extension candidates. Maximal degree in co-relation 3034. Up to 219 conditions per place. [2025-03-04 02:18:06,275 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 102 selfloop transitions, 62 changer transitions 7/174 dead transitions. [2025-03-04 02:18:06,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 174 transitions, 1154 flow [2025-03-04 02:18:06,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 02:18:06,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 02:18:06,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 241 transitions. [2025-03-04 02:18:06,276 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4098639455782313 [2025-03-04 02:18:06,276 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 286 flow. Second operand 21 states and 241 transitions. [2025-03-04 02:18:06,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 174 transitions, 1154 flow [2025-03-04 02:18:06,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 174 transitions, 1138 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-04 02:18:06,282 INFO L231 Difference]: Finished difference. Result has 80 places, 94 transitions, 745 flow [2025-03-04 02:18:06,283 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=745, PETRI_PLACES=80, PETRI_TRANSITIONS=94} [2025-03-04 02:18:06,283 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 54 predicate places. [2025-03-04 02:18:06,284 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 94 transitions, 745 flow [2025-03-04 02:18:06,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:18:06,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:06,284 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:06,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 02:18:06,284 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:06,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:06,285 INFO L85 PathProgramCache]: Analyzing trace with hash -861624607, now seen corresponding path program 3 times [2025-03-04 02:18:06,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:06,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003496418] [2025-03-04 02:18:06,285 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:18:06,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:06,297 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-03-04 02:18:06,312 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 27 statements. [2025-03-04 02:18:06,314 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:18:06,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:06,705 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-04 02:18:06,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:06,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003496418] [2025-03-04 02:18:06,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003496418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:06,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:06,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:18:06,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481204944] [2025-03-04 02:18:06,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:06,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:18:06,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:06,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:18:06,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:18:06,722 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:06,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 94 transitions, 745 flow. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:18:06,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:06,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:06,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:07,521 INFO L124 PetriNetUnfolderBase]: 797/1517 cut-off events. [2025-03-04 02:18:07,521 INFO L125 PetriNetUnfolderBase]: For 4270/4270 co-relation queries the response was YES. [2025-03-04 02:18:07,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5288 conditions, 1517 events. 797/1517 cut-off events. For 4270/4270 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 8959 event pairs, 76 based on Foata normal form. 1/1517 useless extension candidates. Maximal degree in co-relation 5214. Up to 328 conditions per place. [2025-03-04 02:18:07,530 INFO L140 encePairwiseOnDemand]: 16/28 looper letters, 154 selfloop transitions, 72 changer transitions 8/237 dead transitions. [2025-03-04 02:18:07,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 237 transitions, 1940 flow [2025-03-04 02:18:07,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 02:18:07,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-04 02:18:07,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 304 transitions. [2025-03-04 02:18:07,532 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4342857142857143 [2025-03-04 02:18:07,532 INFO L175 Difference]: Start difference. First operand has 80 places, 94 transitions, 745 flow. Second operand 25 states and 304 transitions. [2025-03-04 02:18:07,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 237 transitions, 1940 flow [2025-03-04 02:18:07,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 237 transitions, 1816 flow, removed 53 selfloop flow, removed 4 redundant places. [2025-03-04 02:18:07,546 INFO L231 Difference]: Finished difference. Result has 110 places, 130 transitions, 1202 flow [2025-03-04 02:18:07,547 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1202, PETRI_PLACES=110, PETRI_TRANSITIONS=130} [2025-03-04 02:18:07,548 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 84 predicate places. [2025-03-04 02:18:07,548 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 130 transitions, 1202 flow [2025-03-04 02:18:07,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:18:07,548 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:07,548 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:07,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 02:18:07,549 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:07,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:07,549 INFO L85 PathProgramCache]: Analyzing trace with hash 357605399, now seen corresponding path program 4 times [2025-03-04 02:18:07,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:07,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449612448] [2025-03-04 02:18:07,549 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:18:07,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:07,560 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:18:07,569 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 27 statements. [2025-03-04 02:18:07,570 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 02:18:07,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:07,755 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-04 02:18:07,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:07,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449612448] [2025-03-04 02:18:07,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449612448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:07,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:07,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:18:07,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953986173] [2025-03-04 02:18:07,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:07,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:18:07,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:07,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:18:07,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:18:07,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:07,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 130 transitions, 1202 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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:18:07,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:07,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:07,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:08,702 INFO L124 PetriNetUnfolderBase]: 1148/2174 cut-off events. [2025-03-04 02:18:08,702 INFO L125 PetriNetUnfolderBase]: For 7583/7583 co-relation queries the response was YES. [2025-03-04 02:18:08,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8147 conditions, 2174 events. 1148/2174 cut-off events. For 7583/7583 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 13875 event pairs, 134 based on Foata normal form. 4/2177 useless extension candidates. Maximal degree in co-relation 8063. Up to 434 conditions per place. [2025-03-04 02:18:08,715 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 182 selfloop transitions, 115 changer transitions 10/310 dead transitions. [2025-03-04 02:18:08,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 310 transitions, 2805 flow [2025-03-04 02:18:08,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 02:18:08,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-03-04 02:18:08,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 366 transitions. [2025-03-04 02:18:08,717 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46683673469387754 [2025-03-04 02:18:08,717 INFO L175 Difference]: Start difference. First operand has 110 places, 130 transitions, 1202 flow. Second operand 28 states and 366 transitions. [2025-03-04 02:18:08,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 310 transitions, 2805 flow [2025-03-04 02:18:08,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 310 transitions, 2604 flow, removed 70 selfloop flow, removed 7 redundant places. [2025-03-04 02:18:08,743 INFO L231 Difference]: Finished difference. Result has 139 places, 174 transitions, 1794 flow [2025-03-04 02:18:08,744 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1085, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=1794, PETRI_PLACES=139, PETRI_TRANSITIONS=174} [2025-03-04 02:18:08,744 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 113 predicate places. [2025-03-04 02:18:08,744 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 174 transitions, 1794 flow [2025-03-04 02:18:08,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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:18:08,744 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:08,744 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:08,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 02:18:08,745 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:08,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:08,745 INFO L85 PathProgramCache]: Analyzing trace with hash -57228865, now seen corresponding path program 5 times [2025-03-04 02:18:08,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:08,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170379865] [2025-03-04 02:18:08,745 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:18:08,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:08,753 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 3 equivalence classes. [2025-03-04 02:18:08,760 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:18:08,760 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 02:18:08,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:08,827 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 02:18:08,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:08,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170379865] [2025-03-04 02:18:08,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170379865] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:08,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382920407] [2025-03-04 02:18:08,827 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:18:08,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:08,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:08,829 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:18:08,831 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:18:08,877 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 3 equivalence classes. [2025-03-04 02:18:08,910 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:18:08,910 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 02:18:08,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:08,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 02:18:08,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:08,950 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 02:18:08,950 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:08,978 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 02:18:08,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382920407] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:18:08,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:18:08,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2025-03-04 02:18:08,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373096370] [2025-03-04 02:18:08,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:18:08,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:18:08,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:08,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:18:08,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:18:08,979 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:08,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 174 transitions, 1794 flow. Second operand has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 12 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:08,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:08,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:08,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:09,169 INFO L124 PetriNetUnfolderBase]: 1138/2151 cut-off events. [2025-03-04 02:18:09,169 INFO L125 PetriNetUnfolderBase]: For 8972/8972 co-relation queries the response was YES. [2025-03-04 02:18:09,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8729 conditions, 2151 events. 1138/2151 cut-off events. For 8972/8972 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 13760 event pairs, 626 based on Foata normal form. 1/2150 useless extension candidates. Maximal degree in co-relation 8627. Up to 2013 conditions per place. [2025-03-04 02:18:09,184 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 161 selfloop transitions, 12 changer transitions 0/176 dead transitions. [2025-03-04 02:18:09,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 176 transitions, 2152 flow [2025-03-04 02:18:09,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:18:09,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:18:09,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions. [2025-03-04 02:18:09,186 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3520408163265306 [2025-03-04 02:18:09,186 INFO L175 Difference]: Start difference. First operand has 139 places, 174 transitions, 1794 flow. Second operand 7 states and 69 transitions. [2025-03-04 02:18:09,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 176 transitions, 2152 flow [2025-03-04 02:18:09,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 176 transitions, 2038 flow, removed 17 selfloop flow, removed 11 redundant places. [2025-03-04 02:18:09,215 INFO L231 Difference]: Finished difference. Result has 134 places, 176 transitions, 1726 flow [2025-03-04 02:18:09,215 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1680, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1726, PETRI_PLACES=134, PETRI_TRANSITIONS=176} [2025-03-04 02:18:09,215 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 108 predicate places. [2025-03-04 02:18:09,215 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 176 transitions, 1726 flow [2025-03-04 02:18:09,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 12 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:09,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:09,216 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:09,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 02:18:09,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 02:18:09,416 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:09,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:09,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1408233057, now seen corresponding path program 6 times [2025-03-04 02:18:09,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:09,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268613891] [2025-03-04 02:18:09,417 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:18:09,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:09,427 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-03-04 02:18:09,444 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 29 statements. [2025-03-04 02:18:09,444 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:18:09,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:09,821 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:18:09,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:09,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268613891] [2025-03-04 02:18:09,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268613891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:09,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:09,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:18:09,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497099332] [2025-03-04 02:18:09,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:09,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:18:09,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:09,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:18:09,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:18:09,843 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:09,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 176 transitions, 1726 flow. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:18:09,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:09,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:09,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:10,742 INFO L124 PetriNetUnfolderBase]: 1204/2269 cut-off events. [2025-03-04 02:18:10,743 INFO L125 PetriNetUnfolderBase]: For 8786/8786 co-relation queries the response was YES. [2025-03-04 02:18:10,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9025 conditions, 2269 events. 1204/2269 cut-off events. For 8786/8786 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 14720 event pairs, 85 based on Foata normal form. 1/2270 useless extension candidates. Maximal degree in co-relation 8913. Up to 347 conditions per place. [2025-03-04 02:18:10,753 INFO L140 encePairwiseOnDemand]: 16/28 looper letters, 138 selfloop transitions, 142 changer transitions 7/290 dead transitions. [2025-03-04 02:18:10,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 290 transitions, 2925 flow [2025-03-04 02:18:10,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-04 02:18:10,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-03-04 02:18:10,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 311 transitions. [2025-03-04 02:18:10,755 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4113756613756614 [2025-03-04 02:18:10,755 INFO L175 Difference]: Start difference. First operand has 134 places, 176 transitions, 1726 flow. Second operand 27 states and 311 transitions. [2025-03-04 02:18:10,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 290 transitions, 2925 flow [2025-03-04 02:18:10,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 290 transitions, 2901 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-04 02:18:10,782 INFO L231 Difference]: Finished difference. Result has 163 places, 193 transitions, 2285 flow [2025-03-04 02:18:10,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1702, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=2285, PETRI_PLACES=163, PETRI_TRANSITIONS=193} [2025-03-04 02:18:10,783 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 137 predicate places. [2025-03-04 02:18:10,783 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 193 transitions, 2285 flow [2025-03-04 02:18:10,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:18:10,783 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:10,784 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:10,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 02:18:10,784 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:10,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:10,784 INFO L85 PathProgramCache]: Analyzing trace with hash 746622253, now seen corresponding path program 7 times [2025-03-04 02:18:10,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:10,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176050123] [2025-03-04 02:18:10,784 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:18:10,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:10,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 02:18:10,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:18:10,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:10,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:11,221 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:18:11,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:11,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176050123] [2025-03-04 02:18:11,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176050123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:11,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:11,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:18:11,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831747007] [2025-03-04 02:18:11,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:11,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:18:11,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:11,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:18:11,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:18:11,237 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:11,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 193 transitions, 2285 flow. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:18:11,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:11,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:11,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:12,095 INFO L124 PetriNetUnfolderBase]: 1286/2438 cut-off events. [2025-03-04 02:18:12,095 INFO L125 PetriNetUnfolderBase]: For 13040/13040 co-relation queries the response was YES. [2025-03-04 02:18:12,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10931 conditions, 2438 events. 1286/2438 cut-off events. For 13040/13040 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 16138 event pairs, 81 based on Foata normal form. 1/2439 useless extension candidates. Maximal degree in co-relation 10822. Up to 522 conditions per place. [2025-03-04 02:18:12,113 INFO L140 encePairwiseOnDemand]: 16/28 looper letters, 141 selfloop transitions, 161 changer transitions 7/312 dead transitions. [2025-03-04 02:18:12,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 312 transitions, 3654 flow [2025-03-04 02:18:12,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 02:18:12,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-04 02:18:12,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 305 transitions. [2025-03-04 02:18:12,115 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4357142857142857 [2025-03-04 02:18:12,115 INFO L175 Difference]: Start difference. First operand has 163 places, 193 transitions, 2285 flow. Second operand 25 states and 305 transitions. [2025-03-04 02:18:12,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 312 transitions, 3654 flow [2025-03-04 02:18:12,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 312 transitions, 3425 flow, removed 35 selfloop flow, removed 17 redundant places. [2025-03-04 02:18:12,160 INFO L231 Difference]: Finished difference. Result has 178 places, 222 transitions, 2855 flow [2025-03-04 02:18:12,160 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=2109, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=2855, PETRI_PLACES=178, PETRI_TRANSITIONS=222} [2025-03-04 02:18:12,161 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 152 predicate places. [2025-03-04 02:18:12,161 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 222 transitions, 2855 flow [2025-03-04 02:18:12,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:18:12,161 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:12,161 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:12,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 02:18:12,162 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:12,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:12,162 INFO L85 PathProgramCache]: Analyzing trace with hash 475306839, now seen corresponding path program 8 times [2025-03-04 02:18:12,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:12,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932688289] [2025-03-04 02:18:12,163 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:18:12,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:12,174 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-04 02:18:12,185 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 29 statements. [2025-03-04 02:18:12,189 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:18:12,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:12,478 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:18:12,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:12,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932688289] [2025-03-04 02:18:12,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932688289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:12,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:12,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:18:12,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929799821] [2025-03-04 02:18:12,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:12,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:18:12,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:12,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:18:12,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:18:12,497 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:12,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 222 transitions, 2855 flow. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:18:12,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:12,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:12,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:13,259 INFO L124 PetriNetUnfolderBase]: 1281/2441 cut-off events. [2025-03-04 02:18:13,259 INFO L125 PetriNetUnfolderBase]: For 13893/13893 co-relation queries the response was YES. [2025-03-04 02:18:13,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11380 conditions, 2441 events. 1281/2441 cut-off events. For 13893/13893 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 16175 event pairs, 77 based on Foata normal form. 1/2442 useless extension candidates. Maximal degree in co-relation 11263. Up to 500 conditions per place. [2025-03-04 02:18:13,274 INFO L140 encePairwiseOnDemand]: 16/28 looper letters, 149 selfloop transitions, 161 changer transitions 7/320 dead transitions. [2025-03-04 02:18:13,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 320 transitions, 3987 flow [2025-03-04 02:18:13,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 02:18:13,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-04 02:18:13,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 301 transitions. [2025-03-04 02:18:13,275 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4479166666666667 [2025-03-04 02:18:13,275 INFO L175 Difference]: Start difference. First operand has 178 places, 222 transitions, 2855 flow. Second operand 24 states and 301 transitions. [2025-03-04 02:18:13,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 320 transitions, 3987 flow [2025-03-04 02:18:13,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 320 transitions, 3591 flow, removed 77 selfloop flow, removed 13 redundant places. [2025-03-04 02:18:13,320 INFO L231 Difference]: Finished difference. Result has 194 places, 232 transitions, 3039 flow [2025-03-04 02:18:13,321 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=2516, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=151, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=3039, PETRI_PLACES=194, PETRI_TRANSITIONS=232} [2025-03-04 02:18:13,321 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 168 predicate places. [2025-03-04 02:18:13,321 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 232 transitions, 3039 flow [2025-03-04 02:18:13,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:18:13,322 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:13,322 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:13,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 02:18:13,322 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:13,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:13,322 INFO L85 PathProgramCache]: Analyzing trace with hash 890141103, now seen corresponding path program 9 times [2025-03-04 02:18:13,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:13,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045257854] [2025-03-04 02:18:13,322 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:18:13,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:13,330 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-03-04 02:18:13,337 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 29 statements. [2025-03-04 02:18:13,337 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:18:13,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:13,577 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:18:13,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:13,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045257854] [2025-03-04 02:18:13,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045257854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:13,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:13,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:18:13,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649049454] [2025-03-04 02:18:13,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:13,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:18:13,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:13,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:18:13,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:18:13,598 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:13,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 232 transitions, 3039 flow. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:18:13,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:13,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:13,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:14,147 INFO L124 PetriNetUnfolderBase]: 1297/2453 cut-off events. [2025-03-04 02:18:14,148 INFO L125 PetriNetUnfolderBase]: For 13282/13282 co-relation queries the response was YES. [2025-03-04 02:18:14,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11537 conditions, 2453 events. 1297/2453 cut-off events. For 13282/13282 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 16281 event pairs, 234 based on Foata normal form. 1/2444 useless extension candidates. Maximal degree in co-relation 11417. Up to 764 conditions per place. [2025-03-04 02:18:14,160 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 196 selfloop transitions, 89 changer transitions 7/295 dead transitions. [2025-03-04 02:18:14,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 295 transitions, 3930 flow [2025-03-04 02:18:14,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 02:18:14,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 02:18:14,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 214 transitions. [2025-03-04 02:18:14,164 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4495798319327731 [2025-03-04 02:18:14,164 INFO L175 Difference]: Start difference. First operand has 194 places, 232 transitions, 3039 flow. Second operand 17 states and 214 transitions. [2025-03-04 02:18:14,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 295 transitions, 3930 flow [2025-03-04 02:18:14,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 295 transitions, 3694 flow, removed 21 selfloop flow, removed 12 redundant places. [2025-03-04 02:18:14,209 INFO L231 Difference]: Finished difference. Result has 200 places, 234 transitions, 3047 flow [2025-03-04 02:18:14,210 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=2826, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3047, PETRI_PLACES=200, PETRI_TRANSITIONS=234} [2025-03-04 02:18:14,210 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 174 predicate places. [2025-03-04 02:18:14,210 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 234 transitions, 3047 flow [2025-03-04 02:18:14,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:18:14,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:14,210 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:14,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 02:18:14,211 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:14,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:14,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1551017995, now seen corresponding path program 10 times [2025-03-04 02:18:14,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:14,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031321857] [2025-03-04 02:18:14,211 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:18:14,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:14,218 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-03-04 02:18:14,223 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 29 statements. [2025-03-04 02:18:14,223 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 02:18:14,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:14,357 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:18:14,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:14,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031321857] [2025-03-04 02:18:14,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031321857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:14,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:14,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:18:14,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22013020] [2025-03-04 02:18:14,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:14,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:18:14,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:14,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:18:14,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:18:14,374 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:14,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 234 transitions, 3047 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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:18:14,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:14,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:14,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:15,083 INFO L124 PetriNetUnfolderBase]: 1358/2617 cut-off events. [2025-03-04 02:18:15,084 INFO L125 PetriNetUnfolderBase]: For 13097/13097 co-relation queries the response was YES. [2025-03-04 02:18:15,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11983 conditions, 2617 events. 1358/2617 cut-off events. For 13097/13097 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 17862 event pairs, 96 based on Foata normal form. 1/2618 useless extension candidates. Maximal degree in co-relation 11862. Up to 576 conditions per place. [2025-03-04 02:18:15,098 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 174 selfloop transitions, 138 changer transitions 8/323 dead transitions. [2025-03-04 02:18:15,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 323 transitions, 4154 flow [2025-03-04 02:18:15,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 02:18:15,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-04 02:18:15,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 262 transitions. [2025-03-04 02:18:15,100 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46785714285714286 [2025-03-04 02:18:15,100 INFO L175 Difference]: Start difference. First operand has 200 places, 234 transitions, 3047 flow. Second operand 20 states and 262 transitions. [2025-03-04 02:18:15,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 323 transitions, 4154 flow [2025-03-04 02:18:15,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 323 transitions, 3972 flow, removed 8 selfloop flow, removed 12 redundant places. [2025-03-04 02:18:15,143 INFO L231 Difference]: Finished difference. Result has 209 places, 244 transitions, 3351 flow [2025-03-04 02:18:15,144 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=2882, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3351, PETRI_PLACES=209, PETRI_TRANSITIONS=244} [2025-03-04 02:18:15,144 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 183 predicate places. [2025-03-04 02:18:15,144 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 244 transitions, 3351 flow [2025-03-04 02:18:15,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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:18:15,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:15,145 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:15,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 02:18:15,146 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:15,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:15,146 INFO L85 PathProgramCache]: Analyzing trace with hash 610882669, now seen corresponding path program 11 times [2025-03-04 02:18:15,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:15,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773414888] [2025-03-04 02:18:15,146 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:18:15,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:15,154 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-03-04 02:18:15,177 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:18:15,178 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 02:18:15,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:15,757 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 02:18:15,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:15,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773414888] [2025-03-04 02:18:15,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773414888] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:15,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835006521] [2025-03-04 02:18:15,757 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:18:15,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:15,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:15,759 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:18:15,761 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:18:15,816 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-03-04 02:18:15,849 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:18:15,849 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 02:18:15,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:15,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 02:18:15,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:15,974 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-03-04 02:18:15,976 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 103 treesize of output 64 [2025-03-04 02:18:16,047 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:18:16,047 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:18:16,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835006521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:16,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:18:16,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 18 [2025-03-04 02:18:16,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922142221] [2025-03-04 02:18:16,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:16,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:18:16,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:16,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:18:16,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2025-03-04 02:18:16,060 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:16,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 244 transitions, 3351 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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:18:16,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:16,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:16,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:16,498 INFO L124 PetriNetUnfolderBase]: 1345/2578 cut-off events. [2025-03-04 02:18:16,499 INFO L125 PetriNetUnfolderBase]: For 14382/14382 co-relation queries the response was YES. [2025-03-04 02:18:16,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12317 conditions, 2578 events. 1345/2578 cut-off events. For 14382/14382 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 17546 event pairs, 520 based on Foata normal form. 5/2574 useless extension candidates. Maximal degree in co-relation 12194. Up to 1514 conditions per place. [2025-03-04 02:18:16,513 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 202 selfloop transitions, 62 changer transitions 10/277 dead transitions. [2025-03-04 02:18:16,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 277 transitions, 4007 flow [2025-03-04 02:18:16,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:18:16,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:18:16,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 125 transitions. [2025-03-04 02:18:16,514 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49603174603174605 [2025-03-04 02:18:16,514 INFO L175 Difference]: Start difference. First operand has 209 places, 244 transitions, 3351 flow. Second operand 9 states and 125 transitions. [2025-03-04 02:18:16,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 277 transitions, 4007 flow [2025-03-04 02:18:16,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 277 transitions, 3775 flow, removed 10 selfloop flow, removed 15 redundant places. [2025-03-04 02:18:16,557 INFO L231 Difference]: Finished difference. Result has 202 places, 240 transitions, 3197 flow [2025-03-04 02:18:16,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=3108, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3197, PETRI_PLACES=202, PETRI_TRANSITIONS=240} [2025-03-04 02:18:16,558 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 176 predicate places. [2025-03-04 02:18:16,558 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 240 transitions, 3197 flow [2025-03-04 02:18:16,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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:18:16,558 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:16,558 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:16,564 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:18:16,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 02:18:16,758 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:16,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:16,759 INFO L85 PathProgramCache]: Analyzing trace with hash -329088903, now seen corresponding path program 12 times [2025-03-04 02:18:16,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:16,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905092519] [2025-03-04 02:18:16,759 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:18:16,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:16,768 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-03-04 02:18:16,775 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 29 statements. [2025-03-04 02:18:16,775 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:18:16,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:16,995 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:18:16,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:16,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905092519] [2025-03-04 02:18:16,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905092519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:16,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:16,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:18:16,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665850629] [2025-03-04 02:18:16,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:16,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:18:16,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:16,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:18:16,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:18:17,011 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:17,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 240 transitions, 3197 flow. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:18:17,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:17,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:17,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:17,718 INFO L124 PetriNetUnfolderBase]: 1358/2600 cut-off events. [2025-03-04 02:18:17,718 INFO L125 PetriNetUnfolderBase]: For 14026/14026 co-relation queries the response was YES. [2025-03-04 02:18:17,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12077 conditions, 2600 events. 1358/2600 cut-off events. For 14026/14026 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 17647 event pairs, 169 based on Foata normal form. 1/2597 useless extension candidates. Maximal degree in co-relation 11956. Up to 532 conditions per place. [2025-03-04 02:18:17,733 INFO L140 encePairwiseOnDemand]: 16/28 looper letters, 194 selfloop transitions, 120 changer transitions 8/325 dead transitions. [2025-03-04 02:18:17,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 325 transitions, 4210 flow [2025-03-04 02:18:17,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 02:18:17,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-04 02:18:17,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 274 transitions. [2025-03-04 02:18:17,736 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4448051948051948 [2025-03-04 02:18:17,736 INFO L175 Difference]: Start difference. First operand has 202 places, 240 transitions, 3197 flow. Second operand 22 states and 274 transitions. [2025-03-04 02:18:17,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 325 transitions, 4210 flow [2025-03-04 02:18:17,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 325 transitions, 4032 flow, removed 7 selfloop flow, removed 12 redundant places. [2025-03-04 02:18:17,783 INFO L231 Difference]: Finished difference. Result has 211 places, 243 transitions, 3368 flow [2025-03-04 02:18:17,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=3029, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=3368, PETRI_PLACES=211, PETRI_TRANSITIONS=243} [2025-03-04 02:18:17,784 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 185 predicate places. [2025-03-04 02:18:17,784 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 243 transitions, 3368 flow [2025-03-04 02:18:17,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:18:17,784 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:17,784 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:17,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 02:18:17,784 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:17,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:17,785 INFO L85 PathProgramCache]: Analyzing trace with hash 333006321, now seen corresponding path program 13 times [2025-03-04 02:18:17,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:17,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189727744] [2025-03-04 02:18:17,785 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:18:17,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:17,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 02:18:17,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:18:17,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:17,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:18,147 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:18:18,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:18,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189727744] [2025-03-04 02:18:18,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189727744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:18,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:18,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:18:18,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796847712] [2025-03-04 02:18:18,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:18,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:18:18,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:18,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:18:18,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:18:18,161 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:18,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 243 transitions, 3368 flow. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:18:18,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:18,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:18,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:18,885 INFO L124 PetriNetUnfolderBase]: 1478/2852 cut-off events. [2025-03-04 02:18:18,885 INFO L125 PetriNetUnfolderBase]: For 17597/17597 co-relation queries the response was YES. [2025-03-04 02:18:18,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13634 conditions, 2852 events. 1478/2852 cut-off events. For 17597/17597 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 19803 event pairs, 70 based on Foata normal form. 1/2853 useless extension candidates. Maximal degree in co-relation 13513. Up to 466 conditions per place. [2025-03-04 02:18:18,900 INFO L140 encePairwiseOnDemand]: 16/28 looper letters, 163 selfloop transitions, 217 changer transitions 7/390 dead transitions. [2025-03-04 02:18:18,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 390 transitions, 5305 flow [2025-03-04 02:18:18,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 02:18:18,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-04 02:18:18,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 302 transitions. [2025-03-04 02:18:18,901 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4494047619047619 [2025-03-04 02:18:18,901 INFO L175 Difference]: Start difference. First operand has 211 places, 243 transitions, 3368 flow. Second operand 24 states and 302 transitions. [2025-03-04 02:18:18,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 390 transitions, 5305 flow [2025-03-04 02:18:18,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 390 transitions, 5038 flow, removed 13 selfloop flow, removed 22 redundant places. [2025-03-04 02:18:18,954 INFO L231 Difference]: Finished difference. Result has 223 places, 292 transitions, 4524 flow [2025-03-04 02:18:18,954 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=3176, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=168, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=4524, PETRI_PLACES=223, PETRI_TRANSITIONS=292} [2025-03-04 02:18:18,954 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 197 predicate places. [2025-03-04 02:18:18,954 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 292 transitions, 4524 flow [2025-03-04 02:18:18,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:18:18,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:18,955 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:18,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 02:18:18,955 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:18,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:18,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1858875573, now seen corresponding path program 14 times [2025-03-04 02:18:18,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:18,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105832652] [2025-03-04 02:18:18,955 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:18:18,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:18,962 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-04 02:18:18,969 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 29 statements. [2025-03-04 02:18:18,969 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:18:18,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:19,171 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:18:19,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:19,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105832652] [2025-03-04 02:18:19,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105832652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:19,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:19,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:18:19,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114961988] [2025-03-04 02:18:19,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:19,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:18:19,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:19,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:18:19,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:18:19,187 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:19,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 292 transitions, 4524 flow. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:18:19,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:19,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:19,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:19,856 INFO L124 PetriNetUnfolderBase]: 1488/2880 cut-off events. [2025-03-04 02:18:19,856 INFO L125 PetriNetUnfolderBase]: For 21259/21259 co-relation queries the response was YES. [2025-03-04 02:18:19,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14705 conditions, 2880 events. 1488/2880 cut-off events. For 21259/21259 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 20123 event pairs, 79 based on Foata normal form. 1/2881 useless extension candidates. Maximal degree in co-relation 14577. Up to 441 conditions per place. [2025-03-04 02:18:19,870 INFO L140 encePairwiseOnDemand]: 16/28 looper letters, 152 selfloop transitions, 222 changer transitions 7/384 dead transitions. [2025-03-04 02:18:19,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 384 transitions, 5770 flow [2025-03-04 02:18:19,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 02:18:19,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-04 02:18:19,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 274 transitions. [2025-03-04 02:18:19,871 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4448051948051948 [2025-03-04 02:18:19,871 INFO L175 Difference]: Start difference. First operand has 223 places, 292 transitions, 4524 flow. Second operand 22 states and 274 transitions. [2025-03-04 02:18:19,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 384 transitions, 5770 flow [2025-03-04 02:18:19,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 384 transitions, 5587 flow, removed 57 selfloop flow, removed 5 redundant places. [2025-03-04 02:18:19,955 INFO L231 Difference]: Finished difference. Result has 246 places, 301 transitions, 5034 flow [2025-03-04 02:18:19,956 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=4375, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=213, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=5034, PETRI_PLACES=246, PETRI_TRANSITIONS=301} [2025-03-04 02:18:19,956 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 220 predicate places. [2025-03-04 02:18:19,956 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 301 transitions, 5034 flow [2025-03-04 02:18:19,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:18:19,956 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:19,956 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:19,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 02:18:19,956 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:19,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:19,957 INFO L85 PathProgramCache]: Analyzing trace with hash -701765361, now seen corresponding path program 15 times [2025-03-04 02:18:19,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:19,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415677077] [2025-03-04 02:18:19,957 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:18:19,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:19,964 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-03-04 02:18:19,969 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 29 statements. [2025-03-04 02:18:19,969 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:18:19,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:20,266 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:18:20,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:20,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415677077] [2025-03-04 02:18:20,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415677077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:20,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:20,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:18:20,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729429390] [2025-03-04 02:18:20,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:20,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:18:20,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:20,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:18:20,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:18:20,279 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:20,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 301 transitions, 5034 flow. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:18:20,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:20,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:20,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:21,487 INFO L124 PetriNetUnfolderBase]: 1816/3562 cut-off events. [2025-03-04 02:18:21,487 INFO L125 PetriNetUnfolderBase]: For 26432/26432 co-relation queries the response was YES. [2025-03-04 02:18:21,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19282 conditions, 3562 events. 1816/3562 cut-off events. For 26432/26432 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 26288 event pairs, 132 based on Foata normal form. 3/3565 useless extension candidates. Maximal degree in co-relation 19148. Up to 730 conditions per place. [2025-03-04 02:18:21,509 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 230 selfloop transitions, 242 changer transitions 12/487 dead transitions. [2025-03-04 02:18:21,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 487 transitions, 7772 flow [2025-03-04 02:18:21,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-04 02:18:21,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-03-04 02:18:21,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 354 transitions. [2025-03-04 02:18:21,510 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43596059113300495 [2025-03-04 02:18:21,510 INFO L175 Difference]: Start difference. First operand has 246 places, 301 transitions, 5034 flow. Second operand 29 states and 354 transitions. [2025-03-04 02:18:21,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 487 transitions, 7772 flow [2025-03-04 02:18:21,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 487 transitions, 7373 flow, removed 16 selfloop flow, removed 11 redundant places. [2025-03-04 02:18:21,624 INFO L231 Difference]: Finished difference. Result has 275 places, 361 transitions, 6524 flow [2025-03-04 02:18:21,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=4740, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=184, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=6524, PETRI_PLACES=275, PETRI_TRANSITIONS=361} [2025-03-04 02:18:21,624 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 249 predicate places. [2025-03-04 02:18:21,624 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 361 transitions, 6524 flow [2025-03-04 02:18:21,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:18:21,624 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:21,625 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:21,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 02:18:21,625 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:21,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:21,625 INFO L85 PathProgramCache]: Analyzing trace with hash 700479887, now seen corresponding path program 16 times [2025-03-04 02:18:21,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:21,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573427844] [2025-03-04 02:18:21,625 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:18:21,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:21,632 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-03-04 02:18:21,634 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 29 statements. [2025-03-04 02:18:21,635 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 02:18:21,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:21,798 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:18:21,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:21,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573427844] [2025-03-04 02:18:21,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573427844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:21,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:21,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:18:21,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995279283] [2025-03-04 02:18:21,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:21,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:18:21,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:21,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:18:21,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:18:21,812 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:21,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 361 transitions, 6524 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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:18:21,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:21,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:21,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:22,655 INFO L124 PetriNetUnfolderBase]: 1913/3831 cut-off events. [2025-03-04 02:18:22,655 INFO L125 PetriNetUnfolderBase]: For 31456/31456 co-relation queries the response was YES. [2025-03-04 02:18:22,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21029 conditions, 3831 events. 1913/3831 cut-off events. For 31456/31456 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 29413 event pairs, 98 based on Foata normal form. 1/3830 useless extension candidates. Maximal degree in co-relation 20883. Up to 726 conditions per place. [2025-03-04 02:18:22,678 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 132 selfloop transitions, 297 changer transitions 7/439 dead transitions. [2025-03-04 02:18:22,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 439 transitions, 7865 flow [2025-03-04 02:18:22,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 02:18:22,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-04 02:18:22,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 226 transitions. [2025-03-04 02:18:22,678 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.424812030075188 [2025-03-04 02:18:22,679 INFO L175 Difference]: Start difference. First operand has 275 places, 361 transitions, 6524 flow. Second operand 19 states and 226 transitions. [2025-03-04 02:18:22,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 439 transitions, 7865 flow [2025-03-04 02:18:22,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 439 transitions, 7464 flow, removed 84 selfloop flow, removed 9 redundant places. [2025-03-04 02:18:22,825 INFO L231 Difference]: Finished difference. Result has 289 places, 376 transitions, 7060 flow [2025-03-04 02:18:22,825 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=6143, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=282, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=7060, PETRI_PLACES=289, PETRI_TRANSITIONS=376} [2025-03-04 02:18:22,825 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 263 predicate places. [2025-03-04 02:18:22,825 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 376 transitions, 7060 flow [2025-03-04 02:18:22,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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:18:22,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:22,825 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:22,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 02:18:22,825 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:22,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:22,826 INFO L85 PathProgramCache]: Analyzing trace with hash 303719631, now seen corresponding path program 17 times [2025-03-04 02:18:22,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:22,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465524633] [2025-03-04 02:18:22,826 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:18:22,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:22,833 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-03-04 02:18:22,844 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:18:22,844 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 02:18:22,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:23,147 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:18:23,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:23,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465524633] [2025-03-04 02:18:23,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465524633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:23,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:23,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:18:23,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756057477] [2025-03-04 02:18:23,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:23,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:18:23,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:23,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:18:23,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:18:23,161 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:23,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 376 transitions, 7060 flow. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:18:23,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:23,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:23,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:24,277 INFO L124 PetriNetUnfolderBase]: 1984/3964 cut-off events. [2025-03-04 02:18:24,277 INFO L125 PetriNetUnfolderBase]: For 34077/34077 co-relation queries the response was YES. [2025-03-04 02:18:24,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22353 conditions, 3964 events. 1984/3964 cut-off events. For 34077/34077 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 30415 event pairs, 160 based on Foata normal form. 4/3968 useless extension candidates. Maximal degree in co-relation 22206. Up to 613 conditions per place. [2025-03-04 02:18:24,303 INFO L140 encePairwiseOnDemand]: 15/28 looper letters, 197 selfloop transitions, 298 changer transitions 11/509 dead transitions. [2025-03-04 02:18:24,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 509 transitions, 8822 flow [2025-03-04 02:18:24,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-04 02:18:24,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-04 02:18:24,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 395 transitions. [2025-03-04 02:18:24,304 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41491596638655465 [2025-03-04 02:18:24,304 INFO L175 Difference]: Start difference. First operand has 289 places, 376 transitions, 7060 flow. Second operand 34 states and 395 transitions. [2025-03-04 02:18:24,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 509 transitions, 8822 flow [2025-03-04 02:18:24,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 509 transitions, 8475 flow, removed 36 selfloop flow, removed 9 redundant places. [2025-03-04 02:18:24,448 INFO L231 Difference]: Finished difference. Result has 317 places, 388 transitions, 7684 flow [2025-03-04 02:18:24,448 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=6762, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=287, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=7684, PETRI_PLACES=317, PETRI_TRANSITIONS=388} [2025-03-04 02:18:24,448 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 291 predicate places. [2025-03-04 02:18:24,448 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 388 transitions, 7684 flow [2025-03-04 02:18:24,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:18:24,448 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:24,448 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:24,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 02:18:24,449 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:24,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:24,449 INFO L85 PathProgramCache]: Analyzing trace with hash 222320575, now seen corresponding path program 18 times [2025-03-04 02:18:24,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:24,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823740117] [2025-03-04 02:18:24,449 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:18:24,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:24,455 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-03-04 02:18:24,460 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 29 statements. [2025-03-04 02:18:24,460 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:18:24,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:24,664 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:18:24,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:24,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823740117] [2025-03-04 02:18:24,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823740117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:24,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:24,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:18:24,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977635707] [2025-03-04 02:18:24,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:24,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:18:24,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:24,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:18:24,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:18:24,678 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:24,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 388 transitions, 7684 flow. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:18:24,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:24,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:24,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:25,645 INFO L124 PetriNetUnfolderBase]: 2055/4121 cut-off events. [2025-03-04 02:18:25,645 INFO L125 PetriNetUnfolderBase]: For 37902/37902 co-relation queries the response was YES. [2025-03-04 02:18:25,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24083 conditions, 4121 events. 2055/4121 cut-off events. For 37902/37902 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 31992 event pairs, 298 based on Foata normal form. 1/4122 useless extension candidates. Maximal degree in co-relation 23934. Up to 961 conditions per place. [2025-03-04 02:18:25,672 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 242 selfloop transitions, 226 changer transitions 8/479 dead transitions. [2025-03-04 02:18:25,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 479 transitions, 9244 flow [2025-03-04 02:18:25,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 02:18:25,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-04 02:18:25,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 279 transitions. [2025-03-04 02:18:25,673 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45292207792207795 [2025-03-04 02:18:25,673 INFO L175 Difference]: Start difference. First operand has 317 places, 388 transitions, 7684 flow. Second operand 22 states and 279 transitions. [2025-03-04 02:18:25,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 479 transitions, 9244 flow [2025-03-04 02:18:25,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 479 transitions, 8484 flow, removed 41 selfloop flow, removed 23 redundant places. [2025-03-04 02:18:25,818 INFO L231 Difference]: Finished difference. Result has 319 places, 399 transitions, 7783 flow [2025-03-04 02:18:25,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=6969, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=216, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=7783, PETRI_PLACES=319, PETRI_TRANSITIONS=399} [2025-03-04 02:18:25,819 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 293 predicate places. [2025-03-04 02:18:25,819 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 399 transitions, 7783 flow [2025-03-04 02:18:25,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:18:25,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:25,819 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:25,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 02:18:25,819 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:25,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:25,819 INFO L85 PathProgramCache]: Analyzing trace with hash -853390581, now seen corresponding path program 19 times [2025-03-04 02:18:25,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:25,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787206905] [2025-03-04 02:18:25,820 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:18:25,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:25,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 02:18:25,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:18:25,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:25,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:26,411 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 02:18:26,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:26,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787206905] [2025-03-04 02:18:26,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787206905] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:26,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682440313] [2025-03-04 02:18:26,411 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:18:26,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:26,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:26,413 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:18:26,413 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:18:26,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 02:18:26,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:18:26,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:26,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:26,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 02:18:26,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:26,584 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:18:26,584 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 118 treesize of output 74 [2025-03-04 02:18:26,686 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:18:26,686 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:18:26,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682440313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:26,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:18:26,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [16] total 23 [2025-03-04 02:18:26,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668394203] [2025-03-04 02:18:26,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:26,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:18:26,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:26,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:18:26,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2025-03-04 02:18:26,700 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:26,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 399 transitions, 7783 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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:18:26,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:26,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:26,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:27,486 INFO L124 PetriNetUnfolderBase]: 2077/4132 cut-off events. [2025-03-04 02:18:27,487 INFO L125 PetriNetUnfolderBase]: For 36433/36433 co-relation queries the response was YES. [2025-03-04 02:18:27,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24178 conditions, 4132 events. 2077/4132 cut-off events. For 36433/36433 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 32313 event pairs, 832 based on Foata normal form. 5/4119 useless extension candidates. Maximal degree in co-relation 24030. Up to 2190 conditions per place. [2025-03-04 02:18:27,511 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 348 selfloop transitions, 97 changer transitions 7/455 dead transitions. [2025-03-04 02:18:27,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 455 transitions, 9039 flow [2025-03-04 02:18:27,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:18:27,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:18:27,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 166 transitions. [2025-03-04 02:18:27,512 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49404761904761907 [2025-03-04 02:18:27,512 INFO L175 Difference]: Start difference. First operand has 319 places, 399 transitions, 7783 flow. Second operand 12 states and 166 transitions. [2025-03-04 02:18:27,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 455 transitions, 9039 flow [2025-03-04 02:18:27,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 455 transitions, 8624 flow, removed 12 selfloop flow, removed 15 redundant places. [2025-03-04 02:18:27,660 INFO L231 Difference]: Finished difference. Result has 317 places, 401 transitions, 7676 flow [2025-03-04 02:18:27,660 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=7344, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=7676, PETRI_PLACES=317, PETRI_TRANSITIONS=401} [2025-03-04 02:18:27,661 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 291 predicate places. [2025-03-04 02:18:27,661 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 401 transitions, 7676 flow [2025-03-04 02:18:27,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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:18:27,661 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:27,661 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:27,667 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:18:27,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-04 02:18:27,861 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:27,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:27,862 INFO L85 PathProgramCache]: Analyzing trace with hash -636415695, now seen corresponding path program 20 times [2025-03-04 02:18:27,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:27,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823173751] [2025-03-04 02:18:27,862 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:18:27,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:27,869 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-04 02:18:27,874 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 29 statements. [2025-03-04 02:18:27,874 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:18:27,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:28,110 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:18:28,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:28,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823173751] [2025-03-04 02:18:28,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823173751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:28,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:28,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:18:28,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535993428] [2025-03-04 02:18:28,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:28,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:18:28,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:28,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:18:28,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:18:28,125 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:28,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 401 transitions, 7676 flow. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:18:28,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:28,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:28,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:29,195 INFO L124 PetriNetUnfolderBase]: 2066/4142 cut-off events. [2025-03-04 02:18:29,195 INFO L125 PetriNetUnfolderBase]: For 35479/35479 co-relation queries the response was YES. [2025-03-04 02:18:29,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23678 conditions, 4142 events. 2066/4142 cut-off events. For 35479/35479 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 32236 event pairs, 221 based on Foata normal form. 1/4143 useless extension candidates. Maximal degree in co-relation 23529. Up to 801 conditions per place. [2025-03-04 02:18:29,229 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 170 selfloop transitions, 295 changer transitions 8/476 dead transitions. [2025-03-04 02:18:29,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 476 transitions, 8883 flow [2025-03-04 02:18:29,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 02:18:29,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-04 02:18:29,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 281 transitions. [2025-03-04 02:18:29,230 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4181547619047619 [2025-03-04 02:18:29,230 INFO L175 Difference]: Start difference. First operand has 317 places, 401 transitions, 7676 flow. Second operand 24 states and 281 transitions. [2025-03-04 02:18:29,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 476 transitions, 8883 flow [2025-03-04 02:18:29,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 476 transitions, 8719 flow, removed 22 selfloop flow, removed 14 redundant places. [2025-03-04 02:18:29,410 INFO L231 Difference]: Finished difference. Result has 326 places, 400 transitions, 8103 flow [2025-03-04 02:18:29,411 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=7522, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=295, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=8103, PETRI_PLACES=326, PETRI_TRANSITIONS=400} [2025-03-04 02:18:29,411 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 300 predicate places. [2025-03-04 02:18:29,411 INFO L471 AbstractCegarLoop]: Abstraction has has 326 places, 400 transitions, 8103 flow [2025-03-04 02:18:29,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:18:29,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:29,411 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:29,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 02:18:29,411 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:29,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:29,412 INFO L85 PathProgramCache]: Analyzing trace with hash -717814751, now seen corresponding path program 21 times [2025-03-04 02:18:29,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:29,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736253255] [2025-03-04 02:18:29,412 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:18:29,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:29,420 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-03-04 02:18:29,437 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 29 statements. [2025-03-04 02:18:29,437 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:18:29,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:29,632 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:18:29,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:29,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736253255] [2025-03-04 02:18:29,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736253255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:29,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:29,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:18:29,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547869591] [2025-03-04 02:18:29,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:29,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:18:29,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:29,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:18:29,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:18:29,649 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:29,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 400 transitions, 8103 flow. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:18:29,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:29,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:29,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:30,612 INFO L124 PetriNetUnfolderBase]: 2182/4309 cut-off events. [2025-03-04 02:18:30,612 INFO L125 PetriNetUnfolderBase]: For 41959/41959 co-relation queries the response was YES. [2025-03-04 02:18:30,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25614 conditions, 4309 events. 2182/4309 cut-off events. For 41959/41959 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 33528 event pairs, 296 based on Foata normal form. 5/4301 useless extension candidates. Maximal degree in co-relation 25474. Up to 1076 conditions per place. [2025-03-04 02:18:30,643 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 250 selfloop transitions, 250 changer transitions 9/512 dead transitions. [2025-03-04 02:18:30,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 512 transitions, 9970 flow [2025-03-04 02:18:30,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 02:18:30,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-04 02:18:30,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 302 transitions. [2025-03-04 02:18:30,644 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4494047619047619 [2025-03-04 02:18:30,644 INFO L175 Difference]: Start difference. First operand has 326 places, 400 transitions, 8103 flow. Second operand 24 states and 302 transitions. [2025-03-04 02:18:30,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 512 transitions, 9970 flow [2025-03-04 02:18:30,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 512 transitions, 9440 flow, removed 8 selfloop flow, removed 24 redundant places. [2025-03-04 02:18:30,824 INFO L231 Difference]: Finished difference. Result has 329 places, 416 transitions, 8549 flow [2025-03-04 02:18:30,825 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=7593, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=236, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=8549, PETRI_PLACES=329, PETRI_TRANSITIONS=416} [2025-03-04 02:18:30,825 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 303 predicate places. [2025-03-04 02:18:30,825 INFO L471 AbstractCegarLoop]: Abstraction has has 329 places, 416 transitions, 8549 flow [2025-03-04 02:18:30,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:18:30,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:30,825 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:30,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 02:18:30,825 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:30,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:30,826 INFO L85 PathProgramCache]: Analyzing trace with hash -438556317, now seen corresponding path program 22 times [2025-03-04 02:18:30,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:30,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262888238] [2025-03-04 02:18:30,826 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:18:30,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:30,838 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-03-04 02:18:30,841 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 29 statements. [2025-03-04 02:18:30,842 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 02:18:30,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:30,948 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:18:30,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:30,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262888238] [2025-03-04 02:18:30,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262888238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:30,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:30,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:18:30,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856855463] [2025-03-04 02:18:30,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:30,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:18:30,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:30,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:18:30,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:18:30,963 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:30,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 416 transitions, 8549 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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:18:30,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:30,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:30,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:31,822 INFO L124 PetriNetUnfolderBase]: 2285/4551 cut-off events. [2025-03-04 02:18:31,822 INFO L125 PetriNetUnfolderBase]: For 45121/45121 co-relation queries the response was YES. [2025-03-04 02:18:31,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27376 conditions, 4551 events. 2285/4551 cut-off events. For 45121/45121 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 36147 event pairs, 109 based on Foata normal form. 1/4552 useless extension candidates. Maximal degree in co-relation 27235. Up to 955 conditions per place. [2025-03-04 02:18:31,853 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 176 selfloop transitions, 314 changer transitions 8/501 dead transitions. [2025-03-04 02:18:31,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 501 transitions, 10221 flow [2025-03-04 02:18:31,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 02:18:31,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-04 02:18:31,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 239 transitions. [2025-03-04 02:18:31,854 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4492481203007519 [2025-03-04 02:18:31,854 INFO L175 Difference]: Start difference. First operand has 329 places, 416 transitions, 8549 flow. Second operand 19 states and 239 transitions. [2025-03-04 02:18:31,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 501 transitions, 10221 flow [2025-03-04 02:18:32,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 501 transitions, 9802 flow, removed 14 selfloop flow, removed 15 redundant places. [2025-03-04 02:18:32,088 INFO L231 Difference]: Finished difference. Result has 335 places, 433 transitions, 9294 flow [2025-03-04 02:18:32,088 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=8159, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=296, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=9294, PETRI_PLACES=335, PETRI_TRANSITIONS=433} [2025-03-04 02:18:32,088 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 309 predicate places. [2025-03-04 02:18:32,088 INFO L471 AbstractCegarLoop]: Abstraction has has 335 places, 433 transitions, 9294 flow [2025-03-04 02:18:32,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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:18:32,089 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:32,089 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:32,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 02:18:32,089 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:32,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:32,089 INFO L85 PathProgramCache]: Analyzing trace with hash 886454378, now seen corresponding path program 1 times [2025-03-04 02:18:32,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:32,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437261285] [2025-03-04 02:18:32,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:32,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:32,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 02:18:32,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 02:18:32,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:32,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:32,135 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:18:32,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:32,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437261285] [2025-03-04 02:18:32,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437261285] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:32,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565767836] [2025-03-04 02:18:32,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:32,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:32,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:32,138 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:18:32,139 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:18:32,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 02:18:32,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 02:18:32,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:32,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:32,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 02:18:32,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:32,261 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:18:32,261 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:32,287 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:18:32,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565767836] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:18:32,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:18:32,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 02:18:32,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219019278] [2025-03-04 02:18:32,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:18:32,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:18:32,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:32,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:18:32,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:18:32,289 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-03-04 02:18:32,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 433 transitions, 9294 flow. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 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:18:32,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:32,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-03-04 02:18:32,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:33,249 INFO L124 PetriNetUnfolderBase]: 3255/6032 cut-off events. [2025-03-04 02:18:33,249 INFO L125 PetriNetUnfolderBase]: For 59747/59747 co-relation queries the response was YES. [2025-03-04 02:18:33,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39704 conditions, 6032 events. 3255/6032 cut-off events. For 59747/59747 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 43316 event pairs, 560 based on Foata normal form. 529/6561 useless extension candidates. Maximal degree in co-relation 39562. Up to 1431 conditions per place. [2025-03-04 02:18:33,299 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 593 selfloop transitions, 109 changer transitions 0/704 dead transitions. [2025-03-04 02:18:33,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 704 transitions, 16054 flow [2025-03-04 02:18:33,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:18:33,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:18:33,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2025-03-04 02:18:33,299 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5178571428571429 [2025-03-04 02:18:33,299 INFO L175 Difference]: Start difference. First operand has 335 places, 433 transitions, 9294 flow. Second operand 8 states and 116 transitions. [2025-03-04 02:18:33,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 704 transitions, 16054 flow [2025-03-04 02:18:33,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 704 transitions, 15749 flow, removed 31 selfloop flow, removed 15 redundant places. [2025-03-04 02:18:33,660 INFO L231 Difference]: Finished difference. Result has 329 places, 474 transitions, 10194 flow [2025-03-04 02:18:33,660 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=9029, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10194, PETRI_PLACES=329, PETRI_TRANSITIONS=474} [2025-03-04 02:18:33,661 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 303 predicate places. [2025-03-04 02:18:33,661 INFO L471 AbstractCegarLoop]: Abstraction has has 329 places, 474 transitions, 10194 flow [2025-03-04 02:18:33,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 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:18:33,661 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:33,661 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:33,667 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:18:33,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:33,865 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:33,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:33,865 INFO L85 PathProgramCache]: Analyzing trace with hash 963830412, now seen corresponding path program 1 times [2025-03-04 02:18:33,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:33,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973010535] [2025-03-04 02:18:33,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:33,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:33,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 02:18:33,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 02:18:33,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:33,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:33,901 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:18:33,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:33,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973010535] [2025-03-04 02:18:33,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973010535] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:33,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619632981] [2025-03-04 02:18:33,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:33,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:33,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:33,903 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:18:33,904 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:18:33,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 02:18:33,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 02:18:33,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:33,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:33,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 02:18:33,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:34,003 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:18:34,003 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:34,026 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:18:34,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619632981] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:18:34,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:18:34,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 02:18:34,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587432014] [2025-03-04 02:18:34,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:18:34,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:18:34,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:34,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:18:34,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:18:34,029 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-03-04 02:18:34,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 474 transitions, 10194 flow. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 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:18:34,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:34,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-03-04 02:18:34,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:35,289 INFO L124 PetriNetUnfolderBase]: 4240/7544 cut-off events. [2025-03-04 02:18:35,290 INFO L125 PetriNetUnfolderBase]: For 76482/76566 co-relation queries the response was YES. [2025-03-04 02:18:35,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53350 conditions, 7544 events. 4240/7544 cut-off events. For 76482/76566 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 51427 event pairs, 1052 based on Foata normal form. 608/8136 useless extension candidates. Maximal degree in co-relation 53207. Up to 1908 conditions per place. [2025-03-04 02:18:35,344 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 689 selfloop transitions, 118 changer transitions 0/809 dead transitions. [2025-03-04 02:18:35,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 809 transitions, 18213 flow [2025-03-04 02:18:35,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:18:35,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:18:35,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2025-03-04 02:18:35,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6173469387755102 [2025-03-04 02:18:35,345 INFO L175 Difference]: Start difference. First operand has 329 places, 474 transitions, 10194 flow. Second operand 7 states and 121 transitions. [2025-03-04 02:18:35,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 809 transitions, 18213 flow [2025-03-04 02:18:35,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 809 transitions, 17917 flow, removed 12 selfloop flow, removed 7 redundant places. [2025-03-04 02:18:35,858 INFO L231 Difference]: Finished difference. Result has 332 places, 517 transitions, 11317 flow [2025-03-04 02:18:35,858 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=10011, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=474, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=11317, PETRI_PLACES=332, PETRI_TRANSITIONS=517} [2025-03-04 02:18:35,858 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 306 predicate places. [2025-03-04 02:18:35,859 INFO L471 AbstractCegarLoop]: Abstraction has has 332 places, 517 transitions, 11317 flow [2025-03-04 02:18:35,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 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:18:35,859 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:35,859 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:35,865 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:18:36,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:36,059 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:36,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:36,060 INFO L85 PathProgramCache]: Analyzing trace with hash 504240302, now seen corresponding path program 1 times [2025-03-04 02:18:36,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:36,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920299473] [2025-03-04 02:18:36,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:36,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:36,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:18:36,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:18:36,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:36,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:36,324 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:18:36,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:36,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920299473] [2025-03-04 02:18:36,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920299473] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:36,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495479355] [2025-03-04 02:18:36,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:36,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:36,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:36,325 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:18:36,327 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:18:36,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:18:36,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:18:36,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:36,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:36,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 02:18:36,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:36,548 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:18:36,548 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 118 treesize of output 74 [2025-03-04 02:18:36,572 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:18:36,572 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:36,676 INFO L349 Elim1Store]: treesize reduction 28, result has 59.4 percent of original size [2025-03-04 02:18:36,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 103 treesize of output 87 [2025-03-04 02:18:36,716 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:18:36,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495479355] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:36,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:18:36,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 7] total 18 [2025-03-04 02:18:36,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338682617] [2025-03-04 02:18:36,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:36,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:18:36,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:36,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:18:36,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2025-03-04 02:18:36,724 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:36,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 517 transitions, 11317 flow. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:36,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:36,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:36,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:38,332 INFO L124 PetriNetUnfolderBase]: 4413/8103 cut-off events. [2025-03-04 02:18:38,332 INFO L125 PetriNetUnfolderBase]: For 81682/81858 co-relation queries the response was YES. [2025-03-04 02:18:38,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56687 conditions, 8103 events. 4413/8103 cut-off events. For 81682/81858 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 58971 event pairs, 793 based on Foata normal form. 28/8094 useless extension candidates. Maximal degree in co-relation 56545. Up to 2445 conditions per place. [2025-03-04 02:18:38,428 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 347 selfloop transitions, 242 changer transitions 0/592 dead transitions. [2025-03-04 02:18:38,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 592 transitions, 13198 flow [2025-03-04 02:18:38,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:18:38,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:18:38,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 157 transitions. [2025-03-04 02:18:38,429 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5097402597402597 [2025-03-04 02:18:38,429 INFO L175 Difference]: Start difference. First operand has 332 places, 517 transitions, 11317 flow. Second operand 11 states and 157 transitions. [2025-03-04 02:18:38,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 592 transitions, 13198 flow [2025-03-04 02:18:39,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 592 transitions, 13100 flow, removed 17 selfloop flow, removed 1 redundant places. [2025-03-04 02:18:39,197 INFO L231 Difference]: Finished difference. Result has 343 places, 529 transitions, 12066 flow [2025-03-04 02:18:39,198 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=11186, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=515, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=228, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=12066, PETRI_PLACES=343, PETRI_TRANSITIONS=529} [2025-03-04 02:18:39,198 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 317 predicate places. [2025-03-04 02:18:39,198 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 529 transitions, 12066 flow [2025-03-04 02:18:39,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:39,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:39,198 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:39,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 02:18:39,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:39,399 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:39,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:39,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1744442157, now seen corresponding path program 1 times [2025-03-04 02:18:39,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:39,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611262353] [2025-03-04 02:18:39,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:39,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:39,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:18:39,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:18:39,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:39,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:39,676 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:18:39,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:39,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611262353] [2025-03-04 02:18:39,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611262353] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:39,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735551589] [2025-03-04 02:18:39,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:39,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:39,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:39,679 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:18:39,680 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:18:39,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:18:39,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:18:39,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:39,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:39,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 02:18:39,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:39,850 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:18:39,850 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:39,935 INFO L349 Elim1Store]: treesize reduction 28, result has 59.4 percent of original size [2025-03-04 02:18:39,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 48 [2025-03-04 02:18:39,945 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:18:39,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735551589] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:18:39,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:18:39,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 16 [2025-03-04 02:18:39,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078627786] [2025-03-04 02:18:39,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:18:39,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 02:18:39,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:39,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 02:18:39,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-03-04 02:18:39,968 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:39,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 529 transitions, 12066 flow. Second operand has 16 states, 16 states have (on average 7.5625) internal successors, (121), 16 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:39,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:39,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:39,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:41,578 INFO L124 PetriNetUnfolderBase]: 4480/8206 cut-off events. [2025-03-04 02:18:41,578 INFO L125 PetriNetUnfolderBase]: For 90600/90771 co-relation queries the response was YES. [2025-03-04 02:18:41,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59812 conditions, 8206 events. 4480/8206 cut-off events. For 90600/90771 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 59699 event pairs, 412 based on Foata normal form. 50/8211 useless extension candidates. Maximal degree in co-relation 59667. Up to 2171 conditions per place. [2025-03-04 02:18:41,657 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 197 selfloop transitions, 411 changer transitions 1/612 dead transitions. [2025-03-04 02:18:41,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 612 transitions, 14065 flow [2025-03-04 02:18:41,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 02:18:41,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 02:18:41,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 213 transitions. [2025-03-04 02:18:41,658 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4226190476190476 [2025-03-04 02:18:41,658 INFO L175 Difference]: Start difference. First operand has 343 places, 529 transitions, 12066 flow. Second operand 18 states and 213 transitions. [2025-03-04 02:18:41,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 612 transitions, 14065 flow [2025-03-04 02:18:42,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 612 transitions, 13758 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-03-04 02:18:42,274 INFO L231 Difference]: Finished difference. Result has 358 places, 552 transitions, 13166 flow [2025-03-04 02:18:42,275 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=11709, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=383, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=13166, PETRI_PLACES=358, PETRI_TRANSITIONS=552} [2025-03-04 02:18:42,275 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 332 predicate places. [2025-03-04 02:18:42,275 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 552 transitions, 13166 flow [2025-03-04 02:18:42,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.5625) internal successors, (121), 16 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:42,275 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:42,275 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:42,289 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:18:42,475 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,SelfDestructingSolverStorable32 [2025-03-04 02:18:42,476 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:42,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:42,476 INFO L85 PathProgramCache]: Analyzing trace with hash -556132652, now seen corresponding path program 2 times [2025-03-04 02:18:42,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:42,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254819217] [2025-03-04 02:18:42,476 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:18:42,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:42,483 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:18:42,500 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:18:42,500 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:18:42,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:42,760 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:18:42,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:42,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254819217] [2025-03-04 02:18:42,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254819217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:42,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:42,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:18:42,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656995777] [2025-03-04 02:18:42,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:42,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:18:42,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:42,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:18:42,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:18:42,768 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:42,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 552 transitions, 13166 flow. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 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:18:42,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:42,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:42,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:44,137 INFO L124 PetriNetUnfolderBase]: 4475/8215 cut-off events. [2025-03-04 02:18:44,137 INFO L125 PetriNetUnfolderBase]: For 100252/100422 co-relation queries the response was YES. [2025-03-04 02:18:44,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62335 conditions, 8215 events. 4475/8215 cut-off events. For 100252/100422 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 59904 event pairs, 1150 based on Foata normal form. 5/8191 useless extension candidates. Maximal degree in co-relation 62183. Up to 3070 conditions per place. [2025-03-04 02:18:44,234 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 319 selfloop transitions, 248 changer transitions 10/580 dead transitions. [2025-03-04 02:18:44,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 580 transitions, 14384 flow [2025-03-04 02:18:44,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:18:44,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:18:44,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2025-03-04 02:18:44,234 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4392857142857143 [2025-03-04 02:18:44,234 INFO L175 Difference]: Start difference. First operand has 358 places, 552 transitions, 13166 flow. Second operand 10 states and 123 transitions. [2025-03-04 02:18:44,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 580 transitions, 14384 flow [2025-03-04 02:18:44,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 580 transitions, 14141 flow, removed 15 selfloop flow, removed 7 redundant places. [2025-03-04 02:18:44,929 INFO L231 Difference]: Finished difference. Result has 360 places, 549 transitions, 13347 flow [2025-03-04 02:18:44,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=12894, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=248, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=13347, PETRI_PLACES=360, PETRI_TRANSITIONS=549} [2025-03-04 02:18:44,930 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 334 predicate places. [2025-03-04 02:18:44,930 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 549 transitions, 13347 flow [2025-03-04 02:18:44,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 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:18:44,930 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:44,930 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:44,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-04 02:18:44,930 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:44,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:44,931 INFO L85 PathProgramCache]: Analyzing trace with hash 863555160, now seen corresponding path program 3 times [2025-03-04 02:18:44,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:44,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090663118] [2025-03-04 02:18:44,931 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:18:44,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:44,938 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 4 equivalence classes. [2025-03-04 02:18:44,946 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 31 statements. [2025-03-04 02:18:44,946 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:18:44,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:45,160 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:18:45,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:45,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090663118] [2025-03-04 02:18:45,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090663118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:45,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:45,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:18:45,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932524930] [2025-03-04 02:18:45,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:45,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:18:45,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:45,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:18:45,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:18:45,172 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:45,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 549 transitions, 13347 flow. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 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:18:45,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:45,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:45,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:46,599 INFO L124 PetriNetUnfolderBase]: 4536/8364 cut-off events. [2025-03-04 02:18:46,599 INFO L125 PetriNetUnfolderBase]: For 106642/106812 co-relation queries the response was YES. [2025-03-04 02:18:46,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64125 conditions, 8364 events. 4536/8364 cut-off events. For 106642/106812 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 61673 event pairs, 1177 based on Foata normal form. 5/8332 useless extension candidates. Maximal degree in co-relation 63975. Up to 3042 conditions per place. [2025-03-04 02:18:46,702 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 349 selfloop transitions, 240 changer transitions 5/597 dead transitions. [2025-03-04 02:18:46,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 597 transitions, 14768 flow [2025-03-04 02:18:46,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 02:18:46,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 02:18:46,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 167 transitions. [2025-03-04 02:18:46,703 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4260204081632653 [2025-03-04 02:18:46,703 INFO L175 Difference]: Start difference. First operand has 360 places, 549 transitions, 13347 flow. Second operand 14 states and 167 transitions. [2025-03-04 02:18:46,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 597 transitions, 14768 flow [2025-03-04 02:18:47,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 597 transitions, 14286 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-04 02:18:47,522 INFO L231 Difference]: Finished difference. Result has 361 places, 550 transitions, 13387 flow [2025-03-04 02:18:47,522 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=12827, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=547, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=235, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=13387, PETRI_PLACES=361, PETRI_TRANSITIONS=550} [2025-03-04 02:18:47,522 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 335 predicate places. [2025-03-04 02:18:47,522 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 550 transitions, 13387 flow [2025-03-04 02:18:47,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 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:18:47,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:47,523 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:47,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-04 02:18:47,523 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:47,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:47,523 INFO L85 PathProgramCache]: Analyzing trace with hash 647759152, now seen corresponding path program 4 times [2025-03-04 02:18:47,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:47,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494816427] [2025-03-04 02:18:47,523 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:18:47,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:47,531 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:18:47,534 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 18 of 31 statements. [2025-03-04 02:18:47,534 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 02:18:47,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:47,620 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:18:47,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:47,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494816427] [2025-03-04 02:18:47,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494816427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:47,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:47,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:18:47,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048328226] [2025-03-04 02:18:47,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:47,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:18:47,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:47,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:18:47,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:18:47,630 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:47,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 550 transitions, 13387 flow. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:47,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:47,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:47,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:49,280 INFO L124 PetriNetUnfolderBase]: 4454/8185 cut-off events. [2025-03-04 02:18:49,281 INFO L125 PetriNetUnfolderBase]: For 105681/105851 co-relation queries the response was YES. [2025-03-04 02:18:49,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63246 conditions, 8185 events. 4454/8185 cut-off events. For 105681/105851 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 59856 event pairs, 701 based on Foata normal form. 5/8164 useless extension candidates. Maximal degree in co-relation 63096. Up to 1608 conditions per place. [2025-03-04 02:18:49,363 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 319 selfloop transitions, 280 changer transitions 4/606 dead transitions. [2025-03-04 02:18:49,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 606 transitions, 14891 flow [2025-03-04 02:18:49,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 02:18:49,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 02:18:49,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 179 transitions. [2025-03-04 02:18:49,364 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45663265306122447 [2025-03-04 02:18:49,364 INFO L175 Difference]: Start difference. First operand has 361 places, 550 transitions, 13387 flow. Second operand 14 states and 179 transitions. [2025-03-04 02:18:49,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 606 transitions, 14891 flow [2025-03-04 02:18:50,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 606 transitions, 14746 flow, removed 1 selfloop flow, removed 9 redundant places. [2025-03-04 02:18:50,073 INFO L231 Difference]: Finished difference. Result has 361 places, 549 transitions, 13802 flow [2025-03-04 02:18:50,073 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=13181, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=547, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=277, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=13802, PETRI_PLACES=361, PETRI_TRANSITIONS=549} [2025-03-04 02:18:50,074 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 335 predicate places. [2025-03-04 02:18:50,074 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 549 transitions, 13802 flow [2025-03-04 02:18:50,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:50,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:50,074 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:50,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-04 02:18:50,074 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:50,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:50,075 INFO L85 PathProgramCache]: Analyzing trace with hash -555221101, now seen corresponding path program 2 times [2025-03-04 02:18:50,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:50,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298171831] [2025-03-04 02:18:50,075 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:18:50,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:50,088 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:18:50,094 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 31 statements. [2025-03-04 02:18:50,094 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:18:50,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:50,397 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:18:50,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:50,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298171831] [2025-03-04 02:18:50,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298171831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:50,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:50,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:18:50,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872832897] [2025-03-04 02:18:50,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:50,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:18:50,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:50,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:18:50,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:18:50,413 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:50,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 549 transitions, 13802 flow. Second operand has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:50,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:50,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:50,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:52,060 INFO L124 PetriNetUnfolderBase]: 4375/8091 cut-off events. [2025-03-04 02:18:52,060 INFO L125 PetriNetUnfolderBase]: For 109067/109230 co-relation queries the response was YES. [2025-03-04 02:18:52,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64086 conditions, 8091 events. 4375/8091 cut-off events. For 109067/109230 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 59443 event pairs, 1270 based on Foata normal form. 41/8095 useless extension candidates. Maximal degree in co-relation 63937. Up to 3692 conditions per place. [2025-03-04 02:18:52,138 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 346 selfloop transitions, 261 changer transitions 0/610 dead transitions. [2025-03-04 02:18:52,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 610 transitions, 15815 flow [2025-03-04 02:18:52,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:18:52,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:18:52,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 155 transitions. [2025-03-04 02:18:52,138 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46130952380952384 [2025-03-04 02:18:52,139 INFO L175 Difference]: Start difference. First operand has 361 places, 549 transitions, 13802 flow. Second operand 12 states and 155 transitions. [2025-03-04 02:18:52,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 610 transitions, 15815 flow [2025-03-04 02:18:52,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 610 transitions, 15580 flow, removed 9 selfloop flow, removed 8 redundant places. [2025-03-04 02:18:52,904 INFO L231 Difference]: Finished difference. Result has 364 places, 546 transitions, 14072 flow [2025-03-04 02:18:52,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=13461, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=258, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=14072, PETRI_PLACES=364, PETRI_TRANSITIONS=546} [2025-03-04 02:18:52,905 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 338 predicate places. [2025-03-04 02:18:52,905 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 546 transitions, 14072 flow [2025-03-04 02:18:52,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:52,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:52,905 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:52,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-04 02:18:52,905 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:52,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:52,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1988259139, now seen corresponding path program 3 times [2025-03-04 02:18:52,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:52,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839902748] [2025-03-04 02:18:52,906 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:18:52,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:52,913 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 4 equivalence classes. [2025-03-04 02:18:52,917 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 31 statements. [2025-03-04 02:18:52,917 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:18:52,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:53,103 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:18:53,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:53,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839902748] [2025-03-04 02:18:53,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839902748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:53,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:53,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:18:53,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711596092] [2025-03-04 02:18:53,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:53,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:18:53,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:53,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:18:53,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:18:53,116 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:53,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 546 transitions, 14072 flow. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 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:18:53,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:53,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:53,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:54,574 INFO L124 PetriNetUnfolderBase]: 4420/8159 cut-off events. [2025-03-04 02:18:54,575 INFO L125 PetriNetUnfolderBase]: For 115625/115786 co-relation queries the response was YES. [2025-03-04 02:18:54,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65497 conditions, 8159 events. 4420/8159 cut-off events. For 115625/115786 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 59746 event pairs, 1201 based on Foata normal form. 32/8154 useless extension candidates. Maximal degree in co-relation 65346. Up to 3831 conditions per place. [2025-03-04 02:18:54,668 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 315 selfloop transitions, 271 changer transitions 2/591 dead transitions. [2025-03-04 02:18:54,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 591 transitions, 15540 flow [2025-03-04 02:18:54,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:18:54,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:18:54,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 150 transitions. [2025-03-04 02:18:54,669 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2025-03-04 02:18:54,669 INFO L175 Difference]: Start difference. First operand has 364 places, 546 transitions, 14072 flow. Second operand 12 states and 150 transitions. [2025-03-04 02:18:54,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 591 transitions, 15540 flow [2025-03-04 02:18:55,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 591 transitions, 15157 flow, removed 2 selfloop flow, removed 8 redundant places. [2025-03-04 02:18:55,336 INFO L231 Difference]: Finished difference. Result has 369 places, 545 transitions, 14363 flow [2025-03-04 02:18:55,336 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=13602, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=268, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=14363, PETRI_PLACES=369, PETRI_TRANSITIONS=545} [2025-03-04 02:18:55,337 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 343 predicate places. [2025-03-04 02:18:55,337 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 545 transitions, 14363 flow [2025-03-04 02:18:55,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 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:18:55,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:55,337 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:55,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-04 02:18:55,337 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:55,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:55,337 INFO L85 PathProgramCache]: Analyzing trace with hash 208176493, now seen corresponding path program 4 times [2025-03-04 02:18:55,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:55,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918453704] [2025-03-04 02:18:55,338 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:18:55,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:55,344 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:18:55,347 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 18 of 31 statements. [2025-03-04 02:18:55,347 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 02:18:55,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:55,446 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:18:55,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:55,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918453704] [2025-03-04 02:18:55,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918453704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:55,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:55,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:18:55,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603327334] [2025-03-04 02:18:55,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:55,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:18:55,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:55,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:18:55,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:18:55,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:55,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 545 transitions, 14363 flow. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:55,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:55,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:55,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:56,868 INFO L124 PetriNetUnfolderBase]: 4357/8013 cut-off events. [2025-03-04 02:18:56,869 INFO L125 PetriNetUnfolderBase]: For 128199/128360 co-relation queries the response was YES. [2025-03-04 02:18:56,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66094 conditions, 8013 events. 4357/8013 cut-off events. For 128199/128360 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 58022 event pairs, 1136 based on Foata normal form. 4/7998 useless extension candidates. Maximal degree in co-relation 65941. Up to 2914 conditions per place. [2025-03-04 02:18:56,944 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 315 selfloop transitions, 252 changer transitions 5/575 dead transitions. [2025-03-04 02:18:56,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 575 transitions, 15510 flow [2025-03-04 02:18:56,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:18:56,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:18:56,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 153 transitions. [2025-03-04 02:18:56,945 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45535714285714285 [2025-03-04 02:18:56,945 INFO L175 Difference]: Start difference. First operand has 369 places, 545 transitions, 14363 flow. Second operand 12 states and 153 transitions. [2025-03-04 02:18:56,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 575 transitions, 15510 flow [2025-03-04 02:18:57,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 575 transitions, 14556 flow, removed 3 selfloop flow, removed 15 redundant places. [2025-03-04 02:18:57,689 INFO L231 Difference]: Finished difference. Result has 362 places, 538 transitions, 13910 flow [2025-03-04 02:18:57,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=13231, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=250, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=13910, PETRI_PLACES=362, PETRI_TRANSITIONS=538} [2025-03-04 02:18:57,690 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 336 predicate places. [2025-03-04 02:18:57,690 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 538 transitions, 13910 flow [2025-03-04 02:18:57,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:57,690 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:57,691 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:57,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-04 02:18:57,691 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:18:57,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:57,691 INFO L85 PathProgramCache]: Analyzing trace with hash 261528476, now seen corresponding path program 5 times [2025-03-04 02:18:57,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:57,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718532501] [2025-03-04 02:18:57,691 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:18:57,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:57,698 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 4 equivalence classes. [2025-03-04 02:18:57,710 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:18:57,710 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 02:18:57,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:57,970 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:18:57,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:57,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718532501] [2025-03-04 02:18:57,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718532501] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:57,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012428123] [2025-03-04 02:18:57,970 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:18:57,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:57,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:57,977 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:18:57,978 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:18:58,140 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 4 equivalence classes. [2025-03-04 02:18:58,233 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:18:58,233 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 02:18:58,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:58,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 02:18:58,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:58,401 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:18:58,401 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:58,551 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-04 02:18:58,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-03-04 02:18:58,577 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:18:58,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012428123] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:18:58,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:18:58,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 19 [2025-03-04 02:18:58,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448558572] [2025-03-04 02:18:58,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:18:58,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 02:18:58,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:58,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 02:18:58,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2025-03-04 02:18:58,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:18:58,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 538 transitions, 13910 flow. Second operand has 19 states, 19 states have (on average 7.526315789473684) internal successors, (143), 19 states have internal predecessors, (143), 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:18:58,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:58,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:18:58,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:00,404 INFO L124 PetriNetUnfolderBase]: 4582/8504 cut-off events. [2025-03-04 02:19:00,404 INFO L125 PetriNetUnfolderBase]: For 127233/127393 co-relation queries the response was YES. [2025-03-04 02:19:00,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66205 conditions, 8504 events. 4582/8504 cut-off events. For 127233/127393 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 63404 event pairs, 830 based on Foata normal form. 48/8517 useless extension candidates. Maximal degree in co-relation 66054. Up to 2212 conditions per place. [2025-03-04 02:19:00,482 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 338 selfloop transitions, 303 changer transitions 0/644 dead transitions. [2025-03-04 02:19:00,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 644 transitions, 16507 flow [2025-03-04 02:19:00,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 02:19:00,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 02:19:00,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 222 transitions. [2025-03-04 02:19:00,483 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2025-03-04 02:19:00,483 INFO L175 Difference]: Start difference. First operand has 362 places, 538 transitions, 13910 flow. Second operand 18 states and 222 transitions. [2025-03-04 02:19:00,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 644 transitions, 16507 flow [2025-03-04 02:19:01,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 644 transitions, 16186 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-04 02:19:01,301 INFO L231 Difference]: Finished difference. Result has 374 places, 578 transitions, 15356 flow [2025-03-04 02:19:01,302 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=13615, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=266, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=15356, PETRI_PLACES=374, PETRI_TRANSITIONS=578} [2025-03-04 02:19:01,302 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 348 predicate places. [2025-03-04 02:19:01,302 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 578 transitions, 15356 flow [2025-03-04 02:19:01,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.526315789473684) internal successors, (143), 19 states have internal predecessors, (143), 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:19:01,303 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:01,303 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:01,310 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:19:01,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-03-04 02:19:01,504 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:01,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:01,504 INFO L85 PathProgramCache]: Analyzing trace with hash -599447831, now seen corresponding path program 5 times [2025-03-04 02:19:01,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:01,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377595517] [2025-03-04 02:19:01,504 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:19:01,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:01,512 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 4 equivalence classes. [2025-03-04 02:19:01,524 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:19:01,524 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 02:19:01,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:01,876 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 02:19:01,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:01,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377595517] [2025-03-04 02:19:01,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377595517] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:19:01,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664520174] [2025-03-04 02:19:01,876 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:19:01,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:01,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:19:01,879 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:19:01,880 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:19:01,977 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 4 equivalence classes. [2025-03-04 02:19:02,029 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:19:02,030 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 02:19:02,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:02,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 02:19:02,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:19:02,158 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:19:02,159 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:19:02,251 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-04 02:19:02,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-03-04 02:19:02,275 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:19:02,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664520174] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:19:02,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:19:02,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 17 [2025-03-04 02:19:02,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115793414] [2025-03-04 02:19:02,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:19:02,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 02:19:02,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:02,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 02:19:02,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2025-03-04 02:19:02,338 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:19:02,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 578 transitions, 15356 flow. Second operand has 17 states, 17 states have (on average 7.411764705882353) internal successors, (126), 17 states have internal predecessors, (126), 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:19:02,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:02,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:19:02,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:04,602 INFO L124 PetriNetUnfolderBase]: 4923/9202 cut-off events. [2025-03-04 02:19:04,602 INFO L125 PetriNetUnfolderBase]: For 140420/140572 co-relation queries the response was YES. [2025-03-04 02:19:04,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71745 conditions, 9202 events. 4923/9202 cut-off events. For 140420/140572 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 69956 event pairs, 955 based on Foata normal form. 41/9218 useless extension candidates. Maximal degree in co-relation 71586. Up to 2815 conditions per place. [2025-03-04 02:19:04,703 INFO L140 encePairwiseOnDemand]: 14/28 looper letters, 336 selfloop transitions, 364 changer transitions 1/704 dead transitions. [2025-03-04 02:19:04,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 704 transitions, 18344 flow [2025-03-04 02:19:04,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 02:19:04,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-04 02:19:04,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 239 transitions. [2025-03-04 02:19:04,704 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4492481203007519 [2025-03-04 02:19:04,705 INFO L175 Difference]: Start difference. First operand has 374 places, 578 transitions, 15356 flow. Second operand 19 states and 239 transitions. [2025-03-04 02:19:04,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 704 transitions, 18344 flow [2025-03-04 02:19:05,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 704 transitions, 17957 flow, removed 25 selfloop flow, removed 10 redundant places. [2025-03-04 02:19:05,644 INFO L231 Difference]: Finished difference. Result has 388 places, 624 transitions, 17180 flow [2025-03-04 02:19:05,644 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=14970, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=321, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=17180, PETRI_PLACES=388, PETRI_TRANSITIONS=624} [2025-03-04 02:19:05,644 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 362 predicate places. [2025-03-04 02:19:05,644 INFO L471 AbstractCegarLoop]: Abstraction has has 388 places, 624 transitions, 17180 flow [2025-03-04 02:19:05,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.411764705882353) internal successors, (126), 17 states have internal predecessors, (126), 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:19:05,645 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:05,645 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:05,651 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:19:05,845 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,SelfDestructingSolverStorable40 [2025-03-04 02:19:05,845 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:05,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:05,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1780567274, now seen corresponding path program 6 times [2025-03-04 02:19:05,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:05,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981264061] [2025-03-04 02:19:05,846 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:19:05,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:05,853 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 4 equivalence classes. [2025-03-04 02:19:05,863 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 27 of 31 statements. [2025-03-04 02:19:05,863 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 02:19:05,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:06,260 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:19:06,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:06,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981264061] [2025-03-04 02:19:06,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981264061] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:19:06,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127253440] [2025-03-04 02:19:06,260 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:19:06,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:06,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:19:06,262 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:19:06,264 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:19:06,357 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 4 equivalence classes. [2025-03-04 02:19:06,378 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 27 of 31 statements. [2025-03-04 02:19:06,379 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 02:19:06,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:06,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 02:19:06,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:19:06,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:19:06,471 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 118 treesize of output 70 [2025-03-04 02:19:06,505 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:19:06,505 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:19:06,611 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-04 02:19:06,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-03-04 02:19:06,639 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:19:06,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127253440] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:19:06,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:19:06,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 9] total 17 [2025-03-04 02:19:06,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024365910] [2025-03-04 02:19:06,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:06,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:19:06,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:06,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:19:06,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-03-04 02:19:06,651 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:19:06,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 624 transitions, 17180 flow. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:06,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:06,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:19:06,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:08,618 INFO L124 PetriNetUnfolderBase]: 5020/9402 cut-off events. [2025-03-04 02:19:08,618 INFO L125 PetriNetUnfolderBase]: For 156795/156950 co-relation queries the response was YES. [2025-03-04 02:19:08,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75981 conditions, 9402 events. 5020/9402 cut-off events. For 156795/156950 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 72155 event pairs, 937 based on Foata normal form. 28/9395 useless extension candidates. Maximal degree in co-relation 75818. Up to 2457 conditions per place. [2025-03-04 02:19:08,714 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 390 selfloop transitions, 306 changer transitions 0/699 dead transitions. [2025-03-04 02:19:08,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 699 transitions, 19217 flow [2025-03-04 02:19:08,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 02:19:08,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 02:19:08,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 196 transitions. [2025-03-04 02:19:08,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-04 02:19:08,715 INFO L175 Difference]: Start difference. First operand has 388 places, 624 transitions, 17180 flow. Second operand 14 states and 196 transitions. [2025-03-04 02:19:08,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 699 transitions, 19217 flow [2025-03-04 02:19:09,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 699 transitions, 18488 flow, removed 32 selfloop flow, removed 20 redundant places. [2025-03-04 02:19:09,931 INFO L231 Difference]: Finished difference. Result has 383 places, 627 transitions, 17234 flow [2025-03-04 02:19:09,931 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=16445, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=622, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=301, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=17234, PETRI_PLACES=383, PETRI_TRANSITIONS=627} [2025-03-04 02:19:09,932 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 357 predicate places. [2025-03-04 02:19:09,932 INFO L471 AbstractCegarLoop]: Abstraction has has 383 places, 627 transitions, 17234 flow [2025-03-04 02:19:09,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:09,932 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:09,932 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:09,938 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:19:10,132 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,SelfDestructingSolverStorable41 [2025-03-04 02:19:10,133 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:10,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:10,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1185702602, now seen corresponding path program 7 times [2025-03-04 02:19:10,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:10,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731797996] [2025-03-04 02:19:10,133 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:19:10,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:10,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:19:10,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:19:10,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:19:10,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:10,523 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:19:10,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:10,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731797996] [2025-03-04 02:19:10,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731797996] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:19:10,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271940637] [2025-03-04 02:19:10,523 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:19:10,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:10,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:19:10,525 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:19:10,528 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:19:10,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:19:10,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:19:10,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:19:10,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:10,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 02:19:10,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:19:10,727 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:19:10,728 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 118 treesize of output 74 [2025-03-04 02:19:10,752 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:19:10,752 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:19:10,833 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-04 02:19:10,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 111 treesize of output 95 [2025-03-04 02:19:10,867 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:19:10,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271940637] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:19:10,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:19:10,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 7] total 18 [2025-03-04 02:19:10,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388900337] [2025-03-04 02:19:10,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:10,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:19:10,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:10,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:19:10,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2025-03-04 02:19:10,882 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:19:10,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 627 transitions, 17234 flow. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:10,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:10,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:19:10,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:13,064 INFO L124 PetriNetUnfolderBase]: 4877/9123 cut-off events. [2025-03-04 02:19:13,064 INFO L125 PetriNetUnfolderBase]: For 149382/149534 co-relation queries the response was YES. [2025-03-04 02:19:13,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73781 conditions, 9123 events. 4877/9123 cut-off events. For 149382/149534 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 69437 event pairs, 1003 based on Foata normal form. 28/9112 useless extension candidates. Maximal degree in co-relation 73628. Up to 3069 conditions per place. [2025-03-04 02:19:13,139 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 388 selfloop transitions, 281 changer transitions 0/672 dead transitions. [2025-03-04 02:19:13,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 672 transitions, 18793 flow [2025-03-04 02:19:13,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:19:13,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:19:13,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 149 transitions. [2025-03-04 02:19:13,140 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5321428571428571 [2025-03-04 02:19:13,140 INFO L175 Difference]: Start difference. First operand has 383 places, 627 transitions, 17234 flow. Second operand 10 states and 149 transitions. [2025-03-04 02:19:13,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 672 transitions, 18793 flow [2025-03-04 02:19:14,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 672 transitions, 18279 flow, removed 8 selfloop flow, removed 9 redundant places. [2025-03-04 02:19:14,046 INFO L231 Difference]: Finished difference. Result has 384 places, 617 transitions, 17076 flow [2025-03-04 02:19:14,047 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=16501, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=617, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=281, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=17076, PETRI_PLACES=384, PETRI_TRANSITIONS=617} [2025-03-04 02:19:14,047 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 358 predicate places. [2025-03-04 02:19:14,047 INFO L471 AbstractCegarLoop]: Abstraction has has 384 places, 617 transitions, 17076 flow [2025-03-04 02:19:14,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:14,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:14,048 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:14,058 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:19:14,248 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,SelfDestructingSolverStorable42 [2025-03-04 02:19:14,248 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:14,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:14,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1924086124, now seen corresponding path program 8 times [2025-03-04 02:19:14,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:14,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950437383] [2025-03-04 02:19:14,249 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:19:14,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:14,256 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:19:14,261 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 31 statements. [2025-03-04 02:19:14,261 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:19:14,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:14,579 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:19:14,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:14,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950437383] [2025-03-04 02:19:14,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950437383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:19:14,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:19:14,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:19:14,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694373285] [2025-03-04 02:19:14,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:14,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:19:14,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:14,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:19:14,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:19:14,599 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:19:14,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 617 transitions, 17076 flow. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 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:19:14,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:14,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:19:14,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:16,222 INFO L124 PetriNetUnfolderBase]: 4845/9065 cut-off events. [2025-03-04 02:19:16,222 INFO L125 PetriNetUnfolderBase]: For 151562/151712 co-relation queries the response was YES. [2025-03-04 02:19:16,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73498 conditions, 9065 events. 4845/9065 cut-off events. For 151562/151712 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 68897 event pairs, 2123 based on Foata normal form. 5/9027 useless extension candidates. Maximal degree in co-relation 73346. Up to 6053 conditions per place. [2025-03-04 02:19:16,323 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 552 selfloop transitions, 87 changer transitions 3/645 dead transitions. [2025-03-04 02:19:16,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 645 transitions, 18496 flow [2025-03-04 02:19:16,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:19:16,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:19:16,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2025-03-04 02:19:16,324 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2025-03-04 02:19:16,324 INFO L175 Difference]: Start difference. First operand has 384 places, 617 transitions, 17076 flow. Second operand 11 states and 132 transitions. [2025-03-04 02:19:16,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 645 transitions, 18496 flow [2025-03-04 02:19:17,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 645 transitions, 18038 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 02:19:17,436 INFO L231 Difference]: Finished difference. Result has 387 places, 613 transitions, 16699 flow [2025-03-04 02:19:17,437 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=16554, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=614, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=16699, PETRI_PLACES=387, PETRI_TRANSITIONS=613} [2025-03-04 02:19:17,438 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 361 predicate places. [2025-03-04 02:19:17,438 INFO L471 AbstractCegarLoop]: Abstraction has has 387 places, 613 transitions, 16699 flow [2025-03-04 02:19:17,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 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:19:17,438 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:17,438 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:17,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-04 02:19:17,438 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:17,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:17,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1042183752, now seen corresponding path program 9 times [2025-03-04 02:19:17,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:17,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623818741] [2025-03-04 02:19:17,439 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:19:17,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:17,446 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 4 equivalence classes. [2025-03-04 02:19:17,450 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 31 statements. [2025-03-04 02:19:17,451 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:19:17,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:17,635 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:19:17,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:17,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623818741] [2025-03-04 02:19:17,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623818741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:19:17,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:19:17,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:19:17,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133024438] [2025-03-04 02:19:17,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:17,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:19:17,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:17,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:19:17,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:19:17,650 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:19:17,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 613 transitions, 16699 flow. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 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:19:17,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:17,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:19:17,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:19,649 INFO L124 PetriNetUnfolderBase]: 4833/9043 cut-off events. [2025-03-04 02:19:19,649 INFO L125 PetriNetUnfolderBase]: For 148840/148990 co-relation queries the response was YES. [2025-03-04 02:19:19,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72086 conditions, 9043 events. 4833/9043 cut-off events. For 148840/148990 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 68689 event pairs, 2086 based on Foata normal form. 5/9005 useless extension candidates. Maximal degree in co-relation 71933. Up to 6047 conditions per place. [2025-03-04 02:19:19,753 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 547 selfloop transitions, 95 changer transitions 3/648 dead transitions. [2025-03-04 02:19:19,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 648 transitions, 18163 flow [2025-03-04 02:19:19,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:19:19,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:19:19,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 143 transitions. [2025-03-04 02:19:19,754 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4255952380952381 [2025-03-04 02:19:19,754 INFO L175 Difference]: Start difference. First operand has 387 places, 613 transitions, 16699 flow. Second operand 12 states and 143 transitions. [2025-03-04 02:19:19,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 648 transitions, 18163 flow [2025-03-04 02:19:20,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 648 transitions, 17992 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-03-04 02:19:20,772 INFO L231 Difference]: Finished difference. Result has 389 places, 614 transitions, 16776 flow [2025-03-04 02:19:20,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=16480, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=611, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=516, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=16776, PETRI_PLACES=389, PETRI_TRANSITIONS=614} [2025-03-04 02:19:20,773 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 363 predicate places. [2025-03-04 02:19:20,773 INFO L471 AbstractCegarLoop]: Abstraction has has 389 places, 614 transitions, 16776 flow [2025-03-04 02:19:20,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 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:19:20,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:20,773 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:20,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-04 02:19:20,773 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:20,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:20,774 INFO L85 PathProgramCache]: Analyzing trace with hash -535837486, now seen corresponding path program 10 times [2025-03-04 02:19:20,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:20,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881553270] [2025-03-04 02:19:20,774 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:19:20,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:20,783 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:19:20,786 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 18 of 31 statements. [2025-03-04 02:19:20,786 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 02:19:20,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:20,871 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:19:20,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:20,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881553270] [2025-03-04 02:19:20,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881553270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:19:20,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:19:20,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:19:20,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986654829] [2025-03-04 02:19:20,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:20,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:19:20,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:20,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:19:20,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:19:20,883 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:19:20,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 614 transitions, 16776 flow. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:20,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:20,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:19:20,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:22,902 INFO L124 PetriNetUnfolderBase]: 4756/8870 cut-off events. [2025-03-04 02:19:22,902 INFO L125 PetriNetUnfolderBase]: For 152022/152174 co-relation queries the response was YES. [2025-03-04 02:19:22,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71246 conditions, 8870 events. 4756/8870 cut-off events. For 152022/152174 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 66837 event pairs, 1001 based on Foata normal form. 5/8844 useless extension candidates. Maximal degree in co-relation 71091. Up to 2462 conditions per place. [2025-03-04 02:19:22,991 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 344 selfloop transitions, 292 changer transitions 9/648 dead transitions. [2025-03-04 02:19:22,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 648 transitions, 18029 flow [2025-03-04 02:19:22,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:19:22,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:19:22,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 157 transitions. [2025-03-04 02:19:22,992 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46726190476190477 [2025-03-04 02:19:22,992 INFO L175 Difference]: Start difference. First operand has 389 places, 614 transitions, 16776 flow. Second operand 12 states and 157 transitions. [2025-03-04 02:19:22,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 648 transitions, 18029 flow [2025-03-04 02:19:23,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 648 transitions, 17850 flow, removed 5 selfloop flow, removed 9 redundant places. [2025-03-04 02:19:23,915 INFO L231 Difference]: Finished difference. Result has 389 places, 604 transitions, 16971 flow [2025-03-04 02:19:23,915 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=16425, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=292, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=16971, PETRI_PLACES=389, PETRI_TRANSITIONS=604} [2025-03-04 02:19:23,915 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 363 predicate places. [2025-03-04 02:19:23,915 INFO L471 AbstractCegarLoop]: Abstraction has has 389 places, 604 transitions, 16971 flow [2025-03-04 02:19:23,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:23,915 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:23,915 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:23,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-04 02:19:23,916 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:23,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:23,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1485246111, now seen corresponding path program 6 times [2025-03-04 02:19:23,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:23,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665222856] [2025-03-04 02:19:23,916 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:19:23,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:23,923 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 4 equivalence classes. [2025-03-04 02:19:23,931 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 27 of 31 statements. [2025-03-04 02:19:23,932 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 02:19:23,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:24,189 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:19:24,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:24,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665222856] [2025-03-04 02:19:24,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665222856] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:19:24,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130864983] [2025-03-04 02:19:24,190 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:19:24,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:24,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:19:24,191 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:19:24,195 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:19:24,293 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 4 equivalence classes. [2025-03-04 02:19:24,310 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 27 of 31 statements. [2025-03-04 02:19:24,310 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 02:19:24,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:24,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 02:19:24,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:19:24,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:19:24,396 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 118 treesize of output 70 [2025-03-04 02:19:24,425 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:19:24,425 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:19:24,514 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-04 02:19:24,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-03-04 02:19:24,560 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:19:24,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130864983] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:19:24,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:19:24,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 9] total 17 [2025-03-04 02:19:24,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544863243] [2025-03-04 02:19:24,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:24,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:19:24,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:24,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:19:24,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-03-04 02:19:24,572 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:19:24,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 604 transitions, 16971 flow. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:24,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:24,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:19:24,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:26,218 INFO L124 PetriNetUnfolderBase]: 4855/9077 cut-off events. [2025-03-04 02:19:26,218 INFO L125 PetriNetUnfolderBase]: For 162854/163005 co-relation queries the response was YES. [2025-03-04 02:19:26,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74369 conditions, 9077 events. 4855/9077 cut-off events. For 162854/163005 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 68970 event pairs, 1018 based on Foata normal form. 32/9084 useless extension candidates. Maximal degree in co-relation 74215. Up to 3169 conditions per place. [2025-03-04 02:19:26,326 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 359 selfloop transitions, 318 changer transitions 1/681 dead transitions. [2025-03-04 02:19:26,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 681 transitions, 19177 flow [2025-03-04 02:19:26,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:19:26,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 02:19:26,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 188 transitions. [2025-03-04 02:19:26,327 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5164835164835165 [2025-03-04 02:19:26,327 INFO L175 Difference]: Start difference. First operand has 389 places, 604 transitions, 16971 flow. Second operand 13 states and 188 transitions. [2025-03-04 02:19:26,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 681 transitions, 19177 flow [2025-03-04 02:19:27,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 681 transitions, 18808 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 02:19:27,354 INFO L231 Difference]: Finished difference. Result has 394 places, 612 transitions, 17812 flow [2025-03-04 02:19:27,354 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=16623, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=310, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=17812, PETRI_PLACES=394, PETRI_TRANSITIONS=612} [2025-03-04 02:19:27,354 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 368 predicate places. [2025-03-04 02:19:27,354 INFO L471 AbstractCegarLoop]: Abstraction has has 394 places, 612 transitions, 17812 flow [2025-03-04 02:19:27,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:27,354 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:27,354 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:27,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 02:19:27,555 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,SelfDestructingSolverStorable46 [2025-03-04 02:19:27,555 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:27,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:27,556 INFO L85 PathProgramCache]: Analyzing trace with hash 274806829, now seen corresponding path program 7 times [2025-03-04 02:19:27,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:27,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609064247] [2025-03-04 02:19:27,556 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:19:27,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:27,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:19:27,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:19:27,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:19:27,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:27,813 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:19:27,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:27,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609064247] [2025-03-04 02:19:27,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609064247] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:19:27,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686831772] [2025-03-04 02:19:27,813 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:19:27,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:27,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:19:27,816 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:19:27,817 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:19:27,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:19:27,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:19:27,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:19:27,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:27,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 02:19:27,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:19:27,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:19:27,994 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 118 treesize of output 74 [2025-03-04 02:19:28,015 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:19:28,015 INFO L312 TraceCheckSpWp]: Computing backward predicates...