./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-sorted.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 39e987e3198040ef6af9e29359b0ab7bee89306d1945f6e4e7a9286ebbe2a705 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:49:27,080 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:49:27,140 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:49:27,147 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:49:27,148 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:49:27,167 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:49:27,169 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:49:27,169 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:49:27,169 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:49:27,169 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:49:27,169 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:49:27,170 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:49:27,170 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:49:27,170 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:49:27,170 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:49:27,170 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:49:27,170 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:49:27,170 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:49:27,170 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:49:27,170 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:49:27,170 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:49:27,170 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:49:27,170 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:49:27,170 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:49:27,170 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:49:27,170 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:49:27,170 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:49:27,170 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:49:27,171 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:49:27,171 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:49:27,171 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:49:27,171 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:49:27,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:49:27,171 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:49:27,171 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:49:27,171 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:49:27,171 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:49:27,171 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:49:27,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:49:27,171 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:49:27,171 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:49:27,171 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:49:27,171 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:49:27,173 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 -> 39e987e3198040ef6af9e29359b0ab7bee89306d1945f6e4e7a9286ebbe2a705 [2025-03-13 21:49:27,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:49:27,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:49:27,367 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:49:27,367 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:49:27,368 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:49:27,368 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c [2025-03-13 21:49:28,464 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60ae17a58/3273986b52374567aaeb30f9bfa3749b/FLAG72d5876e5 [2025-03-13 21:49:28,686 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:49:28,706 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c [2025-03-13 21:49:28,717 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60ae17a58/3273986b52374567aaeb30f9bfa3749b/FLAG72d5876e5 [2025-03-13 21:49:28,733 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60ae17a58/3273986b52374567aaeb30f9bfa3749b [2025-03-13 21:49:28,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:49:28,736 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:49:28,738 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:49:28,738 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:49:28,741 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:49:28,743 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:49:28" (1/1) ... [2025-03-13 21:49:28,744 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12ff6f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:28, skipping insertion in model container [2025-03-13 21:49:28,744 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:49:28" (1/1) ... [2025-03-13 21:49:28,756 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:49:28,868 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c[2473,2486] [2025-03-13 21:49:28,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:49:28,885 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:49:28,897 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c[2473,2486] [2025-03-13 21:49:28,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:49:28,909 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:49:28,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:28 WrapperNode [2025-03-13 21:49:28,909 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:49:28,911 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:49:28,911 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:49:28,911 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:49:28,915 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:28" (1/1) ... [2025-03-13 21:49:28,921 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:28" (1/1) ... [2025-03-13 21:49:28,938 INFO L138 Inliner]: procedures = 23, calls = 22, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 87 [2025-03-13 21:49:28,941 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:49:28,941 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:49:28,941 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:49:28,941 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:49:28,949 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:28" (1/1) ... [2025-03-13 21:49:28,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:28" (1/1) ... [2025-03-13 21:49:28,956 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:28" (1/1) ... [2025-03-13 21:49:28,971 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-13 21:49:28,971 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:28" (1/1) ... [2025-03-13 21:49:28,971 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:28" (1/1) ... [2025-03-13 21:49:28,976 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:28" (1/1) ... [2025-03-13 21:49:28,980 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:28" (1/1) ... [2025-03-13 21:49:28,981 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:28" (1/1) ... [2025-03-13 21:49:28,982 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:28" (1/1) ... [2025-03-13 21:49:28,985 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:49:28,988 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:49:28,988 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:49:28,988 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:49:28,989 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:28" (1/1) ... [2025-03-13 21:49:28,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:49:29,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:29,018 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-13 21:49:29,022 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-13 21:49:29,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:49:29,042 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 21:49:29,042 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 21:49:29,042 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 21:49:29,042 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 21:49:29,042 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-13 21:49:29,042 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-13 21:49:29,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:49:29,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-13 21:49:29,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-13 21:49:29,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-13 21:49:29,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 21:49:29,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:49:29,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:49:29,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-13 21:49:29,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-13 21:49:29,044 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:49:29,139 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:49:29,141 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:49:29,373 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:49:29,374 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:49:29,374 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:49:29,563 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:49:29,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:49:29 BoogieIcfgContainer [2025-03-13 21:49:29,564 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:49:29,565 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:49:29,565 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:49:29,569 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:49:29,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:49:28" (1/3) ... [2025-03-13 21:49:29,569 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@512e2f53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:49:29, skipping insertion in model container [2025-03-13 21:49:29,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:28" (2/3) ... [2025-03-13 21:49:29,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@512e2f53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:49:29, skipping insertion in model container [2025-03-13 21:49:29,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:49:29" (3/3) ... [2025-03-13 21:49:29,571 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-sorted.wvr.c [2025-03-13 21:49:29,580 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:49:29,581 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-sorted.wvr.c that has 4 procedures, 24 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-13 21:49:29,582 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:49:29,637 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-13 21:49:29,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 75 flow [2025-03-13 21:49:29,691 INFO L124 PetriNetUnfolderBase]: 4/24 cut-off events. [2025-03-13 21:49:29,692 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 21:49:29,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 24 events. 4/24 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 14 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2025-03-13 21:49:29,695 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 27 transitions, 75 flow [2025-03-13 21:49:29,700 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 23 transitions, 64 flow [2025-03-13 21:49:29,707 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:49:29,718 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;@7b4d2595, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:49:29,718 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-13 21:49:29,731 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:49:29,731 INFO L124 PetriNetUnfolderBase]: 4/22 cut-off events. [2025-03-13 21:49:29,731 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 21:49:29,731 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:29,732 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-13 21:49:29,733 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:49:29,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:29,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1375377675, now seen corresponding path program 1 times [2025-03-13 21:49:29,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:29,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040208899] [2025-03-13 21:49:29,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:49:29,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:29,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-13 21:49:29,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 21:49:29,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:29,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:30,121 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-13 21:49:30,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:30,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040208899] [2025-03-13 21:49:30,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040208899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:30,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:30,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:49:30,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295642603] [2025-03-13 21:49:30,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:30,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:49:30,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:30,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:49:30,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:49:30,150 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-03-13 21:49:30,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 23 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 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-13 21:49:30,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:30,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-03-13 21:49:30,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:30,287 INFO L124 PetriNetUnfolderBase]: 200/296 cut-off events. [2025-03-13 21:49:30,290 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-03-13 21:49:30,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 635 conditions, 296 events. 200/296 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 685 event pairs, 124 based on Foata normal form. 0/220 useless extension candidates. Maximal degree in co-relation 534. Up to 295 conditions per place. [2025-03-13 21:49:30,295 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 21 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2025-03-13 21:49:30,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 24 transitions, 112 flow [2025-03-13 21:49:30,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:49:30,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:49:30,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2025-03-13 21:49:30,307 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-03-13 21:49:30,308 INFO L175 Difference]: Start difference. First operand has 29 places, 23 transitions, 64 flow. Second operand 3 states and 36 transitions. [2025-03-13 21:49:30,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 24 transitions, 112 flow [2025-03-13 21:49:30,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 24 transitions, 100 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-13 21:49:30,316 INFO L231 Difference]: Finished difference. Result has 26 places, 24 transitions, 64 flow [2025-03-13 21:49:30,318 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=26, PETRI_TRANSITIONS=24} [2025-03-13 21:49:30,321 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, -3 predicate places. [2025-03-13 21:49:30,322 INFO L471 AbstractCegarLoop]: Abstraction has has 26 places, 24 transitions, 64 flow [2025-03-13 21:49:30,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 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-13 21:49:30,323 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:30,323 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] [2025-03-13 21:49:30,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:49:30,324 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:49:30,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:30,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1348069956, now seen corresponding path program 1 times [2025-03-13 21:49:30,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:30,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782130983] [2025-03-13 21:49:30,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:49:30,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:30,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-13 21:49:30,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 21:49:30,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:30,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:30,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:30,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:30,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782130983] [2025-03-13 21:49:30,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782130983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:30,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:30,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:49:30,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270995213] [2025-03-13 21:49:30,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:30,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:49:30,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:30,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:49:30,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:49:30,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-03-13 21:49:30,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 24 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 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-13 21:49:30,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:30,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-03-13 21:49:30,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:30,719 INFO L124 PetriNetUnfolderBase]: 387/568 cut-off events. [2025-03-13 21:49:30,719 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-13 21:49:30,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1167 conditions, 568 events. 387/568 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1767 event pairs, 124 based on Foata normal form. 1/418 useless extension candidates. Maximal degree in co-relation 1156. Up to 352 conditions per place. [2025-03-13 21:49:30,724 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 35 selfloop transitions, 4 changer transitions 1/41 dead transitions. [2025-03-13 21:49:30,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 41 transitions, 183 flow [2025-03-13 21:49:30,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:49:30,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:49:30,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2025-03-13 21:49:30,727 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6419753086419753 [2025-03-13 21:49:30,727 INFO L175 Difference]: Start difference. First operand has 26 places, 24 transitions, 64 flow. Second operand 3 states and 52 transitions. [2025-03-13 21:49:30,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 41 transitions, 183 flow [2025-03-13 21:49:30,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 41 transitions, 179 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-13 21:49:30,728 INFO L231 Difference]: Finished difference. Result has 28 places, 27 transitions, 86 flow [2025-03-13 21:49:30,728 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=28, PETRI_TRANSITIONS=27} [2025-03-13 21:49:30,729 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, -1 predicate places. [2025-03-13 21:49:30,729 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 86 flow [2025-03-13 21:49:30,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 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-13 21:49:30,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:30,729 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-13 21:49:30,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:49:30,729 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:49:30,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:30,730 INFO L85 PathProgramCache]: Analyzing trace with hash 438726264, now seen corresponding path program 1 times [2025-03-13 21:49:30,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:30,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098477710] [2025-03-13 21:49:30,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:49:30,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:30,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-13 21:49:30,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:49:30,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:30,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:30,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:30,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:30,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098477710] [2025-03-13 21:49:30,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098477710] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:30,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763141124] [2025-03-13 21:49:30,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:49:30,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:30,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:30,893 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-13 21:49:30,894 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-13 21:49:30,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-13 21:49:30,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:49:30,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:30,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:30,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 21:49:30,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:31,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:31,117 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:31,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:31,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763141124] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:49:31,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:49:31,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-13 21:49:31,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734700282] [2025-03-13 21:49:31,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:49:31,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-13 21:49:31,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:31,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-13 21:49:31,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-13 21:49:31,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-03-13 21:49:31,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 86 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 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-13 21:49:31,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:31,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-03-13 21:49:31,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:31,389 INFO L124 PetriNetUnfolderBase]: 721/1078 cut-off events. [2025-03-13 21:49:31,389 INFO L125 PetriNetUnfolderBase]: For 235/235 co-relation queries the response was YES. [2025-03-13 21:49:31,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2598 conditions, 1078 events. 721/1078 cut-off events. For 235/235 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3942 event pairs, 417 based on Foata normal form. 42/1120 useless extension candidates. Maximal degree in co-relation 1376. Up to 567 conditions per place. [2025-03-13 21:49:31,394 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 53 selfloop transitions, 6 changer transitions 0/60 dead transitions. [2025-03-13 21:49:31,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 60 transitions, 307 flow [2025-03-13 21:49:31,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:49:31,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:49:31,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2025-03-13 21:49:31,396 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47530864197530864 [2025-03-13 21:49:31,396 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 86 flow. Second operand 6 states and 77 transitions. [2025-03-13 21:49:31,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 60 transitions, 307 flow [2025-03-13 21:49:31,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 60 transitions, 298 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:49:31,397 INFO L231 Difference]: Finished difference. Result has 35 places, 31 transitions, 128 flow [2025-03-13 21:49:31,397 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=128, PETRI_PLACES=35, PETRI_TRANSITIONS=31} [2025-03-13 21:49:31,398 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 6 predicate places. [2025-03-13 21:49:31,398 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 31 transitions, 128 flow [2025-03-13 21:49:31,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 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-13 21:49:31,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:31,398 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-13 21:49:31,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-13 21:49:31,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:31,603 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:49:31,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:31,605 INFO L85 PathProgramCache]: Analyzing trace with hash 40395592, now seen corresponding path program 1 times [2025-03-13 21:49:31,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:31,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844875464] [2025-03-13 21:49:31,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:49:31,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:31,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-13 21:49:31,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:49:31,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:31,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:31,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:31,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:31,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844875464] [2025-03-13 21:49:31,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844875464] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:31,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382004353] [2025-03-13 21:49:31,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:49:31,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:31,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:31,691 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-13 21:49:31,693 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-13 21:49:31,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-13 21:49:31,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:49:31,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:31,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:31,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-13 21:49:31,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:31,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:31,800 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:31,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:31,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382004353] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:49:31,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:49:31,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-13 21:49:31,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879487683] [2025-03-13 21:49:31,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:49:31,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-13 21:49:31,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:31,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-13 21:49:31,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-13 21:49:31,843 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-03-13 21:49:31,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 31 transitions, 128 flow. Second operand has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 12 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:31,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:31,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-03-13 21:49:31,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:32,061 INFO L124 PetriNetUnfolderBase]: 636/970 cut-off events. [2025-03-13 21:49:32,061 INFO L125 PetriNetUnfolderBase]: For 447/447 co-relation queries the response was YES. [2025-03-13 21:49:32,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2487 conditions, 970 events. 636/970 cut-off events. For 447/447 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3624 event pairs, 391 based on Foata normal form. 42/1012 useless extension candidates. Maximal degree in co-relation 1440. Up to 567 conditions per place. [2025-03-13 21:49:32,065 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 51 selfloop transitions, 6 changer transitions 0/58 dead transitions. [2025-03-13 21:49:32,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 58 transitions, 322 flow [2025-03-13 21:49:32,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:49:32,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:49:32,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2025-03-13 21:49:32,066 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47530864197530864 [2025-03-13 21:49:32,066 INFO L175 Difference]: Start difference. First operand has 35 places, 31 transitions, 128 flow. Second operand 6 states and 77 transitions. [2025-03-13 21:49:32,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 58 transitions, 322 flow [2025-03-13 21:49:32,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 58 transitions, 312 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-13 21:49:32,070 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 147 flow [2025-03-13 21:49:32,070 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=147, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2025-03-13 21:49:32,071 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 11 predicate places. [2025-03-13 21:49:32,071 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 147 flow [2025-03-13 21:49:32,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 12 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:32,071 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:32,071 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-13 21:49:32,077 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-13 21:49:32,271 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,SelfDestructingSolverStorable3 [2025-03-13 21:49:32,272 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:49:32,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:32,272 INFO L85 PathProgramCache]: Analyzing trace with hash -836740367, now seen corresponding path program 1 times [2025-03-13 21:49:32,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:32,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983238064] [2025-03-13 21:49:32,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:49:32,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:32,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-13 21:49:32,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:49:32,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:32,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:32,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:32,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:32,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983238064] [2025-03-13 21:49:32,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983238064] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:32,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339849568] [2025-03-13 21:49:32,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:49:32,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:32,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:32,379 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-13 21:49:32,381 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-13 21:49:32,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-13 21:49:32,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:49:32,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:32,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:32,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 21:49:32,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:32,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:32,494 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:32,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:32,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339849568] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:49:32,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:49:32,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-13 21:49:32,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651319852] [2025-03-13 21:49:32,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:49:32,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-13 21:49:32,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:32,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-13 21:49:32,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-13 21:49:32,545 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-03-13 21:49:32,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 147 flow. Second operand has 13 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 0 states have call successors, (0), 0 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-13 21:49:32,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:32,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-03-13 21:49:32,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:32,737 INFO L124 PetriNetUnfolderBase]: 511/785 cut-off events. [2025-03-13 21:49:32,737 INFO L125 PetriNetUnfolderBase]: For 689/689 co-relation queries the response was YES. [2025-03-13 21:49:32,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2252 conditions, 785 events. 511/785 cut-off events. For 689/689 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2742 event pairs, 324 based on Foata normal form. 27/812 useless extension candidates. Maximal degree in co-relation 1590. Up to 567 conditions per place. [2025-03-13 21:49:32,741 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 24 selfloop transitions, 3 changer transitions 24/52 dead transitions. [2025-03-13 21:49:32,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 311 flow [2025-03-13 21:49:32,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:49:32,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:49:32,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2025-03-13 21:49:32,742 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4506172839506173 [2025-03-13 21:49:32,742 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 147 flow. Second operand 6 states and 73 transitions. [2025-03-13 21:49:32,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 311 flow [2025-03-13 21:49:32,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 52 transitions, 304 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-13 21:49:32,744 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 118 flow [2025-03-13 21:49:32,745 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=118, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2025-03-13 21:49:32,745 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 15 predicate places. [2025-03-13 21:49:32,745 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 118 flow [2025-03-13 21:49:32,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 0 states have call successors, (0), 0 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-13 21:49:32,745 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:32,745 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:32,752 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-13 21:49:32,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:32,951 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:49:32,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:32,951 INFO L85 PathProgramCache]: Analyzing trace with hash -264439399, now seen corresponding path program 2 times [2025-03-13 21:49:32,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:32,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7866120] [2025-03-13 21:49:32,952 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:49:32,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:32,958 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:49:32,966 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:49:32,966 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:49:32,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:33,024 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:49:33,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:33,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7866120] [2025-03-13 21:49:33,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7866120] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:33,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114486863] [2025-03-13 21:49:33,024 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:49:33,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:33,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:33,027 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-13 21:49:33,028 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-13 21:49:33,074 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:49:33,093 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:49:33,093 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:49:33,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:33,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-13 21:49:33,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:33,170 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:33,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:33,230 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:33,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114486863] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:33,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-13 21:49:33,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 15 [2025-03-13 21:49:33,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501714703] [2025-03-13 21:49:33,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:33,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 21:49:33,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:33,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 21:49:33,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-03-13 21:49:33,232 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-03-13 21:49:33,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 118 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 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-13 21:49:33,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:33,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-03-13 21:49:33,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:33,404 INFO L124 PetriNetUnfolderBase]: 517/765 cut-off events. [2025-03-13 21:49:33,405 INFO L125 PetriNetUnfolderBase]: For 731/731 co-relation queries the response was YES. [2025-03-13 21:49:33,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2340 conditions, 765 events. 517/765 cut-off events. For 731/731 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2635 event pairs, 150 based on Foata normal form. 14/779 useless extension candidates. Maximal degree in co-relation 2317. Up to 379 conditions per place. [2025-03-13 21:49:33,408 INFO L140 encePairwiseOnDemand]: 19/27 looper letters, 55 selfloop transitions, 10 changer transitions 0/66 dead transitions. [2025-03-13 21:49:33,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 66 transitions, 406 flow [2025-03-13 21:49:33,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-13 21:49:33,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-13 21:49:33,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2025-03-13 21:49:33,409 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41203703703703703 [2025-03-13 21:49:33,409 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 118 flow. Second operand 8 states and 89 transitions. [2025-03-13 21:49:33,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 66 transitions, 406 flow [2025-03-13 21:49:33,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 66 transitions, 332 flow, removed 34 selfloop flow, removed 9 redundant places. [2025-03-13 21:49:33,414 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 149 flow [2025-03-13 21:49:33,414 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=149, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2025-03-13 21:49:33,414 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 10 predicate places. [2025-03-13 21:49:33,414 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 149 flow [2025-03-13 21:49:33,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 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-13 21:49:33,414 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:33,414 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:33,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-13 21:49:33,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:33,615 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:49:33,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:33,615 INFO L85 PathProgramCache]: Analyzing trace with hash 383011149, now seen corresponding path program 3 times [2025-03-13 21:49:33,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:33,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169618723] [2025-03-13 21:49:33,616 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:49:33,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:33,629 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:49:33,643 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:49:33,643 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:49:33,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:33,712 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:49:33,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:33,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169618723] [2025-03-13 21:49:33,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169618723] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:33,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79742196] [2025-03-13 21:49:33,713 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:49:33,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:33,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:33,715 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-13 21:49:33,716 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-13 21:49:33,759 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:49:33,777 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:49:33,777 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:49:33,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:33,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-13 21:49:33,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:33,837 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:33,837 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:33,911 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:33,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79742196] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:33,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-13 21:49:33,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 15 [2025-03-13 21:49:33,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880967976] [2025-03-13 21:49:33,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:33,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 21:49:33,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:33,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 21:49:33,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-03-13 21:49:33,914 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-03-13 21:49:33,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 149 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 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-13 21:49:33,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:33,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-03-13 21:49:33,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:34,101 INFO L124 PetriNetUnfolderBase]: 678/1006 cut-off events. [2025-03-13 21:49:34,102 INFO L125 PetriNetUnfolderBase]: For 907/907 co-relation queries the response was YES. [2025-03-13 21:49:34,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3052 conditions, 1006 events. 678/1006 cut-off events. For 907/907 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3615 event pairs, 240 based on Foata normal form. 12/1018 useless extension candidates. Maximal degree in co-relation 3023. Up to 593 conditions per place. [2025-03-13 21:49:34,107 INFO L140 encePairwiseOnDemand]: 19/27 looper letters, 57 selfloop transitions, 13 changer transitions 0/71 dead transitions. [2025-03-13 21:49:34,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 71 transitions, 447 flow [2025-03-13 21:49:34,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-13 21:49:34,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-13 21:49:34,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 85 transitions. [2025-03-13 21:49:34,109 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39351851851851855 [2025-03-13 21:49:34,109 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 149 flow. Second operand 8 states and 85 transitions. [2025-03-13 21:49:34,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 71 transitions, 447 flow [2025-03-13 21:49:34,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 71 transitions, 410 flow, removed 10 selfloop flow, removed 4 redundant places. [2025-03-13 21:49:34,113 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 206 flow [2025-03-13 21:49:34,113 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=206, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2025-03-13 21:49:34,114 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 16 predicate places. [2025-03-13 21:49:34,115 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 206 flow [2025-03-13 21:49:34,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 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-13 21:49:34,115 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:34,115 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:34,121 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-13 21:49:34,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:34,317 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:49:34,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:34,318 INFO L85 PathProgramCache]: Analyzing trace with hash 512570425, now seen corresponding path program 4 times [2025-03-13 21:49:34,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:34,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084261197] [2025-03-13 21:49:34,318 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:49:34,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:34,328 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:49:34,333 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:49:34,333 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:49:34,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:34,394 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:49:34,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:34,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084261197] [2025-03-13 21:49:34,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084261197] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:34,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645170605] [2025-03-13 21:49:34,395 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:49:34,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:34,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:34,396 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-13 21:49:34,397 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-13 21:49:34,444 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:49:34,464 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:49:34,464 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:49:34,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:34,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-13 21:49:34,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:34,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:34,552 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:34,617 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:34,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645170605] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:34,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-13 21:49:34,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 15 [2025-03-13 21:49:34,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602819567] [2025-03-13 21:49:34,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:34,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 21:49:34,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:34,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 21:49:34,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-03-13 21:49:34,618 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-03-13 21:49:34,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 206 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 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-13 21:49:34,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:34,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-03-13 21:49:34,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:34,816 INFO L124 PetriNetUnfolderBase]: 784/1168 cut-off events. [2025-03-13 21:49:34,816 INFO L125 PetriNetUnfolderBase]: For 1935/1935 co-relation queries the response was YES. [2025-03-13 21:49:34,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4080 conditions, 1168 events. 784/1168 cut-off events. For 1935/1935 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4384 event pairs, 319 based on Foata normal form. 14/1182 useless extension candidates. Maximal degree in co-relation 4048. Up to 820 conditions per place. [2025-03-13 21:49:34,822 INFO L140 encePairwiseOnDemand]: 19/27 looper letters, 56 selfloop transitions, 18 changer transitions 0/75 dead transitions. [2025-03-13 21:49:34,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 75 transitions, 531 flow [2025-03-13 21:49:34,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-13 21:49:34,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-13 21:49:34,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2025-03-13 21:49:34,824 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4027777777777778 [2025-03-13 21:49:34,825 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 206 flow. Second operand 8 states and 87 transitions. [2025-03-13 21:49:34,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 75 transitions, 531 flow [2025-03-13 21:49:34,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 75 transitions, 488 flow, removed 12 selfloop flow, removed 4 redundant places. [2025-03-13 21:49:34,840 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 303 flow [2025-03-13 21:49:34,840 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=303, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2025-03-13 21:49:34,840 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 22 predicate places. [2025-03-13 21:49:34,840 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 303 flow [2025-03-13 21:49:34,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 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-13 21:49:34,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:34,841 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:34,851 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-13 21:49:35,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:35,041 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:49:35,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:35,042 INFO L85 PathProgramCache]: Analyzing trace with hash -824638035, now seen corresponding path program 5 times [2025-03-13 21:49:35,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:35,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059437751] [2025-03-13 21:49:35,042 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:49:35,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:35,048 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:49:35,056 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:49:35,056 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:49:35,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:35,137 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:35,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:35,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059437751] [2025-03-13 21:49:35,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059437751] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:35,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786380181] [2025-03-13 21:49:35,137 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:49:35,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:35,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:35,139 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-13 21:49:35,141 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-13 21:49:35,183 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:49:35,200 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:49:35,200 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:49:35,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:35,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-13 21:49:35,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:35,249 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:49:35,249 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:35,294 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:49:35,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786380181] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:49:35,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:49:35,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-03-13 21:49:35,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744118205] [2025-03-13 21:49:35,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:49:35,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-13 21:49:35,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:35,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-13 21:49:35,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-03-13 21:49:35,295 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-03-13 21:49:35,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 303 flow. Second operand has 14 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 0 states have call successors, (0), 0 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-13 21:49:35,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:35,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-03-13 21:49:35,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:35,717 INFO L124 PetriNetUnfolderBase]: 770/1154 cut-off events. [2025-03-13 21:49:35,717 INFO L125 PetriNetUnfolderBase]: For 3005/3005 co-relation queries the response was YES. [2025-03-13 21:49:35,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4447 conditions, 1154 events. 770/1154 cut-off events. For 3005/3005 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4480 event pairs, 143 based on Foata normal form. 14/1168 useless extension candidates. Maximal degree in co-relation 4412. Up to 385 conditions per place. [2025-03-13 21:49:35,723 INFO L140 encePairwiseOnDemand]: 16/27 looper letters, 92 selfloop transitions, 72 changer transitions 0/165 dead transitions. [2025-03-13 21:49:35,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 165 transitions, 1348 flow [2025-03-13 21:49:35,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-13 21:49:35,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-13 21:49:35,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 187 transitions. [2025-03-13 21:49:35,725 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3645224171539961 [2025-03-13 21:49:35,725 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 303 flow. Second operand 19 states and 187 transitions. [2025-03-13 21:49:35,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 165 transitions, 1348 flow [2025-03-13 21:49:35,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 165 transitions, 1226 flow, removed 18 selfloop flow, removed 5 redundant places. [2025-03-13 21:49:35,733 INFO L231 Difference]: Finished difference. Result has 66 places, 100 transitions, 840 flow [2025-03-13 21:49:35,733 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=840, PETRI_PLACES=66, PETRI_TRANSITIONS=100} [2025-03-13 21:49:35,734 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 37 predicate places. [2025-03-13 21:49:35,734 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 100 transitions, 840 flow [2025-03-13 21:49:35,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 0 states have call successors, (0), 0 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-13 21:49:35,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:35,734 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:35,741 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-13 21:49:35,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:35,935 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:49:35,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:35,935 INFO L85 PathProgramCache]: Analyzing trace with hash -583937171, now seen corresponding path program 6 times [2025-03-13 21:49:35,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:35,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130596522] [2025-03-13 21:49:35,935 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:49:35,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:35,941 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:49:35,946 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:49:35,946 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-13 21:49:35,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:36,012 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:49:36,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:36,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130596522] [2025-03-13 21:49:36,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130596522] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:36,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959657602] [2025-03-13 21:49:36,012 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:49:36,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:36,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:36,014 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-13 21:49:36,015 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-13 21:49:36,062 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:49:36,078 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:49:36,078 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-13 21:49:36,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:36,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-13 21:49:36,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:36,151 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:36,151 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:36,220 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:36,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959657602] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:36,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-13 21:49:36,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 17 [2025-03-13 21:49:36,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857344992] [2025-03-13 21:49:36,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:36,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 21:49:36,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:36,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 21:49:36,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2025-03-13 21:49:36,222 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-03-13 21:49:36,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 100 transitions, 840 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 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-13 21:49:36,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:36,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-03-13 21:49:36,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:36,423 INFO L124 PetriNetUnfolderBase]: 753/1119 cut-off events. [2025-03-13 21:49:36,423 INFO L125 PetriNetUnfolderBase]: For 3218/3218 co-relation queries the response was YES. [2025-03-13 21:49:36,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4779 conditions, 1119 events. 753/1119 cut-off events. For 3218/3218 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4215 event pairs, 234 based on Foata normal form. 12/1131 useless extension candidates. Maximal degree in co-relation 4741. Up to 806 conditions per place. [2025-03-13 21:49:36,428 INFO L140 encePairwiseOnDemand]: 19/27 looper letters, 85 selfloop transitions, 47 changer transitions 0/133 dead transitions. [2025-03-13 21:49:36,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 133 transitions, 1250 flow [2025-03-13 21:49:36,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:49:36,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:49:36,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2025-03-13 21:49:36,429 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39094650205761317 [2025-03-13 21:49:36,429 INFO L175 Difference]: Start difference. First operand has 66 places, 100 transitions, 840 flow. Second operand 9 states and 95 transitions. [2025-03-13 21:49:36,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 133 transitions, 1250 flow [2025-03-13 21:49:36,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 133 transitions, 1113 flow, removed 42 selfloop flow, removed 5 redundant places. [2025-03-13 21:49:36,436 INFO L231 Difference]: Finished difference. Result has 70 places, 104 transitions, 848 flow [2025-03-13 21:49:36,437 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=848, PETRI_PLACES=70, PETRI_TRANSITIONS=104} [2025-03-13 21:49:36,437 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 41 predicate places. [2025-03-13 21:49:36,437 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 104 transitions, 848 flow [2025-03-13 21:49:36,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 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-13 21:49:36,437 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:36,437 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:36,443 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-13 21:49:36,637 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,SelfDestructingSolverStorable9 [2025-03-13 21:49:36,638 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:49:36,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:36,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1757237107, now seen corresponding path program 7 times [2025-03-13 21:49:36,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:36,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13835849] [2025-03-13 21:49:36,639 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:49:36,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:36,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-13 21:49:36,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:49:36,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:36,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:36,738 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:36,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:36,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13835849] [2025-03-13 21:49:36,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13835849] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:36,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619136766] [2025-03-13 21:49:36,739 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:49:36,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:36,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:36,740 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-13 21:49:36,741 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-13 21:49:36,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-13 21:49:36,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:49:36,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:36,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:36,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-13 21:49:36,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:36,869 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:36,869 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:36,950 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:36,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619136766] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:36,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-13 21:49:36,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 18 [2025-03-13 21:49:36,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494078086] [2025-03-13 21:49:36,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:36,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 21:49:36,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:36,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 21:49:36,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2025-03-13 21:49:36,951 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-03-13 21:49:36,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 104 transitions, 848 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 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-13 21:49:36,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:36,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-03-13 21:49:36,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:37,154 INFO L124 PetriNetUnfolderBase]: 736/1084 cut-off events. [2025-03-13 21:49:37,155 INFO L125 PetriNetUnfolderBase]: For 3263/3263 co-relation queries the response was YES. [2025-03-13 21:49:37,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4656 conditions, 1084 events. 736/1084 cut-off events. For 3263/3263 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4021 event pairs, 211 based on Foata normal form. 12/1096 useless extension candidates. Maximal degree in co-relation 4616. Up to 619 conditions per place. [2025-03-13 21:49:37,160 INFO L140 encePairwiseOnDemand]: 19/27 looper letters, 68 selfloop transitions, 51 changer transitions 0/120 dead transitions. [2025-03-13 21:49:37,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 120 transitions, 1122 flow [2025-03-13 21:49:37,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-13 21:49:37,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-13 21:49:37,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 86 transitions. [2025-03-13 21:49:37,161 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39814814814814814 [2025-03-13 21:49:37,161 INFO L175 Difference]: Start difference. First operand has 70 places, 104 transitions, 848 flow. Second operand 8 states and 86 transitions. [2025-03-13 21:49:37,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 120 transitions, 1122 flow [2025-03-13 21:49:37,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 120 transitions, 1016 flow, removed 10 selfloop flow, removed 7 redundant places. [2025-03-13 21:49:37,167 INFO L231 Difference]: Finished difference. Result has 68 places, 100 transitions, 812 flow [2025-03-13 21:49:37,167 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=710, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=812, PETRI_PLACES=68, PETRI_TRANSITIONS=100} [2025-03-13 21:49:37,168 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 39 predicate places. [2025-03-13 21:49:37,168 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 100 transitions, 812 flow [2025-03-13 21:49:37,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 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-13 21:49:37,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:37,168 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:37,174 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-13 21:49:37,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:37,369 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:49:37,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:37,370 INFO L85 PathProgramCache]: Analyzing trace with hash -152755277, now seen corresponding path program 2 times [2025-03-13 21:49:37,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:37,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924768350] [2025-03-13 21:49:37,370 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:49:37,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:37,376 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:49:37,381 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:49:37,382 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:49:37,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:37,432 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:49:37,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:37,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924768350] [2025-03-13 21:49:37,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924768350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:37,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:37,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-13 21:49:37,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868119420] [2025-03-13 21:49:37,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:37,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:49:37,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:37,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:49:37,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:49:37,433 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-03-13 21:49:37,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 100 transitions, 812 flow. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 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-13 21:49:37,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:37,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-03-13 21:49:37,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:37,628 INFO L124 PetriNetUnfolderBase]: 980/1460 cut-off events. [2025-03-13 21:49:37,628 INFO L125 PetriNetUnfolderBase]: For 4390/4390 co-relation queries the response was YES. [2025-03-13 21:49:37,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6028 conditions, 1460 events. 980/1460 cut-off events. For 4390/4390 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 6065 event pairs, 214 based on Foata normal form. 28/1488 useless extension candidates. Maximal degree in co-relation 5988. Up to 814 conditions per place. [2025-03-13 21:49:37,635 INFO L140 encePairwiseOnDemand]: 20/27 looper letters, 160 selfloop transitions, 20 changer transitions 3/184 dead transitions. [2025-03-13 21:49:37,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 184 transitions, 1802 flow [2025-03-13 21:49:37,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:49:37,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:49:37,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2025-03-13 21:49:37,636 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5061728395061729 [2025-03-13 21:49:37,636 INFO L175 Difference]: Start difference. First operand has 68 places, 100 transitions, 812 flow. Second operand 6 states and 82 transitions. [2025-03-13 21:49:37,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 184 transitions, 1802 flow [2025-03-13 21:49:37,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 184 transitions, 1639 flow, removed 5 selfloop flow, removed 7 redundant places. [2025-03-13 21:49:37,643 INFO L231 Difference]: Finished difference. Result has 69 places, 112 transitions, 893 flow [2025-03-13 21:49:37,643 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=893, PETRI_PLACES=69, PETRI_TRANSITIONS=112} [2025-03-13 21:49:37,644 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 40 predicate places. [2025-03-13 21:49:37,644 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 112 transitions, 893 flow [2025-03-13 21:49:37,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 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-13 21:49:37,644 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:37,644 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:37,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 21:49:37,644 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:49:37,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:37,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1081657204, now seen corresponding path program 2 times [2025-03-13 21:49:37,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:37,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470680193] [2025-03-13 21:49:37,645 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:49:37,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:37,649 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:49:37,655 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:49:37,655 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:49:37,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:37,696 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:49:37,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:37,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470680193] [2025-03-13 21:49:37,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470680193] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:37,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301167810] [2025-03-13 21:49:37,697 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:49:37,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:37,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:37,699 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-13 21:49:37,700 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-13 21:49:37,743 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:49:37,759 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:49:37,759 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:49:37,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:37,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-13 21:49:37,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:37,800 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:37,800 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:37,843 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:37,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301167810] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:37,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-13 21:49:37,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 12 [2025-03-13 21:49:37,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088811085] [2025-03-13 21:49:37,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:37,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:49:37,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:37,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:49:37,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-13 21:49:37,844 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-03-13 21:49:37,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 112 transitions, 893 flow. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:37,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:37,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-03-13 21:49:37,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:37,973 INFO L124 PetriNetUnfolderBase]: 721/1054 cut-off events. [2025-03-13 21:49:37,974 INFO L125 PetriNetUnfolderBase]: For 3550/3550 co-relation queries the response was YES. [2025-03-13 21:49:37,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4579 conditions, 1054 events. 721/1054 cut-off events. For 3550/3550 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3844 event pairs, 207 based on Foata normal form. 70/1124 useless extension candidates. Maximal degree in co-relation 4539. Up to 816 conditions per place. [2025-03-13 21:49:37,978 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 114 selfloop transitions, 11 changer transitions 0/126 dead transitions. [2025-03-13 21:49:37,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 126 transitions, 1201 flow [2025-03-13 21:49:37,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:49:37,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:49:37,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2025-03-13 21:49:37,979 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3765432098765432 [2025-03-13 21:49:37,979 INFO L175 Difference]: Start difference. First operand has 69 places, 112 transitions, 893 flow. Second operand 6 states and 61 transitions. [2025-03-13 21:49:37,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 126 transitions, 1201 flow [2025-03-13 21:49:37,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 126 transitions, 1161 flow, removed 15 selfloop flow, removed 4 redundant places. [2025-03-13 21:49:37,986 INFO L231 Difference]: Finished difference. Result has 68 places, 101 transitions, 754 flow [2025-03-13 21:49:37,987 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=754, PETRI_PLACES=68, PETRI_TRANSITIONS=101} [2025-03-13 21:49:37,987 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 39 predicate places. [2025-03-13 21:49:37,988 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 101 transitions, 754 flow [2025-03-13 21:49:37,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:37,988 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:37,988 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:37,993 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-13 21:49:38,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-13 21:49:38,188 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:49:38,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:38,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1238676715, now seen corresponding path program 1 times [2025-03-13 21:49:38,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:38,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852089161] [2025-03-13 21:49:38,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:49:38,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:38,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-13 21:49:38,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:49:38,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:38,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:39,390 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:39,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:39,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852089161] [2025-03-13 21:49:39,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852089161] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:39,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799580998] [2025-03-13 21:49:39,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:49:39,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:39,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:39,393 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-13 21:49:39,395 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-13 21:49:39,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-13 21:49:39,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:49:39,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:39,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:39,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-13 21:49:39,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:39,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-13 21:49:39,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:49:39,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 32 [2025-03-13 21:49:39,952 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:39,952 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:41,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 56 [2025-03-13 21:49:41,199 INFO L349 Elim1Store]: treesize reduction 23, result has 34.3 percent of original size [2025-03-13 21:49:41,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 122 treesize of output 95 [2025-03-13 21:49:41,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 56 [2025-03-13 21:49:41,261 INFO L349 Elim1Store]: treesize reduction 34, result has 2.9 percent of original size [2025-03-13 21:49:41,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 118 treesize of output 1 [2025-03-13 21:49:41,298 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:41,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799580998] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:49:41,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:49:41,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 27 [2025-03-13 21:49:41,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005978679] [2025-03-13 21:49:41,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:49:41,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-13 21:49:41,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:41,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-13 21:49:41,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2025-03-13 21:49:41,300 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-03-13 21:49:41,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 101 transitions, 754 flow. Second operand has 28 states, 28 states have (on average 6.357142857142857) internal successors, (178), 28 states have internal predecessors, (178), 0 states have call successors, (0), 0 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-13 21:49:41,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:41,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-03-13 21:49:41,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:46,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 21:49:46,736 INFO L124 PetriNetUnfolderBase]: 1831/2662 cut-off events. [2025-03-13 21:49:46,736 INFO L125 PetriNetUnfolderBase]: For 6967/6967 co-relation queries the response was YES. [2025-03-13 21:49:46,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11424 conditions, 2662 events. 1831/2662 cut-off events. For 6967/6967 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 11614 event pairs, 197 based on Foata normal form. 1/2663 useless extension candidates. Maximal degree in co-relation 7529. Up to 1051 conditions per place. [2025-03-13 21:49:46,748 INFO L140 encePairwiseOnDemand]: 17/27 looper letters, 261 selfloop transitions, 120 changer transitions 1/383 dead transitions. [2025-03-13 21:49:46,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 383 transitions, 3662 flow [2025-03-13 21:49:46,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-13 21:49:46,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-13 21:49:46,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 185 transitions. [2025-03-13 21:49:46,750 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4894179894179894 [2025-03-13 21:49:46,750 INFO L175 Difference]: Start difference. First operand has 68 places, 101 transitions, 754 flow. Second operand 14 states and 185 transitions. [2025-03-13 21:49:46,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 383 transitions, 3662 flow [2025-03-13 21:49:46,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 383 transitions, 3612 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:49:46,764 INFO L231 Difference]: Finished difference. Result has 82 places, 197 transitions, 1966 flow [2025-03-13 21:49:46,764 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1966, PETRI_PLACES=82, PETRI_TRANSITIONS=197} [2025-03-13 21:49:46,765 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 53 predicate places. [2025-03-13 21:49:46,765 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 197 transitions, 1966 flow [2025-03-13 21:49:46,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.357142857142857) internal successors, (178), 28 states have internal predecessors, (178), 0 states have call successors, (0), 0 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-13 21:49:46,765 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:46,765 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:46,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-13 21:49:46,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-13 21:49:46,969 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:49:46,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:46,969 INFO L85 PathProgramCache]: Analyzing trace with hash 382942184, now seen corresponding path program 1 times [2025-03-13 21:49:46,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:46,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348058401] [2025-03-13 21:49:46,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:49:46,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:46,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-13 21:49:46,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:49:46,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:46,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:47,731 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:47,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:47,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348058401] [2025-03-13 21:49:47,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348058401] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:47,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915410811] [2025-03-13 21:49:47,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:49:47,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:47,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:47,734 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-13 21:49:47,736 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-13 21:49:47,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-13 21:49:47,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:49:47,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:47,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:47,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-13 21:49:47,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:47,956 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:49:47,957 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 72 treesize of output 32 [2025-03-13 21:49:48,017 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:49:48,017 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:48,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:49:48,274 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 142 treesize of output 127 [2025-03-13 21:49:48,670 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:49:48,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915410811] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:49:48,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:49:48,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 20 [2025-03-13 21:49:48,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363905321] [2025-03-13 21:49:48,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:49:48,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-13 21:49:48,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:48,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-13 21:49:48,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2025-03-13 21:49:48,671 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-03-13 21:49:48,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 197 transitions, 1966 flow. Second operand has 20 states, 20 states have (on average 7.1) internal successors, (142), 20 states have internal predecessors, (142), 0 states have call successors, (0), 0 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-13 21:49:48,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:48,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-03-13 21:49:48,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:49,225 INFO L124 PetriNetUnfolderBase]: 2303/3319 cut-off events. [2025-03-13 21:49:49,226 INFO L125 PetriNetUnfolderBase]: For 12496/12496 co-relation queries the response was YES. [2025-03-13 21:49:49,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16427 conditions, 3319 events. 2303/3319 cut-off events. For 12496/12496 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 14760 event pairs, 317 based on Foata normal form. 2/3321 useless extension candidates. Maximal degree in co-relation 15127. Up to 2610 conditions per place. [2025-03-13 21:49:49,240 INFO L140 encePairwiseOnDemand]: 17/27 looper letters, 200 selfloop transitions, 140 changer transitions 1/342 dead transitions. [2025-03-13 21:49:49,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 342 transitions, 3955 flow [2025-03-13 21:49:49,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-13 21:49:49,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-13 21:49:49,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2025-03-13 21:49:49,241 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44074074074074077 [2025-03-13 21:49:49,241 INFO L175 Difference]: Start difference. First operand has 82 places, 197 transitions, 1966 flow. Second operand 10 states and 119 transitions. [2025-03-13 21:49:49,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 342 transitions, 3955 flow [2025-03-13 21:49:49,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 342 transitions, 3730 flow, removed 74 selfloop flow, removed 4 redundant places. [2025-03-13 21:49:49,271 INFO L231 Difference]: Finished difference. Result has 91 places, 280 transitions, 3096 flow [2025-03-13 21:49:49,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=1799, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3096, PETRI_PLACES=91, PETRI_TRANSITIONS=280} [2025-03-13 21:49:49,272 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 62 predicate places. [2025-03-13 21:49:49,272 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 280 transitions, 3096 flow [2025-03-13 21:49:49,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.1) internal successors, (142), 20 states have internal predecessors, (142), 0 states have call successors, (0), 0 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-13 21:49:49,272 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:49,272 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:49,279 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-13 21:49:49,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-13 21:49:49,477 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:49:49,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:49,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1226468367, now seen corresponding path program 2 times [2025-03-13 21:49:49,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:49,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151352793] [2025-03-13 21:49:49,478 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:49:49,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:49,485 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-13 21:49:49,504 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:49:49,505 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:49:49,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:50,136 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:50,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:50,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151352793] [2025-03-13 21:49:50,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151352793] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:50,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458050525] [2025-03-13 21:49:50,136 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:49:50,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:50,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:50,138 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-13 21:49:50,140 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-13 21:49:50,187 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-13 21:49:50,213 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:49:50,213 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:49:50,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:50,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-13 21:49:50,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:50,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-13 21:49:50,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:49:50,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 32 [2025-03-13 21:49:50,555 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:50,555 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:51,448 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:49:51,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458050525] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:49:51,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:49:51,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 10] total 31 [2025-03-13 21:49:51,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493462029] [2025-03-13 21:49:51,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:49:51,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-13 21:49:51,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:51,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-13 21:49:51,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=766, Unknown=0, NotChecked=0, Total=930 [2025-03-13 21:49:51,449 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-03-13 21:49:51,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 280 transitions, 3096 flow. Second operand has 31 states, 31 states have (on average 6.096774193548387) internal successors, (189), 31 states have internal predecessors, (189), 0 states have call successors, (0), 0 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-13 21:49:51,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:51,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-03-13 21:49:51,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:52,655 INFO L124 PetriNetUnfolderBase]: 2677/3931 cut-off events. [2025-03-13 21:49:52,655 INFO L125 PetriNetUnfolderBase]: For 18207/18207 co-relation queries the response was YES. [2025-03-13 21:49:52,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21046 conditions, 3931 events. 2677/3931 cut-off events. For 18207/18207 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 18837 event pairs, 272 based on Foata normal form. 2/3933 useless extension candidates. Maximal degree in co-relation 19639. Up to 3129 conditions per place. [2025-03-13 21:49:52,676 INFO L140 encePairwiseOnDemand]: 15/27 looper letters, 262 selfloop transitions, 156 changer transitions 4/423 dead transitions. [2025-03-13 21:49:52,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 423 transitions, 5120 flow [2025-03-13 21:49:52,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-13 21:49:52,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-13 21:49:52,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 196 transitions. [2025-03-13 21:49:52,677 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3820662768031189 [2025-03-13 21:49:52,677 INFO L175 Difference]: Start difference. First operand has 91 places, 280 transitions, 3096 flow. Second operand 19 states and 196 transitions. [2025-03-13 21:49:52,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 423 transitions, 5120 flow [2025-03-13 21:49:52,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 423 transitions, 5061 flow, removed 26 selfloop flow, removed 3 redundant places. [2025-03-13 21:49:52,732 INFO L231 Difference]: Finished difference. Result has 113 places, 348 transitions, 4256 flow [2025-03-13 21:49:52,732 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=3037, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=4256, PETRI_PLACES=113, PETRI_TRANSITIONS=348} [2025-03-13 21:49:52,733 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 84 predicate places. [2025-03-13 21:49:52,734 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 348 transitions, 4256 flow [2025-03-13 21:49:52,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 6.096774193548387) internal successors, (189), 31 states have internal predecessors, (189), 0 states have call successors, (0), 0 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-13 21:49:52,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:52,734 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:52,740 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-13 21:49:52,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-13 21:49:52,935 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:49:52,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:52,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1664187630, now seen corresponding path program 2 times [2025-03-13 21:49:52,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:52,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481332717] [2025-03-13 21:49:52,935 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:49:52,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:52,940 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-13 21:49:52,957 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:49:52,957 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:49:52,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:53,565 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:53,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:53,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481332717] [2025-03-13 21:49:53,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481332717] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:53,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911982528] [2025-03-13 21:49:53,566 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:49:53,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:53,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:53,568 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-13 21:49:53,570 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-13 21:49:53,619 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-13 21:49:53,643 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:49:53,643 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:49:53,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:53,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-13 21:49:53,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:53,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:49:53,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 31 [2025-03-13 21:49:53,799 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:49:53,799 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:54,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:49:54,061 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 133 treesize of output 130 [2025-03-13 21:49:54,373 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:49:54,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911982528] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:49:54,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:49:54,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 16 [2025-03-13 21:49:54,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722166118] [2025-03-13 21:49:54,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:49:54,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-13 21:49:54,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:54,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-13 21:49:54,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-03-13 21:49:54,374 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-03-13 21:49:54,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 348 transitions, 4256 flow. Second operand has 16 states, 16 states have (on average 7.375) internal successors, (118), 16 states have internal predecessors, (118), 0 states have call successors, (0), 0 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-13 21:49:54,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:54,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-03-13 21:49:54,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:55,259 INFO L124 PetriNetUnfolderBase]: 3225/4716 cut-off events. [2025-03-13 21:49:55,259 INFO L125 PetriNetUnfolderBase]: For 26027/26027 co-relation queries the response was YES. [2025-03-13 21:49:55,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27148 conditions, 4716 events. 3225/4716 cut-off events. For 26027/26027 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 23186 event pairs, 287 based on Foata normal form. 2/4718 useless extension candidates. Maximal degree in co-relation 26923. Up to 3235 conditions per place. [2025-03-13 21:49:55,281 INFO L140 encePairwiseOnDemand]: 17/27 looper letters, 224 selfloop transitions, 282 changer transitions 1/508 dead transitions. [2025-03-13 21:49:55,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 508 transitions, 6910 flow [2025-03-13 21:49:55,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-13 21:49:55,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-13 21:49:55,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2025-03-13 21:49:55,282 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4740740740740741 [2025-03-13 21:49:55,282 INFO L175 Difference]: Start difference. First operand has 113 places, 348 transitions, 4256 flow. Second operand 10 states and 128 transitions. [2025-03-13 21:49:55,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 508 transitions, 6910 flow [2025-03-13 21:49:55,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 508 transitions, 6649 flow, removed 67 selfloop flow, removed 5 redundant places. [2025-03-13 21:49:55,387 INFO L231 Difference]: Finished difference. Result has 121 places, 423 transitions, 5840 flow [2025-03-13 21:49:55,388 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=4005, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=224, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5840, PETRI_PLACES=121, PETRI_TRANSITIONS=423} [2025-03-13 21:49:55,388 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 92 predicate places. [2025-03-13 21:49:55,388 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 423 transitions, 5840 flow [2025-03-13 21:49:55,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.375) internal successors, (118), 16 states have internal predecessors, (118), 0 states have call successors, (0), 0 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-13 21:49:55,389 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:55,389 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:55,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-13 21:49:55,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:55,593 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:49:55,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:55,593 INFO L85 PathProgramCache]: Analyzing trace with hash -743443999, now seen corresponding path program 3 times [2025-03-13 21:49:55,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:55,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194538677] [2025-03-13 21:49:55,593 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:49:55,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:55,598 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-03-13 21:49:55,607 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:49:55,607 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:49:55,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:56,290 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:56,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:56,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194538677] [2025-03-13 21:49:56,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194538677] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:56,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365246273] [2025-03-13 21:49:56,291 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:49:56,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:56,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:56,293 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:49:56,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-13 21:49:56,348 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-03-13 21:49:56,374 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:49:56,374 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:49:56,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:56,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-13 21:49:56,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:56,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-13 21:49:56,603 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:49:56,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 66 [2025-03-13 21:49:57,015 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:57,015 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:50:02,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 56 [2025-03-13 21:50:02,151 INFO L349 Elim1Store]: treesize reduction 21, result has 40.0 percent of original size [2025-03-13 21:50:02,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 118 treesize of output 93 [2025-03-13 21:50:02,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 56 [2025-03-13 21:50:02,186 INFO L349 Elim1Store]: treesize reduction 34, result has 2.9 percent of original size [2025-03-13 21:50:02,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 122 treesize of output 1 [2025-03-13 21:50:02,239 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:02,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365246273] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:50:02,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:50:02,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 33 [2025-03-13 21:50:02,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835977299] [2025-03-13 21:50:02,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:50:02,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-13 21:50:02,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:02,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-13 21:50:02,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=935, Unknown=1, NotChecked=0, Total=1122 [2025-03-13 21:50:02,240 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-03-13 21:50:02,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 423 transitions, 5840 flow. Second operand has 34 states, 34 states have (on average 5.9411764705882355) internal successors, (202), 34 states have internal predecessors, (202), 0 states have call successors, (0), 0 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-13 21:50:02,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:02,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-03-13 21:50:02,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:06,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 21:50:11,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 21:50:16,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 21:50:22,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 21:50:25,498 INFO L124 PetriNetUnfolderBase]: 6165/9277 cut-off events. [2025-03-13 21:50:25,498 INFO L125 PetriNetUnfolderBase]: For 63760/63760 co-relation queries the response was YES. [2025-03-13 21:50:25,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55631 conditions, 9277 events. 6165/9277 cut-off events. For 63760/63760 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 54094 event pairs, 255 based on Foata normal form. 6/9283 useless extension candidates. Maximal degree in co-relation 55195. Up to 4315 conditions per place. [2025-03-13 21:50:25,549 INFO L140 encePairwiseOnDemand]: 13/27 looper letters, 356 selfloop transitions, 745 changer transitions 14/1116 dead transitions. [2025-03-13 21:50:25,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 1116 transitions, 15260 flow [2025-03-13 21:50:25,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-03-13 21:50:25,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2025-03-13 21:50:25,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 689 transitions. [2025-03-13 21:50:25,552 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39872685185185186 [2025-03-13 21:50:25,552 INFO L175 Difference]: Start difference. First operand has 121 places, 423 transitions, 5840 flow. Second operand 64 states and 689 transitions. [2025-03-13 21:50:25,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 1116 transitions, 15260 flow [2025-03-13 21:50:25,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 1116 transitions, 14643 flow, removed 305 selfloop flow, removed 3 redundant places. [2025-03-13 21:50:25,943 INFO L231 Difference]: Finished difference. Result has 206 places, 884 transitions, 13650 flow [2025-03-13 21:50:25,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=5593, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=348, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=64, PETRI_FLOW=13650, PETRI_PLACES=206, PETRI_TRANSITIONS=884} [2025-03-13 21:50:25,944 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 177 predicate places. [2025-03-13 21:50:25,944 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 884 transitions, 13650 flow [2025-03-13 21:50:25,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.9411764705882355) internal successors, (202), 34 states have internal predecessors, (202), 0 states have call successors, (0), 0 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-13 21:50:25,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:25,944 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:50:25,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-13 21:50:26,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-13 21:50:26,145 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:50:26,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:26,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1165254193, now seen corresponding path program 4 times [2025-03-13 21:50:26,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:26,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573773963] [2025-03-13 21:50:26,146 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:50:26,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:26,151 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-13 21:50:26,165 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:50:26,165 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:50:26,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:26,874 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:50:26,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:26,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573773963] [2025-03-13 21:50:26,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573773963] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:50:26,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446998109] [2025-03-13 21:50:26,875 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:50:26,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:26,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:50:26,877 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:50:26,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-13 21:50:26,937 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-13 21:50:26,966 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:50:26,966 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:50:26,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:26,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-13 21:50:26,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:50:27,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-13 21:50:27,292 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:50:27,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 32 [2025-03-13 21:50:27,358 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:27,358 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:50:28,249 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:50:28,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446998109] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:50:28,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:50:28,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 26 [2025-03-13 21:50:28,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510986422] [2025-03-13 21:50:28,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:50:28,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-13 21:50:28,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:28,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-13 21:50:28,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2025-03-13 21:50:28,251 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-03-13 21:50:28,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 884 transitions, 13650 flow. Second operand has 26 states, 26 states have (on average 6.461538461538462) internal successors, (168), 26 states have internal predecessors, (168), 0 states have call successors, (0), 0 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-13 21:50:28,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:28,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-03-13 21:50:28,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:30,375 INFO L124 PetriNetUnfolderBase]: 6207/9373 cut-off events. [2025-03-13 21:50:30,375 INFO L125 PetriNetUnfolderBase]: For 81765/81765 co-relation queries the response was YES. [2025-03-13 21:50:30,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64640 conditions, 9373 events. 6207/9373 cut-off events. For 81765/81765 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 55180 event pairs, 661 based on Foata normal form. 2/9375 useless extension candidates. Maximal degree in co-relation 64073. Up to 7592 conditions per place. [2025-03-13 21:50:30,448 INFO L140 encePairwiseOnDemand]: 16/27 looper letters, 502 selfloop transitions, 455 changer transitions 1/959 dead transitions. [2025-03-13 21:50:30,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 959 transitions, 16333 flow [2025-03-13 21:50:30,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-13 21:50:30,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-13 21:50:30,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 146 transitions. [2025-03-13 21:50:30,450 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41595441595441596 [2025-03-13 21:50:30,450 INFO L175 Difference]: Start difference. First operand has 206 places, 884 transitions, 13650 flow. Second operand 13 states and 146 transitions. [2025-03-13 21:50:30,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 959 transitions, 16333 flow [2025-03-13 21:50:31,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 959 transitions, 14359 flow, removed 885 selfloop flow, removed 6 redundant places. [2025-03-13 21:50:31,374 INFO L231 Difference]: Finished difference. Result has 215 places, 904 transitions, 12961 flow [2025-03-13 21:50:31,374 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=11726, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=884, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=435, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=12961, PETRI_PLACES=215, PETRI_TRANSITIONS=904} [2025-03-13 21:50:31,375 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 186 predicate places. [2025-03-13 21:50:31,375 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 904 transitions, 12961 flow [2025-03-13 21:50:31,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.461538461538462) internal successors, (168), 26 states have internal predecessors, (168), 0 states have call successors, (0), 0 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-13 21:50:31,375 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:31,375 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:50:31,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-13 21:50:31,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:31,576 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:50:31,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:31,576 INFO L85 PathProgramCache]: Analyzing trace with hash 782833394, now seen corresponding path program 3 times [2025-03-13 21:50:31,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:31,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341862111] [2025-03-13 21:50:31,576 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:50:31,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:31,582 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-03-13 21:50:31,594 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:50:31,595 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:50:31,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:32,187 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:32,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:32,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341862111] [2025-03-13 21:50:32,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341862111] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:50:32,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717162374] [2025-03-13 21:50:32,188 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:50:32,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:32,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:50:32,190 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:50:32,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-13 21:50:32,244 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-03-13 21:50:32,266 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:50:32,266 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:50:32,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:32,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-13 21:50:32,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:50:32,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:50:32,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 31 [2025-03-13 21:50:32,446 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:50:32,446 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:50:32,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:50:32,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 142 treesize of output 127 [2025-03-13 21:50:33,054 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:50:33,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717162374] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:50:33,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:50:33,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 17 [2025-03-13 21:50:33,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009745277] [2025-03-13 21:50:33,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:50:33,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-13 21:50:33,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:33,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-13 21:50:33,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-03-13 21:50:33,055 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-03-13 21:50:33,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 904 transitions, 12961 flow. Second operand has 17 states, 17 states have (on average 7.117647058823529) internal successors, (121), 17 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-13 21:50:33,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:33,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-03-13 21:50:33,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:34,746 INFO L124 PetriNetUnfolderBase]: 6387/9629 cut-off events. [2025-03-13 21:50:34,747 INFO L125 PetriNetUnfolderBase]: For 65259/65259 co-relation queries the response was YES. [2025-03-13 21:50:34,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60633 conditions, 9629 events. 6387/9629 cut-off events. For 65259/65259 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 56484 event pairs, 810 based on Foata normal form. 8/9615 useless extension candidates. Maximal degree in co-relation 60130. Up to 8493 conditions per place. [2025-03-13 21:50:34,810 INFO L140 encePairwiseOnDemand]: 17/27 looper letters, 691 selfloop transitions, 283 changer transitions 1/976 dead transitions. [2025-03-13 21:50:34,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 976 transitions, 15644 flow [2025-03-13 21:50:34,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-13 21:50:34,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-13 21:50:34,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2025-03-13 21:50:34,811 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45185185185185184 [2025-03-13 21:50:34,811 INFO L175 Difference]: Start difference. First operand has 215 places, 904 transitions, 12961 flow. Second operand 10 states and 122 transitions. [2025-03-13 21:50:34,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 976 transitions, 15644 flow [2025-03-13 21:50:35,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 976 transitions, 14807 flow, removed 11 selfloop flow, removed 7 redundant places. [2025-03-13 21:50:35,249 INFO L231 Difference]: Finished difference. Result has 219 places, 916 transitions, 13084 flow [2025-03-13 21:50:35,249 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=12120, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=903, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=270, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=620, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=13084, PETRI_PLACES=219, PETRI_TRANSITIONS=916} [2025-03-13 21:50:35,250 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 190 predicate places. [2025-03-13 21:50:35,250 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 916 transitions, 13084 flow [2025-03-13 21:50:35,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.117647058823529) internal successors, (121), 17 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-13 21:50:35,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:35,250 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:50:35,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-13 21:50:35,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:35,451 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:50:35,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:35,451 INFO L85 PathProgramCache]: Analyzing trace with hash 710758484, now seen corresponding path program 4 times [2025-03-13 21:50:35,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:35,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515680299] [2025-03-13 21:50:35,451 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:50:35,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:35,456 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-13 21:50:35,466 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:50:35,466 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:50:35,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:36,141 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:36,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:36,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515680299] [2025-03-13 21:50:36,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515680299] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:50:36,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96324753] [2025-03-13 21:50:36,141 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:50:36,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:36,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:50:36,143 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:50:36,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-13 21:50:36,196 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-13 21:50:36,213 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:50:36,213 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:50:36,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:36,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-13 21:50:36,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:50:36,355 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:50:36,355 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 72 treesize of output 32 [2025-03-13 21:50:36,428 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:50:36,429 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:50:36,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:50:36,726 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 147 treesize of output 132 [2025-03-13 21:50:37,250 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:50:37,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96324753] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:50:37,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:50:37,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 20 [2025-03-13 21:50:37,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73722976] [2025-03-13 21:50:37,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:50:37,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-13 21:50:37,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:37,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-13 21:50:37,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2025-03-13 21:50:37,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-03-13 21:50:37,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 916 transitions, 13084 flow. Second operand has 20 states, 20 states have (on average 7.1) internal successors, (142), 20 states have internal predecessors, (142), 0 states have call successors, (0), 0 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-13 21:50:37,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:37,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-03-13 21:50:37,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:39,497 INFO L124 PetriNetUnfolderBase]: 6955/10451 cut-off events. [2025-03-13 21:50:39,497 INFO L125 PetriNetUnfolderBase]: For 71045/71045 co-relation queries the response was YES. [2025-03-13 21:50:39,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65350 conditions, 10451 events. 6955/10451 cut-off events. For 71045/71045 co-relation queries the response was YES. Maximal size of possible extension queue 608. Compared 62140 event pairs, 864 based on Foata normal form. 6/10435 useless extension candidates. Maximal degree in co-relation 65111. Up to 9433 conditions per place. [2025-03-13 21:50:39,568 INFO L140 encePairwiseOnDemand]: 17/27 looper letters, 774 selfloop transitions, 210 changer transitions 1/986 dead transitions. [2025-03-13 21:50:39,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 986 transitions, 15628 flow [2025-03-13 21:50:39,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-13 21:50:39,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-13 21:50:39,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2025-03-13 21:50:39,569 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-03-13 21:50:39,569 INFO L175 Difference]: Start difference. First operand has 219 places, 916 transitions, 13084 flow. Second operand 10 states and 120 transitions. [2025-03-13 21:50:39,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 986 transitions, 15628 flow [2025-03-13 21:50:40,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 986 transitions, 14855 flow, removed 145 selfloop flow, removed 8 redundant places. [2025-03-13 21:50:40,040 INFO L231 Difference]: Finished difference. Result has 222 places, 942 transitions, 13090 flow [2025-03-13 21:50:40,041 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=12319, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=916, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=184, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=706, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=13090, PETRI_PLACES=222, PETRI_TRANSITIONS=942} [2025-03-13 21:50:40,041 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 193 predicate places. [2025-03-13 21:50:40,041 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 942 transitions, 13090 flow [2025-03-13 21:50:40,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.1) internal successors, (142), 20 states have internal predecessors, (142), 0 states have call successors, (0), 0 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-13 21:50:40,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:40,041 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:50:40,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-13 21:50:40,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:40,242 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:50:40,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:40,242 INFO L85 PathProgramCache]: Analyzing trace with hash 429216943, now seen corresponding path program 5 times [2025-03-13 21:50:40,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:40,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465311591] [2025-03-13 21:50:40,243 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:50:40,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:40,248 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-13 21:50:40,257 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:50:40,258 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:50:40,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:40,877 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:40,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:40,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465311591] [2025-03-13 21:50:40,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465311591] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:50:40,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904195999] [2025-03-13 21:50:40,877 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:50:40,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:40,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:50:40,879 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:50:40,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-13 21:50:40,929 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-13 21:50:40,945 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:50:40,945 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:50:40,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:40,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-13 21:50:40,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:50:40,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-13 21:50:41,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:50:41,131 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 72 treesize of output 32 [2025-03-13 21:50:41,187 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:41,187 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:50:42,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 56 [2025-03-13 21:50:42,292 INFO L349 Elim1Store]: treesize reduction 23, result has 34.3 percent of original size [2025-03-13 21:50:42,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 122 treesize of output 95 [2025-03-13 21:50:42,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 56 [2025-03-13 21:50:42,334 INFO L349 Elim1Store]: treesize reduction 34, result has 2.9 percent of original size [2025-03-13 21:50:42,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 118 treesize of output 1 [2025-03-13 21:50:42,378 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:42,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904195999] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:50:42,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:50:42,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2025-03-13 21:50:42,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394533220] [2025-03-13 21:50:42,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:50:42,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-13 21:50:42,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:42,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-13 21:50:42,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2025-03-13 21:50:42,380 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-03-13 21:50:42,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 942 transitions, 13090 flow. Second operand has 24 states, 24 states have (on average 6.666666666666667) internal successors, (160), 24 states have internal predecessors, (160), 0 states have call successors, (0), 0 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-13 21:50:42,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:42,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-03-13 21:50:42,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:44,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 21:50:49,111 INFO L124 PetriNetUnfolderBase]: 7385/11060 cut-off events. [2025-03-13 21:50:49,111 INFO L125 PetriNetUnfolderBase]: For 75318/75318 co-relation queries the response was YES. [2025-03-13 21:50:49,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68610 conditions, 11060 events. 7385/11060 cut-off events. For 75318/75318 co-relation queries the response was YES. Maximal size of possible extension queue 647. Compared 65965 event pairs, 922 based on Foata normal form. 5/11043 useless extension candidates. Maximal degree in co-relation 68350. Up to 4866 conditions per place. [2025-03-13 21:50:49,178 INFO L140 encePairwiseOnDemand]: 16/27 looper letters, 1031 selfloop transitions, 413 changer transitions 6/1451 dead transitions. [2025-03-13 21:50:49,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 1451 transitions, 21350 flow [2025-03-13 21:50:49,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-13 21:50:49,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-13 21:50:49,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 301 transitions. [2025-03-13 21:50:49,180 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48470209339774556 [2025-03-13 21:50:49,180 INFO L175 Difference]: Start difference. First operand has 222 places, 942 transitions, 13090 flow. Second operand 23 states and 301 transitions. [2025-03-13 21:50:49,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 1451 transitions, 21350 flow [2025-03-13 21:50:49,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 1451 transitions, 20884 flow, removed 30 selfloop flow, removed 7 redundant places. [2025-03-13 21:50:49,682 INFO L231 Difference]: Finished difference. Result has 249 places, 1026 transitions, 14731 flow [2025-03-13 21:50:49,683 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=12677, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=942, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=346, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=14731, PETRI_PLACES=249, PETRI_TRANSITIONS=1026} [2025-03-13 21:50:49,683 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 220 predicate places. [2025-03-13 21:50:49,683 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 1026 transitions, 14731 flow [2025-03-13 21:50:49,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 6.666666666666667) internal successors, (160), 24 states have internal predecessors, (160), 0 states have call successors, (0), 0 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-13 21:50:49,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:49,683 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:50:49,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-13 21:50:49,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:49,884 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:50:49,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:49,884 INFO L85 PathProgramCache]: Analyzing trace with hash -2017187489, now seen corresponding path program 6 times [2025-03-13 21:50:49,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:49,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316403882] [2025-03-13 21:50:49,885 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:50:49,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:49,889 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 2 equivalence classes. [2025-03-13 21:50:49,895 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:50:49,895 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-13 21:50:49,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:50,450 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:50,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:50,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316403882] [2025-03-13 21:50:50,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316403882] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:50:50,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118830613] [2025-03-13 21:50:50,450 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:50:50,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:50,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:50:50,453 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:50:50,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-13 21:50:50,511 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 2 equivalence classes. [2025-03-13 21:50:50,528 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:50:50,529 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-13 21:50:50,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:50,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-13 21:50:50,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:50:50,707 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:50:50,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 32 [2025-03-13 21:50:50,759 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:50:50,759 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:50:50,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:50:50,947 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 137 treesize of output 122 [2025-03-13 21:50:51,599 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:50:51,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118830613] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:50:51,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:50:51,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 24 [2025-03-13 21:50:51,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954169451] [2025-03-13 21:50:51,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:50:51,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-13 21:50:51,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:51,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-13 21:50:51,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2025-03-13 21:50:51,600 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-03-13 21:50:51,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 1026 transitions, 14731 flow. Second operand has 24 states, 24 states have (on average 6.375) internal successors, (153), 24 states have internal predecessors, (153), 0 states have call successors, (0), 0 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-13 21:50:51,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:51,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-03-13 21:50:51,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:53,994 INFO L124 PetriNetUnfolderBase]: 7421/11130 cut-off events. [2025-03-13 21:50:53,994 INFO L125 PetriNetUnfolderBase]: For 83165/83165 co-relation queries the response was YES. [2025-03-13 21:50:54,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71471 conditions, 11130 events. 7421/11130 cut-off events. For 83165/83165 co-relation queries the response was YES. Maximal size of possible extension queue 654. Compared 66700 event pairs, 924 based on Foata normal form. 2/11110 useless extension candidates. Maximal degree in co-relation 71189. Up to 10055 conditions per place. [2025-03-13 21:50:54,081 INFO L140 encePairwiseOnDemand]: 15/27 looper letters, 869 selfloop transitions, 230 changer transitions 2/1102 dead transitions. [2025-03-13 21:50:54,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 1102 transitions, 17588 flow [2025-03-13 21:50:54,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-13 21:50:54,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-13 21:50:54,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 174 transitions. [2025-03-13 21:50:54,082 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4027777777777778 [2025-03-13 21:50:54,082 INFO L175 Difference]: Start difference. First operand has 249 places, 1026 transitions, 14731 flow. Second operand 16 states and 174 transitions. [2025-03-13 21:50:54,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 1102 transitions, 17588 flow [2025-03-13 21:50:54,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 1102 transitions, 17149 flow, removed 127 selfloop flow, removed 7 redundant places. [2025-03-13 21:50:54,748 INFO L231 Difference]: Finished difference. Result has 261 places, 1044 transitions, 15137 flow [2025-03-13 21:50:54,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=14314, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1026, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=212, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=800, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=15137, PETRI_PLACES=261, PETRI_TRANSITIONS=1044} [2025-03-13 21:50:54,749 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 232 predicate places. [2025-03-13 21:50:54,750 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 1044 transitions, 15137 flow [2025-03-13 21:50:54,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 6.375) internal successors, (153), 24 states have internal predecessors, (153), 0 states have call successors, (0), 0 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-13 21:50:54,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:54,751 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:50:54,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-13 21:50:54,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-13 21:50:54,951 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:50:54,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:54,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1947684781, now seen corresponding path program 7 times [2025-03-13 21:50:54,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:54,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805182749] [2025-03-13 21:50:54,952 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:50:54,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:54,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-13 21:50:54,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:50:54,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:50:54,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:55,547 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:55,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:55,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805182749] [2025-03-13 21:50:55,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805182749] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:50:55,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893951428] [2025-03-13 21:50:55,548 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:50:55,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:55,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:50:55,549 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:50:55,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-13 21:50:55,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-13 21:50:55,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:50:55,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:50:55,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:55,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-13 21:50:55,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:50:55,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-13 21:50:55,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:50:55,841 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 72 treesize of output 32 [2025-03-13 21:50:55,891 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:55,891 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:50:56,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 56 [2025-03-13 21:50:56,874 INFO L349 Elim1Store]: treesize reduction 23, result has 34.3 percent of original size [2025-03-13 21:50:56,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 118 treesize of output 91 [2025-03-13 21:50:56,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 56 [2025-03-13 21:50:56,907 INFO L349 Elim1Store]: treesize reduction 34, result has 2.9 percent of original size [2025-03-13 21:50:56,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 122 treesize of output 1 [2025-03-13 21:50:56,950 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:56,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893951428] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:50:56,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:50:56,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2025-03-13 21:50:56,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426045150] [2025-03-13 21:50:56,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:50:56,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-13 21:50:56,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:56,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-13 21:50:56,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2025-03-13 21:50:56,951 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-03-13 21:50:56,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 1044 transitions, 15137 flow. Second operand has 26 states, 26 states have (on average 6.538461538461538) internal successors, (170), 26 states have internal predecessors, (170), 0 states have call successors, (0), 0 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-13 21:50:56,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:56,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-03-13 21:50:56,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand