./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-nzb-file-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-nzb-file-trans.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 0d0975dc4466296431d96c26938a2e71864de63aba998f18ecd8a32ca341796b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:18:52,840 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:18:52,883 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:18:52,889 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:18:52,889 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:18:52,902 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:18:52,903 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:18:52,903 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:18:52,903 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:18:52,903 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:18:52,903 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:18:52,903 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:18:52,903 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:18:52,903 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:18:52,903 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:18:52,904 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:18:52,904 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:18:52,904 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:18:52,904 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:18:52,904 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:18:52,904 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:18:52,904 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:18:52,904 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:18:52,904 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:18:52,904 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:18:52,904 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:18:52,904 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:18:52,904 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:18:52,904 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:18:52,904 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:18:52,904 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:18:52,904 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:18:52,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:18:52,905 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:18:52,905 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:18:52,905 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:18:52,905 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:18:52,905 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:18:52,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:18:52,905 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:18:52,905 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:18:52,905 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:18:52,905 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:18:52,905 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 -> 0d0975dc4466296431d96c26938a2e71864de63aba998f18ecd8a32ca341796b [2025-03-04 02:18:53,149 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:18:53,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:18:53,159 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:18:53,160 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:18:53,160 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:18:53,161 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-nzb-file-trans.wvr.c [2025-03-04 02:18:54,275 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dd454a3f/51e5fa6582784799806dca0e676128aa/FLAG65c6668d5 [2025-03-04 02:18:54,585 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:18:54,586 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-nzb-file-trans.wvr.c [2025-03-04 02:18:54,593 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dd454a3f/51e5fa6582784799806dca0e676128aa/FLAG65c6668d5 [2025-03-04 02:18:54,864 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dd454a3f/51e5fa6582784799806dca0e676128aa [2025-03-04 02:18:54,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:18:54,867 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:18:54,869 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:18:54,869 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:18:54,873 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:18:54,873 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:18:54" (1/1) ... [2025-03-04 02:18:54,874 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@526c2332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:54, skipping insertion in model container [2025-03-04 02:18:54,874 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:18:54" (1/1) ... [2025-03-04 02:18:54,887 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:18:55,054 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-nzb-file-trans.wvr.c[6489,6502] [2025-03-04 02:18:55,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:18:55,075 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:18:55,117 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-nzb-file-trans.wvr.c[6489,6502] [2025-03-04 02:18:55,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:18:55,141 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:18:55,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:55 WrapperNode [2025-03-04 02:18:55,143 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:18:55,144 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:18:55,144 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:18:55,144 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:18:55,149 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:55" (1/1) ... [2025-03-04 02:18:55,164 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:55" (1/1) ... [2025-03-04 02:18:55,197 INFO L138 Inliner]: procedures = 25, calls = 61, calls flagged for inlining = 28, calls inlined = 42, statements flattened = 591 [2025-03-04 02:18:55,197 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:18:55,198 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:18:55,198 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:18:55,198 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:18:55,207 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:55" (1/1) ... [2025-03-04 02:18:55,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:55" (1/1) ... [2025-03-04 02:18:55,215 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:55" (1/1) ... [2025-03-04 02:18:55,240 INFO L175 MemorySlicer]: Split 29 memory accesses to 2 slices as follows [2, 27]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-03-04 02:18:55,240 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:55" (1/1) ... [2025-03-04 02:18:55,240 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:55" (1/1) ... [2025-03-04 02:18:55,252 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:55" (1/1) ... [2025-03-04 02:18:55,257 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:55" (1/1) ... [2025-03-04 02:18:55,259 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:55" (1/1) ... [2025-03-04 02:18:55,260 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:55" (1/1) ... [2025-03-04 02:18:55,266 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:18:55,271 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:18:55,272 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:18:55,272 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:18:55,274 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:55" (1/1) ... [2025-03-04 02:18:55,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:18:55,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:55,299 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:18:55,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:18:55,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:18:55,322 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 02:18:55,322 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 02:18:55,322 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 02:18:55,322 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 02:18:55,322 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 02:18:55,322 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 02:18:55,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:18:55,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:18:55,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:18:55,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:18:55,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:18:55,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:18:55,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:18:55,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:18:55,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:18:55,325 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:18:55,441 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:18:55,443 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:18:56,098 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:18:56,098 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:18:56,657 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:18:56,658 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:18:56,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:18:56 BoogieIcfgContainer [2025-03-04 02:18:56,659 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:18:56,660 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:18:56,661 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:18:56,664 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:18:56,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:18:54" (1/3) ... [2025-03-04 02:18:56,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fc9d533 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:18:56, skipping insertion in model container [2025-03-04 02:18:56,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:55" (2/3) ... [2025-03-04 02:18:56,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fc9d533 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:18:56, skipping insertion in model container [2025-03-04 02:18:56,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:18:56" (3/3) ... [2025-03-04 02:18:56,668 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-nzb-file-trans.wvr.c [2025-03-04 02:18:56,679 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:18:56,681 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-nzb-file-trans.wvr.c that has 4 procedures, 38 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-04 02:18:56,682 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:18:56,811 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 02:18:56,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 49 transitions, 119 flow [2025-03-04 02:18:56,880 INFO L124 PetriNetUnfolderBase]: 12/46 cut-off events. [2025-03-04 02:18:56,884 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 02:18:56,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 12/46 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 74 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2025-03-04 02:18:56,888 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 49 transitions, 119 flow [2025-03-04 02:18:56,891 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 45 transitions, 108 flow [2025-03-04 02:18:56,899 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:18:56,911 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;@75f6f57e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:18:56,912 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 02:18:56,933 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:18:56,933 INFO L124 PetriNetUnfolderBase]: 12/44 cut-off events. [2025-03-04 02:18:56,933 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 02:18:56,934 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:56,934 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:56,935 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:18:56,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:56,939 INFO L85 PathProgramCache]: Analyzing trace with hash 654225432, now seen corresponding path program 1 times [2025-03-04 02:18:56,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:56,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704221897] [2025-03-04 02:18:56,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:56,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:57,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 02:18:57,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 02:18:57,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:57,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:57,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:18:57,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:57,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704221897] [2025-03-04 02:18:57,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704221897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:57,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:57,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:18:57,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144942154] [2025-03-04 02:18:57,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:57,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:18:57,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:57,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:18:57,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:18:57,387 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-03-04 02:18:57,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 45 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:57,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:57,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-03-04 02:18:57,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:57,983 INFO L124 PetriNetUnfolderBase]: 2373/3237 cut-off events. [2025-03-04 02:18:57,983 INFO L125 PetriNetUnfolderBase]: For 185/185 co-relation queries the response was YES. [2025-03-04 02:18:57,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6649 conditions, 3237 events. 2373/3237 cut-off events. For 185/185 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 12259 event pairs, 1692 based on Foata normal form. 0/2556 useless extension candidates. Maximal degree in co-relation 6206. Up to 3234 conditions per place. [2025-03-04 02:18:57,999 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 38 selfloop transitions, 6 changer transitions 0/45 dead transitions. [2025-03-04 02:18:57,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 45 transitions, 196 flow [2025-03-04 02:18:58,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:18:58,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:18:58,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2025-03-04 02:18:58,008 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4217687074829932 [2025-03-04 02:18:58,009 INFO L175 Difference]: Start difference. First operand has 43 places, 45 transitions, 108 flow. Second operand 3 states and 62 transitions. [2025-03-04 02:18:58,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 45 transitions, 196 flow [2025-03-04 02:18:58,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 45 transitions, 184 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 02:18:58,015 INFO L231 Difference]: Finished difference. Result has 40 places, 45 transitions, 122 flow [2025-03-04 02:18:58,017 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=40, PETRI_TRANSITIONS=45} [2025-03-04 02:18:58,019 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2025-03-04 02:18:58,020 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 45 transitions, 122 flow [2025-03-04 02:18:58,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:58,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:58,020 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:58,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:18:58,020 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:18:58,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:58,021 INFO L85 PathProgramCache]: Analyzing trace with hash 671603589, now seen corresponding path program 1 times [2025-03-04 02:18:58,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:58,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898711102] [2025-03-04 02:18:58,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:58,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:58,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 02:18:58,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:18:58,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:58,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:58,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:58,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:58,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898711102] [2025-03-04 02:18:58,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898711102] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:58,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80794760] [2025-03-04 02:18:58,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:58,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:58,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:58,257 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:18:58,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 02:18:58,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 02:18:58,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:18:58,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:58,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:58,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 02:18:58,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:58,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:58,462 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:58,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:18:58,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80794760] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:18:58,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:18:58,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-03-04 02:18:58,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188318905] [2025-03-04 02:18:58,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:18:58,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:18:58,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:58,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:18:58,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:18:58,490 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-03-04 02:18:58,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 45 transitions, 122 flow. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:58,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:58,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-03-04 02:18:58,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:58,992 INFO L124 PetriNetUnfolderBase]: 2373/3246 cut-off events. [2025-03-04 02:18:58,992 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2025-03-04 02:18:58,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6574 conditions, 3246 events. 2373/3246 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 12273 event pairs, 1692 based on Foata normal form. 6/2573 useless extension candidates. Maximal degree in co-relation 6525. Up to 3234 conditions per place. [2025-03-04 02:18:59,006 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 38 selfloop transitions, 15 changer transitions 0/54 dead transitions. [2025-03-04 02:18:59,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 54 transitions, 264 flow [2025-03-04 02:18:59,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:18:59,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:18:59,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2025-03-04 02:18:59,008 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2925170068027211 [2025-03-04 02:18:59,008 INFO L175 Difference]: Start difference. First operand has 40 places, 45 transitions, 122 flow. Second operand 6 states and 86 transitions. [2025-03-04 02:18:59,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 54 transitions, 264 flow [2025-03-04 02:18:59,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 54 transitions, 258 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:18:59,010 INFO L231 Difference]: Finished difference. Result has 47 places, 54 transitions, 212 flow [2025-03-04 02:18:59,010 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=212, PETRI_PLACES=47, PETRI_TRANSITIONS=54} [2025-03-04 02:18:59,011 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 4 predicate places. [2025-03-04 02:18:59,011 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 54 transitions, 212 flow [2025-03-04 02:18:59,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:59,011 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:59,011 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:59,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 02:18:59,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:59,212 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:18:59,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:59,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1245307706, now seen corresponding path program 2 times [2025-03-04 02:18:59,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:59,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785813538] [2025-03-04 02:18:59,213 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:18:59,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:59,243 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-04 02:18:59,274 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 36 statements. [2025-03-04 02:18:59,274 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:18:59,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:59,892 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:18:59,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:59,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785813538] [2025-03-04 02:18:59,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785813538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:59,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:59,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:18:59,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623548386] [2025-03-04 02:18:59,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:59,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:18:59,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:59,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:18:59,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:18:59,893 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-03-04 02:18:59,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 54 transitions, 212 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:59,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:59,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-03-04 02:18:59,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:00,851 INFO L124 PetriNetUnfolderBase]: 4763/6629 cut-off events. [2025-03-04 02:19:00,851 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2025-03-04 02:19:00,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13422 conditions, 6629 events. 4763/6629 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 31497 event pairs, 1422 based on Foata normal form. 1/5337 useless extension candidates. Maximal degree in co-relation 13334. Up to 2905 conditions per place. [2025-03-04 02:19:00,879 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 107 selfloop transitions, 14 changer transitions 1/123 dead transitions. [2025-03-04 02:19:00,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 123 transitions, 606 flow [2025-03-04 02:19:00,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:19:00,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:19:00,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2025-03-04 02:19:00,881 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5346938775510204 [2025-03-04 02:19:00,881 INFO L175 Difference]: Start difference. First operand has 47 places, 54 transitions, 212 flow. Second operand 5 states and 131 transitions. [2025-03-04 02:19:00,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 123 transitions, 606 flow [2025-03-04 02:19:00,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 123 transitions, 582 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-03-04 02:19:00,883 INFO L231 Difference]: Finished difference. Result has 54 places, 68 transitions, 294 flow [2025-03-04 02:19:00,885 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=294, PETRI_PLACES=54, PETRI_TRANSITIONS=68} [2025-03-04 02:19:00,886 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 11 predicate places. [2025-03-04 02:19:00,886 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 68 transitions, 294 flow [2025-03-04 02:19:00,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:00,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:00,886 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:00,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:19:00,886 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:19:00,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:00,887 INFO L85 PathProgramCache]: Analyzing trace with hash 407664732, now seen corresponding path program 3 times [2025-03-04 02:19:00,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:00,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435614686] [2025-03-04 02:19:00,887 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:19:00,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:00,905 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 3 equivalence classes. [2025-03-04 02:19:00,924 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 36 statements. [2025-03-04 02:19:00,924 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:19:00,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:01,406 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:19:01,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:01,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435614686] [2025-03-04 02:19:01,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435614686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:19:01,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:19:01,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:19:01,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054950828] [2025-03-04 02:19:01,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:01,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:19:01,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:01,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:19:01,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:19:01,408 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-03-04 02:19:01,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 68 transitions, 294 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:01,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:01,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-03-04 02:19:01,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:03,253 INFO L124 PetriNetUnfolderBase]: 9600/13483 cut-off events. [2025-03-04 02:19:03,253 INFO L125 PetriNetUnfolderBase]: For 4589/4589 co-relation queries the response was YES. [2025-03-04 02:19:03,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32672 conditions, 13483 events. 9600/13483 cut-off events. For 4589/4589 co-relation queries the response was YES. Maximal size of possible extension queue 554. Compared 71662 event pairs, 2274 based on Foata normal form. 1/12482 useless extension candidates. Maximal degree in co-relation 32592. Up to 5614 conditions per place. [2025-03-04 02:19:03,318 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 158 selfloop transitions, 35 changer transitions 1/195 dead transitions. [2025-03-04 02:19:03,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 195 transitions, 1087 flow [2025-03-04 02:19:03,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:19:03,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:19:03,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 187 transitions. [2025-03-04 02:19:03,321 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5451895043731778 [2025-03-04 02:19:03,322 INFO L175 Difference]: Start difference. First operand has 54 places, 68 transitions, 294 flow. Second operand 7 states and 187 transitions. [2025-03-04 02:19:03,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 195 transitions, 1087 flow [2025-03-04 02:19:03,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 195 transitions, 1087 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:19:03,351 INFO L231 Difference]: Finished difference. Result has 65 places, 100 transitions, 601 flow [2025-03-04 02:19:03,352 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=601, PETRI_PLACES=65, PETRI_TRANSITIONS=100} [2025-03-04 02:19:03,353 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 22 predicate places. [2025-03-04 02:19:03,353 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 100 transitions, 601 flow [2025-03-04 02:19:03,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:03,353 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:03,353 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:03,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:19:03,354 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:19:03,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:03,354 INFO L85 PathProgramCache]: Analyzing trace with hash 382692966, now seen corresponding path program 4 times [2025-03-04 02:19:03,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:03,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158398322] [2025-03-04 02:19:03,355 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:19:03,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:03,373 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-03-04 02:19:03,389 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 02:19:03,389 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:19:03,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:03,547 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-04 02:19:03,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:03,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158398322] [2025-03-04 02:19:03,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158398322] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:19:03,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579643844] [2025-03-04 02:19:03,547 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:19:03,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:03,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:19:03,550 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:19:03,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 02:19:03,676 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-03-04 02:19:03,715 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 02:19:03,715 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:19:03,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:03,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 02:19:03,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:19:03,787 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-04 02:19:03,787 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:19:03,852 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-04 02:19:03,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579643844] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:19:03,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:19:03,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-03-04 02:19:03,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3035407] [2025-03-04 02:19:03,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:19:03,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 02:19:03,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:03,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 02:19:03,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2025-03-04 02:19:03,855 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-03-04 02:19:03,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 100 transitions, 601 flow. Second operand has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 17 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:03,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:03,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-03-04 02:19:03,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:05,354 INFO L124 PetriNetUnfolderBase]: 9600/13486 cut-off events. [2025-03-04 02:19:05,354 INFO L125 PetriNetUnfolderBase]: For 16068/16068 co-relation queries the response was YES. [2025-03-04 02:19:05,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38905 conditions, 13486 events. 9600/13486 cut-off events. For 16068/16068 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 70990 event pairs, 6520 based on Foata normal form. 1/13388 useless extension candidates. Maximal degree in co-relation 38808. Up to 13464 conditions per place. [2025-03-04 02:19:05,432 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 84 selfloop transitions, 18 changer transitions 0/103 dead transitions. [2025-03-04 02:19:05,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 103 transitions, 823 flow [2025-03-04 02:19:05,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:19:05,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:19:05,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2025-03-04 02:19:05,435 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2536443148688047 [2025-03-04 02:19:05,435 INFO L175 Difference]: Start difference. First operand has 65 places, 100 transitions, 601 flow. Second operand 7 states and 87 transitions. [2025-03-04 02:19:05,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 103 transitions, 823 flow [2025-03-04 02:19:05,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 103 transitions, 811 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-03-04 02:19:05,624 INFO L231 Difference]: Finished difference. Result has 72 places, 103 transitions, 657 flow [2025-03-04 02:19:05,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=657, PETRI_PLACES=72, PETRI_TRANSITIONS=103} [2025-03-04 02:19:05,624 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 29 predicate places. [2025-03-04 02:19:05,624 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 103 transitions, 657 flow [2025-03-04 02:19:05,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 17 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:05,625 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:05,625 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:05,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 02:19:05,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:05,825 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:19:05,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:05,826 INFO L85 PathProgramCache]: Analyzing trace with hash 292873019, now seen corresponding path program 5 times [2025-03-04 02:19:05,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:05,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376145673] [2025-03-04 02:19:05,826 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:19:05,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:05,845 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 4 equivalence classes. [2025-03-04 02:19:05,890 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 02:19:05,891 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 02:19:05,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:06,465 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 02:19:06,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:06,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376145673] [2025-03-04 02:19:06,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376145673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:19:06,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:19:06,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:19:06,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504812487] [2025-03-04 02:19:06,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:06,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:19:06,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:06,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:19:06,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:19:06,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-03-04 02:19:06,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 103 transitions, 657 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:06,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:06,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-03-04 02:19:06,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:08,403 INFO L124 PetriNetUnfolderBase]: 12367/17476 cut-off events. [2025-03-04 02:19:08,404 INFO L125 PetriNetUnfolderBase]: For 17887/17887 co-relation queries the response was YES. [2025-03-04 02:19:08,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48997 conditions, 17476 events. 12367/17476 cut-off events. For 17887/17887 co-relation queries the response was YES. Maximal size of possible extension queue 672. Compared 96492 event pairs, 3151 based on Foata normal form. 1/17380 useless extension candidates. Maximal degree in co-relation 48879. Up to 6255 conditions per place. [2025-03-04 02:19:08,479 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 147 selfloop transitions, 46 changer transitions 4/198 dead transitions. [2025-03-04 02:19:08,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 198 transitions, 1465 flow [2025-03-04 02:19:08,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:19:08,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:19:08,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 144 transitions. [2025-03-04 02:19:08,481 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5877551020408164 [2025-03-04 02:19:08,481 INFO L175 Difference]: Start difference. First operand has 72 places, 103 transitions, 657 flow. Second operand 5 states and 144 transitions. [2025-03-04 02:19:08,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 198 transitions, 1465 flow [2025-03-04 02:19:08,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 198 transitions, 1429 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-03-04 02:19:08,600 INFO L231 Difference]: Finished difference. Result has 76 places, 123 transitions, 981 flow [2025-03-04 02:19:08,600 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=621, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=981, PETRI_PLACES=76, PETRI_TRANSITIONS=123} [2025-03-04 02:19:08,602 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 33 predicate places. [2025-03-04 02:19:08,602 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 123 transitions, 981 flow [2025-03-04 02:19:08,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:08,602 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:08,603 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:08,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:19:08,603 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:19:08,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:08,603 INFO L85 PathProgramCache]: Analyzing trace with hash 192323227, now seen corresponding path program 6 times [2025-03-04 02:19:08,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:08,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100842594] [2025-03-04 02:19:08,603 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:19:08,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:08,621 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 39 statements into 4 equivalence classes. [2025-03-04 02:19:08,630 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 24 of 39 statements. [2025-03-04 02:19:08,631 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:19:08,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:08,874 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 02:19:08,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:08,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100842594] [2025-03-04 02:19:08,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100842594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:19:08,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:19:08,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:19:08,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155410895] [2025-03-04 02:19:08,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:08,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:19:08,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:08,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:19:08,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:19:08,876 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-03-04 02:19:08,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 123 transitions, 981 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:08,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:08,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-03-04 02:19:08,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:11,256 INFO L124 PetriNetUnfolderBase]: 12306/17367 cut-off events. [2025-03-04 02:19:11,256 INFO L125 PetriNetUnfolderBase]: For 35526/35526 co-relation queries the response was YES. [2025-03-04 02:19:11,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54149 conditions, 17367 events. 12306/17367 cut-off events. For 35526/35526 co-relation queries the response was YES. Maximal size of possible extension queue 661. Compared 95648 event pairs, 6653 based on Foata normal form. 1/17368 useless extension candidates. Maximal degree in co-relation 54045. Up to 12595 conditions per place. [2025-03-04 02:19:11,370 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 155 selfloop transitions, 25 changer transitions 2/183 dead transitions. [2025-03-04 02:19:11,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 183 transitions, 1591 flow [2025-03-04 02:19:11,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:19:11,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:19:11,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2025-03-04 02:19:11,371 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5183673469387755 [2025-03-04 02:19:11,371 INFO L175 Difference]: Start difference. First operand has 76 places, 123 transitions, 981 flow. Second operand 5 states and 127 transitions. [2025-03-04 02:19:11,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 183 transitions, 1591 flow [2025-03-04 02:19:11,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 183 transitions, 1575 flow, removed 8 selfloop flow, removed 0 redundant places. [2025-03-04 02:19:11,664 INFO L231 Difference]: Finished difference. Result has 83 places, 131 transitions, 1162 flow [2025-03-04 02:19:11,664 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=973, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1162, PETRI_PLACES=83, PETRI_TRANSITIONS=131} [2025-03-04 02:19:11,665 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 40 predicate places. [2025-03-04 02:19:11,665 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 131 transitions, 1162 flow [2025-03-04 02:19:11,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:11,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:11,665 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:11,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 02:19:11,665 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:19:11,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:11,666 INFO L85 PathProgramCache]: Analyzing trace with hash -168228379, now seen corresponding path program 7 times [2025-03-04 02:19:11,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:11,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913851728] [2025-03-04 02:19:11,666 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:19:11,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:11,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 02:19:11,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 02:19:11,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:19:11,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:12,245 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 02:19:12,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:12,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913851728] [2025-03-04 02:19:12,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913851728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:19:12,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:19:12,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:19:12,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409537290] [2025-03-04 02:19:12,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:12,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:19:12,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:12,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:19:12,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:19:12,246 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-03-04 02:19:12,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 131 transitions, 1162 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:12,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:12,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-03-04 02:19:12,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:14,361 INFO L124 PetriNetUnfolderBase]: 13907/19654 cut-off events. [2025-03-04 02:19:14,361 INFO L125 PetriNetUnfolderBase]: For 49443/49443 co-relation queries the response was YES. [2025-03-04 02:19:14,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62497 conditions, 19654 events. 13907/19654 cut-off events. For 49443/49443 co-relation queries the response was YES. Maximal size of possible extension queue 765. Compared 112649 event pairs, 4039 based on Foata normal form. 1/19655 useless extension candidates. Maximal degree in co-relation 62389. Up to 8366 conditions per place. [2025-03-04 02:19:14,442 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 171 selfloop transitions, 60 changer transitions 1/233 dead transitions. [2025-03-04 02:19:14,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 233 transitions, 2167 flow [2025-03-04 02:19:14,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:19:14,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:19:14,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 148 transitions. [2025-03-04 02:19:14,444 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6040816326530613 [2025-03-04 02:19:14,444 INFO L175 Difference]: Start difference. First operand has 83 places, 131 transitions, 1162 flow. Second operand 5 states and 148 transitions. [2025-03-04 02:19:14,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 233 transitions, 2167 flow [2025-03-04 02:19:14,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 233 transitions, 2091 flow, removed 38 selfloop flow, removed 0 redundant places. [2025-03-04 02:19:14,697 INFO L231 Difference]: Finished difference. Result has 90 places, 155 transitions, 1576 flow [2025-03-04 02:19:14,697 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1126, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1576, PETRI_PLACES=90, PETRI_TRANSITIONS=155} [2025-03-04 02:19:14,697 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 47 predicate places. [2025-03-04 02:19:14,697 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 155 transitions, 1576 flow [2025-03-04 02:19:14,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:14,697 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:14,697 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:14,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:19:14,698 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:19:14,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:14,698 INFO L85 PathProgramCache]: Analyzing trace with hash -520239365, now seen corresponding path program 8 times [2025-03-04 02:19:14,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:14,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397798360] [2025-03-04 02:19:14,698 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:19:14,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:14,711 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-04 02:19:14,720 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 39 statements. [2025-03-04 02:19:14,721 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:19:14,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:14,974 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 02:19:14,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:14,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397798360] [2025-03-04 02:19:14,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397798360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:19:14,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:19:14,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:19:14,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575937163] [2025-03-04 02:19:14,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:14,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:19:14,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:14,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:19:14,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:19:14,976 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-03-04 02:19:14,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 155 transitions, 1576 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:14,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:14,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-03-04 02:19:14,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:17,174 INFO L124 PetriNetUnfolderBase]: 14625/20705 cut-off events. [2025-03-04 02:19:17,174 INFO L125 PetriNetUnfolderBase]: For 65362/65362 co-relation queries the response was YES. [2025-03-04 02:19:17,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69407 conditions, 20705 events. 14625/20705 cut-off events. For 65362/65362 co-relation queries the response was YES. Maximal size of possible extension queue 817. Compared 119488 event pairs, 3258 based on Foata normal form. 1/20706 useless extension candidates. Maximal degree in co-relation 69295. Up to 7338 conditions per place. [2025-03-04 02:19:17,299 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 178 selfloop transitions, 88 changer transitions 2/269 dead transitions. [2025-03-04 02:19:17,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 269 transitions, 2667 flow [2025-03-04 02:19:17,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:19:17,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:19:17,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 180 transitions. [2025-03-04 02:19:17,300 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6122448979591837 [2025-03-04 02:19:17,300 INFO L175 Difference]: Start difference. First operand has 90 places, 155 transitions, 1576 flow. Second operand 6 states and 180 transitions. [2025-03-04 02:19:17,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 269 transitions, 2667 flow [2025-03-04 02:19:17,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 269 transitions, 2628 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:19:17,572 INFO L231 Difference]: Finished difference. Result has 98 places, 182 transitions, 2193 flow [2025-03-04 02:19:17,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1545, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2193, PETRI_PLACES=98, PETRI_TRANSITIONS=182} [2025-03-04 02:19:17,572 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 55 predicate places. [2025-03-04 02:19:17,573 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 182 transitions, 2193 flow [2025-03-04 02:19:17,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:17,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:17,573 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:17,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 02:19:17,573 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:19:17,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:17,573 INFO L85 PathProgramCache]: Analyzing trace with hash -27483939, now seen corresponding path program 1 times [2025-03-04 02:19:17,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:17,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715860293] [2025-03-04 02:19:17,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:19:17,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:17,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 02:19:17,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 02:19:17,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:19:17,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:17,704 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 02:19:17,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:17,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715860293] [2025-03-04 02:19:17,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715860293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:19:17,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:19:17,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:19:17,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620639315] [2025-03-04 02:19:17,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:17,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:19:17,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:17,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:19:17,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:19:17,707 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-03-04 02:19:17,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 182 transitions, 2193 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:17,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:17,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-03-04 02:19:17,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:19,845 INFO L124 PetriNetUnfolderBase]: 15034/21321 cut-off events. [2025-03-04 02:19:19,846 INFO L125 PetriNetUnfolderBase]: For 98373/98373 co-relation queries the response was YES. [2025-03-04 02:19:19,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76430 conditions, 21321 events. 15034/21321 cut-off events. For 98373/98373 co-relation queries the response was YES. Maximal size of possible extension queue 840. Compared 123322 event pairs, 5321 based on Foata normal form. 3/21324 useless extension candidates. Maximal degree in co-relation 76315. Up to 16628 conditions per place. [2025-03-04 02:19:20,057 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 184 selfloop transitions, 12 changer transitions 47/244 dead transitions. [2025-03-04 02:19:20,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 244 transitions, 3155 flow [2025-03-04 02:19:20,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:19:20,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:19:20,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2025-03-04 02:19:20,058 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5255102040816326 [2025-03-04 02:19:20,058 INFO L175 Difference]: Start difference. First operand has 98 places, 182 transitions, 2193 flow. Second operand 4 states and 103 transitions. [2025-03-04 02:19:20,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 244 transitions, 3155 flow [2025-03-04 02:19:20,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 244 transitions, 3125 flow, removed 15 selfloop flow, removed 0 redundant places. [2025-03-04 02:19:20,637 INFO L231 Difference]: Finished difference. Result has 104 places, 166 transitions, 2001 flow [2025-03-04 02:19:20,637 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2167, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2001, PETRI_PLACES=104, PETRI_TRANSITIONS=166} [2025-03-04 02:19:20,637 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 61 predicate places. [2025-03-04 02:19:20,637 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 166 transitions, 2001 flow [2025-03-04 02:19:20,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:20,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:20,638 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:20,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 02:19:20,638 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:19:20,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:20,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1756369036, now seen corresponding path program 1 times [2025-03-04 02:19:20,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:20,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064945281] [2025-03-04 02:19:20,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:19:20,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:20,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 02:19:20,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 02:19:20,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:19:20,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:20,816 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 02:19:20,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:20,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064945281] [2025-03-04 02:19:20,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064945281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:19:20,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:19:20,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:19:20,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950469290] [2025-03-04 02:19:20,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:20,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:19:20,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:20,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:19:20,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:19:20,818 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-03-04 02:19:20,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 166 transitions, 2001 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:20,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:20,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-03-04 02:19:20,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:23,371 INFO L124 PetriNetUnfolderBase]: 14520/20742 cut-off events. [2025-03-04 02:19:23,371 INFO L125 PetriNetUnfolderBase]: For 90229/90229 co-relation queries the response was YES. [2025-03-04 02:19:23,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72773 conditions, 20742 events. 14520/20742 cut-off events. For 90229/90229 co-relation queries the response was YES. Maximal size of possible extension queue 828. Compared 120766 event pairs, 4493 based on Foata normal form. 4/20746 useless extension candidates. Maximal degree in co-relation 72655. Up to 16026 conditions per place. [2025-03-04 02:19:23,543 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 161 selfloop transitions, 14 changer transitions 50/226 dead transitions. [2025-03-04 02:19:23,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 226 transitions, 2939 flow [2025-03-04 02:19:23,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:19:23,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:19:23,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2025-03-04 02:19:23,544 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5153061224489796 [2025-03-04 02:19:23,544 INFO L175 Difference]: Start difference. First operand has 104 places, 166 transitions, 2001 flow. Second operand 4 states and 101 transitions. [2025-03-04 02:19:23,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 226 transitions, 2939 flow [2025-03-04 02:19:23,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 226 transitions, 2895 flow, removed 10 selfloop flow, removed 3 redundant places. [2025-03-04 02:19:23,896 INFO L231 Difference]: Finished difference. Result has 106 places, 151 transitions, 1861 flow [2025-03-04 02:19:23,896 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1970, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1861, PETRI_PLACES=106, PETRI_TRANSITIONS=151} [2025-03-04 02:19:23,897 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 63 predicate places. [2025-03-04 02:19:23,897 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 151 transitions, 1861 flow [2025-03-04 02:19:23,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:23,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:23,897 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:23,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 02:19:23,897 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:19:23,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:23,897 INFO L85 PathProgramCache]: Analyzing trace with hash 947627020, now seen corresponding path program 1 times [2025-03-04 02:19:23,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:23,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535847850] [2025-03-04 02:19:23,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:19:23,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:23,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 02:19:23,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 02:19:23,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:19:23,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:24,029 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 02:19:24,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:24,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535847850] [2025-03-04 02:19:24,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535847850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:19:24,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:19:24,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:19:24,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281624217] [2025-03-04 02:19:24,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:24,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:19:24,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:24,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:19:24,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:19:24,031 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-03-04 02:19:24,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 151 transitions, 1861 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:24,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:24,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-03-04 02:19:24,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:25,904 INFO L124 PetriNetUnfolderBase]: 13580/19483 cut-off events. [2025-03-04 02:19:25,904 INFO L125 PetriNetUnfolderBase]: For 84111/84111 co-relation queries the response was YES. [2025-03-04 02:19:25,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67761 conditions, 19483 events. 13580/19483 cut-off events. For 84111/84111 co-relation queries the response was YES. Maximal size of possible extension queue 797. Compared 113618 event pairs, 3769 based on Foata normal form. 5/19488 useless extension candidates. Maximal degree in co-relation 67655. Up to 15434 conditions per place. [2025-03-04 02:19:26,043 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 162 selfloop transitions, 14 changer transitions 30/207 dead transitions. [2025-03-04 02:19:26,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 207 transitions, 2686 flow [2025-03-04 02:19:26,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:19:26,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:19:26,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2025-03-04 02:19:26,044 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5051020408163265 [2025-03-04 02:19:26,044 INFO L175 Difference]: Start difference. First operand has 106 places, 151 transitions, 1861 flow. Second operand 4 states and 99 transitions. [2025-03-04 02:19:26,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 207 transitions, 2686 flow [2025-03-04 02:19:26,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 207 transitions, 2649 flow, removed 11 selfloop flow, removed 3 redundant places. [2025-03-04 02:19:26,331 INFO L231 Difference]: Finished difference. Result has 105 places, 154 transitions, 1954 flow [2025-03-04 02:19:26,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1831, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1954, PETRI_PLACES=105, PETRI_TRANSITIONS=154} [2025-03-04 02:19:26,332 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 62 predicate places. [2025-03-04 02:19:26,332 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 154 transitions, 1954 flow [2025-03-04 02:19:26,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:26,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:26,332 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:26,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 02:19:26,332 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:19:26,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:26,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1085018088, now seen corresponding path program 2 times [2025-03-04 02:19:26,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:26,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898850331] [2025-03-04 02:19:26,333 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:19:26,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:26,345 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-04 02:19:26,349 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 42 statements. [2025-03-04 02:19:26,349 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:19:26,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:26,407 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 02:19:26,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:26,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898850331] [2025-03-04 02:19:26,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898850331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:19:26,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:19:26,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:19:26,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579757597] [2025-03-04 02:19:26,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:26,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:19:26,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:26,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:19:26,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:19:26,409 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-03-04 02:19:26,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 154 transitions, 1954 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:26,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:26,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-03-04 02:19:26,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:28,233 INFO L124 PetriNetUnfolderBase]: 12983/18695 cut-off events. [2025-03-04 02:19:28,233 INFO L125 PetriNetUnfolderBase]: For 81999/81999 co-relation queries the response was YES. [2025-03-04 02:19:28,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65449 conditions, 18695 events. 12983/18695 cut-off events. For 81999/81999 co-relation queries the response was YES. Maximal size of possible extension queue 701. Compared 108700 event pairs, 7666 based on Foata normal form. 4/18699 useless extension candidates. Maximal degree in co-relation 65365. Up to 14944 conditions per place. [2025-03-04 02:19:28,344 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 147 selfloop transitions, 3 changer transitions 49/200 dead transitions. [2025-03-04 02:19:28,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 200 transitions, 2605 flow [2025-03-04 02:19:28,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:19:28,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:19:28,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2025-03-04 02:19:28,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-04 02:19:28,345 INFO L175 Difference]: Start difference. First operand has 105 places, 154 transitions, 1954 flow. Second operand 4 states and 98 transitions. [2025-03-04 02:19:28,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 200 transitions, 2605 flow [2025-03-04 02:19:28,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 200 transitions, 2537 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-04 02:19:28,567 INFO L231 Difference]: Finished difference. Result has 106 places, 133 transitions, 1526 flow [2025-03-04 02:19:28,567 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1893, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1526, PETRI_PLACES=106, PETRI_TRANSITIONS=133} [2025-03-04 02:19:28,568 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 63 predicate places. [2025-03-04 02:19:28,568 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 133 transitions, 1526 flow [2025-03-04 02:19:28,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:28,568 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:28,568 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:28,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 02:19:28,568 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:19:28,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:28,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1562278536, now seen corresponding path program 2 times [2025-03-04 02:19:28,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:28,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439759834] [2025-03-04 02:19:28,568 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:19:28,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:28,581 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-04 02:19:28,584 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 42 statements. [2025-03-04 02:19:28,585 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:19:28,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:28,649 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 02:19:28,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:28,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439759834] [2025-03-04 02:19:28,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439759834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:19:28,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:19:28,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:19:28,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503470568] [2025-03-04 02:19:28,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:28,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:19:28,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:28,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:19:28,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:19:28,652 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-03-04 02:19:28,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 133 transitions, 1526 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:28,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:28,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-03-04 02:19:28,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:30,307 INFO L124 PetriNetUnfolderBase]: 11629/16697 cut-off events. [2025-03-04 02:19:30,307 INFO L125 PetriNetUnfolderBase]: For 61867/61867 co-relation queries the response was YES. [2025-03-04 02:19:30,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57068 conditions, 16697 events. 11629/16697 cut-off events. For 61867/61867 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 93783 event pairs, 7142 based on Foata normal form. 5/16702 useless extension candidates. Maximal degree in co-relation 56991. Up to 13897 conditions per place. [2025-03-04 02:19:30,431 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 130 selfloop transitions, 4 changer transitions 38/173 dead transitions. [2025-03-04 02:19:30,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 173 transitions, 2094 flow [2025-03-04 02:19:30,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:19:30,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:19:30,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2025-03-04 02:19:30,432 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47959183673469385 [2025-03-04 02:19:30,432 INFO L175 Difference]: Start difference. First operand has 106 places, 133 transitions, 1526 flow. Second operand 4 states and 94 transitions. [2025-03-04 02:19:30,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 173 transitions, 2094 flow [2025-03-04 02:19:30,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 173 transitions, 2011 flow, removed 18 selfloop flow, removed 7 redundant places. [2025-03-04 02:19:30,583 INFO L231 Difference]: Finished difference. Result has 100 places, 119 transitions, 1245 flow [2025-03-04 02:19:30,583 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1452, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1245, PETRI_PLACES=100, PETRI_TRANSITIONS=119} [2025-03-04 02:19:30,584 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 57 predicate places. [2025-03-04 02:19:30,584 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 119 transitions, 1245 flow [2025-03-04 02:19:30,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:30,584 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:30,584 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:30,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 02:19:30,584 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:19:30,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:30,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1316623417, now seen corresponding path program 2 times [2025-03-04 02:19:30,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:30,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63231095] [2025-03-04 02:19:30,585 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:19:30,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:30,597 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-04 02:19:30,601 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 42 statements. [2025-03-04 02:19:30,601 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:19:30,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:30,651 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 02:19:30,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:30,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63231095] [2025-03-04 02:19:30,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63231095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:19:30,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:19:30,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:19:30,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596401294] [2025-03-04 02:19:30,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:30,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:19:30,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:30,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:19:30,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:19:30,653 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-03-04 02:19:30,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 119 transitions, 1245 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:30,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:30,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-03-04 02:19:30,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:32,122 INFO L124 PetriNetUnfolderBase]: 10078/14355 cut-off events. [2025-03-04 02:19:32,122 INFO L125 PetriNetUnfolderBase]: For 48503/48503 co-relation queries the response was YES. [2025-03-04 02:19:32,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48893 conditions, 14355 events. 10078/14355 cut-off events. For 48503/48503 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 76734 event pairs, 6205 based on Foata normal form. 4/14359 useless extension candidates. Maximal degree in co-relation 48859. Up to 12097 conditions per place. [2025-03-04 02:19:32,181 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 90 selfloop transitions, 0 changer transitions 58/149 dead transitions. [2025-03-04 02:19:32,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 149 transitions, 1651 flow [2025-03-04 02:19:32,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:19:32,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:19:32,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2025-03-04 02:19:32,182 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2025-03-04 02:19:32,182 INFO L175 Difference]: Start difference. First operand has 100 places, 119 transitions, 1245 flow. Second operand 4 states and 91 transitions. [2025-03-04 02:19:32,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 149 transitions, 1651 flow [2025-03-04 02:19:32,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 149 transitions, 1472 flow, removed 5 selfloop flow, removed 9 redundant places. [2025-03-04 02:19:32,269 INFO L231 Difference]: Finished difference. Result has 93 places, 91 transitions, 687 flow [2025-03-04 02:19:32,270 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1072, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=687, PETRI_PLACES=93, PETRI_TRANSITIONS=91} [2025-03-04 02:19:32,270 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 50 predicate places. [2025-03-04 02:19:32,270 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 91 transitions, 687 flow [2025-03-04 02:19:32,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:32,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:32,270 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:32,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 02:19:32,270 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:19:32,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:32,271 INFO L85 PathProgramCache]: Analyzing trace with hash -230824085, now seen corresponding path program 1 times [2025-03-04 02:19:32,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:32,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902118822] [2025-03-04 02:19:32,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:19:32,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:32,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 02:19:32,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 02:19:32,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:19:32,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:32,367 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 02:19:32,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:32,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902118822] [2025-03-04 02:19:32,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902118822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:19:32,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:19:32,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:19:32,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744499936] [2025-03-04 02:19:32,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:32,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:19:32,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:32,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:19:32,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:19:32,368 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-03-04 02:19:32,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 91 transitions, 687 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 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-04 02:19:32,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:32,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-03-04 02:19:32,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:33,680 INFO L124 PetriNetUnfolderBase]: 10285/14526 cut-off events. [2025-03-04 02:19:33,681 INFO L125 PetriNetUnfolderBase]: For 29504/29504 co-relation queries the response was YES. [2025-03-04 02:19:33,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45241 conditions, 14526 events. 10285/14526 cut-off events. For 29504/29504 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 75862 event pairs, 6226 based on Foata normal form. 314/14840 useless extension candidates. Maximal degree in co-relation 45212. Up to 11347 conditions per place. [2025-03-04 02:19:33,787 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 111 selfloop transitions, 11 changer transitions 1/124 dead transitions. [2025-03-04 02:19:33,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 124 transitions, 1124 flow [2025-03-04 02:19:33,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:19:33,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:19:33,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-03-04 02:19:33,789 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4965986394557823 [2025-03-04 02:19:33,789 INFO L175 Difference]: Start difference. First operand has 93 places, 91 transitions, 687 flow. Second operand 3 states and 73 transitions. [2025-03-04 02:19:33,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 124 transitions, 1124 flow [2025-03-04 02:19:33,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 124 transitions, 1009 flow, removed 23 selfloop flow, removed 8 redundant places. [2025-03-04 02:19:33,863 INFO L231 Difference]: Finished difference. Result has 79 places, 94 transitions, 658 flow [2025-03-04 02:19:33,863 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=658, PETRI_PLACES=79, PETRI_TRANSITIONS=94} [2025-03-04 02:19:33,863 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 36 predicate places. [2025-03-04 02:19:33,863 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 94 transitions, 658 flow [2025-03-04 02:19:33,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 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-04 02:19:33,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:33,864 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:33,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 02:19:33,864 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:19:33,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:33,864 INFO L85 PathProgramCache]: Analyzing trace with hash 2006019121, now seen corresponding path program 1 times [2025-03-04 02:19:33,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:33,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351837042] [2025-03-04 02:19:33,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:19:33,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:33,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 02:19:33,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 02:19:33,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:19:33,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:33,999 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 02:19:33,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:33,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351837042] [2025-03-04 02:19:33,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351837042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:19:33,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:19:34,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:19:34,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270003073] [2025-03-04 02:19:34,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:34,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:19:34,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:34,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:19:34,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:19:34,001 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-03-04 02:19:34,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 94 transitions, 658 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:34,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:34,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-03-04 02:19:34,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:35,599 INFO L124 PetriNetUnfolderBase]: 12416/17542 cut-off events. [2025-03-04 02:19:35,599 INFO L125 PetriNetUnfolderBase]: For 26745/26745 co-relation queries the response was YES. [2025-03-04 02:19:35,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51400 conditions, 17542 events. 12416/17542 cut-off events. For 26745/26745 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 93665 event pairs, 7201 based on Foata normal form. 366/17908 useless extension candidates. Maximal degree in co-relation 51376. Up to 13788 conditions per place. [2025-03-04 02:19:35,712 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 111 selfloop transitions, 9 changer transitions 1/122 dead transitions. [2025-03-04 02:19:35,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 122 transitions, 1041 flow [2025-03-04 02:19:35,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:19:35,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:19:35,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-03-04 02:19:35,713 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48299319727891155 [2025-03-04 02:19:35,713 INFO L175 Difference]: Start difference. First operand has 79 places, 94 transitions, 658 flow. Second operand 3 states and 71 transitions. [2025-03-04 02:19:35,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 122 transitions, 1041 flow [2025-03-04 02:19:35,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 122 transitions, 1029 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:19:35,810 INFO L231 Difference]: Finished difference. Result has 81 places, 98 transitions, 726 flow [2025-03-04 02:19:35,810 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=726, PETRI_PLACES=81, PETRI_TRANSITIONS=98} [2025-03-04 02:19:35,810 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 38 predicate places. [2025-03-04 02:19:35,810 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 98 transitions, 726 flow [2025-03-04 02:19:35,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:35,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:35,811 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:35,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 02:19:35,811 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:19:35,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:35,811 INFO L85 PathProgramCache]: Analyzing trace with hash -490967414, now seen corresponding path program 1 times [2025-03-04 02:19:35,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:35,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162415529] [2025-03-04 02:19:35,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:19:35,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:35,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 02:19:35,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 02:19:35,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:19:35,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:35,943 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-04 02:19:35,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:35,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162415529] [2025-03-04 02:19:35,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162415529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:19:35,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:19:35,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:19:35,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856270859] [2025-03-04 02:19:35,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:35,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:19:35,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:35,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:19:35,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:19:35,945 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-03-04 02:19:35,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 98 transitions, 726 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:35,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:35,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-03-04 02:19:35,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:38,048 INFO L124 PetriNetUnfolderBase]: 16067/22717 cut-off events. [2025-03-04 02:19:38,048 INFO L125 PetriNetUnfolderBase]: For 38395/38395 co-relation queries the response was YES. [2025-03-04 02:19:38,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67490 conditions, 22717 events. 16067/22717 cut-off events. For 38395/38395 co-relation queries the response was YES. Maximal size of possible extension queue 623. Compared 125488 event pairs, 9023 based on Foata normal form. 595/23312 useless extension candidates. Maximal degree in co-relation 67465. Up to 16842 conditions per place. [2025-03-04 02:19:38,233 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 128 selfloop transitions, 11 changer transitions 1/141 dead transitions. [2025-03-04 02:19:38,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 141 transitions, 1297 flow [2025-03-04 02:19:38,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:19:38,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:19:38,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2025-03-04 02:19:38,234 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4897959183673469 [2025-03-04 02:19:38,234 INFO L175 Difference]: Start difference. First operand has 81 places, 98 transitions, 726 flow. Second operand 3 states and 72 transitions. [2025-03-04 02:19:38,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 141 transitions, 1297 flow [2025-03-04 02:19:38,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 141 transitions, 1284 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:19:38,348 INFO L231 Difference]: Finished difference. Result has 83 places, 100 transitions, 769 flow [2025-03-04 02:19:38,348 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=717, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=769, PETRI_PLACES=83, PETRI_TRANSITIONS=100} [2025-03-04 02:19:38,348 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 40 predicate places. [2025-03-04 02:19:38,348 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 100 transitions, 769 flow [2025-03-04 02:19:38,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:38,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:38,348 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:38,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 02:19:38,348 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:19:38,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:38,349 INFO L85 PathProgramCache]: Analyzing trace with hash 563604820, now seen corresponding path program 1 times [2025-03-04 02:19:38,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:38,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606822048] [2025-03-04 02:19:38,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:19:38,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:38,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 02:19:38,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 02:19:38,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:19:38,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:47,795 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:19:47,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:47,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606822048] [2025-03-04 02:19:47,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606822048] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:19:47,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951260048] [2025-03-04 02:19:47,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:19:47,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:47,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:19:47,798 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:19:47,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 02:19:47,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 02:19:47,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 02:19:47,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:19:47,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:47,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-04 02:19:48,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:19:49,022 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:19:49,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 205 treesize of output 241 [2025-03-04 02:19:49,636 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 02:19:49,636 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:19:51,222 INFO L349 Elim1Store]: treesize reduction 5, result has 95.8 percent of original size [2025-03-04 02:19:51,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 251 treesize of output 299 [2025-03-04 02:19:51,863 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 02:19:51,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951260048] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:19:51,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:19:51,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 9, 9] total 44 [2025-03-04 02:19:51,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318061992] [2025-03-04 02:19:51,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:19:51,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-04 02:19:51,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:51,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-04 02:19:51,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1755, Unknown=0, NotChecked=0, Total=1892 [2025-03-04 02:19:51,865 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-03-04 02:19:51,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 100 transitions, 769 flow. Second operand has 44 states, 44 states have (on average 6.840909090909091) internal successors, (301), 44 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:51,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:51,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-03-04 02:19:51,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand