./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/unroll-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 735b3cc8 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/unroll-3.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 a4cca88acec68e5dbb90cd5700ef248bb5273dc097847f9475a683bfbdc7b189 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:11:20,055 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:11:20,102 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 01:11:20,105 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:11:20,105 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:11:20,122 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:11:20,122 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:11:20,123 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:11:20,123 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 01:11:20,123 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 01:11:20,124 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:11:20,124 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:11:20,124 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:11:20,124 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:11:20,124 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:11:20,125 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:11:20,125 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:11:20,125 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:11:20,125 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:11:20,125 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:11:20,125 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:11:20,125 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:11:20,125 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:11:20,125 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:11:20,125 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:11:20,125 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:11:20,125 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:11:20,125 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:11:20,125 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:11:20,125 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:11:20,126 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 01:11:20,126 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:11:20,126 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:11:20,126 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:11:20,126 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:11:20,126 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:11:20,126 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:11:20,126 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:11:20,126 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:11:20,126 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:11:20,126 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:11:20,126 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:11:20,126 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:11:20,126 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 -> a4cca88acec68e5dbb90cd5700ef248bb5273dc097847f9475a683bfbdc7b189 [2025-03-14 01:11:20,347 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:11:20,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:11:20,359 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:11:20,360 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:11:20,360 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:11:20,361 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/unroll-3.wvr.c [2025-03-14 01:11:21,522 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/facdff680/b5d462d1a51248eb8c2dcca405b06700/FLAG38670326f [2025-03-14 01:11:21,744 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:11:21,746 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/unroll-3.wvr.c [2025-03-14 01:11:21,753 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/facdff680/b5d462d1a51248eb8c2dcca405b06700/FLAG38670326f [2025-03-14 01:11:21,792 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/facdff680/b5d462d1a51248eb8c2dcca405b06700 [2025-03-14 01:11:21,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:11:21,796 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:11:21,797 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:11:21,798 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:11:21,801 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:11:21,802 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:11:21" (1/1) ... [2025-03-14 01:11:21,802 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f794e16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:21, skipping insertion in model container [2025-03-14 01:11:21,802 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:11:21" (1/1) ... [2025-03-14 01:11:21,814 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:11:21,941 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/unroll-3.wvr.c[2526,2539] [2025-03-14 01:11:21,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:11:21,960 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:11:21,972 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/unroll-3.wvr.c[2526,2539] [2025-03-14 01:11:21,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:11:21,984 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:11:21,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:21 WrapperNode [2025-03-14 01:11:21,984 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:11:21,985 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:11:21,985 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:11:21,985 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:11:21,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:21" (1/1) ... [2025-03-14 01:11:21,993 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:21" (1/1) ... [2025-03-14 01:11:22,004 INFO L138 Inliner]: procedures = 23, calls = 24, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 128 [2025-03-14 01:11:22,005 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:11:22,005 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:11:22,005 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:11:22,005 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:11:22,010 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:21" (1/1) ... [2025-03-14 01:11:22,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:21" (1/1) ... [2025-03-14 01:11:22,011 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:21" (1/1) ... [2025-03-14 01:11:22,025 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 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-14 01:11:22,025 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:21" (1/1) ... [2025-03-14 01:11:22,025 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:21" (1/1) ... [2025-03-14 01:11:22,029 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:21" (1/1) ... [2025-03-14 01:11:22,029 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:21" (1/1) ... [2025-03-14 01:11:22,030 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:21" (1/1) ... [2025-03-14 01:11:22,030 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:21" (1/1) ... [2025-03-14 01:11:22,031 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:11:22,032 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:11:22,032 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:11:22,032 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:11:22,033 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:21" (1/1) ... [2025-03-14 01:11:22,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:11:22,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:11:22,054 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-14 01:11:22,058 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-14 01:11:22,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:11:22,073 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 01:11:22,073 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 01:11:22,073 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 01:11:22,073 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 01:11:22,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 01:11:22,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-14 01:11:22,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-14 01:11:22,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-14 01:11:22,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:11:22,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:11:22,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:11:22,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-14 01:11:22,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-14 01:11:22,075 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:11:22,138 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:11:22,140 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:11:22,371 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:11:22,372 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:11:22,372 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:11:22,556 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:11:22,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:11:22 BoogieIcfgContainer [2025-03-14 01:11:22,557 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:11:22,559 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:11:22,560 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:11:22,563 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:11:22,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:11:21" (1/3) ... [2025-03-14 01:11:22,563 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bdab2e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:11:22, skipping insertion in model container [2025-03-14 01:11:22,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:21" (2/3) ... [2025-03-14 01:11:22,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bdab2e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:11:22, skipping insertion in model container [2025-03-14 01:11:22,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:11:22" (3/3) ... [2025-03-14 01:11:22,564 INFO L128 eAbstractionObserver]: Analyzing ICFG unroll-3.wvr.c [2025-03-14 01:11:22,574 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:11:22,575 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unroll-3.wvr.c that has 3 procedures, 18 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-14 01:11:22,575 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:11:22,617 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 01:11:22,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 20 transitions, 54 flow [2025-03-14 01:11:22,661 INFO L124 PetriNetUnfolderBase]: 3/18 cut-off events. [2025-03-14 01:11:22,662 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:11:22,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 18 events. 3/18 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 10 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2025-03-14 01:11:22,666 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 20 transitions, 54 flow [2025-03-14 01:11:22,669 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 17 transitions, 46 flow [2025-03-14 01:11:22,677 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:11:22,684 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;@77a66598, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:11:22,684 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-14 01:11:22,704 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:11:22,704 INFO L124 PetriNetUnfolderBase]: 3/16 cut-off events. [2025-03-14 01:11:22,704 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:11:22,705 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:11:22,705 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:11:22,705 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:11:22,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:11:22,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1905296501, now seen corresponding path program 1 times [2025-03-14 01:11:22,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:11:22,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167993649] [2025-03-14 01:11:22,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:11:22,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:11:22,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-14 01:11:22,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-14 01:11:22,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:11:22,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:11:22,923 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-14 01:11:22,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:11:22,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167993649] [2025-03-14 01:11:22,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167993649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:11:22,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:11:22,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:11:22,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232233573] [2025-03-14 01:11:22,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:11:22,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:11:22,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:11:22,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:11:22,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:11:22,948 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:11:22,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 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-14 01:11:22,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:11:22,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:11:22,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:11:23,029 INFO L124 PetriNetUnfolderBase]: 69/125 cut-off events. [2025-03-14 01:11:23,029 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-14 01:11:23,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 125 events. 69/125 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 315 event pairs, 22 based on Foata normal form. 1/95 useless extension candidates. Maximal degree in co-relation 220. Up to 72 conditions per place. [2025-03-14 01:11:23,032 INFO L140 encePairwiseOnDemand]: 16/20 looper letters, 23 selfloop transitions, 3 changer transitions 1/28 dead transitions. [2025-03-14 01:11:23,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 28 transitions, 131 flow [2025-03-14 01:11:23,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:11:23,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:11:23,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2025-03-14 01:11:23,045 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2025-03-14 01:11:23,046 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 3 states and 37 transitions. [2025-03-14 01:11:23,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 28 transitions, 131 flow [2025-03-14 01:11:23,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 28 transitions, 117 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-14 01:11:23,052 INFO L231 Difference]: Finished difference. Result has 20 places, 19 transitions, 57 flow [2025-03-14 01:11:23,054 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=57, PETRI_PLACES=20, PETRI_TRANSITIONS=19} [2025-03-14 01:11:23,059 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2025-03-14 01:11:23,059 INFO L471 AbstractCegarLoop]: Abstraction has has 20 places, 19 transitions, 57 flow [2025-03-14 01:11:23,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 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-14 01:11:23,062 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:11:23,062 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:11:23,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:11:23,063 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:11:23,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:11:23,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1034973386, now seen corresponding path program 1 times [2025-03-14 01:11:23,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:11:23,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536222830] [2025-03-14 01:11:23,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:11:23,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:11:23,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-14 01:11:23,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-14 01:11:23,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:11:23,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:11:23,285 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-14 01:11:23,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:11:23,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536222830] [2025-03-14 01:11:23,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536222830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:11:23,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:11:23,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:11:23,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869755395] [2025-03-14 01:11:23,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:11:23,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:11:23,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:11:23,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:11:23,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:11:23,289 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:11:23,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 19 transitions, 57 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 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-14 01:11:23,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:11:23,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:11:23,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:11:23,350 INFO L124 PetriNetUnfolderBase]: 69/126 cut-off events. [2025-03-14 01:11:23,350 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-03-14 01:11:23,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 308 conditions, 126 events. 69/126 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 298 event pairs, 44 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 110. Up to 125 conditions per place. [2025-03-14 01:11:23,352 INFO L140 encePairwiseOnDemand]: 17/20 looper letters, 17 selfloop transitions, 2 changer transitions 0/20 dead transitions. [2025-03-14 01:11:23,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 20 transitions, 97 flow [2025-03-14 01:11:23,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:11:23,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:11:23,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2025-03-14 01:11:23,353 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45 [2025-03-14 01:11:23,353 INFO L175 Difference]: Start difference. First operand has 20 places, 19 transitions, 57 flow. Second operand 3 states and 27 transitions. [2025-03-14 01:11:23,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 20 transitions, 97 flow [2025-03-14 01:11:23,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 20 transitions, 94 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:11:23,353 INFO L231 Difference]: Finished difference. Result has 22 places, 20 transitions, 66 flow [2025-03-14 01:11:23,354 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=22, PETRI_TRANSITIONS=20} [2025-03-14 01:11:23,354 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 1 predicate places. [2025-03-14 01:11:23,354 INFO L471 AbstractCegarLoop]: Abstraction has has 22 places, 20 transitions, 66 flow [2025-03-14 01:11:23,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 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-14 01:11:23,354 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:11:23,355 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:11:23,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:11:23,355 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:11:23,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:11:23,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1673572502, now seen corresponding path program 1 times [2025-03-14 01:11:23,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:11:23,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967083745] [2025-03-14 01:11:23,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:11:23,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:11:23,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-14 01:11:23,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 01:11:23,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:11:23,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:11:23,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:11:23,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:11:23,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967083745] [2025-03-14 01:11:23,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967083745] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:11:23,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385223782] [2025-03-14 01:11:23,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:11:23,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:11:23,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:11:23,579 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-14 01:11:23,580 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-14 01:11:23,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-14 01:11:23,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 01:11:23,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:11:23,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:11:23,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-14 01:11:23,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:11:23,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:11:23,703 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:11:23,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:11:23,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385223782] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 01:11:23,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 01:11:23,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2025-03-14 01:11:23,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392562700] [2025-03-14 01:11:23,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:11:23,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:11:23,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:11:23,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:11:23,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:11:23,749 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:11:23,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 20 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 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-14 01:11:23,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:11:23,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:11:23,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:11:23,832 INFO L124 PetriNetUnfolderBase]: 76/138 cut-off events. [2025-03-14 01:11:23,832 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-14 01:11:23,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330 conditions, 138 events. 76/138 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 22 based on Foata normal form. 5/142 useless extension candidates. Maximal degree in co-relation 317. Up to 71 conditions per place. [2025-03-14 01:11:23,833 INFO L140 encePairwiseOnDemand]: 16/20 looper letters, 28 selfloop transitions, 4 changer transitions 1/34 dead transitions. [2025-03-14 01:11:23,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 34 transitions, 168 flow [2025-03-14 01:11:23,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 01:11:23,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 01:11:23,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2025-03-14 01:11:23,834 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5625 [2025-03-14 01:11:23,834 INFO L175 Difference]: Start difference. First operand has 22 places, 20 transitions, 66 flow. Second operand 4 states and 45 transitions. [2025-03-14 01:11:23,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 34 transitions, 168 flow [2025-03-14 01:11:23,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 34 transitions, 164 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-14 01:11:23,836 INFO L231 Difference]: Finished difference. Result has 26 places, 22 transitions, 88 flow [2025-03-14 01:11:23,836 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=88, PETRI_PLACES=26, PETRI_TRANSITIONS=22} [2025-03-14 01:11:23,836 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2025-03-14 01:11:23,836 INFO L471 AbstractCegarLoop]: Abstraction has has 26 places, 22 transitions, 88 flow [2025-03-14 01:11:23,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 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-14 01:11:23,837 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:11:23,837 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:11:23,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-14 01:11:24,041 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-14 01:11:24,041 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:11:24,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:11:24,042 INFO L85 PathProgramCache]: Analyzing trace with hash 536772906, now seen corresponding path program 2 times [2025-03-14 01:11:24,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:11:24,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630987138] [2025-03-14 01:11:24,042 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:11:24,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:11:24,048 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-14 01:11:24,072 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 01:11:24,072 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:11:24,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:11:24,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:11:24,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:11:24,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630987138] [2025-03-14 01:11:24,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630987138] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:11:24,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178698460] [2025-03-14 01:11:24,318 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:11:24,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:11:24,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:11:24,320 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-14 01:11:24,322 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-14 01:11:24,359 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-14 01:11:24,376 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 01:11:24,376 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:11:24,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:11:24,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-14 01:11:24,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:11:25,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:11:25,056 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 01:11:25,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178698460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:11:25,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 01:11:25,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-14 01:11:25,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425546235] [2025-03-14 01:11:25,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:11:25,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:11:25,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:11:25,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:11:25,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-14 01:11:25,058 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:11:25,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 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-14 01:11:25,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:11:25,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:11:25,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:11:25,160 INFO L124 PetriNetUnfolderBase]: 93/179 cut-off events. [2025-03-14 01:11:25,161 INFO L125 PetriNetUnfolderBase]: For 165/165 co-relation queries the response was YES. [2025-03-14 01:11:25,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 495 conditions, 179 events. 93/179 cut-off events. For 165/165 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 592 event pairs, 24 based on Foata normal form. 11/189 useless extension candidates. Maximal degree in co-relation 476. Up to 95 conditions per place. [2025-03-14 01:11:25,162 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 31 selfloop transitions, 7 changer transitions 10/49 dead transitions. [2025-03-14 01:11:25,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 49 transitions, 279 flow [2025-03-14 01:11:25,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:11:25,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:11:25,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2025-03-14 01:11:25,164 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.525 [2025-03-14 01:11:25,164 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 88 flow. Second operand 6 states and 63 transitions. [2025-03-14 01:11:25,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 49 transitions, 279 flow [2025-03-14 01:11:25,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 49 transitions, 272 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-14 01:11:25,166 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 150 flow [2025-03-14 01:11:25,166 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=150, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2025-03-14 01:11:25,166 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 13 predicate places. [2025-03-14 01:11:25,166 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 150 flow [2025-03-14 01:11:25,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 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-14 01:11:25,166 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:11:25,166 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:11:25,173 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-14 01:11:25,367 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-14 01:11:25,367 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:11:25,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:11:25,368 INFO L85 PathProgramCache]: Analyzing trace with hash -481253712, now seen corresponding path program 3 times [2025-03-14 01:11:25,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:11:25,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9511341] [2025-03-14 01:11:25,368 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:11:25,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:11:25,373 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-03-14 01:11:25,383 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 01:11:25,383 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:11:25,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:11:25,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:11:25,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:11:25,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9511341] [2025-03-14 01:11:25,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9511341] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:11:25,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085629377] [2025-03-14 01:11:25,562 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:11:25,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:11:25,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:11:25,564 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-14 01:11:25,566 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-14 01:11:25,604 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-03-14 01:11:25,618 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 01:11:25,619 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:11:25,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:11:25,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-14 01:11:25,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:11:25,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:11:25,661 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:11:25,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:11:25,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085629377] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:11:25,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:11:25,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2025-03-14 01:11:25,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762958172] [2025-03-14 01:11:25,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:11:25,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-14 01:11:25,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:11:25,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-14 01:11:25,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-03-14 01:11:25,710 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:11:25,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 150 flow. Second operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:11:25,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:11:25,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:11:25,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:11:25,849 INFO L124 PetriNetUnfolderBase]: 100/195 cut-off events. [2025-03-14 01:11:25,849 INFO L125 PetriNetUnfolderBase]: For 291/291 co-relation queries the response was YES. [2025-03-14 01:11:25,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 713 conditions, 195 events. 100/195 cut-off events. For 291/291 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 608 event pairs, 33 based on Foata normal form. 5/199 useless extension candidates. Maximal degree in co-relation 690. Up to 119 conditions per place. [2025-03-14 01:11:25,851 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 30 selfloop transitions, 14 changer transitions 3/48 dead transitions. [2025-03-14 01:11:25,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 48 transitions, 351 flow [2025-03-14 01:11:25,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:11:25,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:11:25,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2025-03-14 01:11:25,852 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-03-14 01:11:25,852 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 150 flow. Second operand 6 states and 56 transitions. [2025-03-14 01:11:25,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 48 transitions, 351 flow [2025-03-14 01:11:25,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 48 transitions, 331 flow, removed 7 selfloop flow, removed 2 redundant places. [2025-03-14 01:11:25,857 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 231 flow [2025-03-14 01:11:25,857 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=231, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2025-03-14 01:11:25,857 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 18 predicate places. [2025-03-14 01:11:25,858 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 231 flow [2025-03-14 01:11:25,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:11:25,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:11:25,859 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:11:25,864 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-14 01:11:26,059 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-14 01:11:26,059 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:11:26,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:11:26,060 INFO L85 PathProgramCache]: Analyzing trace with hash -119244809, now seen corresponding path program 1 times [2025-03-14 01:11:26,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:11:26,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812927109] [2025-03-14 01:11:26,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:11:26,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:11:26,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-14 01:11:26,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 01:11:26,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:11:26,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:11:26,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:11:26,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:11:26,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812927109] [2025-03-14 01:11:26,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812927109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:11:26,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:11:26,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:11:26,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941929367] [2025-03-14 01:11:26,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:11:26,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:11:26,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:11:26,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:11:26,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:11:26,157 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:11:26,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 231 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 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-14 01:11:26,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:11:26,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:11:26,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:11:26,243 INFO L124 PetriNetUnfolderBase]: 106/205 cut-off events. [2025-03-14 01:11:26,243 INFO L125 PetriNetUnfolderBase]: For 470/470 co-relation queries the response was YES. [2025-03-14 01:11:26,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 849 conditions, 205 events. 106/205 cut-off events. For 470/470 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 656 event pairs, 30 based on Foata normal form. 4/209 useless extension candidates. Maximal degree in co-relation 823. Up to 140 conditions per place. [2025-03-14 01:11:26,247 INFO L140 encePairwiseOnDemand]: 16/20 looper letters, 33 selfloop transitions, 8 changer transitions 3/45 dead transitions. [2025-03-14 01:11:26,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 376 flow [2025-03-14 01:11:26,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 01:11:26,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 01:11:26,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2025-03-14 01:11:26,248 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-03-14 01:11:26,248 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 231 flow. Second operand 4 states and 44 transitions. [2025-03-14 01:11:26,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 376 flow [2025-03-14 01:11:26,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 45 transitions, 361 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-14 01:11:26,254 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 258 flow [2025-03-14 01:11:26,254 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=258, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2025-03-14 01:11:26,255 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 21 predicate places. [2025-03-14 01:11:26,256 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 258 flow [2025-03-14 01:11:26,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 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-14 01:11:26,256 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:11:26,256 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:11:26,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:11:26,256 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:11:26,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:11:26,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1670522795, now seen corresponding path program 2 times [2025-03-14 01:11:26,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:11:26,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130514468] [2025-03-14 01:11:26,257 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:11:26,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:11:26,262 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-14 01:11:26,279 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 01:11:26,279 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:11:26,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:11:26,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:11:26,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:11:26,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130514468] [2025-03-14 01:11:26,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130514468] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:11:26,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006668204] [2025-03-14 01:11:26,340 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:11:26,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:11:26,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:11:26,342 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-14 01:11:26,344 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-14 01:11:26,382 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-14 01:11:26,398 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 01:11:26,399 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:11:26,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:11:26,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-14 01:11:26,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:11:26,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:11:26,419 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:11:26,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:11:26,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006668204] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:11:26,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:11:26,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-14 01:11:26,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226365672] [2025-03-14 01:11:26,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:11:26,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 01:11:26,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:11:26,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 01:11:26,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-14 01:11:26,465 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:11:26,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 258 flow. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 0 states have call successors, (0), 0 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-14 01:11:26,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:11:26,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:11:26,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:11:26,543 INFO L124 PetriNetUnfolderBase]: 107/201 cut-off events. [2025-03-14 01:11:26,543 INFO L125 PetriNetUnfolderBase]: For 584/584 co-relation queries the response was YES. [2025-03-14 01:11:26,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 871 conditions, 201 events. 107/201 cut-off events. For 584/584 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 632 event pairs, 31 based on Foata normal form. 4/204 useless extension candidates. Maximal degree in co-relation 844. Up to 136 conditions per place. [2025-03-14 01:11:26,544 INFO L140 encePairwiseOnDemand]: 15/20 looper letters, 30 selfloop transitions, 13 changer transitions 3/47 dead transitions. [2025-03-14 01:11:26,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 47 transitions, 411 flow [2025-03-14 01:11:26,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:11:26,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:11:26,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2025-03-14 01:11:26,545 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49 [2025-03-14 01:11:26,545 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 258 flow. Second operand 5 states and 49 transitions. [2025-03-14 01:11:26,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 47 transitions, 411 flow [2025-03-14 01:11:26,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 47 transitions, 399 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-14 01:11:26,548 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 295 flow [2025-03-14 01:11:26,548 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=295, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2025-03-14 01:11:26,549 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 25 predicate places. [2025-03-14 01:11:26,549 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 295 flow [2025-03-14 01:11:26,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 0 states have call successors, (0), 0 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-14 01:11:26,549 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:11:26,549 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:11:26,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-14 01:11:26,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:11:26,750 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:11:26,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:11:26,750 INFO L85 PathProgramCache]: Analyzing trace with hash 2139034426, now seen corresponding path program 4 times [2025-03-14 01:11:26,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:11:26,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076784376] [2025-03-14 01:11:26,750 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:11:26,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:11:26,755 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-03-14 01:11:26,773 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 01:11:26,773 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:11:26,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:11:26,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:11:26,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:11:26,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076784376] [2025-03-14 01:11:26,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076784376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:11:26,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:11:26,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:11:26,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569711889] [2025-03-14 01:11:26,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:11:26,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:11:26,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:11:26,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:11:26,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:11:26,820 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:11:26,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 295 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 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-14 01:11:26,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:11:26,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:11:26,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:11:26,923 INFO L124 PetriNetUnfolderBase]: 95/169 cut-off events. [2025-03-14 01:11:26,923 INFO L125 PetriNetUnfolderBase]: For 651/651 co-relation queries the response was YES. [2025-03-14 01:11:26,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 808 conditions, 169 events. 95/169 cut-off events. For 651/651 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 476 event pairs, 18 based on Foata normal form. 2/170 useless extension candidates. Maximal degree in co-relation 780. Up to 89 conditions per place. [2025-03-14 01:11:26,924 INFO L140 encePairwiseOnDemand]: 15/20 looper letters, 34 selfloop transitions, 15 changer transitions 3/53 dead transitions. [2025-03-14 01:11:26,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 53 transitions, 498 flow [2025-03-14 01:11:26,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:11:26,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:11:26,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2025-03-14 01:11:26,926 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2025-03-14 01:11:26,926 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 295 flow. Second operand 6 states and 52 transitions. [2025-03-14 01:11:26,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 53 transitions, 498 flow [2025-03-14 01:11:26,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 53 transitions, 464 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-14 01:11:26,929 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 345 flow [2025-03-14 01:11:26,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=345, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2025-03-14 01:11:26,932 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 27 predicate places. [2025-03-14 01:11:26,932 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 345 flow [2025-03-14 01:11:26,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 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-14 01:11:26,932 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:11:26,932 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:11:26,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:11:26,933 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:11:26,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:11:26,933 INFO L85 PathProgramCache]: Analyzing trace with hash 65253917, now seen corresponding path program 1 times [2025-03-14 01:11:26,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:11:26,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41317855] [2025-03-14 01:11:26,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:11:26,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:11:26,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-14 01:11:26,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-14 01:11:26,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:11:26,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:11:27,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:11:27,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:11:27,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41317855] [2025-03-14 01:11:27,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41317855] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:11:27,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379736333] [2025-03-14 01:11:27,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:11:27,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:11:27,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:11:27,294 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-14 01:11:27,295 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-14 01:11:27,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-14 01:11:27,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-14 01:11:27,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:11:27,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:11:27,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-14 01:11:27,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:11:27,402 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-14 01:11:27,528 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:11:27,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:11:27,768 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 170 treesize of output 150 [2025-03-14 01:11:27,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:11:27,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 560 treesize of output 488 [2025-03-14 01:11:56,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:11:56,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379736333] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:11:56,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:11:56,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 18 [2025-03-14 01:11:56,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530184698] [2025-03-14 01:11:56,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:11:56,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-14 01:11:56,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:11:56,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-14 01:11:56,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2025-03-14 01:11:56,869 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:11:56,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 345 flow. Second operand has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 18 states have internal predecessors, (102), 0 states have call successors, (0), 0 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-14 01:11:56,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:11:56,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:11:56,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:11:58,795 INFO L124 PetriNetUnfolderBase]: 270/471 cut-off events. [2025-03-14 01:11:58,795 INFO L125 PetriNetUnfolderBase]: For 1662/1662 co-relation queries the response was YES. [2025-03-14 01:11:58,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2352 conditions, 471 events. 270/471 cut-off events. For 1662/1662 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1827 event pairs, 11 based on Foata normal form. 49/517 useless extension candidates. Maximal degree in co-relation 2281. Up to 223 conditions per place. [2025-03-14 01:11:58,798 INFO L140 encePairwiseOnDemand]: 11/20 looper letters, 61 selfloop transitions, 40 changer transitions 62/164 dead transitions. [2025-03-14 01:11:58,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 164 transitions, 1574 flow [2025-03-14 01:11:58,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-14 01:11:58,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-03-14 01:11:58,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 219 transitions. [2025-03-14 01:11:58,801 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40555555555555556 [2025-03-14 01:11:58,801 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 345 flow. Second operand 27 states and 219 transitions. [2025-03-14 01:11:58,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 164 transitions, 1574 flow [2025-03-14 01:11:58,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 164 transitions, 1538 flow, removed 18 selfloop flow, removed 1 redundant places. [2025-03-14 01:11:58,809 INFO L231 Difference]: Finished difference. Result has 84 places, 66 transitions, 730 flow [2025-03-14 01:11:58,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=730, PETRI_PLACES=84, PETRI_TRANSITIONS=66} [2025-03-14 01:11:58,810 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 63 predicate places. [2025-03-14 01:11:58,810 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 66 transitions, 730 flow [2025-03-14 01:11:58,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 18 states have internal predecessors, (102), 0 states have call successors, (0), 0 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-14 01:11:58,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:11:58,810 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:11:58,816 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-14 01:11:59,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:11:59,011 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:11:59,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:11:59,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1659446622, now seen corresponding path program 2 times [2025-03-14 01:11:59,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:11:59,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007100948] [2025-03-14 01:11:59,011 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:11:59,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:11:59,022 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-14 01:11:59,032 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-14 01:11:59,032 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:11:59,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:11:59,200 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-14 01:11:59,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:11:59,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007100948] [2025-03-14 01:11:59,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007100948] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:11:59,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875580696] [2025-03-14 01:11:59,200 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:11:59,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:11:59,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:11:59,206 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-14 01:11:59,207 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-14 01:11:59,240 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-14 01:11:59,350 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-14 01:11:59,350 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:11:59,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:11:59,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-14 01:11:59,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:11:59,409 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-14 01:11:59,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:11:59,504 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-14 01:11:59,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875580696] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:11:59,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:11:59,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-14 01:11:59,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648326859] [2025-03-14 01:11:59,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:11:59,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-14 01:11:59,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:11:59,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-14 01:11:59,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-14 01:11:59,505 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:11:59,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 66 transitions, 730 flow. Second operand has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 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-14 01:11:59,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:11:59,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:11:59,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:12:00,766 INFO L124 PetriNetUnfolderBase]: 263/461 cut-off events. [2025-03-14 01:12:00,766 INFO L125 PetriNetUnfolderBase]: For 4680/4680 co-relation queries the response was YES. [2025-03-14 01:12:00,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2764 conditions, 461 events. 263/461 cut-off events. For 4680/4680 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1661 event pairs, 14 based on Foata normal form. 42/501 useless extension candidates. Maximal degree in co-relation 2727. Up to 213 conditions per place. [2025-03-14 01:12:00,771 INFO L140 encePairwiseOnDemand]: 15/20 looper letters, 98 selfloop transitions, 38 changer transitions 0/137 dead transitions. [2025-03-14 01:12:00,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 137 transitions, 1619 flow [2025-03-14 01:12:00,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:12:00,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:12:00,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 108 transitions. [2025-03-14 01:12:00,773 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4909090909090909 [2025-03-14 01:12:00,773 INFO L175 Difference]: Start difference. First operand has 84 places, 66 transitions, 730 flow. Second operand 11 states and 108 transitions. [2025-03-14 01:12:00,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 137 transitions, 1619 flow [2025-03-14 01:12:00,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 137 transitions, 1436 flow, removed 62 selfloop flow, removed 13 redundant places. [2025-03-14 01:12:00,784 INFO L231 Difference]: Finished difference. Result has 77 places, 76 transitions, 816 flow [2025-03-14 01:12:00,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=816, PETRI_PLACES=77, PETRI_TRANSITIONS=76} [2025-03-14 01:12:00,785 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 56 predicate places. [2025-03-14 01:12:00,785 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 76 transitions, 816 flow [2025-03-14 01:12:00,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 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-14 01:12:00,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:12:00,785 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:12:00,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-14 01:12:00,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:12:00,986 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:12:00,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:12:00,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1795670154, now seen corresponding path program 3 times [2025-03-14 01:12:00,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:12:00,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859487735] [2025-03-14 01:12:00,987 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:12:00,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:12:00,992 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-03-14 01:12:01,010 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-14 01:12:01,011 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:12:01,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:01,881 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:12:01,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:12:01,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859487735] [2025-03-14 01:12:01,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859487735] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:12:01,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851414737] [2025-03-14 01:12:01,881 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:12:01,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:12:01,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:12:01,883 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-14 01:12:01,885 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-14 01:12:01,923 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-03-14 01:12:01,939 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-14 01:12:01,939 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:12:01,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:01,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-14 01:12:01,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:12:02,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:12:02,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 41 [2025-03-14 01:12:02,082 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:12:02,082 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:12:02,240 INFO L349 Elim1Store]: treesize reduction 15, result has 90.2 percent of original size [2025-03-14 01:12:02,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 173 [2025-03-14 01:12:02,385 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:12:02,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851414737] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:12:02,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:12:02,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 5] total 18 [2025-03-14 01:12:02,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52332076] [2025-03-14 01:12:02,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:12:02,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-14 01:12:02,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:12:02,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-14 01:12:02,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2025-03-14 01:12:02,386 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:12:02,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 76 transitions, 816 flow. Second operand has 19 states, 19 states have (on average 5.526315789473684) internal successors, (105), 19 states have internal predecessors, (105), 0 states have call successors, (0), 0 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-14 01:12:02,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:12:02,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:12:02,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:12:03,034 INFO L124 PetriNetUnfolderBase]: 583/1031 cut-off events. [2025-03-14 01:12:03,034 INFO L125 PetriNetUnfolderBase]: For 7626/7626 co-relation queries the response was YES. [2025-03-14 01:12:03,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6338 conditions, 1031 events. 583/1031 cut-off events. For 7626/7626 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4458 event pairs, 49 based on Foata normal form. 4/1035 useless extension candidates. Maximal degree in co-relation 5937. Up to 443 conditions per place. [2025-03-14 01:12:03,039 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 114 selfloop transitions, 84 changer transitions 2/201 dead transitions. [2025-03-14 01:12:03,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 201 transitions, 2456 flow [2025-03-14 01:12:03,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-14 01:12:03,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-14 01:12:03,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 183 transitions. [2025-03-14 01:12:03,041 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4357142857142857 [2025-03-14 01:12:03,041 INFO L175 Difference]: Start difference. First operand has 77 places, 76 transitions, 816 flow. Second operand 21 states and 183 transitions. [2025-03-14 01:12:03,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 201 transitions, 2456 flow [2025-03-14 01:12:03,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 201 transitions, 2265 flow, removed 69 selfloop flow, removed 4 redundant places. [2025-03-14 01:12:03,054 INFO L231 Difference]: Finished difference. Result has 97 places, 131 transitions, 1598 flow [2025-03-14 01:12:03,054 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1598, PETRI_PLACES=97, PETRI_TRANSITIONS=131} [2025-03-14 01:12:03,055 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 76 predicate places. [2025-03-14 01:12:03,055 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 131 transitions, 1598 flow [2025-03-14 01:12:03,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.526315789473684) internal successors, (105), 19 states have internal predecessors, (105), 0 states have call successors, (0), 0 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-14 01:12:03,055 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:12:03,055 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:12:03,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-14 01:12:03,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:12:03,256 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:12:03,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:12:03,256 INFO L85 PathProgramCache]: Analyzing trace with hash 210465272, now seen corresponding path program 4 times [2025-03-14 01:12:03,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:12:03,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504123495] [2025-03-14 01:12:03,256 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:12:03,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:12:03,261 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-03-14 01:12:03,284 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-14 01:12:03,284 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:12:03,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:04,069 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:12:04,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:12:04,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504123495] [2025-03-14 01:12:04,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504123495] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:12:04,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642163703] [2025-03-14 01:12:04,070 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:12:04,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:12:04,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:12:04,072 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-14 01:12:04,079 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-14 01:12:04,122 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-03-14 01:12:04,138 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-14 01:12:04,138 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:12:04,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:04,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-14 01:12:04,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:12:04,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:12:04,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 45 [2025-03-14 01:12:04,236 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:12:04,237 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:12:04,390 INFO L349 Elim1Store]: treesize reduction 15, result has 90.2 percent of original size [2025-03-14 01:12:04,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 173 [2025-03-14 01:12:04,511 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:12:04,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642163703] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:12:04,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:12:04,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 5] total 17 [2025-03-14 01:12:04,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887101715] [2025-03-14 01:12:04,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:12:04,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-14 01:12:04,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:12:04,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-14 01:12:04,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-03-14 01:12:04,513 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:12:04,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 131 transitions, 1598 flow. Second operand has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 18 states have internal predecessors, (100), 0 states have call successors, (0), 0 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-14 01:12:04,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:12:04,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:12:04,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:12:05,061 INFO L124 PetriNetUnfolderBase]: 925/1645 cut-off events. [2025-03-14 01:12:05,061 INFO L125 PetriNetUnfolderBase]: For 14182/14182 co-relation queries the response was YES. [2025-03-14 01:12:05,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10582 conditions, 1645 events. 925/1645 cut-off events. For 14182/14182 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8205 event pairs, 111 based on Foata normal form. 4/1649 useless extension candidates. Maximal degree in co-relation 9930. Up to 845 conditions per place. [2025-03-14 01:12:05,074 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 158 selfloop transitions, 109 changer transitions 2/270 dead transitions. [2025-03-14 01:12:05,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 270 transitions, 3572 flow [2025-03-14 01:12:05,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-14 01:12:05,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-14 01:12:05,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 181 transitions. [2025-03-14 01:12:05,076 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4763157894736842 [2025-03-14 01:12:05,076 INFO L175 Difference]: Start difference. First operand has 97 places, 131 transitions, 1598 flow. Second operand 19 states and 181 transitions. [2025-03-14 01:12:05,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 270 transitions, 3572 flow [2025-03-14 01:12:05,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 270 transitions, 3240 flow, removed 151 selfloop flow, removed 7 redundant places. [2025-03-14 01:12:05,105 INFO L231 Difference]: Finished difference. Result has 113 places, 191 transitions, 2431 flow [2025-03-14 01:12:05,106 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=1326, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=2431, PETRI_PLACES=113, PETRI_TRANSITIONS=191} [2025-03-14 01:12:05,107 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 92 predicate places. [2025-03-14 01:12:05,107 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 191 transitions, 2431 flow [2025-03-14 01:12:05,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 18 states have internal predecessors, (100), 0 states have call successors, (0), 0 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-14 01:12:05,108 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:12:05,108 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:12:05,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-14 01:12:05,308 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,SelfDestructingSolverStorable11 [2025-03-14 01:12:05,309 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:12:05,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:12:05,309 INFO L85 PathProgramCache]: Analyzing trace with hash -2007286446, now seen corresponding path program 5 times [2025-03-14 01:12:05,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:12:05,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890863561] [2025-03-14 01:12:05,309 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:12:05,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:12:05,315 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 3 equivalence classes. [2025-03-14 01:12:05,338 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-03-14 01:12:05,340 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-14 01:12:05,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:06,215 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:12:06,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:12:06,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890863561] [2025-03-14 01:12:06,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890863561] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:12:06,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905512837] [2025-03-14 01:12:06,215 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:12:06,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:12:06,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:12:06,218 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-14 01:12:06,219 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-14 01:12:06,253 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 3 equivalence classes. [2025-03-14 01:12:06,277 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-03-14 01:12:06,277 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-14 01:12:06,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:06,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-14 01:12:06,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:12:06,365 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:12:06,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 45 [2025-03-14 01:12:06,371 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:12:06,371 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:12:06,512 INFO L349 Elim1Store]: treesize reduction 15, result has 90.2 percent of original size [2025-03-14 01:12:06,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 173 [2025-03-14 01:12:06,607 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:12:06,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905512837] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:12:06,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:12:06,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 5] total 17 [2025-03-14 01:12:06,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273626225] [2025-03-14 01:12:06,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:12:06,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-14 01:12:06,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:12:06,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-14 01:12:06,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2025-03-14 01:12:06,609 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:12:06,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 191 transitions, 2431 flow. Second operand has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 18 states have internal predecessors, (102), 0 states have call successors, (0), 0 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-14 01:12:06,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:12:06,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:12:06,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:12:07,208 INFO L124 PetriNetUnfolderBase]: 1277/2271 cut-off events. [2025-03-14 01:12:07,208 INFO L125 PetriNetUnfolderBase]: For 20300/20300 co-relation queries the response was YES. [2025-03-14 01:12:07,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15104 conditions, 2271 events. 1277/2271 cut-off events. For 20300/20300 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 12416 event pairs, 193 based on Foata normal form. 4/2275 useless extension candidates. Maximal degree in co-relation 13984. Up to 1508 conditions per place. [2025-03-14 01:12:07,225 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 197 selfloop transitions, 99 changer transitions 1/298 dead transitions. [2025-03-14 01:12:07,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 298 transitions, 4257 flow [2025-03-14 01:12:07,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-14 01:12:07,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-14 01:12:07,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 155 transitions. [2025-03-14 01:12:07,228 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4305555555555556 [2025-03-14 01:12:07,228 INFO L175 Difference]: Start difference. First operand has 113 places, 191 transitions, 2431 flow. Second operand 18 states and 155 transitions. [2025-03-14 01:12:07,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 298 transitions, 4257 flow [2025-03-14 01:12:07,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 298 transitions, 3916 flow, removed 146 selfloop flow, removed 9 redundant places. [2025-03-14 01:12:07,269 INFO L231 Difference]: Finished difference. Result has 125 places, 244 transitions, 3281 flow [2025-03-14 01:12:07,269 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=2194, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3281, PETRI_PLACES=125, PETRI_TRANSITIONS=244} [2025-03-14 01:12:07,270 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 104 predicate places. [2025-03-14 01:12:07,270 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 244 transitions, 3281 flow [2025-03-14 01:12:07,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 18 states have internal predecessors, (102), 0 states have call successors, (0), 0 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-14 01:12:07,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:12:07,271 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:12:07,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-14 01:12:07,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-14 01:12:07,475 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:12:07,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:12:07,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1580463726, now seen corresponding path program 6 times [2025-03-14 01:12:07,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:12:07,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981001628] [2025-03-14 01:12:07,476 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 01:12:07,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:12:07,485 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 3 equivalence classes. [2025-03-14 01:12:07,500 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-03-14 01:12:07,500 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-14 01:12:07,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:08,186 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:12:08,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:12:08,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981001628] [2025-03-14 01:12:08,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981001628] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:12:08,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446505573] [2025-03-14 01:12:08,187 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 01:12:08,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:12:08,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:12:08,189 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-14 01:12:08,190 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-14 01:12:08,225 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 3 equivalence classes. [2025-03-14 01:12:08,241 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-03-14 01:12:08,241 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-14 01:12:08,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:08,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-14 01:12:08,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:12:08,445 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2025-03-14 01:12:08,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 40 [2025-03-14 01:12:08,467 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:12:08,467 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:12:08,625 INFO L349 Elim1Store]: treesize reduction 15, result has 90.2 percent of original size [2025-03-14 01:12:08,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 116 treesize of output 189 [2025-03-14 01:12:08,969 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:12:08,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446505573] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:12:08,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:12:08,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2025-03-14 01:12:08,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515807771] [2025-03-14 01:12:08,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:12:08,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-14 01:12:08,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:12:08,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-14 01:12:08,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=436, Unknown=0, NotChecked=0, Total=552 [2025-03-14 01:12:08,971 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:12:08,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 244 transitions, 3281 flow. Second operand has 24 states, 24 states have (on average 5.166666666666667) internal successors, (124), 24 states have internal predecessors, (124), 0 states have call successors, (0), 0 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-14 01:12:08,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:12:08,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:12:08,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:12:09,727 INFO L124 PetriNetUnfolderBase]: 1815/3232 cut-off events. [2025-03-14 01:12:09,727 INFO L125 PetriNetUnfolderBase]: For 30425/30425 co-relation queries the response was YES. [2025-03-14 01:12:09,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21759 conditions, 3232 events. 1815/3232 cut-off events. For 30425/30425 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 19061 event pairs, 321 based on Foata normal form. 6/3238 useless extension candidates. Maximal degree in co-relation 20542. Up to 2065 conditions per place. [2025-03-14 01:12:09,749 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 270 selfloop transitions, 120 changer transitions 3/394 dead transitions. [2025-03-14 01:12:09,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 394 transitions, 5913 flow [2025-03-14 01:12:09,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-14 01:12:09,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-14 01:12:09,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 164 transitions. [2025-03-14 01:12:09,751 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45555555555555555 [2025-03-14 01:12:09,751 INFO L175 Difference]: Start difference. First operand has 125 places, 244 transitions, 3281 flow. Second operand 18 states and 164 transitions. [2025-03-14 01:12:09,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 394 transitions, 5913 flow [2025-03-14 01:12:09,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 394 transitions, 5654 flow, removed 109 selfloop flow, removed 8 redundant places. [2025-03-14 01:12:09,805 INFO L231 Difference]: Finished difference. Result has 143 places, 329 transitions, 4821 flow [2025-03-14 01:12:09,805 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=3048, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=4821, PETRI_PLACES=143, PETRI_TRANSITIONS=329} [2025-03-14 01:12:09,807 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 122 predicate places. [2025-03-14 01:12:09,807 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 329 transitions, 4821 flow [2025-03-14 01:12:09,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.166666666666667) internal successors, (124), 24 states have internal predecessors, (124), 0 states have call successors, (0), 0 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-14 01:12:09,807 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:12:09,807 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:12:09,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-14 01:12:10,012 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,SelfDestructingSolverStorable13 [2025-03-14 01:12:10,012 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:12:10,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:12:10,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1870814885, now seen corresponding path program 7 times [2025-03-14 01:12:10,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:12:10,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730159840] [2025-03-14 01:12:10,013 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 01:12:10,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:12:10,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-14 01:12:10,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-14 01:12:10,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:12:10,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:10,166 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-14 01:12:10,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:12:10,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730159840] [2025-03-14 01:12:10,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730159840] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:12:10,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885003132] [2025-03-14 01:12:10,166 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 01:12:10,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:12:10,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:12:10,169 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-14 01:12:10,170 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-14 01:12:10,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-14 01:12:10,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-14 01:12:10,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:12:10,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:10,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-14 01:12:10,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:12:10,281 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-14 01:12:10,281 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:12:10,381 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-14 01:12:10,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885003132] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:12:10,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:12:10,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-03-14 01:12:10,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499431306] [2025-03-14 01:12:10,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:12:10,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-14 01:12:10,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:12:10,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-14 01:12:10,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-03-14 01:12:10,382 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:12:10,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 329 transitions, 4821 flow. Second operand has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 0 states have call successors, (0), 0 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-14 01:12:10,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:12:10,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:12:10,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:12:11,605 INFO L124 PetriNetUnfolderBase]: 2097/4084 cut-off events. [2025-03-14 01:12:11,606 INFO L125 PetriNetUnfolderBase]: For 47165/47165 co-relation queries the response was YES. [2025-03-14 01:12:11,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28172 conditions, 4084 events. 2097/4084 cut-off events. For 47165/47165 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 28536 event pairs, 234 based on Foata normal form. 19/4103 useless extension candidates. Maximal degree in co-relation 26857. Up to 1283 conditions per place. [2025-03-14 01:12:11,634 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 409 selfloop transitions, 374 changer transitions 7/791 dead transitions. [2025-03-14 01:12:11,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 791 transitions, 12807 flow [2025-03-14 01:12:11,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-14 01:12:11,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-03-14 01:12:11,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 256 transitions. [2025-03-14 01:12:11,636 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-03-14 01:12:11,636 INFO L175 Difference]: Start difference. First operand has 143 places, 329 transitions, 4821 flow. Second operand 32 states and 256 transitions. [2025-03-14 01:12:11,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 791 transitions, 12807 flow [2025-03-14 01:12:11,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 791 transitions, 12048 flow, removed 364 selfloop flow, removed 6 redundant places. [2025-03-14 01:12:11,749 INFO L231 Difference]: Finished difference. Result has 180 places, 598 transitions, 9446 flow [2025-03-14 01:12:11,749 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=4507, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=9446, PETRI_PLACES=180, PETRI_TRANSITIONS=598} [2025-03-14 01:12:11,750 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 159 predicate places. [2025-03-14 01:12:11,751 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 598 transitions, 9446 flow [2025-03-14 01:12:11,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 0 states have call successors, (0), 0 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-14 01:12:11,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:12:11,751 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:12:11,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-14 01:12:11,955 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,SelfDestructingSolverStorable14 [2025-03-14 01:12:11,955 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:12:11,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:12:11,955 INFO L85 PathProgramCache]: Analyzing trace with hash -683720201, now seen corresponding path program 8 times [2025-03-14 01:12:11,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:12:11,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146292276] [2025-03-14 01:12:11,956 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:12:11,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:12:11,962 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-14 01:12:11,968 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-14 01:12:11,968 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:12:11,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:12,064 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-14 01:12:12,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:12:12,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146292276] [2025-03-14 01:12:12,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146292276] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:12:12,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956315049] [2025-03-14 01:12:12,065 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:12:12,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:12:12,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:12:12,067 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-14 01:12:12,069 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-14 01:12:12,116 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-14 01:12:12,137 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-14 01:12:12,137 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:12:12,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:12,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-14 01:12:12,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:12:12,193 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-14 01:12:12,193 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:12:12,323 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-14 01:12:12,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956315049] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:12:12,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:12:12,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-14 01:12:12,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835320838] [2025-03-14 01:12:12,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:12:12,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-14 01:12:12,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:12:12,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-14 01:12:12,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-14 01:12:12,325 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:12:12,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 598 transitions, 9446 flow. Second operand has 15 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:12,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:12:12,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:12:12,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:12:13,311 INFO L124 PetriNetUnfolderBase]: 2073/4156 cut-off events. [2025-03-14 01:12:13,311 INFO L125 PetriNetUnfolderBase]: For 58070/58070 co-relation queries the response was YES. [2025-03-14 01:12:13,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30577 conditions, 4156 events. 2073/4156 cut-off events. For 58070/58070 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 30267 event pairs, 207 based on Foata normal form. 51/4207 useless extension candidates. Maximal degree in co-relation 29845. Up to 1350 conditions per place. [2025-03-14 01:12:13,345 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 501 selfloop transitions, 261 changer transitions 19/782 dead transitions. [2025-03-14 01:12:13,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 782 transitions, 13740 flow [2025-03-14 01:12:13,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-14 01:12:13,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-14 01:12:13,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 130 transitions. [2025-03-14 01:12:13,347 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40625 [2025-03-14 01:12:13,347 INFO L175 Difference]: Start difference. First operand has 180 places, 598 transitions, 9446 flow. Second operand 16 states and 130 transitions. [2025-03-14 01:12:13,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 782 transitions, 13740 flow [2025-03-14 01:12:13,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 782 transitions, 12658 flow, removed 415 selfloop flow, removed 5 redundant places. [2025-03-14 01:12:13,578 INFO L231 Difference]: Finished difference. Result has 192 places, 620 transitions, 9513 flow [2025-03-14 01:12:13,578 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=8374, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=598, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=232, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=9513, PETRI_PLACES=192, PETRI_TRANSITIONS=620} [2025-03-14 01:12:13,579 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 171 predicate places. [2025-03-14 01:12:13,579 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 620 transitions, 9513 flow [2025-03-14 01:12:13,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:13,579 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:12:13,579 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:12:13,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-14 01:12:13,779 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,SelfDestructingSolverStorable15 [2025-03-14 01:12:13,779 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:12:13,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:12:13,780 INFO L85 PathProgramCache]: Analyzing trace with hash -204557365, now seen corresponding path program 9 times [2025-03-14 01:12:13,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:12:13,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259081142] [2025-03-14 01:12:13,780 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:12:13,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:12:13,784 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-03-14 01:12:13,798 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-03-14 01:12:13,798 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-14 01:12:13,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:13,974 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-14 01:12:13,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:12:13,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259081142] [2025-03-14 01:12:13,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259081142] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:12:13,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113882622] [2025-03-14 01:12:13,975 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:12:13,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:12:13,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:12:13,977 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-14 01:12:13,979 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-14 01:12:14,015 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-03-14 01:12:14,116 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-03-14 01:12:14,117 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-14 01:12:14,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:14,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-14 01:12:14,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:12:14,197 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-14 01:12:14,197 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:12:14,319 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-14 01:12:14,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113882622] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:12:14,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:12:14,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24 [2025-03-14 01:12:14,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136186611] [2025-03-14 01:12:14,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:12:14,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-14 01:12:14,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:12:14,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-14 01:12:14,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2025-03-14 01:12:14,321 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:12:14,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 620 transitions, 9513 flow. Second operand has 24 states, 24 states have (on average 4.666666666666667) internal successors, (112), 24 states have internal predecessors, (112), 0 states have call successors, (0), 0 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-14 01:12:14,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:12:14,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:12:14,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:12:17,989 INFO L124 PetriNetUnfolderBase]: 2712/5349 cut-off events. [2025-03-14 01:12:17,989 INFO L125 PetriNetUnfolderBase]: For 95548/95548 co-relation queries the response was YES. [2025-03-14 01:12:18,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41366 conditions, 5349 events. 2712/5349 cut-off events. For 95548/95548 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 40511 event pairs, 491 based on Foata normal form. 160/5509 useless extension candidates. Maximal degree in co-relation 40650. Up to 1918 conditions per place. [2025-03-14 01:12:18,021 INFO L140 encePairwiseOnDemand]: 13/20 looper letters, 400 selfloop transitions, 713 changer transitions 3/1117 dead transitions. [2025-03-14 01:12:18,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 1117 transitions, 20270 flow [2025-03-14 01:12:18,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-14 01:12:18,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-03-14 01:12:18,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 290 transitions. [2025-03-14 01:12:18,022 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4027777777777778 [2025-03-14 01:12:18,022 INFO L175 Difference]: Start difference. First operand has 192 places, 620 transitions, 9513 flow. Second operand 36 states and 290 transitions. [2025-03-14 01:12:18,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 1117 transitions, 20270 flow [2025-03-14 01:12:18,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 1117 transitions, 17289 flow, removed 791 selfloop flow, removed 19 redundant places. [2025-03-14 01:12:18,400 INFO L231 Difference]: Finished difference. Result has 223 places, 948 transitions, 15283 flow [2025-03-14 01:12:18,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=7903, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=615, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=391, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=15283, PETRI_PLACES=223, PETRI_TRANSITIONS=948} [2025-03-14 01:12:18,400 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 202 predicate places. [2025-03-14 01:12:18,400 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 948 transitions, 15283 flow [2025-03-14 01:12:18,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.666666666666667) internal successors, (112), 24 states have internal predecessors, (112), 0 states have call successors, (0), 0 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-14 01:12:18,401 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:12:18,401 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:12:18,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-14 01:12:18,601 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,SelfDestructingSolverStorable16 [2025-03-14 01:12:18,601 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:12:18,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:12:18,602 INFO L85 PathProgramCache]: Analyzing trace with hash 371226747, now seen corresponding path program 10 times [2025-03-14 01:12:18,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:12:18,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530255727] [2025-03-14 01:12:18,602 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:12:18,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:12:18,606 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-14 01:12:18,610 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-14 01:12:18,610 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:12:18,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:18,683 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-14 01:12:18,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:12:18,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530255727] [2025-03-14 01:12:18,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530255727] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:12:18,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899961156] [2025-03-14 01:12:18,684 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:12:18,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:12:18,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:12:18,687 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-14 01:12:18,689 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-14 01:12:18,729 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-14 01:12:18,746 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-14 01:12:18,746 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:12:18,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:18,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-14 01:12:18,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:12:18,800 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-14 01:12:18,800 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:12:18,891 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-14 01:12:18,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899961156] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:12:18,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:12:18,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-03-14 01:12:18,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134437417] [2025-03-14 01:12:18,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:12:18,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-14 01:12:18,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:12:18,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-14 01:12:18,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2025-03-14 01:12:18,893 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:12:18,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 948 transitions, 15283 flow. Second operand has 19 states, 19 states have (on average 4.684210526315789) internal successors, (89), 19 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-14 01:12:18,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:12:18,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:12:18,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:12:20,791 INFO L124 PetriNetUnfolderBase]: 2873/5658 cut-off events. [2025-03-14 01:12:20,792 INFO L125 PetriNetUnfolderBase]: For 71587/71587 co-relation queries the response was YES. [2025-03-14 01:12:20,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42508 conditions, 5658 events. 2873/5658 cut-off events. For 71587/71587 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 43450 event pairs, 390 based on Foata normal form. 14/5672 useless extension candidates. Maximal degree in co-relation 38375. Up to 1897 conditions per place. [2025-03-14 01:12:20,832 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 659 selfloop transitions, 522 changer transitions 12/1194 dead transitions. [2025-03-14 01:12:20,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 1194 transitions, 21398 flow [2025-03-14 01:12:20,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-14 01:12:20,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2025-03-14 01:12:20,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 287 transitions. [2025-03-14 01:12:20,833 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3416666666666667 [2025-03-14 01:12:20,833 INFO L175 Difference]: Start difference. First operand has 223 places, 948 transitions, 15283 flow. Second operand 42 states and 287 transitions. [2025-03-14 01:12:20,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 1194 transitions, 21398 flow [2025-03-14 01:12:21,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 1194 transitions, 19760 flow, removed 596 selfloop flow, removed 7 redundant places. [2025-03-14 01:12:21,383 INFO L231 Difference]: Finished difference. Result has 272 places, 1035 transitions, 17079 flow [2025-03-14 01:12:21,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=13912, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=948, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=441, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=474, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=17079, PETRI_PLACES=272, PETRI_TRANSITIONS=1035} [2025-03-14 01:12:21,384 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 251 predicate places. [2025-03-14 01:12:21,384 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 1035 transitions, 17079 flow [2025-03-14 01:12:21,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.684210526315789) internal successors, (89), 19 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-14 01:12:21,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:12:21,384 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:12:21,390 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-14 01:12:21,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:12:21,585 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:12:21,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:12:21,585 INFO L85 PathProgramCache]: Analyzing trace with hash 88120585, now seen corresponding path program 11 times [2025-03-14 01:12:21,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:12:21,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401677193] [2025-03-14 01:12:21,585 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:12:21,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:12:21,590 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-03-14 01:12:21,599 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-03-14 01:12:21,599 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-14 01:12:21,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:21,688 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-14 01:12:21,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:12:21,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401677193] [2025-03-14 01:12:21,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401677193] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:12:21,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322455784] [2025-03-14 01:12:21,689 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:12:21,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:12:21,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:12:21,691 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-14 01:12:21,692 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-14 01:12:21,729 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-03-14 01:12:21,762 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-03-14 01:12:21,762 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-14 01:12:21,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:21,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-14 01:12:21,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:12:21,812 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-14 01:12:21,812 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:12:21,916 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-14 01:12:21,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322455784] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:12:21,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:12:21,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-14 01:12:21,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135266459] [2025-03-14 01:12:21,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:12:21,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-14 01:12:21,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:12:21,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-14 01:12:21,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2025-03-14 01:12:21,918 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:12:21,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 1035 transitions, 17079 flow. Second operand has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 18 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:21,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:12:21,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:12:21,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:12:23,843 INFO L124 PetriNetUnfolderBase]: 2970/5833 cut-off events. [2025-03-14 01:12:23,843 INFO L125 PetriNetUnfolderBase]: For 80240/80240 co-relation queries the response was YES. [2025-03-14 01:12:23,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44579 conditions, 5833 events. 2970/5833 cut-off events. For 80240/80240 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 44872 event pairs, 401 based on Foata normal form. 10/5841 useless extension candidates. Maximal degree in co-relation 44342. Up to 1958 conditions per place. [2025-03-14 01:12:23,894 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 675 selfloop transitions, 554 changer transitions 7/1237 dead transitions. [2025-03-14 01:12:23,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 1237 transitions, 22109 flow [2025-03-14 01:12:23,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-14 01:12:23,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-03-14 01:12:23,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 242 transitions. [2025-03-14 01:12:23,896 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3457142857142857 [2025-03-14 01:12:23,896 INFO L175 Difference]: Start difference. First operand has 272 places, 1035 transitions, 17079 flow. Second operand 35 states and 242 transitions. [2025-03-14 01:12:23,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 1237 transitions, 22109 flow [2025-03-14 01:12:24,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 1237 transitions, 20817 flow, removed 486 selfloop flow, removed 12 redundant places. [2025-03-14 01:12:24,646 INFO L231 Difference]: Finished difference. Result has 303 places, 1093 transitions, 18153 flow [2025-03-14 01:12:24,646 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=15799, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1035, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=496, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=503, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=18153, PETRI_PLACES=303, PETRI_TRANSITIONS=1093} [2025-03-14 01:12:24,647 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 282 predicate places. [2025-03-14 01:12:24,647 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 1093 transitions, 18153 flow [2025-03-14 01:12:24,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 18 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:24,647 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:12:24,647 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:12:24,653 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-14 01:12:24,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:12:24,847 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:12:24,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:12:24,848 INFO L85 PathProgramCache]: Analyzing trace with hash 2014154663, now seen corresponding path program 12 times [2025-03-14 01:12:24,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:12:24,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911995370] [2025-03-14 01:12:24,848 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 01:12:24,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:12:24,852 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 3 equivalence classes. [2025-03-14 01:12:24,859 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-03-14 01:12:24,859 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-14 01:12:24,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:24,931 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-14 01:12:24,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:12:24,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911995370] [2025-03-14 01:12:24,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911995370] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:12:24,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773840706] [2025-03-14 01:12:24,932 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 01:12:24,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:12:24,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:12:24,934 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-14 01:12:24,935 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-14 01:12:24,972 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 3 equivalence classes. [2025-03-14 01:12:24,985 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-03-14 01:12:24,986 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-14 01:12:24,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:24,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-14 01:12:24,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:12:25,039 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-14 01:12:25,039 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:12:25,123 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-14 01:12:25,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773840706] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:12:25,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:12:25,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-14 01:12:25,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432037969] [2025-03-14 01:12:25,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:12:25,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-14 01:12:25,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:12:25,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-14 01:12:25,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2025-03-14 01:12:25,125 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:12:25,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 1093 transitions, 18153 flow. Second operand has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:25,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:12:25,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:12:25,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:12:29,812 INFO L124 PetriNetUnfolderBase]: 3312/6558 cut-off events. [2025-03-14 01:12:29,812 INFO L125 PetriNetUnfolderBase]: For 95604/95604 co-relation queries the response was YES. [2025-03-14 01:12:29,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51521 conditions, 6558 events. 3312/6558 cut-off events. For 95604/95604 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 52243 event pairs, 481 based on Foata normal form. 13/6569 useless extension candidates. Maximal degree in co-relation 51286. Up to 2339 conditions per place. [2025-03-14 01:12:29,870 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 836 selfloop transitions, 583 changer transitions 20/1440 dead transitions. [2025-03-14 01:12:29,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 1440 transitions, 25918 flow [2025-03-14 01:12:29,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-14 01:12:29,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2025-03-14 01:12:29,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 328 transitions. [2025-03-14 01:12:29,872 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3565217391304348 [2025-03-14 01:12:29,872 INFO L175 Difference]: Start difference. First operand has 303 places, 1093 transitions, 18153 flow. Second operand 46 states and 328 transitions. [2025-03-14 01:12:29,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 1440 transitions, 25918 flow [2025-03-14 01:12:30,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 1440 transitions, 25506 flow, removed 160 selfloop flow, removed 11 redundant places. [2025-03-14 01:12:30,809 INFO L231 Difference]: Finished difference. Result has 356 places, 1250 transitions, 22477 flow [2025-03-14 01:12:30,810 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=17741, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1093, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=446, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=22477, PETRI_PLACES=356, PETRI_TRANSITIONS=1250} [2025-03-14 01:12:30,810 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 335 predicate places. [2025-03-14 01:12:30,810 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 1250 transitions, 22477 flow [2025-03-14 01:12:30,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:30,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:12:30,810 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:12:30,817 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-14 01:12:31,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:12:31,011 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:12:31,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:12:31,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1229211107, now seen corresponding path program 13 times [2025-03-14 01:12:31,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:12:31,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863800909] [2025-03-14 01:12:31,012 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 01:12:31,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:12:31,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-14 01:12:31,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-14 01:12:31,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:12:31,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:31,153 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-14 01:12:31,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:12:31,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863800909] [2025-03-14 01:12:31,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863800909] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:12:31,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831809656] [2025-03-14 01:12:31,154 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 01:12:31,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:12:31,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:12:31,157 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-14 01:12:31,159 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-14 01:12:31,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-14 01:12:31,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-14 01:12:31,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:12:31,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:31,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-14 01:12:31,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:12:31,282 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-14 01:12:31,282 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:12:31,370 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-14 01:12:31,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831809656] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:12:31,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:12:31,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-14 01:12:31,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799704452] [2025-03-14 01:12:31,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:12:31,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-14 01:12:31,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:12:31,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-14 01:12:31,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2025-03-14 01:12:31,371 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:12:31,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 1250 transitions, 22477 flow. Second operand has 18 states, 18 states have (on average 4.722222222222222) internal successors, (85), 18 states have internal predecessors, (85), 0 states have call successors, (0), 0 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-14 01:12:31,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:12:31,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:12:31,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:12:36,336 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 [] [2025-03-14 01:12:38,401 INFO L124 PetriNetUnfolderBase]: 3496/6951 cut-off events. [2025-03-14 01:12:38,401 INFO L125 PetriNetUnfolderBase]: For 123682/123682 co-relation queries the response was YES. [2025-03-14 01:12:38,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58682 conditions, 6951 events. 3496/6951 cut-off events. For 123682/123682 co-relation queries the response was YES. Maximal size of possible extension queue 568. Compared 56265 event pairs, 510 based on Foata normal form. 20/6969 useless extension candidates. Maximal degree in co-relation 58422. Up to 2490 conditions per place. [2025-03-14 01:12:38,465 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 889 selfloop transitions, 623 changer transitions 18/1531 dead transitions. [2025-03-14 01:12:38,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 1531 transitions, 30064 flow [2025-03-14 01:12:38,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-14 01:12:38,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-03-14 01:12:38,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 307 transitions. [2025-03-14 01:12:38,467 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3488636363636364 [2025-03-14 01:12:38,467 INFO L175 Difference]: Start difference. First operand has 356 places, 1250 transitions, 22477 flow. Second operand 44 states and 307 transitions. [2025-03-14 01:12:38,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 1531 transitions, 30064 flow [2025-03-14 01:12:39,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 1531 transitions, 28591 flow, removed 603 selfloop flow, removed 19 redundant places. [2025-03-14 01:12:39,744 INFO L231 Difference]: Finished difference. Result has 392 places, 1355 transitions, 25839 flow [2025-03-14 01:12:39,745 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=21027, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=519, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=676, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=25839, PETRI_PLACES=392, PETRI_TRANSITIONS=1355} [2025-03-14 01:12:39,745 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 371 predicate places. [2025-03-14 01:12:39,745 INFO L471 AbstractCegarLoop]: Abstraction has has 392 places, 1355 transitions, 25839 flow [2025-03-14 01:12:39,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.722222222222222) internal successors, (85), 18 states have internal predecessors, (85), 0 states have call successors, (0), 0 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-14 01:12:39,745 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:12:39,746 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:12:39,752 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-14 01:12:39,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:12:39,946 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:12:39,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:12:39,947 INFO L85 PathProgramCache]: Analyzing trace with hash -691355529, now seen corresponding path program 14 times [2025-03-14 01:12:39,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:12:39,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255529325] [2025-03-14 01:12:39,947 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:12:39,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:12:39,951 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-14 01:12:40,019 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-14 01:12:40,019 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:12:40,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:40,126 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-14 01:12:40,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:12:40,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255529325] [2025-03-14 01:12:40,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255529325] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:12:40,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607842954] [2025-03-14 01:12:40,127 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:12:40,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:12:40,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:12:40,150 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-14 01:12:40,162 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-14 01:12:40,229 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-14 01:12:40,246 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-14 01:12:40,246 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:12:40,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:40,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-14 01:12:40,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:12:40,349 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-14 01:12:40,349 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:12:40,478 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-14 01:12:40,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607842954] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:12:40,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:12:40,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-14 01:12:40,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090677579] [2025-03-14 01:12:40,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:12:40,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-14 01:12:40,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:12:40,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-14 01:12:40,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2025-03-14 01:12:40,480 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:12:40,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 1355 transitions, 25839 flow. Second operand has 20 states, 20 states have (on average 4.65) internal successors, (93), 20 states have internal predecessors, (93), 0 states have call successors, (0), 0 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-14 01:12:40,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:12:40,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:12:40,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:12:45,190 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 [] [2025-03-14 01:12:49,268 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 [] [2025-03-14 01:12:52,003 INFO L124 PetriNetUnfolderBase]: 3678/7325 cut-off events. [2025-03-14 01:12:52,003 INFO L125 PetriNetUnfolderBase]: For 152077/152077 co-relation queries the response was YES. [2025-03-14 01:12:52,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64179 conditions, 7325 events. 3678/7325 cut-off events. For 152077/152077 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 59989 event pairs, 545 based on Foata normal form. 24/7347 useless extension candidates. Maximal degree in co-relation 63951. Up to 2657 conditions per place. [2025-03-14 01:12:52,088 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 950 selfloop transitions, 646 changer transitions 20/1617 dead transitions. [2025-03-14 01:12:52,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 1617 transitions, 33268 flow [2025-03-14 01:12:52,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-14 01:12:52,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2025-03-14 01:12:52,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 311 transitions. [2025-03-14 01:12:52,090 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33804347826086956 [2025-03-14 01:12:52,090 INFO L175 Difference]: Start difference. First operand has 392 places, 1355 transitions, 25839 flow. Second operand 46 states and 311 transitions. [2025-03-14 01:12:52,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 1617 transitions, 33268 flow